{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-12-ulam-sequence-grows-subexponentially-kravitz-chatgpt/","md":"https://postcutoff.com/e/2026-11-12-ulam-sequence-grows-subexponentially-kravitz-chatgpt/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-12-ulam-sequence-grows-subexponentially-kravitz-chatgpt","date":"2026-11-12","date_precision":"day","short_title":"Ulam sequence grows subexponentially (ChatGPT 6)","deck":null,"takeaway":"Ulam's 1964 sequence had only exponential upper bounds (best growth rate 1.454ⁿ, 2025). A preprint proves u_n ≤ e^{C√n}. The author states that ChatGPT 6 produced the successive bounds 'with minimal substantive human input'.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.17584: The Ulam sequence grows subexponentially","url":"https://arxiv.org/abs/2611.17584","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-11-16","updated":"2026-11-16","orgs":["OpenAI"],"title":"The Ulam sequence grows subexponentially: Noah Kravitz posts a bound u_n ≤ e^{C√n} whose proofs, he writes, 'are due to ChatGPT'","summary":"arXiv 2611.17584 (math.CO, 12 Nov 2026), Noah Kravitz: the n-th Ulam number satisfies u_n ≤ e^{C√n}; previous upper bounds were exponential (record 1.454ⁿ, Clément–Steinerberger 2025). The argument uses only two properties of the sequence and an additive-combinatorial lemma on covering finite difference sets by multiplicatively short intervals. The abstract says 'The proofs are due to ChatGPT.' Numerics suggest linear growth; the true rate remains open.","key_facts":["Claim (Theorem 1.1): there is C > 0 with u_n ≤ e^{C√n} for all n","AI statement (verbatim): 'With minimal substantive human input, ChatGPT 6 successively produced upper bounds for u_n of the shape e^{O(n^{2/3})}, then e^{O(√n log n)}, and finally e^{O(√n)}'; further prompting produced the sharp form of Proposition 2.1","Background (paper): sequence defined by Stanislaw Ulam in 1964 (1, 2, 3, 4, 6, 8, 11, …, each term the smallest number with a unique representation as a sum of two distinct earlier terms); computations suggest linear growth","Status: unrefereed preprint; no Lean; no public reaction found by 16 Nov"],"key_numbers":[],"tags":["math","combinatorics","additive-combinatorics","ulam-sequence","chatgpt","gpt-6","arxiv"],"science":{"field":"mathematics","subfield":"combinatorics / additive number theory","problem":"Growth rate of the Ulam sequence (Ulam 1964)","result":"First subexponential upper bound, u_n ≤ e^{C√n}","open_since":"1964","ai_system":["ChatGPT 6"],"human_role":"Largely AI-generated proofs; the author prompted, checked and wrote the paper","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint"},"status":"pending","shock":""},"body_md":"## What happened\n\nNoah Kravitz posted a short paper giving the first subexponential upper bound for Ulam's sequence. The paper credits the proofs\nto ChatGPT 6, which improved its own bounds in stages from e^{O(n^{2/3})} to e^{O(√n)} with little human input.\n\n## Why it matters\n\nThe Ulam sequence is a well-known example of a simply defined sequence whose growth is not understood. The result moves the\nupper bound from exponential to e^{O(√n)}, still far from the linear growth that computations suggest.","disputed":[{"label":"Verification","text":"Unrefereed preprint","sources":[]}],"related":[{"id":"2026-11-16-ai-assisted-results-november-16-listing","url":"https://postcutoff.com/e/2026-11-16-ai-assisted-results-november-16-listing/","date":"2026-11-16","date_precision":"day","short_title":"AI-assisted results, 16 Nov","deck":null,"takeaway":"The sweep listed 260 arXiv papers with AI statements, 52 conjecture papers without one, 62 new Hexagon works and 16 result-repo commits. Every PDF was read at its AI statement. Eight results got their own entries; 54 arXiv papers and 45 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":10,"official":10,"filed":"2026-11-16","updated":"2026-11-16","orgs":["OpenAI","Anthropic","Google","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-16","type":"filed","text":"Created (science agent; abstract, introduction and AI statement read in the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-16","run":null,"sources_read":"Science agent; abstract, introduction and AI statement read in the PDF","updated":"2026-11-16","human_review":null,"version":{"date":"2026-11-16"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":165,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":135,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":226,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":165,"in_training_data":false}],"short_url":null}