{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-28-ai-assisted-results-october-28-listing/","md":"https://postcutoff.com/e/2026-10-28-ai-assisted-results-october-28-listing/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-10-28-ai-assisted-results-october-28-listing","date":"2026-10-28","date_precision":"day","short_title":"AI-assisted results in the 28 Oct 2026 sweep","deck":"Bialostocki–Lotspeich (1992), part of Gross–Prasad in geometric Langlands, Fuglede in 𝔽₂⁸, a TEMPO structure found by Claude, agent swarms on fractional Chern insulators, and a human digest of GPT-6 Astra's Smale counterexample","takeaway":"The 28 Oct sweep covered the arXiv announcement of 26–27 Oct submissions and late papers from 23–26 Oct. Five results have their own entries: Axiom's Lean proof of the Classification of Finite Simple Groups, OpenAI's spin-one Haldane gap proof (found through Hal Tasaki's follow-up), OpenAI's De Giorgi dimension-eight claim, Morgan–Mullen with Claude and Lean, and formula minimization with GPT-Sol-6.1. This page lists the rest. Claude, GPT-6 Astra and GPT-6 Pro supplied ideas, counterexamples or whole arguments in papers on zero-sum sequences, geometric Langlands, quantum dynamics, fire-blocking and spectral bounds.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.37125: A proof of the Bialostocki–Lotspeich conjecture (Wang, Zeng)","url":"https://arxiv.org/abs/2610.37125","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2610.36377: Gross–Prasad conjecture in geometric Langlands (Chen, Wang)","url":"https://arxiv.org/abs/2610.36377","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"arXiv 2610.36417: Fuglede's conjecture holds in eight dimensions over 𝔽₂ (Ferguson, Iosevich)","url":"https://arxiv.org/abs/2610.36417","type":"paper","group":"primary","domain":"arxiv.org"},{"n":4,"title":"arXiv 2610.37012: The TEMPO network can be made independent of the system size (Link)","url":"https://arxiv.org/abs/2610.37012","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"arXiv 2610.35934: Agentic swarms discover enhancement of fractional Chern insulator gaps (MOSAIC)","url":"https://arxiv.org/abs/2610.35934","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"arXiv 2610.36158: From boundary geometry to counterexamples in Smale's mean value problem (Adamczewski, Colbrook)","url":"https://arxiv.org/abs/2610.36158","type":"paper","group":"primary","domain":"arxiv.org"},{"n":7,"title":"arXiv 2610.36919: On the minimum speed for a fire blocking problem (Bressan, Talamini)","url":"https://arxiv.org/abs/2610.36919","type":"paper","group":"primary","domain":"arxiv.org"},{"n":8,"title":"arXiv 2610.35819: The Erdős–Ginzburg–Ziv constant of C_nʳ for even n (Elsholtz)","url":"https://arxiv.org/abs/2610.35819","type":"paper","group":"primary","domain":"arxiv.org"},{"n":9,"title":"arXiv 2610.34877: Rainbow maps and the number of graceful labelings of trees (Li)","url":"https://arxiv.org/abs/2610.34877","type":"paper","group":"primary","domain":"arxiv.org"},{"n":10,"title":"arXiv 2610.34972: Membership in the cone of quantum states over time is NP-hard","url":"https://arxiv.org/abs/2610.34972","type":"paper","group":"primary","domain":"arxiv.org"},{"n":11,"title":"arXiv 2610.34389: The ascending chain condition for radical well-mixed difference ideals","url":"https://arxiv.org/abs/2610.34389","type":"paper","group":"primary","domain":"arxiv.org"},{"n":12,"title":"arXiv 2610.37187: Removing trace preservation from a universal spectral bound for 2-positive maps (Tanninen)","url":"https://arxiv.org/abs/2610.37187","type":"paper","group":"primary","domain":"arxiv.org"},{"n":13,"title":"arXiv 2610.37107: A counterexample to KL1 completeness","url":"https://arxiv.org/abs/2610.37107","type":"paper","group":"primary","domain":"arxiv.org"},{"n":14,"title":"arXiv 2610.37018: Linear-time FPT rectilinear planarity testing of series-parallel graphs (Ortali)","url":"https://arxiv.org/abs/2610.37018","type":"paper","group":"primary","domain":"arxiv.org"},{"n":15,"title":"arXiv 2610.36588: Square-root logarithmic bounds for the arithmetic complexity of factorial multiples","url":"https://arxiv.org/abs/2610.36588","type":"paper","group":"primary","domain":"arxiv.org"},{"n":16,"title":"arXiv 2610.35579: Infinity Machine: a self-improving AI agent for research","url":"https://arxiv.org/abs/2610.35579","type":"paper","group":"primary","domain":"arxiv.org"},{"n":17,"title":"arXiv 2610.34449: Is the arXiv Apocalypse upon us? (Contaldi)","url":"https://arxiv.org/abs/2610.34449","type":"paper","group":"primary","domain":"arxiv.org"},{"n":18,"title":"arXiv 2610.36302: The Andreadakis conjecture (Kofinas; no AI statement)","url":"https://arxiv.org/abs/2610.36302","type":"paper","group":"primary","domain":"arxiv.org"},{"n":19,"title":"formal-conjectures commit: Erdős Problem 627, Tutte–Zykov variant proved","url":"https://github.com/google-deepmind/formal-conjectures/commit/1e79eb940d9865ffa4017615b54e403bee6be38e","type":"code","group":"primary","domain":"github.com"},{"n":20,"title":"36Kr: 'Wang's Conjecture Fully Cracked by AI Overnight' (Kakeya)","url":"https://eu.36kr.com/en/p/4043601956033414","type":"press","group":"press","domain":"eu.36kr.com"},{"n":21,"title":"36Kr: Zhang Yitang's unsolved breakthrough (Landau–Siegel zeros)","url":"https://eu.36kr.com/en/p/4042391812953220","type":"press","group":"press","domain":"eu.36kr.com"}],"official":19,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"],"title":"AI-assisted results in the 28 Oct 2026 sweep: Bialostocki–Lotspeich (1992), part of Gross–Prasad in geometric Langlands, Fuglede in 𝔽₂⁸, a TEMPO structure found by Claude, agent swarms on fractional Chern insulators, and a human digest of GPT-6 Astra's Smale counterexample","summary":"Catalogue of AI-disclosing papers from the 26–28 Oct 2026 arXiv announcements and new commits in result repositories, beyond those with their own entries. Highlights: Wang and Zeng prove the 1992 Bialostocki–Lotspeich conjecture with an LLM used \"for mathematical exploration, checking arguments\"; Chen and Wang prove part of the global Gross–Prasad conjecture in the geometric Langlands setting, where a GPT-6 Pro prompt \"led to Proposition 1.7\"; Ferguson and Iosevich prove Fuglede's conjecture in 𝔽₂⁸ with ChatGPT; Link's TEMPO tensor-network structure \"was discovered by Claude Opus 5.5\"; a Claude Opus 5.5 agent swarm (MOSAIC) finds fractional Chern insulator gaps over ten times larger away from ideal quantum geometry; Adamczewski and Colbrook give a human account of GPT-6 Astra's Smale counterexample. An agent-run study finds that maths arXiv submissions doubled within a year.","key_facts":["Own entries: 2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean, 2026-10-06-openai-spin-one-haldane-gap-proof (with Tasaki's arXiv 2610.34330), 2026-10-06-openai-de-giorgi-conjecture-dimension-eight, 2026-10-27-morgan-mullen-conjecture-claude-lean (2610.36534), 2026-10-25-formula-minimization-sigma2p-complete-gpt-sol (2610.34516). Enriched: Smale mean value (2610.36158), Yang–Mills (Gross committee statement, AGMAI release request), quasi-Riemann (Radziwiłł talk; first downstream use in 2610.36588), crossing numbers (Pasechnik's forest), Navier–Stokes (Armstrong via 36Kr)","Bialostocki–Lotspeich conjecture (1992) on the number of n-term zero-sum subsequences, N₀ⁿ(S) ≥ C(⌊|S|/2⌋, n) + C(⌈|S|/2⌉, n) (Guoqing Wang, Xiangneng Zeng; 2610.37125): 'In this paper, we prove this conjecture completely.' AI statement: 'The authors used a large language model during the preparation of this manuscript for assistance with mathematical exploration, checking arguments, organization and language editing.'","Gross–Prasad in geometric Langlands (Kaiyi Chen, Zeyu Wang, advised by Zhiwei Yun; 2610.36377): part of the global conjecture for SO_n × SO_{n−1} in the unramified de Rham setting of Ben-Zvi–Sakellaridis–Venkatesh. 'Wang then prompted GPT-6 Pro with this idea and asked whether stronger statements beyond Euler characteristics could be established. This led to Proposition 1.7.' GPT-6 and Claude Opus 5.5 helped with literature (notably Proposition 3.7)","Fuglede's conjecture in 𝔽₂⁸ (Samuel J. Ferguson, Joshua Iosevich; 2610.36417): every spectral set and tile has a linear-subspace tiling complement, with a simpler proof of Kadowaki's dimension-seven result. 'The authors acknowledge collaboration with OpenAI's ChatGPT in preparing this draft, developing and checking the computer programs, and simplifying the presentation of the proofs.'","Physics: TEMPO networks independent of system size (Valentin Link; 2610.37012): internal bond dimension (2m+1)(m+1); 'This result was discovered by Claude Opus 5.5 during guided development of TEMPO methods. AI-generated code, cross-checked against our established code base, is available.' MOSAIC (Zhang, Xu, Li, Sarkar, Sun, Viswanathan; 2610.35934): a Claude Opus 5.5 swarm explores a GPT-6 Astra-proposed framework and finds many-body gaps 'more than an order of magnitude larger than in the ideal case', with the real-space quantum metric as the governing quantity","Model-suggested key ideas: fire-blocking lower bound λ ≤ 1.62621… cannot block (Alberto Bressan, Luca Talamini; 2610.36919): 'the specific idea of using a weighted double-bubble configuration as a comparison was suggested by GPT-6 Astra'; Erdős–Ginzburg–Ziv constant of C_nʳ beyond Harborth's bound (Christian Elsholtz; 2610.35819): research 'carried out in interaction with … Claude (Anthropic, model Opus 5.5)'; graceful labelings of trees, a TAOCP exercise 7.2.2.3-106 asymptotic with b = 2/π (Shisheng Li; 2610.34877): 'done with extensive use of AI systems', with thanks to Donald Knuth for comments; NP-hardness of the cone of quantum states over time (Matt Hoogsteder-Riera; 2610.34972): 'LLM assistance has been used to derive the results'","More: ascending chain condition for radical well-mixed difference ideals, 'a long-standing open problem in difference algebra' (Wei Li, Jie Wang; 2610.34389): GPT-6 Astra for 'brainstorming, mathematical development, and manuscript drafting'; Galois-type property for weakly compact actions (Chifan, Flood; 2610.33320): ChatGPT Astra 6 helped construct the counterexample in Theorem C; a conjecture of vom Ende–Chruściński–Kimura–Muratore-Ginanneschi on conditionally 2-positive maps (Petri Tanninen; 2610.37187): ChatGPT for 'exploring proof strategies, drafting and checking derivations'; KL₁ completeness conjecture refuted (Presa, D'Asaro, Badino; 2610.37107): counterexample found without AI, Gemini gave a preliminary completeness argument, Claude Opus 5.5 checked proofs and helped the Agda formalization; Tam's star-shapedness conjecture (Luan, Tam; 2610.35612): ChatGPT for exposition and Section 5; sheaves on nodal singularities (2610.34676): Theorem 4.1 'partly assisted by … ChatGPT-5.6 Sol'","Lean: linear-time FPT rectilinear planarity of series-parallel graphs (Giacomo Ortali; 2610.37018): 'All proofs … are additionally verified in Lean 4 with Mathlib'; ChatGPT and Claude helped develop proofs and the Lean code. Parabolic rectifiable Reifenberg (2610.35809): Lean code written by LLMs under the author's direction","Downstream use of OpenAI's quasi-Riemann preprints: Liang Zhang (2610.36588, with UniDT's UniMath model, GPT-6.1 Sol and GPT-6 Astra) bounds the arithmetic complexity of factorial multiples, τ(m_k k!) ≤ exp(C√(log k log log k)), assuming a zero-free half-plane, and notes that OpenAI's unrefereed 7/8 and 11/12 results 'supply the hypothesis'","Agent systems: Infinity Machine (Harish S. Ganesan; 2610.35579), a self-improving harness that over 14 problems in six days and about $180 of model usage reports four results beyond the published state of the art in quantum information (e.g. stabilizer rank χ(T⁷) ≤ 10), and reports its failures ('proposers gamed lenient scorers four times')","Meta-science: 'Is the arXiv Apocalypse upon us?' (Carlo Contaldi, Imperial; 2610.34449; analysis and first draft by an agentic AI): a second break in arXiv growth between Dec 2025 and Feb 2026; non-CS submissions 17% above trend; record 40,363 submissions in Sept 2026; maths submissions doubled within a year; solo-authored papers up 70% in maths and condensed matter","Checked, no AI statement in the PDF: Andreadakis conjecture disproved for n ≥ 3, c ≥ 4 (C. E. Kofinas; 2610.36302); Carlet–Solé weight-spectrum conjecture refuted for RM(m−7, m) (Lou, Wang; 2610.36687)","Writing help only: Wang's planar D-coloring conjecture, sharp 2Δ−1 for Δ ≥ 6 (Harshit Verma; 2610.33322): 'Generative AI tools were used to assist in the writing of this paper'","Repositories: formal-conjectures added Erdős problems 777 (Claude-assisted PR, plby/lean-proofs proofs of known results), 1114, 284, 823 and others, proved the Tutte–Zykov variant of #627 (Mycielski graphs; main question open), linked Cambie's n = 3 counterexample for #692 and marked Green's problem 27 (lower bound) solved by Cao–Yuan; anthropics/formal-math added the ETH paper (own entry); openai/math update of 26 Oct added the ETH and all-dimension local smoothing papers and a Lean formalization for the CM Hodge paper (in those entries)","36Kr leads resolved: 'Wang's Conjecture fully cracked by AI overnight' (27 Oct) is about Hong Wang's Kakeya work and OpenAI's all-dimension local smoothing claim (2026-10-26-openai-local-smoothing-kakeya-all-dimensions-claim); 'Zhang Yitang's unsolved breakthrough … 5-page proof' (26 Oct) is the Landau–Siegel zero story (Green, Banks, Kerr), already covered"],"key_numbers":[],"tags":["math","physics","computer-science","arxiv","catalogue","chatgpt","gpt-6-astra","gpt-6-pro","gpt-6-1-sol","claude","claude-opus-5-5","claude-fable-5-1","gemini","codex","lean"],"science":{"field":"mathematics","subfield":"multiple (additive combinatorics, geometric Langlands, harmonic analysis, quantum many-body physics, PDE, algebra, logic)","problem":"See list","result":"Catalogue of AI-assisted results in the 28 Oct 2026 arXiv announcements and result repositories, beyond those with their own entries","open_since":"","ai_system":["ChatGPT","GPT-6 Astra","GPT-6 Pro","GPT-6.1 Sol","ChatGPT-5.6 Sol","Claude Opus 5.5","Gemini","UniMath"],"human_role":"From model-discovered structures and key ideas to AI checking and editing","verification":{"key":"lean","label":"Lean-verified","text":"Unrefereed arXiv preprints; Lean formalizations where stated"},"status":"pending","shock":"","verified_by":["preprint","lean"],"kind":"batch"},"body_md":"## What happened\n\nThe sweep listed 102 arXiv papers with an AI-use sentence and 69 conjecture papers without one. We read the abstracts and the PDFs'\nAI statements for the 33 most relevant. The quotes above come from the PDFs. Five results got their own entries. The day's\nbiggest finds were not on arXiv: Axiom's Classification of Finite Simple Groups in Lean, and OpenAI's Haldane gap and De Giorgi\nmanuscripts from 6 Oct, which we had not covered. The Haldane gap paper surfaced only because Tasaki cited it.\n\n## Why it matters\n\nModels are now credited with specific discoveries in physics, not only maths. Claude found the TEMPO network structure, an agent\nswarm found the gap enhancement, and ChatGPT Astra found the separated-insertion argument in Tasaki's paper. An agent-run study\nmeasured how far preprint volume has moved: maths submissions doubled in a year.","disputed":[{"label":"Verification","text":"Unrefereed arXiv preprints; Lean formalizations where stated","sources":[]}],"related":[{"id":"2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean","url":"https://postcutoff.com/e/2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean/","date":"2026-10-27","date_precision":"day","short_title":"Axiom: Classification of Finite Simple Groups formalized in Lean","deck":null,"takeaway":"On 27 Oct 2026 Axiom Math published a Lean 4 formalization of the Classification of Finite Simple Groups (CFSG). The proof was originally spread over hundreds of papers and an estimated 10,000–15,000 pages. Axiom says it is sorry-free, follows the first-generation proof, and was built by AI agents working with about 30 mathematicians and engineers. Press reports put the build time at 24 days. Along the way the team found a false step in one published route to the Unbalanced Group Theorem and wrote a replacement argument. The project is self-reviewed: outside experts have not yet re-run the build or checked that the Lean statement matches CFSG.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":13,"official":7,"filed":"2026-10-28","updated":"2026-10-29","orgs":["Axiom Math"]},{"id":"2026-10-27-morgan-mullen-conjecture-claude-lean","url":"https://postcutoff.com/e/2026-10-27-morgan-mullen-conjecture-claude-lean/","date":"2026-10-27","date_precision":"day","short_title":"Morgan–Mullen conjecture confirmed with Claude, Lean-checked","deck":null,"takeaway":"Florian Hellwig (University of Zurich) posted a proof on 27 Oct 2026 that every F_{q^n} contains a primitive element that is completely normal over F_q, the 1996 Morgan–Mullen conjecture. The paper also proves Hachenberger's conjectured lower bound for the number of completely normal elements. The paper says the arguments and the text were generated by Claude Fable 5.1 and Claude Opus 5.5 under the author's direction, and the Lean formalization was 'generated entirely by AI'. The author checked the final proof by hand and checked the formal statements.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":1,"official":1,"filed":"2026-10-28","updated":"2026-10-28","orgs":["University of Zurich","Anthropic"]},{"id":"2026-10-27-ai-assisted-results-october-27-listing","url":"https://postcutoff.com/e/2026-10-27-ai-assisted-results-october-27-listing/","date":"2026-10-27","date_precision":"day","short_title":"AI-assisted results in the 27 Oct 2026 sweep","deck":"Muckenhoupt's C_p conjecture, Graham's rearrangement conjecture in abelian groups, a quasi-polynomial χ-bound for P₆-free graphs, Haagerup's 1975 problem, Langberg–Médard, and proofs whose main idea came from Claude or GPT","takeaway":"Tuesday's arXiv announcement (papers submitted 23–26 Oct) was the largest so far for AI-assisted mathematics. Four results have their own entries: Golomb–Welch, 3-coloring with O(n^0.1537) colors, Balko's exposition of OpenAI's Harary–Hill proof, and Ando–Umehara on Alpöge's smooth Carathéodory counterexamples. This page lists the next tier, from 46-year-old conjectures where ChatGPT supplied an alternative argument to short papers where Claude or GPT proposed the main idea.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":22,"official":22,"filed":"2026-10-27","updated":"2026-10-27","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-10-25-formula-minimization-sigma2p-complete-gpt-sol","url":"https://postcutoff.com/e/2026-10-25-formula-minimization-sigma2p-complete-gpt-sol/","date":"2026-10-25","date_precision":"day","short_title":"Formula minimization Σ₂ᵖ-complete (proof found by GPT-Sol-6.1)","deck":null,"takeaway":"Reijo Jaakkola posted a short arXiv note on 25 Oct 2026 proving that the Minimum Equivalent Expression problem is Σ₂ᵖ-complete under polynomial-time many-one reductions. The problem asks whether a Boolean formula has an equivalent formula with at most k variable occurrences, and it has been on Garey and Johnson's open-problem list since 1979. Buchfuhrer and Umans had proved completeness only under Turing reductions, in 2008. The note says the proof 'was discovered by GPT-Sol-6.1', then rewritten by Opus 5.5. It is unrefereed and has no formal proof.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI","Anthropic"]},{"id":"2026-10-06-openai-spin-one-haldane-gap-proof","url":"https://postcutoff.com/e/2026-10-06-openai-spin-one-haldane-gap-proof/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI proves the spin-one Haldane gap (periodic chains)","deck":null,"takeaway":"Two manuscripts in OpenAI's 6 Oct 2026 math release (dated 24 Sept) prove that the spin-one antiferromagnetic Heisenberg chain has a spectral gap that stays positive as even periodic rings grow. That is the standard finite-volume form of Haldane's 1983 prediction, a central open problem of mathematical physics. Hal Tasaki, a leading expert on the problem, studied the analytic part. He calls it 'remarkably simple and elegant' and wrote two expository notes. He has not checked the computer-assisted estimates. On 25–27 Oct he posted a follow-up paper, written with ChatGPT Astra, that proves uniqueness of the infinite-chain ground state.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":4,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI"]},{"id":"2026-10-06-openai-de-giorgi-conjecture-dimension-eight","url":"https://postcutoff.com/e/2026-10-06-openai-de-giorgi-conjecture-dimension-eight/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI claims De Giorgi's conjecture in dimension eight","deck":null,"takeaway":"A manuscript in OpenAI's 6 Oct 2026 math release (family 375, dated 26 Sept) claims to complete De Giorgi's conjecture. Every bounded entire solution of the Allen–Cahn equation Δu = u³ − u in ℝ⁸ that is strictly increasing in one direction is a one-dimensional tanh profile. Dimensions 2 and 3 were known, as was Savin's result up to dimension 8 under an extra limit assumption, and counterexamples exist from dimension 9. The paper also classifies stable solutions in ℝ⁷ without energy bounds. A Chinese group has already built on it. No expert assessment and no Lean proof are known as of 28 Oct.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":4,"official":3,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI"]},{"id":"2026-09-03-smale-mean-value-conjecture-disproved-gpt-6-astra","url":"https://postcutoff.com/e/2026-09-03-smale-mean-value-conjecture-disproved-gpt-6-astra/","date":"2026-09-03","date_precision":"day","short_title":"GPT-6 Astra autonomously disproves Smale's mean value conjecture in Lean","deck":"HKU mathematicians build on it to show Smale's constant exceeds 1.1018","takeaway":"A Smale problem from 1981 fell to an unattended model run in an Epoch AI benchmark, with a Lean proof; six weeks later two complex analysts turned the construction into a quantitative bound M > 1.1018.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":6,"official":6,"filed":"2026-10-16","updated":"2026-10-28","orgs":["OpenAI","Epoch AI","University of Hong Kong"]}],"people":[{"id":"hal-tasaki","name":"Hal Tasaki","url":"https://postcutoff.com/person/hal-tasaki/"},{"id":"zvi-mowshowitz","name":"Zvi Mowshowitz","url":"https://postcutoff.com/person/zvi-mowshowitz/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-28","type":"filed","text":"Created (science agent; arXiv abstracts and PDFs, GitHub API, 36Kr)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-28","run":null,"sources_read":null,"updated":"2026-10-28","human_review":null,"version":{"date":"2026-10-28"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":181,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":120,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":211,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":150,"in_training_data":false}],"short_url":null}