{"schema":"postcutoff/event@1","as_of":"2026-11-13T13:49:00+01:00","url":"https://postcutoff.com/e/2026-11-13-ai-assisted-results-november-13-listing/","md":"https://postcutoff.com/e/2026-11-13-ai-assisted-results-november-13-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-11-13-ai-assisted-results-november-13-listing","date":"2026-11-13","date_precision":"day","short_title":"AI-assisted results, 13 Nov","deck":null,"takeaway":"The arXiv listings of 12–13 Nov carried about 190 maths papers with an AI statement. Most disclose editing or literature search; about forty credit models with proofs, constructions or counterexamples. Seven got their own entries; the rest are catalogued here with the disclosure quoted. All are unrefereed preprints.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.15128: Affine Combiners for Reed-Solomon Proximity Gaps","url":"https://arxiv.org/abs/2611.15128","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2611.16231: A Polynomial Bound on Split Rank","url":"https://arxiv.org/abs/2611.16231","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"arXiv 2611.17090: Online Transportation via Shifted Geometric Scales","url":"https://arxiv.org/abs/2611.17090","type":"paper","group":"primary","domain":"arxiv.org"},{"n":4,"title":"arXiv 2611.15486: Independent sets in regular uniform hypergraphs","url":"https://arxiv.org/abs/2611.15486","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"arXiv 2611.15773: A negative answer to the final question in 'Les petits cailloux'","url":"https://arxiv.org/abs/2611.15773","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"arXiv 2611.16819: Finiteness of strongly reflective modular forms","url":"https://arxiv.org/abs/2611.16819","type":"paper","group":"primary","domain":"arxiv.org"},{"n":7,"title":"arXiv 2611.16682: The coercivity conjecture for nonlocal energies","url":"https://arxiv.org/abs/2611.16682","type":"paper","group":"primary","domain":"arxiv.org"},{"n":8,"title":"arXiv 2611.16690: Hilbert's 17th problem for symmetric functions: undecidability and a counterexample","url":"https://arxiv.org/abs/2611.16690","type":"paper","group":"primary","domain":"arxiv.org"},{"n":9,"title":"arXiv 2611.16938: Rohrbach's Conjecture for Finite Groups","url":"https://arxiv.org/abs/2611.16938","type":"paper","group":"primary","domain":"arxiv.org"},{"n":10,"title":"arXiv 2611.16157: Resolution of Erdős problem 521","url":"https://arxiv.org/abs/2611.16157","type":"paper","group":"primary","domain":"arxiv.org"},{"n":11,"title":"arXiv 2611.16299: Improved lower bounds for MOLS at 33 orders","url":"https://arxiv.org/abs/2611.16299","type":"paper","group":"primary","domain":"arxiv.org"},{"n":12,"title":"arXiv 2611.16899: Counterexamples to flagged LLT and nonsymmetric Macdonald atom positivity","url":"https://arxiv.org/abs/2611.16899","type":"paper","group":"primary","domain":"arxiv.org"},{"n":13,"title":"arXiv 2611.17205: Forbidden subset sums and the Erdős–Graham irregularity problem","url":"https://arxiv.org/abs/2611.17205","type":"paper","group":"primary","domain":"arxiv.org"},{"n":14,"title":"arXiv 2611.16963: A completely decomposable modular Jacobian of dimension 1777","url":"https://arxiv.org/abs/2611.16963","type":"paper","group":"primary","domain":"arxiv.org"},{"n":15,"title":"arXiv 2611.15431: Subadditivity and the failure of strong subadditivity in the Nichols–Wootters entropies","url":"https://arxiv.org/abs/2611.15431","type":"paper","group":"primary","domain":"arxiv.org"},{"n":16,"title":"arXiv 2611.14888: Strongly quasidiagonal C*-algebras with nuclear dimension one and infinite decomposition rank","url":"https://arxiv.org/abs/2611.14888","type":"paper","group":"primary","domain":"arxiv.org"},{"n":17,"title":"arXiv 2611.15299: Small classes have linear neighbourhood complexity","url":"https://arxiv.org/abs/2611.15299","type":"paper","group":"primary","domain":"arxiv.org"},{"n":18,"title":"arXiv 2611.16140: The lower boundary of the {K2,Kp,Kq}-profile","url":"https://arxiv.org/abs/2611.16140","type":"paper","group":"primary","domain":"arxiv.org"},{"n":19,"title":"arXiv 2611.15244: Small cells in great-circle arrangements","url":"https://arxiv.org/abs/2611.15244","type":"paper","group":"primary","domain":"arxiv.org"},{"n":20,"title":"arXiv 2611.17248: Matching in Random-Order Streams via Historical Deletion Bounds","url":"https://arxiv.org/abs/2611.17248","type":"paper","group":"primary","domain":"arxiv.org"},{"n":21,"title":"arXiv 2611.16043: The Wasserstein cost of the Girsanov Theorem","url":"https://arxiv.org/abs/2611.16043","type":"paper","group":"primary","domain":"arxiv.org"},{"n":22,"title":"arXiv 2611.16898: A complete solution to the Naor isomorphic reverse isoperimetry conjecture","url":"https://arxiv.org/abs/2611.16898","type":"paper","group":"primary","domain":"arxiv.org"},{"n":23,"title":"formal-conjectures commit: Erdős Problem 190 solved, formal proof linked","url":"https://github.com/google-deepmind/formal-conjectures/commit/04937a4cccadd0a205abdf2c706938c6c95e4177","type":"code","group":"primary","domain":"github.com"},{"n":24,"title":"Hexagon 2610.00435: Area nondecreasing drawstrings and counterexamples to Euclidean rigidity and zero mass stability","url":"https://hexagonmath.org/abs/2610.00435","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":25,"title":"Hexagon 2610.00408: On the irrationality of the 3-adic zeta value ζ₃(5)","url":"https://hexagonmath.org/abs/2610.00408","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":26,"title":"Hexagon 2610.00409: A Frobenius determinant proof of the non-existence of Landau–Siegel zeros","url":"https://hexagonmath.org/abs/2610.00409","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":27,"title":"Hexagon 2610.00398: log_p 2 · log_p(3+√2) is not a p-adic linear form in logarithms","url":"https://hexagonmath.org/abs/2610.00398","type":"paper","group":"primary","domain":"hexagonmath.org"}],"official":27,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","Anthropic","Google DeepMind","Axiom Math","various researchers"],"title":"AI-assisted results in the 13 Nov sweep: ℤ Diophantine in ℚ, the hyperelliptic Schottky problem, a BST with the unified bound, band-matrix QUE in 1.2M lines of Lean, plus Reed–Solomon proximity gaps 'carried out entirely with AI', split rank, online transportation and 26 Hexagon backlog lines","summary":"Catalogue of AI-assisted results from the arXiv listings of 12–13 Nov 2026 (and late papers dated 12 Nov), the 13 Nov result-repo commits and 26 lines of the October Hexagon backlog. Own entries: ℤ is Diophantine in ℚ (Glazer; Burungale), hyperelliptic Schottky problem (Huang–Jiang), unified-bound BST (Cao–Qi–Wang), band-matrix QUE with AxiomProver Lean (Ghosal–Remy), grid-minor exponent 6 (Hajiaghayi), test-free PDL interpolation (Gattinger, Claude Fable), fixed-profile soliton resolution counterexamples (Chen–Holmer–Shen); a third Grad counterexample was added to the Grad entry. Highlights below: Chiesa et al.'s Reed–Solomon proximity gaps, split rank, online transportation, Balogh–Bollobás–Narayanan, Borcherds' 1995 question, the coercivity conjecture, Hilbert's 17th problem for symmetric functions.","key_facts":["Reed–Solomon proximity gaps with affine combiners (Alessandro Chiesa, Guy Weissenberg, Eylon Yogev, Kai Zhe Zheng; [2611.15128](https://arxiv.org/abs/2611.15128)): combining f + (α + βx)g gives smaller mutual-correlated-agreement error than scalar combiners, relevant to SNARK soundness. Disclosure: 'The authors then asked ChatGPT 6 Astra to prove an improved proximity-gap result for these combiners and immediately obtained Theorem 1.1. The analysis, including all proofs appearing in this paper, was carried out entirely with AI.' Lean formalization developed with Astra, theorem statement checked by Claude Code Opus 5.5; Sections 5, 7 and App. A not formalized","Polynomial bound on split rank (Avinash Bhardwaj, Vishnu Narayanan; [2611.16231](https://arxiv.org/abs/2611.16231)): split rank of a rational pure-integer polyhedron is O((L+1)⁹) in its encoding length, 'resolving a conjecture of Basu, Conforti, Di Summa, and Jiang'; ChatGPT used for literature, 'the development of induction arguments and checking the encoding bound'","Online transportation (John Jeang; [2611.17090](https://arxiv.org/abs/2611.17090)): competitive ratio ρ(m−1)+1 with ρ ≈ 5.64, improving Seth–Das–Raghvendra's ≈ 6.66m; the conjectured optimum 2m−1 remains open. AI checklist: approach, proof development, writing and bug-checking 'Yes'; 'the idea to have a second objective function F … was a novel idea produced by ChatGPT. Moreover the original draft was entirely created by ChatGPT' (ChatGPT-6 Astra)","Balogh–Bollobás–Narayanan conjecture (An Chang, Lusheng Fang, Guorong Gao, Caihong Yang; [2611.15486](https://arxiv.org/abs/2611.15486)): every d-regular r-uniform hypergraph has ind(H) ≤ ind(H_d^r)^(n/(rd)), the hypergraph Kahn–Zhao bound; GPT-6 'to discuss the choice of local statistics in the proof of Lemma 4.4' and identified the weighted bipartite inequality of Lemma 3.2","P ≠ NP over structures with pairing (Mihai Prunescu; [2611.15773](https://arxiv.org/abs/2611.15773)): every finite-signature structure with a pairing operation and its two projections satisfies P ≠ NP in the BSS-style unit-cost model, answering the final question of Poizat's 'Les petits cailloux' negatively; 'This paper was produced in an AI-assisted workflow. AI assistants helped explore candidate constructions, draft proofs'","Borcherds 1995 / Gritsenko–Nikulin 1998 (Jialin Li, Haowu Wang; [2611.16819](https://arxiv.org/abs/2611.16819)): only finitely many strongly reflective modular forms on O⁺(n,2), n ≥ 3, up to conjugation; generative AI used 'in the development, testing, and refinement of parts of the proof'","Coercivity conjecture for nonlocal energies (Behn, Colombo, Fernández-Real, Grube, Prasad, Ros-Oton; [2611.16682](https://arxiv.org/abs/2611.16682)): fails whenever n > 2s, holds for n = 1, s > 1/2; 'sustained interactions with ChatGPT versions 5.5, 5.6, and 6 … The models served as sounding boards and contributed mathematical ideas, technical extensions, refinements of proofs'","Hilbert's 17th problem for symmetric functions (Sebastian Debus, Robin Schabert; [2611.16690](https://arxiv.org/abs/2611.16690)): dimension-free nonnegativity of symmetric functions is undecidable (a question of Acevedo–Blekherman–Debus–Riener), and a degree-8 positive definite symmetric function has no uniform SOS multiplier; 'Initial proofs of the two main results … were found by GPT 6.0 Astra (OpenAI) in September 2026'; Lean 'almost entirely generated by coding agents' ([repo](https://github.com/RobinSchabert/positive-sym-func-h17-undecidability-lean)); cites Jin's Codex-prepared manuscript on the same undecidability","Other 12 Nov papers: Rohrbach's conjecture for finite groups (Yong Yang, [2611.16938](https://arxiv.org/abs/2611.16938), ChatGPT 'for mathematical exploration'); Erdős Problem 521 resolved, N_n/log n has no a.s. limit (Zengjing Chen et al., [2611.16157](https://arxiv.org/abs/2611.16157); its deterministic step is 'the paired-sum criterion of ChatGPT 5.5 Pro' from Kovač's earlier note); MOLS lower bounds improved at 33 orders, 'The large language model OpenAI GPT-6 Astra … found all the MOLS constructions' (Christopher Rosin, [2611.16299](https://arxiv.org/abs/2611.16299)); counterexamples to flagged LLT and nonsymmetric Macdonald atom positivity 'found by ChatGPT-6 Astra' (Per Alexandersson, [2611.16899](https://arxiv.org/abs/2611.16899)); Erdős #361 (Erdős–Graham irregularity): exact f_c(n) for c ≥ 1 and limsup for c < 1, from ideas 'produced with a research pipeline combining the AI systems GPT-5 (OpenAI) and Claude (Anthropic)' (Mateo Matijasevick, [2611.17205](https://arxiv.org/abs/2611.17205)); a completely decomposable modular Jacobian of dimension 1777, beating Ekedahl–Serre's 1297 from 1993 (Robert Auffarth, [2611.16963](https://arxiv.org/abs/2611.16963), AI 'in exploratory research'); random-order streaming matching 0.71295 with Codex/Astra and Lean (Farhadi, Hajiaghayi, Mahdavi, [2611.17248](https://arxiv.org/abs/2611.17248)); contiguity of random regular hypergraphs, 'We used ChatGPT to come up with an initial proof' (Frieze, Pérez-Giménez, [2611.16160](https://arxiv.org/abs/2611.16160)); (Δ+2)-colouring reconfiguration diameter (Cames van Batenburg, [2611.17022](https://arxiv.org/abs/2611.17022)); a quasi-RH variant over ℚ(i) from OpenAI's proof, 'GPT6.1Sol produced the initial proof' (Xin Hang Ji, [2611.16665](https://arxiv.org/abs/2611.16665))","Combinatorics, 13 Nov: Sidorenko inequalities for orientations, negative answer to Doležal et al., 'first used OpenAI GPT-5.6 Sol to prove weaker versions' (Nie, Wei, [2611.15027](https://arxiv.org/abs/2611.15027)); {K2,Kp,Kq}-profile lower boundary, 'Conversations with ChatGPT Pro 5.6 were instrumental in proving the technical lemmas' (Blekherman, Raymond, [2611.16140](https://arxiv.org/abs/2611.16140)); small classes have linear neighbourhood complexity, resolving Bonnet–Duron–Sylvester–Zamaraev, ChatGPT Pro (Astra 6) helped repair the argument (Sylvester, Zamaraev, Zhukovskii, [2611.15299](https://arxiv.org/abs/2611.15299)); Das–Abdioğlu triameter conjecture, initial results 'produced with the assistance of the AI system GPT-Astra' (Hak, Kozerenko, [2611.17259](https://arxiv.org/abs/2611.17259)); smallest great-circle cells ≤ 7.0667/n² and M/m > 13, improving Fejes Tóth's 7.43, ChatGPT 6 Astra collaboration (Bhowmick, [2611.15244](https://arxiv.org/abs/2611.15244)); critical lower-tail large deviations, a dual certificate found with 'AI tools and heavy computational interval arithmetic' (Kwan, Pham, [2610.10233](https://arxiv.org/abs/2610.10233) v2); frustration index of hypercubes with Codex ([2611.14906](https://arxiv.org/abs/2611.14906)); near-minimum circuits in regular matroids with ChatGPT-5.6 ([2611.15755](https://arxiv.org/abs/2611.15755)); Grundy values of slow exact k-Nim with ChatGPT (Gurvich, Naumova, [2611.14546](https://arxiv.org/abs/2611.14546))","Geometry and analysis, 13 Nov: inscribed 4-polytope of maximal volume with ten vertices (Medgyes, [2611.14674](https://arxiv.org/abs/2611.14674), AI 'for mathematical discussion'); a trimmed Wetzel sector still covers all unit arcs (Panraksa, Wichiramala, [2611.16204](https://arxiv.org/abs/2611.16204), ChatGPT 6.1 Sol and Claude Fable 5.2); 373 extremal disc packings on minimal-genus hyperbolic surfaces, computation with Claude Opus 5.5 (Girondo, Reyes-Monsalve, [2611.15477](https://arxiv.org/abs/2611.15477)); MUON optimizer rates, four lemmas 'developed based on discussions with GPT-5.6 Sol Pro' (Jentzen et al., [2611.15825](https://arxiv.org/abs/2611.15825)); Levitt–Yoccoz gasket dimension with Claude and ChatGPT certificates (De Leo, [2611.15996](https://arxiv.org/abs/2611.15996)); Campana rational connectedness of weak log Fano orbifolds with GPT-6 Astra (Chen, Tseng, [2611.15191](https://arxiv.org/abs/2611.15191)); first strongly quasidiagonal C*-algebras with finite nuclear dimension and infinite decomposition rank, 'A discussion with ChatGPT led to Lemma 2.13 which was the missing piece' (Eckhardt, [2611.14888](https://arxiv.org/abs/2611.14888)); Lagrangian cobordisms and persistence, GPT-6 Astra suggested the Υ∞ retreat (Entov, Polterovich, [2611.14682](https://arxiv.org/abs/2611.14682)); global rigidity of right-angled Löbell polytopes, conditions found 'through further discussions with GPT-6 Astra' (Ko, [2611.16135](https://arxiv.org/abs/2611.16135)); Wasserstein cost of Girsanov, 'formalization was done in around 6 hours … by GPT-Astra-6' (Coste, [2611.16043](https://arxiv.org/abs/2611.16043); Hexagon 2611.00407); random torus slices with Opus 5.5 and GPT-6 Luna (Finch, [2611.15546](https://arxiv.org/abs/2611.15546))","Physics and logic, 13 Nov: subadditivity conjecture for subentropy settled and strong subadditivity fails for the Nichols–Wootters family, Lean via Codex and Claude Code (Zhang, Zhang, Ma, [2611.15431](https://arxiv.org/abs/2611.15431)); a third counterexample to Grad's conjecture, analytic with trivial symmetry group, 'discovered with the assistance of GPT-6 Astra Ultra' (de Lacy, Sato, [2611.16688](https://arxiv.org/abs/2611.16688); added to 2026-09-21-grad-conjecture-counterexamples); Hilbert-tenth companion 'Why should ℤ be Diophantine in ℚ?' ([2611.17124](https://arxiv.org/abs/2611.17124); see 2026-11-05-z-diophantine-in-q-glazer-burungale)","Checked, no AI statement in the PDF (conjecture list, 31 papers): Naor's isomorphic reverse isoperimetry conjecture, complete solution ([2611.16898](https://arxiv.org/abs/2611.16898)); Brown–Shields conjecture counterexample ([2611.16997](https://arxiv.org/abs/2611.16997)); GAP conjecture reduction ([2611.16279](https://arxiv.org/abs/2611.16279)); graph a-Turán theorem ([2611.16262](https://arxiv.org/abs/2611.16262)); packing sets by rigid motions ([2611.15402](https://arxiv.org/abs/2611.15402)); and 26 others","Result repos (formal-conjectures, 11–13 Nov): Erdős #190 marked solved with a Lean proof of J. H. Bae's April 2026 resolution ([commit](https://github.com/google-deepmind/formal-conjectures/commit/04937a4cccadd0a205abdf2c706938c6c95e4177), [Palomar](https://palomar-registry.org/entry.html?id=PALOMAR-2026-09-15-000003)); Palomar links for formal proofs of Erdős #1033 and the Straus variant of #657 ([commit](https://github.com/google-deepmind/formal-conjectures/commit/b76eef5f6443d95cebf9f09716bc3474266fc528), [commit](https://github.com/google-deepmind/formal-conjectures/commit/a7b29ebdb0b816467805e4421e0d2c172a718fb7)); an Isabelle proof of the Sándor variant of #882 ([commit](https://github.com/google-deepmind/formal-conjectures/commit/151f24a93d5b276ee07c3320ee6703fede8edeb1)); the rest are new statements (Green's open problems 17, 59, 69, 74, 84, 86, 91, 92, 95, 100; Erdős 297, 739, 1129, 1130; ambidextrous sofa; weighing and Butson–Hadamard conjectures). openai/math, anthropics/formal-math and oai-math-revised had no new commits","Hexagon backlog (26 lines, 20–21 Oct): Jiangcheng You disproves part (b) of Gromov's Euclidean C⁰ rigidity conjecture and Sormani's zero-mass stability conjecture with area-nondecreasing drawstrings (human-written, 'ChatGPT 6 was employed to discuss potential ideas', [2610.00435](https://hexagonmath.org/abs/2610.00435)); ζ₃(5) (3-adic) irrational, 'produced by large language models … in particular Anthropic's Claude Opus 5.5 running as autonomous agents', no human check ([2610.00408](https://hexagonmath.org/abs/2610.00408)); a Frobenius-determinant variant of OpenAI's Landau–Siegel proof, no human check (van Dijk, [2610.00409](https://hexagonmath.org/abs/2610.00409)); log_p 2·log_p(3+√2) is not a p-adic linear form in logarithms, 'a single session of Claude Code Fable' ([2610.00398](https://hexagonmath.org/abs/2610.00398)); Bergman's adjoint-tower question answered (Zhenyu Sun, [2610.00417](https://hexagonmath.org/abs/2610.00417)); prime-gap bounds H_m for 2 ≤ m ≤ 5 (Kapila, [2610.00419](https://hexagonmath.org/abs/2610.00419)); certificates for Zhang–Zagier ([2610.00426](https://hexagonmath.org/abs/2610.00426)), Schur–Siegel–Smyth ([2610.00425](https://hexagonmath.org/abs/2610.00425)) and Korenblum's constant ≥ 0.432 ([2610.00399](https://hexagonmath.org/abs/2610.00399)) by AI agents (Pinho); (3/2)ⁿ steering word with Fable 5 and Opus (Stephan, [2610.00414](https://hexagonmath.org/abs/2610.00414)); four Mislan autocatalysis papers, primarily AI ([2610.00437](https://hexagonmath.org/abs/2610.00437)–[00440](https://hexagonmath.org/abs/2610.00440)); two Pyle/Lyra graph papers, no human check ([2610.00421](https://hexagonmath.org/abs/2610.00421), [2610.00427](https://hexagonmath.org/abs/2610.00427)); Sun, P-ideals of hypergraphs ([2610.00410](https://hexagonmath.org/abs/2610.00410)); mixed physics essays ([2610.00411](https://hexagonmath.org/abs/2610.00411), [2610.00412](https://hexagonmath.org/abs/2610.00412)); human-written: [2610.00400](https://hexagonmath.org/abs/2610.00400), [00405](https://hexagonmath.org/abs/2610.00405), [00406](https://hexagonmath.org/abs/2610.00406), [00413](https://hexagonmath.org/abs/2610.00413), [00420](https://hexagonmath.org/abs/2610.00420), [00422](https://hexagonmath.org/abs/2610.00422), [00423](https://hexagonmath.org/abs/2610.00423)"],"key_numbers":[],"tags":["math","computer-science","physics","arxiv","hexagon","catalogue","gpt-6-astra","gpt-6-1-sol","gpt-5-6-sol","claude-opus-5-5","claude-fable","codex","lean"],"science":{"field":"mathematics","subfield":"multiple","problem":"See list","result":"Catalogue of AI-assisted arXiv papers of 12–13 Nov 2026 and Hexagon backlog lines beyond those with their own entries","open_since":"","ai_system":["GPT-6 Astra","GPT-6.1 Sol","GPT-5.6 Sol","ChatGPT","Claude Opus 5.5","Claude Fable 5.1","Claude Fable 5.2","Codex","AxiomProver"],"human_role":"From AI-found counterexamples and AI-written proofs to human proofs with AI checks","verification":{"key":"lean","label":"Lean-verified","text":"Unrefereed preprints; some with Lean"},"status":"pending","shock":"","verified_by":["preprint","lean"],"kind":"batch"},"body_md":"## What happened\n\nThe 13 Nov sweep listed 421 arXiv papers with AI statements; about 190 were new in the 12–13 Nov listings (the rest are older\npapers still uncited). Most statements cover editing, literature search, figures or proofreading; some authors state that no AI was\nused. About forty credit models with substantive mathematics. Seven results got their own entries (see related), and the Grad entry\ngained a third counterexample. This entry catalogues the rest, with the disclosure quoted.\n\nNotable patterns: several papers credit a model with the whole main proof (Chiesa et al.: \"carried out entirely with AI\"; Jeang:\n\"the original draft was entirely created by ChatGPT\"), and several with finding counterexamples or constructions (MOLS, flagged LLT,\nthe PDL interpolation counterexample). OpenAI's October release keeps generating follow-ups by human mathematicians (Hilbert's tenth\nproblem, quasi-RH, Landau–Siegel variants).\n\n## Why it matters\n\nThe share of maths preprints with substantive AI credit keeps growing, and the credited roles now include main theorems in active\nareas (coding theory, data structures, combinatorics). None of the items here is refereed; Lean coverage is partial where it exists.","disputed":[{"label":"Verification","text":"Unrefereed preprints; some with Lean","sources":[]}],"related":[{"id":"2026-11-12-binary-search-tree-unified-bound-ai","url":"https://postcutoff.com/e/2026-11-12-binary-search-tree-unified-bound-ai/","date":"2026-11-12","date_precision":"day","short_title":"A BST meets Iacono's 2001 unified bound, with Claude and GPT","deck":null,"takeaway":"Since 2001 it was open whether any binary search tree, even offline, achieves Iacono's unified bound, which combines the working-set and dynamic-finger bounds. A new preprint gives an online deterministic one, so dynamic optimality would imply Iacono's conjecture for splay trees. Five models from Anthropic and OpenAI helped design and analyse it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":1,"official":1,"filed":"2026-11-13","updated":"2026-11-13","orgs":["Anthropic","OpenAI","Pennsylvania State University","Jilin University","Tsinghua University"]},{"id":"2026-11-12-grid-minor-sixth-power-hajiaghayi-astra","url":"https://postcutoff.com/e/2026-11-12-grid-minor-sixth-power-hajiaghayi-astra/","date":"2026-11-12","date_precision":"day","short_title":"Grid-minor exponent 6 in polynomial time (Hajiaghayi with Astra)","deck":null,"takeaway":"Robertson and Seymour's grid-minor theorem is central to graph minors and bidimensionality; Chuzhoy and Tan's g⁹ bound (2021) was the best. Two AI-assisted claims now go below it: Édouard Bonnet's Lean-checked g⁸·polylog with Codex, and Hajiaghayi's g⁶·polylog with a polynomial-time algorithm, developed with OpenAI Astra.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":3,"official":3,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","University of Maryland","various researchers"]},{"id":"2026-11-12-test-free-pdl-no-craig-interpolation-claude-fable","url":"https://postcutoff.com/e/2026-11-12-test-free-pdl-no-craig-interpolation-claude-fable/","date":"2026-11-12","date_precision":"day","short_title":"Test-free PDL lacks interpolation; counterexample by Claude Fable in Lean","deck":null,"takeaway":"After Borzechowski et al. proved Craig interpolation for PDL (2026), the test-free fragment remained open. Malvin Gattinger asked Claude Fable to turn failed proof attempts into a counterexample search; it returned one with a Lean formalization in minutes. The paper, written by Gattinger, publishes all prompts.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":3,"filed":"2026-11-13","updated":"2026-11-13","orgs":["Anthropic","Harmonic","University of Amsterdam"]},{"id":"2026-11-12-fixed-profile-soliton-resolution-counterexamples-gpt-6-astra","url":"https://postcutoff.com/e/2026-11-12-fixed-profile-soliton-resolution-counterexamples-gpt-6-astra/","date":"2026-11-12","date_precision":"day","short_title":"Fixed-profile soliton resolution fails (3D, 5D wave equation), with GPT-6 Astra","deck":null,"takeaway":"Soliton resolution predicts that solutions of the focusing energy-critical wave equation split into finitely many fixed solitons plus radiation. Two preprints build bounded global solutions whose core keeps changing shape, contradicting the fixed-profile formulation of Duyckaerts, Kenig and Merle. The authors had the mechanism; GPT-6 Astra did the estimates.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","University of Rochester","Brown University","various researchers"]},{"id":"2026-11-12-ai-assisted-results-november-12-listing","url":"https://postcutoff.com/e/2026-11-12-ai-assisted-results-november-12-listing/","date":"2026-11-12","date_precision":"day","short_title":"AI-assisted results, 12 Nov: Hexagon","deck":null,"takeaway":"The largest Hexagon day yet: 94 uncited deposits on 12 Nov, a quarter of them Tejasvi Singh Tomar's Lean-checked bounds on classical constants. Several claim named conjectures (Petty, Marcus–Minc, Kim–Roush, Humphreys, quantum Kazhdan–Lusztig) with little or no human checking; read each as a claim.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":102,"official":102,"filed":"2026-11-12","updated":"2026-11-12","orgs":["OpenAI","Anthropic","various researchers"]},{"id":"2026-11-11-hyperelliptic-schottky-problem-huang-jiang-ai","url":"https://postcutoff.com/e/2026-11-11-hyperelliptic-schottky-problem-huang-jiang-ai/","date":"2026-11-11","date_precision":"day","short_title":"Hyperelliptic Schottky problem solved; AI suggested the final step","deck":null,"takeaway":"Which abelian varieties are Jacobians of hyperelliptic curves? Huang and Jiang say: exactly those whose theta divisor has singular locus of codimension three. Their acknowledgement says AI tools suggested completing the proof of the main theorem with a known result and constructed the paper's sharpness example.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":1,"official":1,"filed":"2026-11-13","updated":"2026-11-13","orgs":["Fudan University","various researchers"]},{"id":"2026-11-11-band-matrix-que-critical-crossover-axiomprover-lean","url":"https://postcutoff.com/e/2026-11-11-band-matrix-que-critical-crossover-axiomprover-lean/","date":"2026-11-11","date_precision":"day","short_title":"Band-matrix QUE and critical crossover, 1.2M lines of Lean by AxiomProver","deck":null,"takeaway":"Random band matrices are the standard model for the Anderson localization transition. A Chicago–Axiom Math preprint proves delocalization (QUE) right down to W ≫ √N and the predicted critical law at W² ≍ N, and says AxiomProver formalized all of it in Lean, including the published results it relies on.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-11-13","updated":"2026-11-13","orgs":["Axiom Math","University of Chicago"]},{"id":"2026-11-05-z-diophantine-in-q-glazer-burungale","url":"https://postcutoff.com/e/2026-11-05-z-diophantine-in-q-glazer-burungale/","date":"2026-11-05","date_precision":"day","short_title":"ℤ is Diophantine in ℚ: Glazer (Astra, Claude) and Burungale claim Mazur's conjecture fails","deck":null,"takeaway":"OpenAI's October preprint claimed Hilbert's tenth problem over ℚ is undecidable without defining ℤ in ℚ. A month later two independent manuscripts claim the stronger statement: one polynomial equation picks out exactly the integers among the rationals. Glazer's was produced with Astra 6, Sol 6.1 and Opus 5.5; Burungale says ChatGPT assisted two sections. Neither is refereed.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":7,"official":4,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","Anthropic","Principia Labs","University of Texas at Austin"]},{"id":"2026-09-21-grad-conjecture-counterexamples","url":"https://postcutoff.com/e/2026-09-21-grad-conjecture-counterexamples/","date":"2026-09-21","date_precision":"day","short_title":"Grad's 1967 conjecture on 3D plasma equilibria falls","deck":"Two AI-assisted papers give three families of counterexamples","takeaway":"It removes a long-standing theoretical doubt about smooth non-symmetric equilibria, which is relevant to stellarator design and gives exact test cases for equilibrium codes.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":7,"official":5,"filed":"2026-09-30","updated":"2026-11-13","orgs":["University of Maryland","OpenAI","Anthropic"]}],"people":[{"id":"richard-borcherds","name":"Richard Borcherds","url":"https://postcutoff.com/person/richard-borcherds/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-13","type":"filed","text":"Created (science agent; PDFs of the cited arXiv papers and Hexagon provenance statements read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-13","run":null,"sources_read":"Science agent; PDFs of the cited arXiv papers and Hexagon provenance statements read","updated":"2026-11-13","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":197,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":136,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":227,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":166,"in_training_data":false}],"short_url":null}