Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Can one construct a plain-model, efficient, information-theoretically secure one-time unclonable-encryption scheme for one classical bit with exponentially small adversarial advantage?
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
Two simultaneous papers achieve the goal independently; one construction, using random Pauli eigenstates, attains the optimal exponent up to constants (Ragavan, ePrint 2026/1509).
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Two independent author-verified proofs posted the same week (Ananth-Sahai arXiv:2607.21551 and Ragavan ePrint 2026/1509); one development is Lean-checked. Neither peer-reviewed yet.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.