Minimum Sparsity of S-Decoding Polynomials
Prior state unknown→proved
conditional on a plausible number-theoretic conjecture; unconditional through s = 15
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-science / Private information retrieval
Minimum Sparsity of S-Decoding Polynomials
conditional on a plausible number-theoretic conjecture; unconditional through s = 15
5Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
conditional on a plausible number-theoretic conjecture; unconditional through s = 15
conditional on a plausible number-theoretic conjecture; unconditional through s = 15
Recorded attempts
Evidence graph
Connected research record
- →Minimum Sparsity of S-Decoding Polynomials
parent of · event · claim reported
- →conditional on a plausible number-theoretic conjecture; unconditional through s = 15
parent of · claim · theorem