theoretical-computer-science / Computational complexity

Ghasemi-Kopparty Problem on Sparse SS-Decoding Polynomials

the PIR consequence is conditional on a number-theoretic conjecture implied by either the generalized repunit conjecture or Schinzel's hypothesis H, and is unconditional for s <= 15

12Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

theoretical-computer-scienceJul 24, 2026Significance 12/100Registry: unreviewed

Ghasemi-Kopparty Problem on Sparse SS-Decoding Polynomials

Prior state unknown→proved

the PIR consequence is conditional on a number-theoretic conjecture implied by either the generalized repunit conjecture or Schinzel's hypothesis H, and is unconditional for s <= 15

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

the PIR consequence is conditional on a number-theoretic conjecture implied by either the generalized repunit conjecture or Schinzel's hypothesis H, and is unconditional for s <= 15

the PIR consequence is conditional on a number-theoretic conjecture implied by either the generalized repunit conjecture or Schinzel's hypothesis H, and is unconditional for s <= 15

Recorded attempts

Evidence graph

Connected research record

Ghasemi-Kopparty Problem on Sparse $S$-Decoding Polynomials — Mathematical Frontier Network