Erdős Problem #959
superlinear lower bound M(n) ≥ n^{1 + 1/(50000 log log n)}, improving Ω(n log n); the exact order remains open
Exact FrontierDelta
Scope and record
Occurred: Oct 29, 2026
Delta type: REGISTRY REVISION
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. 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: Erdős Problem #959 · Erdős #959 · Problem 959
Confidence: Not scored
Registry verification: lean verified · announcement · partial
Attribution
VibeMathed
registry · event recorded by
GPT-5.6 starships (Claude Fable 5 reviewer)
model · ai model contributor · OpenAI / Anthropic
Lineage and corrections
Corrects Erdős Problem #959 →
Supersedes Erdős Problem #959 →
Erdős Problem #959 parent of this event
Erdős Problem #959 evidence for this event
This event attributed to GPT-5.6 starships (Claude Fable 5 reviewer)
superlinear lower bound M(n) ≥ n^{1 + 1/(50000 log log n)}, improving Ω(n log n); the exact order remains open parent of this event
VibeMathed record: Erdős Problem #959 evidence for this event
Act on this frontier