Erdős Problem #709
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain 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 #709 · Erdős #709 · Problem 709
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 #709 →
Supersedes Erdős Problem #709 →
This event attributed to GPT-5.6 starships (Claude Fable 5 reviewer)
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open parent of this event
VibeMathed record: Erdős Problem #709 evidence for this event
Erdős Problem #709 evidence for this event
Erdős Problem #709 parent of this event
Act on this frontier