Alphabeta MathHow statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Private-coin SMP Equality lower bound and source recovery
Remark
The standard private-coin simultaneous-message Equality lower bound is proved locally in Private-coin SMP equality requires Ω(√n) bits. The full Newman–Szegedy author-hosted manuscript was recovered and read after the ACM PDF endpoint returned HTTP 403; its matrix-packing theorem supplies the proof route, while the library theorem above contains the complete local derivation. A constant-communication public-coin hash uses a shared seed and is a different resource model.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ilan Newman and Mario Szegedy, Public vs. Private Coin Flips in One Round Communication Games (standard reference, not scraped)
- Ilan Newman and Mario Szegedy, Public vs. Private Coin Flips in One Round Communication Games (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)