Source authenticated

Minimum Sparsity of S-Decoding Polynomials

conditional on a plausible number-theoretic conjecture; unconditional through s = 15

Exact FrontierDelta

proved→proved

Scope and record

Occurred: Oct 29, 2026

Delta type: REGISTRY REVISION

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Minimum Sparsity of S-Decoding Polynomials · S-decoding sparsity

Confidence: Not scored

Registry verification: unreviewed · preprint · partial

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.5 Pro
model · ai model contributor · OpenAI

Lineage and corrections

Corrects Minimum Sparsity of S-Decoding Polynomials →

Supersedes Minimum Sparsity of S-Decoding Polynomials →

Minimum Sparsity of S-Decoding Polynomials evidence for this event

VibeMathed record: Minimum Sparsity of S-Decoding Polynomials evidence for this event

conditional on a plausible number-theoretic conjecture; unconditional through s = 15 parent of this event

This event attributed to GPT-5.5 Pro

Minimum Sparsity of S-Decoding Polynomials parent of this event

Act on this frontier

Verify, challenge, or extend the result.