{"version":1,"generated":"2026-11-20","license":"CC BY 4.0","fields":["id","title","claim","field","date","added","lab","model","verification","autonomy","tags","humans","year_posed","sources","registrations","url"],"total":280,"count":280,"offset":0,"entries":[{"id":"2026-11-20-riemann-hypothesis-lean","title":"Lean proof of the Riemann hypothesis and GRH for Dirichlet L-functions, released without a paper","claim":"Levent Alpöge, a mathematician at Anthropic, says he found with Claude a proof that every nontrivial zero of the Riemann zeta function, and of every Dirichlet L-function, has real part one half, and has released it only as a Lean formalization of about 17 million lines that he says he does not yet fully understand.","field":"mathematics","date":"2026-11-20","added":"2026-11-20","lab":"Anthropic","model":"Claude (Anthropic); version not stated, described by Terence Tao as an internal model","verification":"claimed","autonomy":"collaborative","tags":["riemann-hypothesis","riemann-zeta","l-functions","analytic-number-theory","number-theory","automorphic-forms","lean","argument"],"humans":["Levent Alpöge"],"year_posed":1859,"sources":[{"label":"leanprover-community/riemann-hypothesis: the Lean submission mirrored unmodified, with a Comparator setup","url":"https://github.com/leanprover-community/riemann-hypothesis","kind":"research"},{"label":"Levent Alpöge: note announcing the proof, with links to the Lean archive (PDF)","url":"https://alpo.ge/remark.pdf","kind":"announcement"},{"label":"Andrew Sutherland (MIT): verification files and kernel results for the Lean proof","url":"https://math.mit.edu/~drew/grh/","kind":"commentary"},{"label":"leanprover-community: verification notes on the submission's size, statements, metaprogramming and checkers","url":"https://github.com/leanprover-community/riemann-hypothesis/blob/main/verification/NOTES.md","kind":"commentary"},{"label":"Terence Tao: Unforced Euler singularity, unforced Navier-Stokes singularity, and the Generalized Riemann Hypothesis","url":"https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singularity-and-the-generalized-riemann-hypothesis/","kind":"commentary"},{"label":"Scientific American: The AI Riemann hypothesis proof is almost certainly true, independent mathematicians attest","url":"https://www.scientificamerican.com/article/the-ai-riemann-hypothesis-proof-is-almost-certainly-true-independent-mathematicians-attest/","kind":"coverage"},{"label":"Scientific American: Anthropic mathematician claims to prove Riemann hypothesis, most famous problem in all of math","url":"https://www.scientificamerican.com/article/anthropic-mathematician-claims-to-prove-riemann-hypothesis-most-famous-problem-in-all-of-math/","kind":"coverage"},{"label":"Phys.org: Anthropic researcher says he and Claude proved the Riemann hypothesis, first posed in 1859 (AFP)","url":"https://phys.org/news/2026-11-anthropic-claude-math-greatest-riddle.html","kind":"coverage"},{"label":"SiliconANGLE: Anthropic researcher claims to have proven Riemann hypothesis using Claude","url":"https://siliconangle.com/2026/11/20/anthropic-researcher-claims-to-have-proven-riemann-hypothesis-using-claude/","kind":"coverage"}],"registrations":[{"registry":"mathdb","id":"315854","title":"Riemann hypothesis","url":"https://mathdb.com/p/315854/riemann-hypothesis","note":"Marked claimed solved, unverified, on 20 November 2026."}],"url":"https://whataifound.org/finding/2026-11-20-riemann-hypothesis-lean"},{"id":"2026-11-16-aristotle-manifest-rounding-bug","title":"Harmonic's Aristotle finds a rounding bug while formally verifying Manifest's Solana order book","claim":"Harmonic reports that its Aristotle system proved 28 properties of Manifest's open-source Rust order book on Solana and found two defects, including a rounding case in which a complete fill overshooting its target returned an arithmetic error; Manifest's fix, merged on 8 October 2026, cites the finding.","field":"computer-science","date":"2026-11-16","added":"2026-11-19","lab":"Harmonic","model":"Aristotle","verification":"claimed","autonomy":"ai-assisted","tags":["formal-verification","smart-contracts","rust","software-bugs"],"sources":[{"label":"GitHub: Bonasa-Tech/manifest pull request 751, the rounding fix","url":"https://github.com/Bonasa-Tech/manifest/pull/751","kind":"research"},{"label":"Harmonic: How Manifest went beyond no loss of funds with Aristotle","url":"https://www.harmonic.fun/aristotle/case-studies/manifest/","kind":"announcement"},{"label":"Harmonic: Aristotle Expands Into Rust","url":"https://www.harmonic.fun/news/aristotle-rust-verification/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-16-aristotle-manifest-rounding-bug"},{"id":"2026-11-16-chest-radiograph-fracture-risk","title":"Deep learning on routine chest radiographs predicts major osteoporotic fractures better than FRAX","claim":"A convolutional survival model trained on 53,109 adults at a Korean tertiary hospital and validated on 85,284 patients from two other institutions predicted incident major osteoporotic fracture from routine chest radiographs with a C-index of 0.843, against 0.779 for FRAX with bone density.","field":"medicine","date":"2026-11-16","added":"2026-11-19","lab":"Seoul National University Hospital","model":"A convolutional neural network survival model; not named","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["osteoporosis","radiology","fracture-risk","retrospective","external-validation"],"humans":["Yisak Kim","Chang Min Park","Hanbin Ko","Dongheon Lee","Jin Hwan Kim","Sung Hye Kong"],"sources":[{"label":"NEJM AI: Opportunistic Risk Assessment of Major Osteoporotic Fractures from Routine Chest Radiographs Using Deep Learning","url":"https://doi.org/10.1056/aioa2600590","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-16-chest-radiograph-fracture-risk"},{"id":"2026-11-16-naslund-crossing-lower-bounds","title":"First lower bounds above n for Naslund's crossing problem, found and proved in Lean by an agent team","claim":"A multi-agent harness of Claude models run by Arth Singh proved in Lean, over every field, that the quantity P(n) in Naslund's crossing problem is at least 4n/3, then 15n/11 and 67n/49 for larger n, and that P(4) = 7, the first lower bounds above the trivial n, though all are linear and leave Naslund's superlinear question open.","field":"mathematics","date":"2026-11-16","added":"2026-11-16","lab":"AIM Intelligence","model":"Claude Fable 5.2 lead with Claude Opus 5.5 workers, in an in-house multi-agent harness","verification":"formal","autonomy":"ai-led","tags":["tensor-rank","combinatorics","lower-bounds","lean","argument"],"humans":["Arth Singh"],"year_posed":2017,"sources":[{"label":"GitHub: Arth-Singh/crossing-lower-bounds","url":"https://github.com/Arth-Singh/crossing-lower-bounds","kind":"research"},{"label":"Singh: Lower bounds for Naslund's crossing problem (PDF)","url":"https://github.com/Arth-Singh/crossing-lower-bounds/blob/main/paper/crossing-lower-bounds.pdf","kind":"research"},{"label":"arXiv: Naslund, stating the problem","url":"https://arxiv.org/abs/1701.04475","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-16-000011","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-16-000011&version=1","title":"Lower bounds for Naslund's crossing problem","repository":"Arth-Singh/crossing-lower-bounds","commit":"3d302668a9f3928021ea33a8ef53ca2ad63d37c7","theorems":["Crossing.four_thirds","Crossing.fifteen_elevenths","Crossing.sixtyseven_fortyninths","Crossing.add_three","Crossing.four_eq_seven","Crossing.five_ge_eight","Crossing.six_ge_nine"],"checked":"2026-11-16","note":"Trust level high. The repository reports that Palomar built the commit, ran Comparator and replayed the proofs, and that its automated review found no blocking problem."}],"url":"https://whataifound.org/finding/2026-11-16-naslund-crossing-lower-bounds"},{"id":"2026-11-15-pherc-211-first-letters","title":"First letters read in the Herculaneum scroll PHerc. 211","claim":"A Vesuvius Challenge contestant's 3D ink-detection model, trained only on other scrolls, revealed 11 readable Greek letters in a 4 cm strip of PHerc. 211, a carbonised bookroll in the National Library of Naples, which the challenge's papyrology team read as including \"and to the\" followed by the start of a word that may mean \"difference\".","field":"archaeology","date":"2026-11-15","added":"2026-11-16","lab":"Vesuvius Challenge","model":"Residual 3D U-Net ink model trained by the contestant, with a self-supervised 3D DINO model used to choose training scrolls","verification":"author-verified","autonomy":"ai-assisted","tags":["papyrology","virtual-unwrapping","ink-detection","ancient-texts","herculaneum"],"humans":["Priyank Aranke","Federica Nicolardi","Paul Henderson"],"sources":[{"label":"Vesuvius Challenge: First letters emerge from PHerc. 211","url":"https://scrollprize.substack.com/p/first-letters-emerge-from-pherc-211","kind":"announcement"},{"label":"GitHub: priyankaranke/vesuvius-studio-multiscroll-cpt, the ink model","url":"https://github.com/priyankaranke/vesuvius-studio-multiscroll-cpt","kind":"research"},{"label":"GitHub: priyankaranke/vc3d-manual, the segmentation tooling","url":"https://github.com/priyankaranke/vc3d-manual","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-15-pherc-211-first-letters"},{"id":"2026-11-15-sharp-logarithmic-kakeya","title":"Sharp logarithmic Kakeya maximal and tube bounds in every dimension, registered as a Lean proof","claim":"Mark Lewko, with ChatGPT and Codex doing the mathematical development and Lean implementation, registered on Palomar a Lean proof that the Kakeya maximal operator is bounded from \\(L^n(\\mathbb{R}^n)\\) to \\(L^n(S^{n-1})\\) with norm at most \\(C_n[\\log(2/\\delta)]^{(n-1)/n}\\) in every dimension \\(n \\ge 2\\), a logarithmic power the accompanying notes argue is optimal.","field":"mathematics","date":"2026-11-15","added":"2026-11-19","lab":"Independent","model":"OpenAI ChatGPT and Codex; versions not stated","verification":"claimed","autonomy":"ai-assisted","tags":["harmonic-analysis","kakeya","maximal-functions","lean","argument"],"humans":["Mark Lewko"],"sources":[{"label":"GitHub: mrklwk/kakeya-sharp, the Lean proof and notes","url":"https://github.com/mrklwk/kakeya-sharp","kind":"research"},{"label":"arXiv: Fernández-Delgado and de la Salle, A construction of Kakeya sets in arbitrary dimension","url":"https://arxiv.org/abs/2607.14824","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-15-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-15-000001&version=1","title":"Sharp logarithmic Kakeya estimates in every dimension","repository":"mrklwk/kakeya-sharp","commit":"0ffa953d9275d86b1caef5763464b067f994064f","theorems":["KakeyaPalomar.sharpMaximalBound","KakeyaPalomar.sharpTubeBound"],"checked":"2026-11-19","note":"Trust level high; checked by the nanoda and con-ron kernels. Only the two upper estimates are Lean theorems; the geometric consequences and sharpness arguments are not formalized."}],"url":"https://whataifound.org/finding/2026-11-15-sharp-logarithmic-kakeya"},{"id":"2026-11-14-cage-8-7-768-vertices","title":"An 8-regular graph of girth 7 on 768 vertices, below the previous record of 774","claim":"Claude agents working for Quantavane under Arhan Canli constructed an 8-regular graph of girth 7 on 768 vertices, verified in Lean by kernel computation and registered on Palomar, improving the best known upper bound on the order of an (8,7)-cage from the 774 listed in the House of Graphs table.","field":"mathematics","date":"2026-11-14","added":"2026-11-16","lab":"Quantavane","model":"Claude (Anthropic) agents; version not stated","verification":"formal","autonomy":"ai-led","tags":["graph-theory","cages","extremal-combinatorics","lean","construction"],"humans":["Arhan Canli"],"sources":[{"label":"GitHub: arhancanli/quantavane-cage-8-7","url":"https://github.com/arhancanli/quantavane-cage-8-7","kind":"research"},{"label":"arXiv: Exoo, Goedgebeur, Jooken, Stubbe and Van den Eede, New small regular graphs of given girth, the previous record of 774","url":"https://arxiv.org/abs/2511.07247","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-14-000013","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-14-000013&version=1","title":"An 8-regular graph of girth 7 on 768 vertices","repository":"arhancanli/quantavane-cage-8-7","commit":"593719d9713eaf81f23e2364e973824ac208bbc4","theorems":["Cage87.exists_regular_girth_seven"],"checked":"2026-11-16","note":"Trust level high. The statement uses only Mathlib's SimpleGraph, IsRegularOfDegree and girth, so there are no project definitions to audit."}],"url":"https://whataifound.org/finding/2026-11-14-cage-8-7-768-vertices"},{"id":"2026-11-13-chabauty-kim-dimension-inequality","title":"Kim's dimension inequality for curves over Q with a rational point, via noncommutative Iwasawa theory","claim":"Sa'ar Zehavi proves Kim's conjectured dimension inequality for every smooth projective curve of genus at least two over \\(\\mathbb{Q}\\) with a rational basepoint, at every odd prime of good reduction and all sufficiently large levels, so the Chabauty–Kim method works unconditionally for such curves; the key nontrivial bound was developed in a lengthy back-and-forth with GPT-6 Astra.","field":"mathematics","date":"2026-11-13","added":"2026-11-19","lab":"Independent (Max Planck Institute for Mathematics)","model":"GPT-6 Astra (OpenAI), Ultra mode","verification":"claimed","autonomy":"collaborative","tags":["number-theory","rational-points","chabauty-kim","iwasawa-theory","argument"],"humans":["Sa'ar Zehavi"],"year_posed":2009,"sources":[{"label":"arXiv: Zehavi, The Chabauty–Kim dimension inequality via noncommutative Iwasawa theory","url":"https://arxiv.org/abs/2611.18218","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"chabauty-kim-dimension-inequality-for-projective-curves-over-mathbb-q","url":"https://vibemathed.com/problem/chabauty-kim-dimension-inequality-for-projective-curves-over-mathbb-q"}],"url":"https://whataifound.org/finding/2026-11-13-chabauty-kim-dimension-inequality"},{"id":"2026-11-13-green-problem-64","title":"Green's Problem 64 proved in Lean: infinitely many primes p for which p-2 has an odd number of prime factors","claim":"GPT-6 Astra, in a repository run by Igor Inozemtsev, produced an 83-page proof and a Lean formalization, registered on Palomar, that infinitely many primes p have p-2 with an odd number of prime factors counted with multiplicity, Problem 64 on Ben Green's list of open problems, drawing on an October 2026 manuscript by Jizhou Guo that the agent consulted.","field":"mathematics","date":"2026-11-13","added":"2026-11-16","lab":"Independent","model":"GPT-6 Astra (OpenAI)","verification":"formal","autonomy":"ai-led","tags":["number-theory","sieve-theory","primes","lean","argument"],"humans":["Igor Inozemtsev"],"sources":[{"label":"GitHub: inozemtsev/formal-math, proofs/green64","url":"https://github.com/inozemtsev/formal-math/tree/main/proofs/green64","kind":"research"},{"label":"Green's Problem 64: full proof (PDF)","url":"https://github.com/inozemtsev/formal-math/blob/main/proofs/green64/paper/green64.pdf","kind":"research"},{"label":"Formal Conjectures: Green64.green_64, the statement as an open problem","url":"https://github.com/google-deepmind/formal-conjectures/blob/a425ca3eb797fe927cb88c950565fdcbbbbada70/FormalConjectures/GreensOpenProblems/64.lean","kind":"research"},{"label":"Ben Green: 100 open problems, Problem 64","url":"https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-13-000010","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-13-000010&version=3","title":"Primes p for which Omega(p - 2) is odd (Green's Problem 64)","repository":"inozemtsev/formal-math","commit":"43f0988e15c2e1b9fb28b931e6fbb0cf9f7a70cc","theorems":["Green64.green_64"],"checked":"2026-11-16","note":"Trust level high. Version 3 of the record, with Green64.green_64 as the sole principal result; the project sits under proofs/green64."}],"url":"https://whataifound.org/finding/2026-11-13-green-problem-64"},{"id":"2026-11-12-langlands-split-groups-function-fields","title":"Automorphic realization of Langlands parameters for split groups over function fields, Part I","claim":"A single-author Hexagon preprint, whose mathematical arguments its provenance statement says were developed with GPT-6 Astra Pro, claims the converse to V. Lafforgue's decomposition: every semisimple elliptic Langlands parameter of a split reductive group over a global function field is the parameter of a cusp form, with this part's theorems resting on existence results deposited separately as Parts II and III.","field":"mathematics","date":"2026-11-12","added":"2026-11-19","lab":"Independent","model":"GPT-6 Astra Pro (mathematical arguments) and Claude Fable 5.2 (organizing and rewriting), per the provenance statement; the record's tools field lists GPT-6 Pro","verification":"claimed","autonomy":"ai-led","tags":["langlands-program","function-fields","automorphic-forms","argument"],"humans":["Boyang Hu"],"sources":[{"label":"Hexagon 2611.00398: Automorphic realization of Langlands parameters for split groups over global function fields, I","url":"https://hexagonmath.org/2611.00398v1","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"automorphic-realization-for-global-langlands-parameters","url":"https://vibemathed.com/problem/automorphic-realization-for-global-langlands-parameters"}],"url":"https://whataifound.org/finding/2026-11-12-langlands-split-groups-function-fields"},{"id":"2026-11-12-nonlocal-coercivity-conjecture","title":"The coercivity conjecture for nonlocal energies fails whenever n > 2s, and holds in restricted classes","claim":"Six authors including Xavier Ros-Oton show that uniform ellipticity does not imply \\(H^s\\)-coercivity for symmetric nonlocal kernels of order \\(2s\\) whenever \\(n > 2s\\), while it does hold for \\(n = 1\\) and \\(s > 1/2\\) and for kernels with annular cancellation, after sustained interactions with ChatGPT versions 5.5, 5.6 and 6.","field":"mathematics","date":"2026-11-12","added":"2026-11-19","lab":"Independent","model":"ChatGPT versions 5.5, 5.6 and 6","verification":"claimed","autonomy":"ai-assisted","tags":["nonlocal-pde","boltzmann-equation","coercivity","construction"],"humans":["Linus Behn","Roberto Colombo","Xavier Fernández-Real","Florian Grube","Harsh Prasad","Xavier Ros-Oton"],"sources":[{"label":"arXiv: Behn, Colombo, Fernández-Real, Grube, Prasad and Ros-Oton, The coercivity conjecture for nonlocal energies","url":"https://arxiv.org/abs/2611.16682","kind":"research"},{"label":"arXiv: Biswas, Coercivity and regularity for nonlocal divergence-form operators with measurable kernels","url":"https://arxiv.org/abs/2610.06408","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"the-coercivity-conjecture-for-nonlocal-energies","url":"https://vibemathed.com/problem/the-coercivity-conjecture-for-nonlocal-energies"}],"url":"https://whataifound.org/finding/2026-11-12-nonlocal-coercivity-conjecture"},{"id":"2026-11-12-spot-tb-ai-case-finding-rct","title":"Stepped-wedge randomised trial of AI-guided site selection for tuberculosis case-finding in Pakistan (SPOT-TB)","claim":"Across 3,936 screening camps and 269,254 people in all four provinces of Pakistan, mobile x-ray teams switched in random order from conventional site selection to locations recommended by the MATCH-AI software; tuberculosis yield per camp was 7% higher but not significantly so in the intention-to-treat analysis (adjusted risk ratio 1.07, 95% CI 0.94-1.22), and 32% higher in a per-protocol analysis of camps held within 5 km of a recommended site.","field":"medicine","date":"2026-11-12","added":"2026-11-16","lab":"Centre for Global Public Health, Pakistan","model":"MATCH-AI (Mapping and Analysis for Tailored disease Control and Health system strengthening) geographic targeting software","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["tuberculosis","case-finding","global-health","geospatial","rct","prospective","real-world-data"],"humans":["Amna Mahfooz","Faran Emmanuel"],"sources":[{"label":"Lancet Global Health: Geographical targeting of active case-finding for tuberculosis in Pakistan using AI software (SPOT-TB)","url":"https://doi.org/10.1016/j.langlo.2026.104090","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06017843","url":"https://clinicaltrials.gov/study/NCT06017843"}],"url":"https://whataifound.org/finding/2026-11-12-spot-tb-ai-case-finding-rct"},{"id":"2026-11-11-talagrand-ultimate-matching","title":"Talagrand's Ultimate Matching Conjecture proved for finite critical exponents and refuted at the endpoints","claim":"Three probabilists posted a 70-page proof, largely generated and proof-checked by language models, that random points in the unit square can be matched with simultaneous exponential tail bounds in both coordinates for every pair of finite critical exponents, settling Talagrand's Ultimate Matching Conjecture in that range, and showing that it fails at the two endpoint cases.","field":"mathematics","date":"2026-11-11","added":"2026-11-16","lab":"Independent (CNRS and Université Gustave Eiffel; University of Pisa)","model":"GPT-6 (OpenAI) and Claude Fable (Anthropic); versions not stated","verification":"claimed","autonomy":"collaborative","tags":["probability","random-matching","optimal-transport","argument"],"humans":["Michael Goldman","Francesco Grotto","Dario Trevisan"],"year_posed":2021,"sources":[{"label":"Hexagon 2611.00294: The Ultimate Matching Theorem","url":"https://hexagonmath.org/2611.00294v1","kind":"research"},{"label":"GitHub: grottofrancesco/UltimateMatchingTheorem, including the earlier monolithic versions","url":"https://github.com/grottofrancesco/UltimateMatchingTheorem","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"talagrand-s-ultimate-matching-conjecture","url":"https://vibemathed.com/problem/talagrand-s-ultimate-matching-conjecture","note":"Labels its own verification unreviewed."}],"url":"https://whataifound.org/finding/2026-11-11-talagrand-ultimate-matching"},{"id":"2026-11-10-alphaproof-code-libsignal","title":"Lean proofs of security properties for the compiled machine code of libsignal","claim":"Google DeepMind's AlphaProof Code, a framework in which humans vet Lean specifications and Gemini-powered agents write the proofs, produced about 6.5 million lines of Lean establishing forward secrecy, authentication, post-compromise security and handshake secrecy for Signal's PQXDH handshake and Triple Ratchet as compiled to AArch64 machine code from unmodified libsignal, along with machine-checked disproofs for two previously fixed bugs reintroduced into the code.","field":"computer-science","date":"2026-11-10","added":"2026-11-12","lab":"Google DeepMind","model":"AlphaProof Code agents powered by Gemini Carbon","verification":"claimed","autonomy":"ai-led","tags":["argument","formal-verification","cryptography","lean","software-security"],"humans":["Swarat Chaudhuri","Andrew Ferraiuolo","Anton Kovsharov","Tej Chajed","Sam Schlesinger","Karn Seth","Jonathan Katz","Charles Sutton","Pushmeet Kohli"],"sources":[{"label":"AlphaProof Code: Verifying Signal's security at the machine-code level (technical paper)","url":"https://google-deepmind.github.io/code-verification","kind":"research"},{"label":"GitHub: google-deepmind/code-verification (Lean development)","url":"https://github.com/google-deepmind/code-verification","kind":"research"},{"label":"Google DeepMind: Introducing AlphaProof Code","url":"https://deepmind.google/blog/introducing-alphaproof-code/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-10-alphaproof-code-libsignal"},{"id":"2026-11-10-castro-silva-triangles-plane","title":"Large triangles in planar sets of positive upper density, resolving Castro-Silva's conjecture, with a Lean proof","claim":"Polona Durcik directed GPT-6 Astra Pro to a proof, formalized in Lean by Claude Opus 5.5 and registered on Palomar, that every measurable planar set of positive upper Banach density contains a rotated and translated copy of every sufficiently large dilate of any fixed non-degenerate triangle, which gives the planar conjecture of Davi Castro-Silva.","field":"mathematics","date":"2026-11-10","added":"2026-11-16","lab":"Independent","model":"GPT-6 Astra Pro via Codex (proof and manuscript); Claude Opus 5.5 at medium effort (Lean formalization)","verification":"formal","autonomy":"ai-led","tags":["harmonic-analysis","euclidean-ramsey-theory","geometric-measure-theory","lean","argument"],"humans":["Polona Durcik"],"year_posed":2021,"sources":[{"label":"Hexagon 2611.00302: Triangles in sets of positive upper density in the plane","url":"https://hexagonmath.org/2611.00302v1","kind":"research"},{"label":"GitHub: durcikp/lean-trianglesinplane, the Lean formalization","url":"https://github.com/durcikp/lean-trianglesinplane","kind":"research"},{"label":"arXiv: Castro-Silva, Geometrical sets with forbidden configurations, stating the conjecture","url":"https://arxiv.org/abs/2102.10018","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-10-000004","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-10-000004&version=1","title":"Triangles in sets of positive upper density in the plane","repository":"durcikp/lean-trianglesinplane","commit":"3fb29cdc7ad97a2ef235503309b6ba994518ad64","theorems":["Auto.triangles_in_the_plane"],"checked":"2026-11-16","note":"Trust level high."},{"registry":"vibemathed","id":"the-positive-density-configuration-problem","url":"https://vibemathed.com/problem/the-positive-density-configuration-problem","note":"Labels it Lean-checked with the statement unaudited, and records reading Castro-Silva's Conjecture 1 in arXiv 2102.10018 against the Lean headline statement."}],"url":"https://whataifound.org/finding/2026-11-10-castro-silva-triangles-plane"},{"id":"2026-11-10-explicit-rip-two-thirds","title":"Explicit restricted isometries with k = m^(2/3 − o(1)), first proved in one shot by GPT-6 Astra","claim":"Kümmerle and Mixon construct explicit real restricted isometry matrices whose sparsity level reaches \\(k = m^{2/3 - o(1)}\\), past the square-root barrier that conventional wisdom attached to proofs of this kind, on a problem Tao posed in 2007; their declaration says the main theorem was proved in one shot using GPT-6 Astra.","field":"mathematics","date":"2026-11-10","added":"2026-11-19","lab":"Independent","model":"GPT-6 Astra (main theorem); ChatGPT and Claude Opus 5.5 (exploration, drafting and feedback); an Opus 5.5 orchestrator with GPT-6.1 Sol and GPT-6 Astra subagents (Lean)","verification":"claimed","autonomy":"ai-led","tags":["compressed-sensing","restricted-isometry","strongly-regular-graphs","construction"],"humans":["Christian Kümmerle","Dustin G. Mixon"],"year_posed":2007,"sources":[{"label":"arXiv: Kümmerle and Mixon, Explicit restricted isometries with k = m^(2/3 − o(1))","url":"https://arxiv.org/abs/2611.14475","kind":"research"},{"label":"GitHub: ckuemmerle/ExplicitRIPTwoThirds, the Lean formalization","url":"https://github.com/ckuemmerle/ExplicitRIPTwoThirds","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"optimal-explicit-restricted-isometry","url":"https://vibemathed.com/problem/optimal-explicit-restricted-isometry"}],"url":"https://whataifound.org/finding/2026-11-10-explicit-rip-two-thirds"},{"id":"2026-11-10-ideal-generation-reduced-points","title":"The Ideal Generation Conjecture for general reduced points in projective space, characteristic zero","claim":"A Hexagon preprint described as 'a guided exploration by Open AI Astra agents' proves that for general reduced points in projective space over an algebraically closed field of characteristic zero, multiplication by linear forms from the initial degree \\(D\\) of their ideal to degree \\(D+1\\) has maximal rank, and its main theorem is registered on Palomar as a Lean proof.","field":"mathematics","date":"2026-11-10","added":"2026-11-19","lab":"Independent","model":"OpenAI Astra agents; version not stated","verification":"claimed","autonomy":"collaborative","tags":["algebraic-geometry","commutative-algebra","points-in-projective-space","lean","argument"],"humans":["Vlado Vojdanovski"],"sources":[{"label":"Hexagon 2611.00274: Ideal generation for general reduced projective points","url":"https://hexagonmath.org/2611.00274v1","kind":"research"},{"label":"GitHub: Vlado-V/ideal-generation-projective-points, the Lean proof","url":"https://github.com/Vlado-V/ideal-generation-projective-points","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-10-000007","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-10-000007&version=1","title":"Ideal generation for general reduced projective points","repository":"Vlado-V/ideal-generation-projective-points","commit":"9782452b468ef34b82717cbb3fb729a19b29646d","theorems":["IdealGenerationPaper.main_result"],"checked":"2026-11-19","note":"Trust level high; checked by the nanoda kernel. Generality is expressed in the standard affine chart of projective space."},{"registry":"vibemathed","id":"the-ideal-generation-conjecture-for-general-reduced-projective-points","url":"https://vibemathed.com/problem/the-ideal-generation-conjecture-for-general-reduced-projective-points"}],"url":"https://whataifound.org/finding/2026-11-10-ideal-generation-reduced-points"},{"id":"2026-11-10-lrx-diameter-symmetric-group","title":"Exact diameter of the symmetric group with LRX generators, n(n−1)/2 for every n ≥ 4","claim":"Seven authors report that their agentic system, mainly GPT-6 Astra, proved the undirected Cayley graph of \\(S_n\\) generated by the cyclic shift, its inverse and the transposition of the first two positions has diameter \\(n(n-1)/2\\) for every \\(n \\ge 4\\), with a finite set of special cases checked by C++ code and the result registered on Palomar as a Lean proof.","field":"mathematics","date":"2026-11-10","added":"2026-11-19","lab":"Independent","model":"GPT-6 Astra (agentic system and Codex); Claude Opus 5.5 (minor checks and editing)","verification":"claimed","autonomy":"ai-led","tags":["combinatorics","cayley-graphs","symmetric-group","lean","argument"],"humans":["Sergei Uskov","Alexander Chervov","Fedor Levkovich-Maslyuk","Ivan Litvak","Andrei Smolensky","Alexander Soibelman","Dia Taha"],"sources":[{"label":"Hexagon 2611.00333: The exact diameter of the symmetric group with LRX generators","url":"https://hexagonmath.org/2611.00333v1","kind":"research"},{"label":"GitHub: snow-ghost/lrx-lean, the Lean proof","url":"https://github.com/snow-ghost/lrx-lean","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-10-000010","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-10-000010&version=1","title":"Exact LRX diameter of the symmetric group","repository":"snow-ghost/lrx-lean","commit":"9cffbfbab7e1d6f5be1012c3caf608478f5af5b6","theorems":["PalomarLRX.exactDiameter","PalomarLRX.boundedRouting"],"checked":"2026-11-19","note":"Trust level high; checked by the nanoda kernel."},{"registry":"vibemathed","id":"diameter-of-the-symmetric-group-s-n-with-lrx-generators","url":"https://vibemathed.com/problem/diameter-of-the-symmetric-group-s-n-with-lrx-generators"}],"url":"https://whataifound.org/finding/2026-11-10-lrx-diameter-symmetric-group"},{"id":"2026-11-10-smale-mean-value-constant-four","title":"Smale's mean value constant shown to equal 4, with a Lean proof","claim":"Dave Goel, steering Claude and ChatGPT in alternation, proved that the supremum over all degrees of Smale's mean value constant is exactly 4, Smale's own 1981 bound, approached as the degree grows but never attained, so no smaller constant works for every degree; the main theorem is registered on Palomar as a Lean proof.","field":"mathematics","date":"2026-11-10","added":"2026-11-16","lab":"Independent","model":"Claude (Anthropic) and ChatGPT (OpenAI), alternated; versions not stated","verification":"formal","autonomy":"collaborative","tags":["complex-analysis","polynomials","smale-problems","lean","construction"],"humans":["Dave Goel"],"year_posed":1981,"sources":[{"label":"arXiv: Goel, Smale's mean value constant (1981) equals 4","url":"https://arxiv.org/abs/2611.17373","kind":"research"},{"label":"Hexagon 2611.00282: Smale's mean value constant (1981) equals 4","url":"https://hexagonmath.org/2611.00282","kind":"research"},{"label":"GitHub: david44hello/paper_smale-mean-value-constant-equals-4, the Lean proof","url":"https://github.com/david44hello/paper_smale-mean-value-constant-equals-4","kind":"research"},{"label":"arXiv: Jatar and Ng, Smale's mean value constant and admissible univalent Blaschke pairs","url":"https://arxiv.org/abs/2610.21472","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-12-000015","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-12-000015&version=1","title":"Smale's mean value constant equals 4","repository":"david44hello/paper_smale-mean-value-constant-equals-4","commit":"72511404d60696455d07604a6f6cb2e97aad44b4","theorems":["Smale.P030.Rows.thm_1_1","Smale.P030.kstar_eq_four","Smale.P030.tendsto_Kd_four"],"checked":"2026-11-16","note":"Trust level high. The record states the result as answering Smale's question in the negative rather than proving his conjecture."},{"registry":"vibemathed","id":"smale-s-mean-value-constant","url":"https://vibemathed.com/problem/smale-s-mean-value-constant","note":"Labels it Lean-checked with the statement unaudited, and records reading the headline definitions line by line without rebuilding the proof."}],"url":"https://whataifound.org/finding/2026-11-10-smale-mean-value-constant-four"},{"id":"2026-11-09-claude-designed-electronics","title":"Three prototype electronic devices designed by Claude Fable 5.2 and built by Diode Computers","claim":"From short prompts, Claude Fable 5.2 wrote the specifications, schematics, four-layer circuit board layouts, enclosures, firmware and parts lists for a USB speakerphone, a voice-assistant hub and a handheld virtual pet; Diode Computers, which has a disclosed commercial relationship with Anthropic, built all three from Claude's design files without changes to the circuitry, and all three still worked after weeks of use.","field":"engineering","date":"2026-11-09","added":"2026-11-12","lab":"Anthropic / Diode Computers","model":"Claude Fable 5.2","verification":"claimed","autonomy":"ai-led","tags":["construction","pcb-design","hardware","capability-demonstration"],"humans":["Mike Cretella","Connor Jennings","Brent Yi","Craig Chen"],"sources":[{"label":"Anthropic: Claude can design electronic prototypes from start to finish","url":"https://www.anthropic.com/research/claude-electronics-design","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-09-claude-designed-electronics"},{"id":"2026-11-09-polyanalytic-zeros-linear-bound","title":"A linear bound on zeros of polyanalytic polynomials, via a topological approach suggested by GPT-6.1","claim":"Lundberg, Rosen and Zhang prove that a complex polynomial of degree \\(n\\) in \\(z\\) and \\(m < n\\) in \\(\\bar z\\) with finitely many zeros has at most \\((4m+1)n - 5m\\) of them, answering Eremenko's question of whether the count is linear in \\(n\\) for fixed \\(m\\), using an approach through the Kronheimer–Mrowka theorem that GPT-6.1 suggested.","field":"mathematics","date":"2026-11-09","added":"2026-11-19","lab":"Independent","model":"GPT-6.1","verification":"claimed","autonomy":"collaborative","tags":["complex-analysis","polynomials","zero-counting","argument"],"humans":["Erik Lundberg","Zvi Rosen","Teng Zhang"],"sources":[{"label":"arXiv: Lundberg, Rosen and Zhang, On the number of zeros of polyanalytic polynomials","url":"https://arxiv.org/abs/2611.13278","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"number-of-zeros-of-polyanalytic-polynomials","url":"https://vibemathed.com/problem/number-of-zeros-of-polyanalytic-polynomials"}],"url":"https://whataifound.org/finding/2026-11-09-polyanalytic-zeros-linear-bound"},{"id":"2026-11-09-supercritical-ten-martini","title":"The supercritical Ten Martini Problem, with an LLM used for the renormalization and KAM steps","claim":"Ge, Jitomirskaya and You prove Cantor spectrum on the positive-Lyapunov part of the spectrum of every nonconstant real analytic one-frequency Schrödinger operator, settling a 2024 conjecture of You; their appendix says they conceived the whole strategy without AI and then used an LLM to help carry out the renormalization and local KAM steps.","field":"mathematics","date":"2026-11-09","added":"2026-11-19","lab":"Independent","model":"An unnamed LLM","verification":"claimed","autonomy":"ai-assisted","tags":["spectral-theory","schrodinger-operators","quasi-periodic","argument"],"humans":["Lingrui Ge","Svetlana Jitomirskaya","Jiangong You"],"year_posed":2024,"sources":[{"label":"arXiv: Ge, Jitomirskaya and You, The Supercritical Ten Martini Problem","url":"https://arxiv.org/abs/2611.13068","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"the-supercritical-ten-martini-problem","url":"https://vibemathed.com/problem/the-supercritical-ten-martini-problem"}],"url":"https://whataifound.org/finding/2026-11-09-supercritical-ten-martini"},{"id":"2026-11-08-lvov-kaplansky-large-matrices","title":"The L'vov–Kaplansky conjecture for matrices of sufficiently large order","claim":"A Hexagon preprint whose main results were developed over ten GPT-6-Pro research runs claims that for each degree, the image of a nonzero multilinear polynomial on \\(n \\times n\\) matrices over any field is the traceless matrices or the whole matrix algebra, as the L'vov–Kaplansky conjecture predicts, once \\(n\\) exceeds a threshold depending only on the degree.","field":"mathematics","date":"2026-11-08","added":"2026-11-19","lab":"Independent","model":"GPT-6-Pro (ten research runs, 62.5 scheduled hours) and Codex (proof audit and manuscript polish)","verification":"claimed","autonomy":"ai-led","tags":["ring-theory","polynomial-identities","matrix-algebras","argument"],"humans":["Qiyue Tang"],"sources":[{"label":"Hexagon 2611.00206: The L'vov–Kaplansky Conjecture for Matrices of Sufficiently Large Order","url":"https://hexagonmath.org/2611.00206v2","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"the-l-vov-kaplansky-conjecture","url":"https://vibemathed.com/problem/the-l-vov-kaplansky-conjecture"}],"url":"https://whataifound.org/finding/2026-11-08-lvov-kaplansky-large-matrices"},{"id":"2026-11-07-hawking-page-weak-coupling","title":"Hawking–Page transition at weak coupling in N=4 super Yang–Mills is first order, computed by Claude","claim":"An Anthropic preprint reports that a Claude research model computed the three-loop quartic coefficient \\(b = -1.48 \\times 10^{-3} \\lambda^2\\) in the Polyakov-loop effective action of \\(\\mathcal{N} = 4\\) super Yang–Mills on \\(S^3\\), settling a question set up in 2003: the weak-coupling deconfinement transition is first order, like the Hawking–Page transition it is dual to.","field":"physics","date":"2026-11-07","added":"2026-11-19","lab":"Anthropic","model":"An internal Claude research model; Anthropic's post presents the results under Claude Fable 5.2","verification":"claimed","autonomy":"ai-led","tags":["holography","black-holes","gauge-theory","computation"],"humans":["Hongbin Chen"],"year_posed":2003,"sources":[{"label":"Hexagon 2611.00175: The Hawking-Page transition at weak coupling","url":"https://hexagonmath.org/2611.00175v1","kind":"research"},{"label":"Anthropic: Claude solves two open problems in the physics of black holes","url":"https://www.anthropic.com/research/claude-black-hole-physics","kind":"announcement"},{"label":"arXiv: Aharony et al., The Hagedorn/deconfinement phase transition in weakly coupled large N gauge theories (2003)","url":"https://arxiv.org/abs/hep-th/0310285","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-07-hawking-page-weak-coupling"},{"id":"2026-11-07-latent-ai-ecg-af-rct","title":"Randomised trial of AI-ECG guided monitoring for undetected atrial fibrillation","claim":"In a single-centre trial in Taiwan, 14,665 adults without known atrial fibrillation were randomised to have their past year of sinus-rhythm ECGs analysed by an AI model, with the 1.1% it called high risk offered up to seven days of Holter monitoring, and the composite of newly detected atrial fibrillation, flutter or pre-atrial-fibrillation findings at 90 days was 0.74% against 0.48%, a result the authors describe as statistically fragile.","field":"medicine","date":"2026-11-07","added":"2026-11-09","lab":"National Defense Medical Center, Taiwan","model":"An institutional AI-ECG model scoring atrial electrical vulnerability from sinus-rhythm ECGs","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","ecg","atrial-fibrillation","screening","rct","prospective"],"humans":["Chin Lin","Chin-Chou Lee","Wen-Yu Lin"],"sources":[{"label":"Circulation: LATENT, a randomized controlled trial","url":"https://doi.org/10.1161/circulationaha.126.083540","kind":"research"},{"label":"Acta Cardiologica Sinica: LATENT study rationale and design","url":"https://doi.org/10.6515/acs.202609_42(5).20260124a","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06847932","url":"https://clinicaltrials.gov/study/NCT06847932","title":"Leveraging AI-ECG Technology for Early Notification and Tracking of AF Development"}],"url":"https://whataifound.org/finding/2026-11-07-latent-ai-ecg-af-rct"},{"id":"2026-11-07-spinless-modular-bootstrap-slope","title":"Exact large-c slope of the spinless modular bootstrap bound, found by Claude","claim":"An Anthropic preprint reports that a Claude research model found the exact optimal slope of the spinless modular bootstrap bound on the lightest primary in two-dimensional CFTs at large central charge, \\(\\Lambda_V = 12\\pi^2/(\\pi^2 + 4\\,\\mathrm{arcsinh}^2 1) \\approx 9.1266\\), where it had been known only to lie between 8.503 and 12.","field":"physics","date":"2026-11-07","added":"2026-11-19","lab":"Anthropic","model":"An internal Claude research model, later reproduced by Claude Opus 5.5; Anthropic's post presents the results under Claude Fable 5.2","verification":"claimed","autonomy":"ai-led","tags":["conformal-bootstrap","3d-gravity","black-holes","argument"],"humans":["Hongbin Chen"],"sources":[{"label":"Hexagon 2611.00174: The spinless modular bootstrap at large central charge","url":"https://hexagonmath.org/2611.00174v1","kind":"research"},{"label":"Anthropic: Claude solves two open problems in the physics of black holes","url":"https://www.anthropic.com/research/claude-black-hole-physics","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-07-spinless-modular-bootstrap-slope"},{"id":"2026-11-06-aaronson-ambainis-conjecture","title":"Lean-checked proof of the Aaronson-Ambainis conjecture on influential variables of bounded polynomials","claim":"A research system at Physical Superintelligence running a non-public Anthropic model produced a proof, checked in Lean by two independent kernels, that every low-degree polynomial bounded on the Boolean cube with non-trivial variance has a variable of polynomially large influence, the conjecture Aaronson and Ambainis showed implies that quantum query algorithms can be simulated classically on most inputs with polynomially more queries.","field":"computer-science","date":"2026-11-06","added":"2026-11-16","lab":"Physical Superintelligence (PSI)","model":"Non-public Anthropic model, run in a research harness built at PSI","verification":"formal","autonomy":"ai-led","tags":["quantum-query-complexity","boolean-functions","influence","lean","argument"],"humans":["David Turturean"],"year_posed":2009,"sources":[{"label":"GitHub: physical-superintelligence/aaronson-ambainis, the paper and Lean formalization","url":"https://github.com/physical-superintelligence/aaronson-ambainis","kind":"research"},{"label":"Turturean: A proof of the Aaronson-Ambainis conjecture (PDF)","url":"https://github.com/physical-superintelligence/aaronson-ambainis/blob/main/paper/aaronson_ambainis_paper.pdf","kind":"research"},{"label":"PSI: A proof of the Aaronson-Ambainis conjecture","url":"https://psi.inc/research/aaronson-ambainis/","kind":"announcement"},{"label":"arXiv: Blanc, Docter, Strassle and Tan, Proof of the Aaronson-Ambainis Conjecture: An Exposition","url":"https://arxiv.org/abs/2611.11626","kind":"commentary"},{"label":"arXiv: Huffstutler, Miloschewsky and Podder, A short proof of the Aaronson-Ambainis Conjecture via the completion framework","url":"https://arxiv.org/abs/2611.12795","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"the-aaronson-ambainis-conjecture","url":"https://vibemathed.com/problem/the-aaronson-ambainis-conjecture","note":"Labels it Lean-checked with the statement unaudited, while recording that its own check on 15 November 2026 read PrintedConjecture line by line against Conjecture 6 of arXiv:0911.0996v3 and found that it matches."}],"url":"https://whataifound.org/finding/2026-11-06-aaronson-ambainis-conjecture"},{"id":"2026-11-06-aura-ana-autoimmune-rct","title":"Randomised trial of a risk model triaging patients with a positive antinuclear antibody test","claim":"At one US academic health system, 2,385 people with a new positive antinuclear antibody test were randomised to a pathway in which an electronic health record risk model invited those it scored high risk to expedited rheumatology evaluation, and those in the intervention arm reached an autoimmune disease diagnosis faster, with a median of 43 days against 138.","field":"medicine","date":"2026-11-06","added":"2026-11-09","lab":"Vanderbilt University Medical Center","model":"An interpretable electronic health record risk model for systemic autoimmune disease, developed by the same group in 2024","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["rheumatology","autoimmune-disease","ehr","triage","rct","prospective","real-world-data"],"humans":["April Barnado","Ryan P. Moore","Daniel W. Byrne"],"sources":[{"label":"NEJM AI: Randomized Evaluation of an Autoimmune Disease Prediction Model, AURA","url":"https://doi.org/10.1056/AIoa2600112","kind":"research"},{"label":"Frontiers in Immunology: development and validation of the real-time risk model","url":"https://doi.org/10.3389/fimmu.2024.1384229","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-06-aura-ana-autoimmune-rct"},{"id":"2026-11-06-cable-knot-volume-conjecture","title":"Cable knot counterexamples to the full-sequence volume conjecture for all knots","claim":"Haibin Hang, with OpenAI Codex assisting, shows that for the (1,2)-cable of the connected sum of two figure-eight knots the growth rate of the colored Jones polynomial does not converge along all colors, so the volume conjecture's full-sequence limit fails for knots in general, extending parity effects Lê and Tran found for cables in 2009.","field":"mathematics","date":"2026-11-06","added":"2026-11-19","lab":"Independent","model":"OpenAI Codex; version not stated","verification":"claimed","autonomy":"ai-assisted","tags":["knot-theory","volume-conjecture","colored-jones-polynomial","construction"],"humans":["Haibin Hang"],"sources":[{"label":"arXiv: Hang, Cable Knot Counterexamples to the All-Knot Volume Conjecture","url":"https://arxiv.org/abs/2611.09063","kind":"research"},{"label":"arXiv: Lê and Tran, On the volume conjecture for cables of knots (2009)","url":"https://arxiv.org/abs/0907.0172","kind":"challenge"}],"registrations":[{"registry":"vibemathed","id":"the-all-knot-volume-conjecture","url":"https://vibemathed.com/problem/the-all-knot-volume-conjecture","note":"The listing's title frames the result as the volume conjecture for all knots; the paper is a disproof of its full-sequence form for one family."}],"url":"https://whataifound.org/finding/2026-11-06-cable-knot-volume-conjecture"},{"id":"2026-11-06-doppler-ai-feedback-rct","title":"Randomised trial of AI feedback on clinicians reading fetal Doppler ultrasound images","claim":"96 clinicians at five Danish hospitals were randomised to receive AI feedback or none while judging 40 standardised umbilical and middle cerebral artery Doppler vignettes each, and those given feedback were accurate on 75.0% of vignettes against 62.3% without it, a difference of 12.7 percentage points measured against expert consensus rather than patient outcomes.","field":"medicine","date":"2026-11-06","added":"2026-11-09","lab":"University of Copenhagen, Technical University of Denmark and Copenhagen Academy for Medical Education and Simulation","model":"An explainable AI system giving visual and textual feedback on Doppler gate placement, anatomical suitability, insonation angle and waveform quality (not named)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["obstetrics","ultrasound","doppler","clinician-performance","rct","prospective"],"humans":["Zahra Bashir","Aasa Feragen","Martin G. Tolsgaard"],"sources":[{"label":"AJOG MFM: AI feedback for clinician assessment of umbilical and middle cerebral artery Doppler ultrasound","url":"https://doi.org/10.1016/j.ajogmf.2026.102192","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-06-doppler-ai-feedback-rct"},{"id":"2026-11-06-gait-foundation-model-phenotypes","title":"Gait embeddings from a single depth camera predict health phenotypes across 18 body systems","claim":"A gait foundation model that turns three-dimensional skeletal motion, recorded by a single depth camera during five motor tasks, into learned embeddings predicted age (\\(r = 0.69\\)), body mass index (\\(r = 0.91\\)) and visceral fat area (\\(r = 0.83\\)) better than engineered gait features in 3,328 deeply phenotyped adults, significantly predicted 1,887 of 3,210 tested phenotypes, and improved on a baseline of age, body mass index, visceral fat and height in all 18 body systems in men and 17 of 18 in women, including clinical diagnoses and medication use.","field":"medicine","date":"2026-11-06","added":"2026-11-12","lab":"Weizmann Institute of Science","model":"Gait foundation model producing learned embeddings of 3D skeletal motion; architecture not named in the abstract","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["gait","digital-biomarker","foundation-model","phenome-wide"],"humans":["Adam Gabet","Sarah Kohn","Guy Lutsker","Adina Weinberger","Eran Segal"],"sources":[{"label":"Nature Medicine: A gait foundation model for prediction of multisystem health phenotypes from 3D skeletal motion","url":"https://doi.org/10.1038/s41591-026-04724-9","kind":"research"},{"label":"Nature Medicine research briefing: Deep learning-based gait analysis predicts multisystem health phenotypes","url":"https://doi.org/10.1038/s41591-026-04725-8","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-06-gait-foundation-model-phenotypes"},{"id":"2026-11-06-k-clique-hypothesis-refuted","title":"Refutation of the k-Clique hypothesis, independent of the matrix multiplication exponent","claim":"Two complexity theorists working back and forth with ChatGPT-6 published an algorithm that counts weighted k-cliques faster than the long-conjectured barrier for every large enough k, and faster even if matrix multiplication were optimal, with the paper crediting the decisive algebraic decomposition almost purely to the model.","field":"computer-science","date":"2026-11-06","added":"2026-11-09","lab":"Independent (MIT and Tel Aviv University)","model":"ChatGPT-6 (OpenAI), public web interface, no harness","verification":"author-verified","autonomy":"collaborative","tags":["algorithms","fine-grained-complexity","matrix-multiplication","argument"],"humans":["Virginia Vassilevska Williams","Or Zamir"],"sources":[{"label":"arXiv: The k-Clique hypothesis is dead, for good","url":"https://arxiv.org/abs/2611.09764","kind":"research"},{"label":"OpenAI: The Exponential Time Hypothesis is False","url":"https://github.com/openai/math/tree/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"the-k-clique-hypothesis","url":"https://vibemathed.com/problem/the-k-clique-hypothesis","note":"Records this paper as the refutation, labels its own verification unreviewed, and says its check on 15 November 2026 read the statement and Theorem 1.1 but not the proofs."}],"url":"https://whataifound.org/finding/2026-11-06-k-clique-hypothesis-refuted"},{"id":"2026-11-06-lean-verified-quantum-programs","title":"LLM agents write quantum programs checked against Lean specifications","claim":"Google DeepMind and Google Quantum AI report that teams of language model agents, searching against frozen Lean specifications that an external verifier re-checks, found quantum programs that cut published resource costs by up to 290 times for fixed-point arcsine and by factors of 11, 8 and 2.5 on simulations relevant to fusion, photochemistry and drug metabolism.","field":"computer-science","date":"2026-11-06","added":"2026-11-09","lab":"Google DeepMind / Google Quantum AI","model":"Not named: the paper says only that large language model agents synthesize the programs","verification":"claimed","autonomy":"search-scaffold","tags":["quantum-algorithms","formal-verification","lean","construction"],"humans":["Sergey Shirobokov","Ben Jaderberg","Katerina Hristova","George Tsoukalas","Nicholas C. Rubin","Guang Hao Low","Sergio Boixo","Swarat Chaudhuri","Ryan Babbush","Pushmeet Kohli"],"sources":[{"label":"arXiv: Discovering formally verified quantum programs with AI","url":"https://arxiv.org/abs/2611.09822","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-06-lean-verified-quantum-programs"},{"id":"2026-11-05-grassl-qubit-code-tables","title":"AI agent search raises 1,873 entries of the Grassl qubit code tables","claim":"A search written and run by AI agents under one physicist's direction produced 192 explicit quantum stabilizer codes whose minimum distance beats the best bound previously recorded for their parameters, raising 1,873 entries of the standard reference table, with every distance certified exactly and a checker published alongside.","field":"physics","date":"2026-11-05","added":"2026-11-09","lab":"Virginia Tech","model":"Not named: the paper and repository say only that AI agents wrote and ran the search","verification":"author-verified","autonomy":"collaborative","tags":["quantum-error-correction","coding-theory","computation"],"humans":["Marin Girard"],"sources":[{"label":"arXiv: Random encoders and expurgation improve 1,873 entries of the Grassl qubit code tables","url":"https://arxiv.org/abs/2611.08744","kind":"research"},{"label":"GitHub: MarinAndreGirard/qubit-stabilizer-codes-2026, codes, certificates and independent checker","url":"https://github.com/MarinAndreGirard/qubit-stabilizer-codes-2026","kind":"research"},{"label":"Grassl, Bounds on the minimum distance of linear codes and quantum codes","url":"http://www.codetables.de","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-05-grassl-qubit-code-tables"},{"id":"2026-11-05-openai-gpt6-cyber-vulnerabilities","title":"OpenAI reports 81 high-severity Firefox vulnerabilities and 948 Linux kernel privilege-escalation exploits found by its models","claim":"OpenAI announced that its restricted GPT-6 Cyber model found 81 previously unknown high-severity Firefox vulnerabilities, and that an automated pipeline found 2,308 candidate Linux kernel flaws, reproduced 1,724 and produced local privilege-escalation exploits for 948; Mozilla's advisories credit dozens of high-impact Firefox CVEs to OpenAI reporters, while no CVEs are public for the Linux results.","field":"computer-science","date":"2026-11-05","added":"2026-11-16","lab":"OpenAI","model":"GPT-6 Cyber, available only to approved customers, per coverage; OpenAI's own posts could not be read","verification":"claimed","autonomy":"search-scaffold","tags":["security","vulnerability-discovery","linux-kernel","firefox","exploits"],"sources":[{"label":"Mozilla Foundation Security Advisory 2026-125: security vulnerabilities fixed in Firefox 160","url":"https://www.mozilla.org/en-US/security/advisories/mfsa2026-125/","kind":"research"},{"label":"Mozilla Foundation Security Advisory 2026-120: security vulnerabilities fixed in Firefox ESR 153.6","url":"https://www.mozilla.org/en-US/security/advisories/mfsa2026-120/","kind":"research"},{"label":"OpenAI: A thousand fewer paths to root","url":"https://openai.com/index/a-thousand-fewer-paths-to-root/","kind":"announcement"},{"label":"BleepingComputer: OpenAI's new GPT-6 Cyber AI finds 81 Firefox flaws, 948 Linux bugs","url":"https://www.bleepingcomputer.com/news/security/openais-new-gpt-6-cyber-ai-finds-81-firefox-flaws-948-linux-bugs/","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-11-05-openai-gpt6-cyber-vulnerabilities"},{"id":"2026-11-05-smartwatch-hypertension-detection","title":"Hypertension detected from consumer smartwatch sensors without a cuff","claim":"A Google model reading photoplethysmography and accelerometer signals from a consumer smartwatch, with no cuff calibration, flagged hypertension in 196 prospectively enrolled participants with 65.8% sensitivity and 90.0% specificity against 24-hour ambulatory blood pressure monitoring, slightly ahead of initial office blood pressure screening at the same specificity.","field":"medicine","date":"2026-11-05","added":"2026-11-09","lab":"Google Research","model":"AI-PPG-ACC-HTN","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","hypertension","wearables","screening","prospective"],"humans":["Paolo Di Achille","Stephen P. Juraschek","Ming-Zher Poh"],"sources":[{"label":"Nature: Opportunistically detecting signs of hypertension on a consumer smartwatch","url":"https://doi.org/10.1038/s41586-026-11336-3","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-05-smartwatch-hypertension-detection"},{"id":"2026-11-05-xgb-ews-denmark","title":"Gradient-boosted early warning score tested for clinical net benefit across 2.08 million Danish hospital encounters","claim":"Across 2,080,765 encounters at 15 Danish hospitals, a gradient-boosted model using vital signs, laboratory values and text embeddings of medical history beat the National Early Warning Score for predicting death within 24 hours by 1.9 additional correct identifications per 10,000 patients overall, a gain that rose to 78.1 per 10,000 among patients the existing score already called high risk and fell to 0.9 per 10,000 among those it called low risk.","field":"medicine","date":"2026-11-05","added":"2026-11-09","lab":"University of Copenhagen and Capital and Zealand region hospitals","model":"XGB-EWS, an XGBoost model over vital signs, demographics, laboratory markers and sentence-transformer embeddings of medical history","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["early-warning","deterioration","mortality","retrospective","real-world-data"],"humans":["Alexandros Katsiferis","Nina Scheidwasser","Christian S. Meyhoff"],"sources":[{"label":"The Lancet Digital Health: development and validation of early warning scores predicting 24 h mortality in Denmark","url":"https://doi.org/10.1016/j.landig.2026.101067","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-05-xgb-ews-denmark"},{"id":"2026-11-04-diophantine-z-in-q","title":"Claimed Diophantine definition of ℤ in ℚ","claim":"Elliot Glazer, working with four frontier models, published an explicit integer-coefficient polynomial whose rational zeros project exactly onto the integers, which if correct would refute Mazur's conjecture on the topology of rational points and give a second route to the undecidability of Hilbert's tenth problem over the rationals.","field":"mathematics","date":"2026-11-04","added":"2026-11-09","lab":"Independent","model":"Astra 6, Sol 6.1 and Opus 5.5, with auditing from Fable 5.1","verification":"claimed","autonomy":"collaborative","tags":["number-theory","diophantine-equations","hilberts-tenth-problem","construction"],"humans":["Elliot Glazer","Sohail Farhangi","Gabriel Conant"],"sources":[{"label":"GitHub: elliotglazer/diophantine-z-q","url":"https://github.com/elliotglazer/diophantine-z-q","kind":"research"},{"label":"OpenAI: Hilbert's tenth problem over the rational numbers","url":"https://github.com/openai/math/blob/main/preprints/Hilberts-tenth-problem-over-the-rational-numbers-October-6-2026/main.pdf","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"mathbb-z-is-diophantine-in-mathbb-q","url":"https://vibemathed.com/problem/mathbb-z-is-diophantine-in-mathbb-q","note":"Records Version 17 of 13 November 2026, labels its own verification unreviewed, and notes that the main Lean target still contains sorry."}],"url":"https://whataifound.org/finding/2026-11-04-diophantine-z-in-q"},{"id":"2026-11-04-stacks-project-lean-axiom","title":"The Stacks Project formalized in Lean by directed AI agents","claim":"Axiom Math released a Lean formalization of the whole Stacks Project, the roughly 7,500-page reference work on algebraic geometry, at about 16 million lines with no sorry, and says its agents found dozens of statements in the original text needing repair, including a lemma on algebraization of coherent formal modules that the library marks as false as published.","field":"mathematics","date":"2026-11-04","added":"2026-11-09","lab":"Axiom Math","model":"AxiomProver agent swarms using an unnamed mix of models","verification":"claimed","autonomy":"collaborative","tags":["algebraic-geometry","lean","formalization","multi-agent"],"sources":[{"label":"GitHub: AxiomMath/Stacks","url":"https://github.com/AxiomMath/Stacks","kind":"research"},{"label":"The Stacks Project: tag 0EJA","url":"https://stacks.math.columbia.edu/tag/0EJA","kind":"research"},{"label":"Axiom Math: The Stacks Project, formalized in Lean","url":"https://axiommath.ai/research/the-stacks-project-formalized/","kind":"announcement"},{"label":"Axiom Math: Stacks Project in Lean project site","url":"https://stacks.axiommath.ai/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-11-04-stacks-project-lean-axiom"},{"id":"2026-11-03-cdk46-home-therapy-ai-rct","title":"Randomised trial of an AI management platform for breast cancer patients on home CDK4/6 inhibitor therapy","claim":"In a three-arm randomised trial across hospitals in Tianjin, 189 breast cancer patients taking CDK4/6 inhibitors at home were assigned to an AI management platform, a tailored active follow-up service by phone and text, or standard care; a preprint reports that both active arms kept anxiety and depression scores better than standard care, without reporting a comparison between the AI and the human follow-up.","field":"medicine","date":"2026-11-03","added":"2026-11-05","lab":"Tianjin Medical University Cancer Institute and Hospital","model":"Zhiliao Doctor AI management platform","verification":"claimed","autonomy":"ai-assisted","tags":["oncology","breast-cancer","remote-monitoring","patient-reported-outcomes","rct","prospective"],"humans":["Li Zhang"],"sources":[{"label":"Research Square: Impact of an AI management model on psychological and behavioral outcomes in breast cancer patients receiving home-based CDK4/6i therapy, a multicenter randomized controlled trial","url":"https://doi.org/10.21203/rs.3.rs-11115307/v1","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT07409298","url":"https://clinicaltrials.gov/study/NCT07409298","title":"Impact of an Artificial Intelligence-Based Management Model on Psychological and Behavioral Outcomes in Breast Cancer Patients Undergoing Home CDK4/6 Inhibitor Therapy"}],"url":"https://whataifound.org/finding/2026-11-03-cdk46-home-therapy-ai-rct"},{"id":"2026-11-03-kite-crm-cystic-renal-masses","title":"Randomised implementation study of CT-based AI risk support for cystic renal masses (KITE-CRM)","claim":"Among 5,869 adults randomised at one Shanghai hospital to AI-assisted or standard CT reporting, benign pathology was found in 16.4% of treated lesions with AI support against 40.3% with standard care, after the model reached external AUROCs of 0.913 to 0.999 at five hospitals and raised six radiologists' AUROC from 0.825 to 0.973 in a reader study; in the subgroup of cystic masses the tool is built for, the difference was not significant.","field":"medicine","date":"2026-11-03","added":"2026-11-16","lab":"Changhai Hospital, Naval Medical University","model":"KITE-CRM (Kidney Imaging-based Triage Engine for Cystic Renal Masses), a deep-learning model on corticomedullary-phase CT","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["urology","renal-cell-carcinoma","radiology","overtreatment","rct","prospective","external-validation","retrospective"],"humans":["Chengwei Chen","Yun Bian"],"sources":[{"label":"EClinicalMedicine: CT-based AI risk support for cystic renal masses, multicenter validation, reader study, and a randomized implementation study","url":"https://doi.org/10.1016/j.eclinm.2026.104279","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-03-kite-crm-cystic-renal-masses"},{"id":"2026-11-02-hopfield-free-energy","title":"Limit free energy of the Hopfield model identified at every temperature and loading ratio","claim":"Six mathematicians identified, by a Parisi-type variational formula, the limit of the free energy of the Hopfield associative-memory model with random Bernoulli patterns at every temperature and every ratio of patterns to neurons, after one of them obtained the existence of the limit with assistance from GPT 6 Astra.","field":"mathematics","date":"2026-11-02","added":"2026-11-16","lab":"Independent (Hebrew University, MIT, NYU Shanghai, Weizmann Institute, Sorbonne University, ENS Lyon)","model":"GPT 6 Astra (existence proof and writing) and Fable 5.1 (writing)","verification":"author-verified","autonomy":"ai-assisted","tags":["statistical-mechanics","spin-glasses","hopfield-model","argument"],"humans":["Ayman Ali","Jeanne Boursier","Hong-Bin Chen","Fu-Hsuan Ho","Victor Issa","Jean-Christophe Mourrat"],"sources":[{"label":"arXiv: Free energy of the Hopfield model","url":"https://arxiv.org/abs/2611.03306","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"free-energy-of-the-hopfield-model","url":"https://vibemathed.com/problem/free-energy-of-the-hopfield-model","note":"Labels its own verification unreviewed."}],"url":"https://whataifound.org/finding/2026-11-02-hopfield-free-energy"},{"id":"2026-11-02-pherc-306b-first-letters","title":"First text read in the Herculaneum scroll PHerc. 306B","claim":"Two Vesuvius Challenge contestants combined a public ink-detection model with one they fine-tuned themselves to recover readable Greek from PHerc. 306B, a carbonised Herculaneum scroll nobody had read, where the papyrology team agreed on the phrase \"that which is in itself desirable\".","field":"archaeology","date":"2026-11-02","added":"2026-11-09","lab":"Vesuvius Challenge","model":"TRACE v3B with a fine-tuned derivative of the v8-in ink model, plus VC3D GrowPatch segmentation","verification":"author-verified","autonomy":"ai-assisted","tags":["papyrology","virtual-unwrapping","ink-detection","ancient-texts","herculaneum"],"humans":["Liam Warner","Nicola Bodill","Paul Henderson","Federica Nicolardi"],"sources":[{"label":"Vesuvius Challenge: Writing seen in PHerc. 306B, for the first time in 2000 years","url":"https://scrollprize.substack.com/p/writing-seen-in-pherc-306b-for-the","kind":"announcement"},{"label":"GitHub: SirProdigle/pherc0306b-first-letters","url":"https://github.com/SirProdigle/pherc0306b-first-letters","kind":"research"},{"label":"Hugging Face: the fine-tuned A-hn ink detection model","url":"https://huggingface.co/Prodigle/pherc0306b-ink-ahn","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-02-pherc-306b-first-letters"},{"id":"2026-11-02-retime-retinal-mortality","title":"Deep learning marker of mortality risk from retinal photographs, validated in three external cohorts (RetiME)","claim":"A deep learning marker that maps a retinal photograph directly to an individual's mortality risk, trained on a European cohort, was associated with all-cause and cause-specific mortality and with the later onset of a wide range of systemic and eye diseases in three external cohorts in Southeast Asia, Eurasia and North America, and was used to reconstruct personalised lifespan trajectories.","field":"medicine","date":"2026-11-02","added":"2026-11-05","lab":"National University of Singapore and Singapore Eye Research Institute","model":"RetiME, a deep learning marker built on large foundation models (not named in the abstract)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["ophthalmology","retinal-imaging","mortality","ageing","retrospective","external-validation"],"humans":["Ting Xu","Ching-Yu Cheng"],"sources":[{"label":"Nature Biomedical Engineering: Re-timing mortality risk through individualized modelling of lifespan trajectories","url":"https://doi.org/10.1038/s41551-026-01822-4","kind":"research"}],"url":"https://whataifound.org/finding/2026-11-02-retime-retinal-mortality"},{"id":"2026-11-02-rosie-maternal-chatbot-rct","title":"Randomised trial of a maternal health chatbot finds no improvement in anxiety or depression at 12 months","claim":"400 pregnant and postpartum people from racially and ethnically minoritised groups across 49 US states were randomised to Rosie, a generative AI maternal health chatbot, or to monthly children's books, and after 12 months the chatbot arm showed no improvement in anxiety or depression scores, nor in emergency department visits, postpartum care, contraception use or sleep.","field":"medicine","date":"2026-11-02","added":"2026-11-09","lab":"University of Maryland","model":"Rosie, a generative AI maternal health chatbot answering from an evidence-based knowledge base (underlying model not named)","verification":"peer-reviewed","autonomy":"ai-led","tags":["maternal-health","conversational-ai","mental-health","negative-result","rct","prospective"],"humans":["Elizabeth M. Norell","Jordan Boyd-Graber","Quynh C. Nguyen"],"sources":[{"label":"JAMA Network Open: Generative Artificial Intelligence and Maternal Health Outcomes in Pregnant and Postpartum Individuals","url":"https://doi.org/10.1001/jamanetworkopen.2026.41062","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06053515","url":"https://clinicaltrials.gov/study/NCT06053515","title":"Rosie the Chatbot: Leveraging Automated and Personalized Health Information Communication to Reduce Disparities in Maternal and Child Health"}],"url":"https://whataifound.org/finding/2026-11-02-rosie-maternal-chatbot-rct"},{"id":"2026-10-31-dfu-explainable-decision-support","title":"Explainable machine-learning decision support for diabetic foot ulcers, externally validated and tested in a randomised comparison","claim":"An ensemble of gradient-boosted trees and neural networks trained on records of 763 diabetic foot ulcer patients at two Chinese hospitals predicted cure, recurrence, amputation and death at a third hospital with a macro-averaged AUC of 0.901; in a 202-patient randomised comparison of AI-assisted against usual care, the AI-assisted arm had better short-term follow-up engagement and glucose-management adherence, and blinded experts scored AI-assisted versions of usual-care recommendations higher than the clinicians' originals (7.77 against 6.47 out of 9).","field":"medicine","date":"2026-10-31","added":"2026-11-12","lab":"Affiliated Hospital of Xuzhou Medical University / Westlake University","model":"Ensemble of single-task XGBoost and multilayer perceptron models with SHAP explanations","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["diabetic-foot","clinical-decision-support","explainable-ai","retrospective","external-validation","prospective","rct"],"humans":["Jia-Yu Zhang","Yangyang Zhuang","Qingping Cao","Aijun Zhang","Chi Zhang"],"sources":[{"label":"EClinicalMedicine: An explainable artificial intelligence system for prognostic assessment and decision support in diabetic foot ulcer care","url":"https://doi.org/10.1016/j.eclinm.2026.104284","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-31-dfu-explainable-decision-support"},{"id":"2026-10-30-designed-activation-domains","title":"Designed transcriptional activation domains, over 90 percent functional in yeast","claim":"A Berkeley-led team generated 500,000 candidate activation domains, scored them with existing machine learning models including three neural networks, and synthesized 18,750 of the top ones, of which more than 90 percent worked as activation domains in yeast, with some retaining function in fungi, plants and human cells.","field":"biology","date":"2026-10-30","added":"2026-11-09","lab":"University of California, Berkeley","model":"Existing activation-domain function predictors including three neural networks, plus MADRIGAL, a consensus predictor built from the results","verification":"author-verified","autonomy":"search-scaffold","tags":["protein-design","synthetic-biology","intrinsically-disordered-proteins","construction"],"humans":["Marissa A. Zintel","Max V. Staller"],"sources":[{"label":"bioRxiv: Machine learning guided design of strong transcriptional activation domains","url":"https://doi.org/10.64898/2026.10.30.763198","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-30-designed-activation-domains"},{"id":"2026-10-29-infinity-harmonic-c1alpha-lean","title":"Lean formalization of interior gradient Hölder estimates for infinity-harmonic functions","claim":"Juan J. Manfredi machine-checked in Lean one of the result families in OpenAI's October 2026 mathematics release, a uniform interior estimate giving every bounded viscosity solution of the infinity-Laplace equation on the unit ball of \\(\\mathbb{R}^d\\), \\(d \\ge 3\\), a gradient that is Hölder continuous on the half ball, and with it the corollary that every infinity-harmonic function on a connected open set in those dimensions is \\(C^1\\); the Lean proofs and the blueprint were written by Claude under an AI-assisted formalization pipeline.","field":"mathematics","date":"2026-10-29","added":"2026-11-02","lab":"Independent","model":"Claude, under the Trellis AI-assisted formalization pipeline; the underlying manuscript came from an unreleased internal OpenAI model","verification":"formal","autonomy":"ai-led","tags":["partial-differential-equations","viscosity-solutions","regularity","lean","formalization","argument"],"humans":["Juan J. Manfredi"],"sources":[{"label":"na0b/infharmonic-lean at the registered commit","url":"https://github.com/na0b/infharmonic-lean/tree/e8710101271a529a8bd84fe0e610c3ab10de85b3","kind":"research"},{"label":"OpenAI: Uniform Interior C^1,alpha Estimates for Infinity-Harmonic Functions (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Uniform-Interior-C1alpha-Estimates-for-Infinity-Harmonic-Functions-October-4-2026/interior-c1-infinity-harmonic.pdf","kind":"research"},{"label":"arXiv: Qualitative-to-quantitative regularity for degenerate equations, the planar case in the human literature","url":"https://arxiv.org/abs/2610.13137","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-29-000040","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-29-000040&version=1","title":"Uniform interior C^{1,alpha} estimates for infinity-harmonic functions in dimensions d at least 3","repository":"na0b/infharmonic-lean","commit":"e8710101271a529a8bd84fe0e610c3ab10de85b3","theorems":["InfHarmonic.main_estimate","InfHarmonic.interior_C1","InfHarmonic.liouville"],"checked":"2026-10-29","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice, with two kernels, nanoda and con-ron, and trust level high. Palomar records the relationship to the OpenAI manuscript as formalizes, with author endorsement not contacted."}],"url":"https://whataifound.org/finding/2026-10-29-infinity-harmonic-c1alpha-lean"},{"id":"2026-10-29-molrsi-molecular-discovery","title":"A self-improving agent selected antibiotic candidates at nearly twice a prior expert workflow's hit rate","claim":"MoLRSI, an agent that rewrites its own molecular-discovery workflows using memory of earlier tasks, built a screening workflow whose 107 selected compounds hit at 15.9% against Staphylococcus aureus, against 8.7% for the same group's earlier expert-designed workflow on the same training data and the same 12-million-compound library, and separately produced eight experimentally validated peptide-MHC binders.","field":"biology","date":"2026-10-29","added":"2026-11-09","lab":"Northeastern University / Broad Institute of MIT and Harvard","model":"Claude Sonnet 5 as the MoLRSI backbone; Claude Opus 5 for the Claude Science comparator","verification":"claimed","autonomy":"search-scaffold","tags":["antibiotics","protein-design","agents","preclinical","preprint"],"humans":["Yikun Zhang","Xiwei Cheng","Wengong Jin","Nir Hacohen","James J. Collins"],"sources":[{"label":"arXiv: MoLRSI, A Recursive Self-Improving AI agent for Molecular Discovery","url":"https://arxiv.org/abs/2610.39714","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-29-molrsi-molecular-discovery"},{"id":"2026-10-29-peddx-posterior-fossa-tumours","title":"Pediatric posterior fossa tumour classifier from T2 MRI with abstention, evaluated at an outside site (PedDx)","claim":"A preprint reports a classifier for five pediatric posterior fossa tumour types from a single T2-weighted MRI, which abstains when unsure, reaching 81.4% accuracy on 129 external cases (88.7% when it did not abstain) and 92.5% on 40 cases run through the full workflow by a team at another institution, while degrading on out-of-distribution scans, sometimes confidently.","field":"medicine","date":"2026-10-29","added":"2026-11-05","lab":"Children's Hospital of Philadelphia","model":"PedDx, a frozen 3DINO vision transformer with a classification head, calibrated, with confidence-based abstention","verification":"claimed","autonomy":"ai-assisted","tags":["pediatrics","neuro-oncology","mri","retrospective","external-validation"],"sources":[{"label":"medRxiv: PedDx, an end-to-end deep learning framework for pediatric posterior fossa tumor diagnosis with agentic AI-enabled independent external evaluation","url":"https://doi.org/10.64898/2026.10.27.26366616","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-29-peddx-posterior-fossa-tumours"},{"id":"2026-10-29-photo-malocclusion-screening","title":"Smartphone profile photograph screening for skeletal malocclusion, externally validated in Turkey and Belgium","claim":"A preprint reports that a classifier using 100 geometric features from a single side-profile smartphone photograph, with no radiograph, kept its sensitivity for skeletal Class III malocclusion across two external cohorts but lost specificity in a non-European cohort from a Belgian clinic, where its AUC fell from 0.902 to 0.835, and fell further in a second task separating Class I from Class II (0.875 to 0.723).","field":"medicine","date":"2026-10-29","added":"2026-11-05","lab":"Bezmialem Vakif University, Muğla Sıtkı Koçman University and Kedi Mobil Uygulama","model":"Geometric machine learning classifiers on 100 engineered facial-profile features","verification":"claimed","autonomy":"ai-assisted","tags":["orthodontics","dentistry","screening","smartphone","retrospective","external-validation"],"sources":[{"label":"medRxiv: Photograph-based skeletal malocclusion screening with geometric machine learning, external validation across Turkish and non-European cohorts","url":"https://doi.org/10.64898/2026.10.28.26366413","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-29-photo-malocclusion-screening"},{"id":"2026-10-28-eus-guideq-endosonography-rct","title":"Randomised trial of voice-guided AI navigation for biliopancreatic endoscopic ultrasound","claim":"In a single-centre randomised trial of 266 patients in China, a real-time AI system that recognises scanning stations and prompts the endoscopist by voice raised the completeness of guideline-recommended biliopancreatic endoscopic ultrasound stations from a median of 0.81 to 1.00, while lengthening procedures by about two minutes.","field":"medicine","date":"2026-10-28","added":"2026-10-29","lab":"Central South University (Third Xiangya Hospital)","model":"EUS-GUIDEQ","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["endoscopic-ultrasound","gastroenterology","quality-control","rct","prospective"],"humans":["Rui Wang","Xiaoyan Wang"],"sources":[{"label":"Clinical Gastroenterology and Hepatology: Real-time voice-guided artificial intelligence improves biliopancreatic endosonography quality, a randomized trial","url":"https://doi.org/10.1016/j.cgh.2026.10.008","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-28-eus-guideq-endosonography-rct"},{"id":"2026-10-27-bernoulli-shifts-unequal-entropy","title":"Measurably isomorphic Bernoulli shifts with different base entropies, proved in Lean","claim":"A Lean proof, registered on Palomar, that some countable group has measurably isomorphic Bernoulli shifts over alphabets of different sizes, so that base entropy is not an isomorphism invariant for that group; the group comes from OpenAI's claimed counterexample to Kaplansky's direct-finiteness conjecture, and the dynamical construction was written with GPT-6 Astra and GPT-6 Sol under Peter Burton's direction.","field":"mathematics","date":"2026-10-27","added":"2026-10-29","lab":"Independent","model":"GPT-6 Astra and GPT-6 Sol via Codex, building on an OpenAI construction","verification":"formal","autonomy":"collaborative","tags":["ergodic-theory","bernoulli-shifts","sofic-groups","lean","formalization","construction"],"humans":["Peter Burton"],"sources":[{"label":"GitHub: peterburton1728/bernoulli-iso-1","url":"https://github.com/peterburton1728/bernoulli-iso-1","kind":"research"},{"label":"Peter Burton: expository note (PDF)","url":"https://github.com/peterburton1728/bernoulli-iso-1/blob/main/bernoulli-iso.pdf","kind":"research"},{"label":"OpenAI: A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Characteristic Two (PDF)","url":"https://github.com/openai/math/blob/main/preprints/A-Counterexample-to-Kaplanskys-Direct-Finiteness-Conjecture-in-Characteristic-Two-September-23-2026/paper.pdf","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-27-000030","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-27-000030&version=1","title":"Finite uniform Bernoulli shifts with unequal base entropy","repository":"peterburton1728/bernoulli-iso-1","commit":"80241ef9354deaa4e787431f5e0692d8d757308e","theorems":["BernoulliCertificate.unequal_finite_bernoulli_shifts"],"checked":"2026-10-27","note":"Permitted axioms are exactly propext, Classical.choice and Quot.sound, with NanoDa enabled. The certificate is narrower than the expository note."},{"registry":"palomar","id":"PALOMAR-2026-11-12-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-12-000001&version=1","title":"A countable group all of whose nontrivial Bernoulli shifts are isomorphic","repository":"peterburton1728/bernoulli-iso-1","commit":"a8df55ed454edfc197296f98155d67a49f3e5eed","theorems":["AllCollapse.all_bernoulli_shifts_isomorphic"],"checked":"2026-11-19","note":"Trust level high; checked by the nanoda and con-ron kernels. A stronger statement from the same repository: for the group N × (Z/2 wr Z) every two non-point-mass standard bases give isomorphic Bernoulli shifts, with no condition on entropy. The record notes that it implies the earlier registered statement mathematically but that this implication is not formalized."}],"url":"https://whataifound.org/finding/2026-10-27-bernoulli-shifts-unequal-entropy"},{"id":"2026-10-27-bighat-antibody-fragment-optimisation","title":"Antibody fragment leads optimised with Claude on affinity, stability and aggregation","claim":"Claude, connected to BigHat Biosciences' laboratory data system, proposed changes to two antibody-fragment drug leads and BigHat's automated laboratory made and tested about 1,010 variants in about 10 weeks; against the originals the best versions bound more than 10 times more tightly, the cancer-targeting lead stayed in solution at a temperature 18 degrees Celsius higher, and the lead meant to keep a drug in the body longer aggregated more than 100 times more slowly.","field":"biology","date":"2026-10-27","added":"2026-10-27","lab":"BigHat Biosciences / Anthropic","model":"Not disclosed; no model name or version given in the announcement","verification":"claimed","autonomy":"ai-assisted","tags":["antibody-design","lead-optimisation","preclinical","construction"],"sources":[{"label":"Anthropic: Early progress on accelerating drug development with Claude","url":"https://www.anthropic.com/research/early-progress-drug-development","kind":"announcement"},{"label":"BigHat Biosciences and Anthropic collaboration report","url":"https://www.bighatbio.com/bighat-anthropic-collaboration-report-10-27-2026","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-27-bighat-antibody-fragment-optimisation"},{"id":"2026-10-27-car-intracellular-domain-refactor","title":"A shortened CAR intracellular domain designed with Claude Code","claim":"Six scientists at Generate Biomedicines used Claude Code to propose new designs for the intracellular signalling region of a CAR T-cell receptor; one design was about 70 percent shorter than the standard version and, in cell assays, let immune cells display roughly 10 times as many receptors, kill tumour cells more efficiently and stay active longer, with no animal or patient data reported.","field":"biology","date":"2026-10-27","added":"2026-10-27","lab":"Generate Biomedicines / Anthropic","model":"Not disclosed; Claude accessed through Claude Code, with no model name or version given in the announcement","verification":"claimed","autonomy":"ai-assisted","tags":["car-t","protein-design","preclinical","construction"],"sources":[{"label":"Anthropic: Early progress on accelerating drug development with Claude","url":"https://www.anthropic.com/research/early-progress-drug-development","kind":"announcement"},{"label":"Generate Biomedicines technical report: Refactored intracellular domains enhance CAR expression and function","url":"https://generatebiomedicines.com/publications/refactored-intracellular-domains-enhance-car-expression-and-function/","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-27-car-intracellular-domain-refactor"},{"id":"2026-10-27-heidi-ai-scribe-health-system","title":"System-wide AI scribe deployment and clinician documentation time at a 14-hospital health system","claim":"Across 1,637,227 outpatient encounters at a 14-hospital Boston health system, enrolment in the Heidi ambient AI scribe was associated with 1.21 fewer minutes of active note time per encounter, more among heavy users, and longer notes, with no change in same-day or after-hours note closure or in work relative value units.","field":"medicine","date":"2026-10-27","added":"2026-10-29","lab":"Beth Israel Deaconess Medical Center / Beth Israel Lahey Health","model":"Heidi (Heidi Health)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["ambient-scribe","documentation","clinician-workload","retrospective","real-world-data"],"humans":["Sara E. Booth","Jennifer P. Stevens"],"sources":[{"label":"Annals of Internal Medicine: Impact of unrestricted artificial intelligence scribe deployment in a single health system on clinician workload and productivity","url":"https://doi.org/10.7326/annals-25-05294","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-27-heidi-ai-scribe-health-system"},{"id":"2026-10-27-ige-dislodging-antibody-designs","title":"Claude-generated antibody designs that dislodge receptor-bound IgE","claim":"Claude turned Divergence Labs' goals into a design plan and then, largely autonomously, generated roughly 35,000 antibody designs in about a month towards a two-armed treatment for food allergy; early testing found three designs that bound IgE and 20 that dislodged it from immune cells, three of the 20 appearing to dislodge more of it than the standard medication, and the two arms have not been combined into a single molecule.","field":"biology","date":"2026-10-27","added":"2026-10-27","lab":"Divergence Labs / Anthropic","model":"Not disclosed; no model name or version given in the announcement","verification":"claimed","autonomy":"search-scaffold","tags":["antibody-design","food-allergy","preclinical","construction"],"sources":[{"label":"Anthropic: Early progress on accelerating drug development with Claude","url":"https://www.anthropic.com/research/early-progress-drug-development","kind":"announcement"},{"label":"Divergence Labs technical report (PDF)","url":"https://divergencelabs.com/publications/ige-preprint.pdf","kind":"research"},{"label":"Hacker News comment: the comparator omalizumab blocks rather than disrupts, and IgE disrupters are known","url":"https://news.ycombinator.com/item?id=50298626","kind":"challenge"}],"url":"https://whataifound.org/finding/2026-10-27-ige-dislodging-antibody-designs"},{"id":"2026-10-27-pts-beta-eta-normalization","title":"Weak normalization implies strong normalization in pure type systems with βη-conversion, proved in Lean","claim":"A Lean proof, written by Claude Opus 5.5 under four authors' direction by adapting OpenAI's proof of the β case, that in every pure type system with βη-conversion, if every legal term is weakly normalizing then every legal term is strongly normalizing, the βη form of a conjecture Geuvers stated in 1993.","field":"computer-science","date":"2026-10-27","added":"2026-10-29","lab":"Independent","model":"Claude Opus 5.5 in Claude Code, adapting an OpenAI Lean proof of the β case","verification":"formal","autonomy":"collaborative","tags":["type-theory","lambda-calculus","normalization","lean","formalization","argument"],"humans":["Ankit Pradhan","Cole Vick","Ruijie Fang","Carl Kwan"],"year_posed":1993,"sources":[{"label":"GitHub: localmotiveproofs/PTS-beta-eta","url":"https://github.com/localmotiveproofs/PTS-beta-eta","kind":"research"},{"label":"OpenAI: Weak and strong normalization in pure type systems, the β case (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Weak-and-strong-normalization-in-pure-type-systems-September-25-2026/paper.pdf","kind":"research"},{"label":"openai/math: scope of the Lean formalization of the β case","url":"https://github.com/openai/math/blob/main/lean/docs/245.md","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-27-000027","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-27-000027&version=1","title":"Weak and strong βη-normalization in pure type systems with βη-conversion","repository":"localmotiveproofs/PTS-beta-eta","commit":"9d0b54a7d5f6747410212c40acf53d12544eb2e6","theorems":["PureTypeSystem.weak_implies_strong_betaEta","PureTypeSystem.weak_beta_implies_strong_betaEta"],"checked":"2026-10-27","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. Palomar records trust level high and archives a fork of the repository."}],"url":"https://whataifound.org/finding/2026-10-27-pts-beta-eta-normalization"},{"id":"2026-10-26-cfsg-lean-axiom","title":"Classification of Finite Simple Groups formalized in Lean by directed AI agents","claim":"Axiom Math released a sorry-free Lean proof of the Classification of Finite Simple Groups that follows the first-generation proof, about 43.1 million lines written over 24 days by swarms of AI agents directed by its mathematicians and engineers, whose agents also found counterexamples to a step in one published route to the Unbalanced Group Theorem.","field":"mathematics","date":"2026-10-26","added":"2026-10-29","lab":"Axiom Math","model":"AxiomProver agent system using an unnamed, changing mix of models","verification":"claimed","autonomy":"collaborative","tags":["group-theory","finite-simple-groups","lean","formalization"],"humans":["Dean Cureton","Vasily Ilin","Bhavik Mehta","Niels Voss","Letong Hong","Colin Defant","Ken Ono"],"sources":[{"label":"GitHub: AxiomMath/CFSG","url":"https://github.com/AxiomMath/CFSG","kind":"research"},{"label":"Hexagon: Defant and Ono, The Unbalanced Group Theorem","url":"https://hexagonmath.org/2610.00575","kind":"research"},{"label":"Axiom Math: Formalizing the Enormous Theorem","url":"https://axiommath.ai/research/the-enormous-theorem-formalized/","kind":"announcement"},{"label":"Axiom Math: CFSG project site","url":"https://cfsg.axiommath.ai/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-10-26-cfsg-lean-axiom"},{"id":"2026-10-26-eth-refuted-claude","title":"A subexponential algorithm for counting 3-SAT solutions, refuting the Exponential Time Hypothesis","claim":"A 49-page paper authored by Claude gives a deterministic algorithm that counts the satisfying assignments of a 3-CNF formula on \\(n\\) variables in \\(2^{o(n)}\\) time, which contradicts the Exponential Time Hypothesis, and a Lean 4 development in Anthropic's public repository states and proves the refutation against Mathlib's Turing machines using only Lean's three standard axioms.","field":"computer-science","date":"2026-10-26","added":"2026-10-27","lab":"Anthropic","model":"Unreleased internal Anthropic research model, not named or versioned; the paper's author line is Claude","verification":"formal","autonomy":"ai-led","tags":["algorithms","fine-grained-complexity","sat","counting","lean","formalization","construction"],"year_posed":1999,"sources":[{"label":"anthropics/formal-math: eth, paper and Lean 4 formalization","url":"https://github.com/anthropics/formal-math/tree/main/eth","kind":"research"},{"label":"A 2 to the o(n) Time Algorithm for 3-SAT, by Claude (Anthropic) (PDF)","url":"https://github.com/anthropics/formal-math/blob/main/eth/paper.pdf","kind":"research"},{"label":"Lean statements of the two headline results (MainResults.lean)","url":"https://github.com/anthropics/formal-math/blob/main/eth/MainResults.lean","kind":"research"},{"label":"ProveIt: Sub-exponential 3-SAT (the Exponential Time Hypothesis), a third-party collection of both manuscripts and derivative reports","url":"https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/SubexponentialSAT","kind":"commentary"}],"registrations":[{"registry":"mathdb","id":"353263","title":"Exponential Time Hypothesis","url":"https://mathdb.com/p/353263/exponential-time-hypothesis","note":"Lists the hypothesis as open as of October 2026; its one posted solution is OpenAI's concurrent claim, and this refutation is not recorded there."}],"url":"https://whataifound.org/finding/2026-10-26-eth-refuted-claude"},{"id":"2026-10-26-eth-refuted-openai","title":"A subexponential counting algorithm for fixed-width CNF, refuting the Exponential Time Hypothesis","claim":"A 67-page preprint authored by OpenAI gives a deterministic algorithm that exactly counts the satisfying assignments of a \\(k\\)-CNF formula in subexponential time and polynomial space, refuting the Exponential Time Hypothesis in the case of 3-SAT; OpenAI released it with a Lean formalization of a weaker bound than the manuscript claims, and announced that an independent working group of complexity theorists would examine the proof.","field":"computer-science","date":"2026-10-26","added":"2026-10-27","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["algorithms","fine-grained-complexity","sat","counting","lean","formalization","construction"],"year_posed":1999,"sources":[{"label":"OpenAI: The Exponential Time Hypothesis is False (PDF)","url":"https://github.com/openai/math/blob/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf","kind":"research"},{"label":"openai/math: scope of the Lean formalization for this paper","url":"https://github.com/openai/math/blob/main/lean/docs/378.md","kind":"research"},{"label":"openai/math: Comparator challenge statement (SubexponentialSAT.lean)","url":"https://github.com/openai/math/blob/main/lean/ComparatorChallenges/SubexponentialSAT.lean","kind":"research"},{"label":"openai/math release history, 26 October 2026 entry announcing the review group","url":"https://github.com/openai/math/blob/main/history.md","kind":"announcement"},{"label":"Some exposition of “The Exponential Time Hypothesis Is False” (30 October 2026), hosted on Ryan O'Donnell's Carnegie Mellon page","url":"https://www.cs.cmu.edu/~odonnell/some_eth_false_exposition.pdf","kind":"commentary"},{"label":"ProveIt: Sub-exponential 3-SAT (the Exponential Time Hypothesis), a third-party collection of both manuscripts and derivative reports","url":"https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/SubexponentialSAT","kind":"commentary"}],"registrations":[{"registry":"mathdb","id":"353263","title":"Exponential Time Hypothesis","url":"https://mathdb.com/p/353263/exponential-time-hypothesis","note":"Carries OpenAI's claimed refutation as its one posted solution and, as of October 2026, lists the hypothesis as open with no independently verified proof or refutation."},{"registry":"vibemathed","id":"exponential-time-hypothesis","url":"https://vibemathed.com/problem/exponential-time-hypothesis","note":"Records OpenAI's manuscript; the concurrent Anthropic paper appears there only as a linked reference."}],"url":"https://whataifound.org/finding/2026-10-26-eth-refuted-openai"},{"id":"2026-10-26-local-smoothing-all-dimensions","title":"Sogge's local smoothing conjecture claimed in every dimension, with Bochner–Riesz and Kakeya as consequences","claim":"An OpenAI manuscript released with a Lean formalization claims Sogge's local smoothing conjecture for the wave equation in every spatial dimension, and from it the Bochner–Riesz conjecture, the Kakeya and Nikodym maximal conjectures, full Hausdorff dimension for every Euclidean Kakeya set, and Fourier restriction for the sphere, paraboloid and cone throughout the interior of the conjectured range.","field":"mathematics","date":"2026-10-26","added":"2026-10-29","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["harmonic-analysis","local-smoothing","kakeya","restriction","lean","argument"],"year_posed":1991,"sources":[{"label":"OpenAI: Local smoothing for the Euclidean wave equation (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Local-smoothing-for-the-Euclidean-wave-equation-October-25-2026/paper.pdf","kind":"research"},{"label":"openai/math: scope of the Lean formalization for family 079","url":"https://github.com/openai/math/blob/main/lean/docs/079.md","kind":"research"},{"label":"openai/math: Comparator challenge statement (LocalSmoothing.lean)","url":"https://github.com/openai/math/blob/main/lean/ComparatorChallenges/LocalSmoothing.lean","kind":"research"},{"label":"openai/math release history, 26 October 2026 entry","url":"https://github.com/openai/math/blob/main/history.md","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"sogge-s-local-smoothing-conjecture","url":"https://vibemathed.com/problem/sogge-s-local-smoothing-conjecture"}],"url":"https://whataifound.org/finding/2026-10-26-local-smoothing-all-dimensions"},{"id":"2026-10-26-osteoaid-femoral-head-osteonecrosis","title":"Deep learning detection and staging of femoral head osteonecrosis on hip x-rays across six Chinese hospitals","claim":"OsteoAID, a YOLOv8-based model trained on 20,722 hip x-rays from 16,399 patients at six Chinese hospitals, staged osteonecrosis of the femoral head with 96.6% accuracy on an external test set, against 75.0% for radiologists.","field":"medicine","date":"2026-10-26","added":"2026-10-29","lab":"Sun Yat-sen University (with the Chinese Artificial Intelligence Project Group for Hip Joint Diseases)","model":"OsteoAID (YOLOv8-based)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["orthopaedics","radiography","osteonecrosis","retrospective","external-validation"],"humans":["Zhanqi Wei","Xisheng Weng"],"sources":[{"label":"The Lancet Digital Health: A deep learning model for detection and staging of osteonecrosis of the femoral head on x-ray images","url":"https://doi.org/10.1016/j.landig.2026.101081","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-26-osteoaid-femoral-head-osteonecrosis"},{"id":"2026-10-26-pythia-full-length-antibodies","title":"Designed full-length IgG antibodies against 22 targets, including GPCR agonists","claim":"Pythia Labs reports that its all-atom generative model designed full-length human IgG antibodies for 22 therapeutic targets, and that screening at most 48 candidates per target after a single design round found single-digit nanomolar binders, including both agonists and antagonists of G protein-coupled receptors.","field":"biology","date":"2026-10-26","added":"2026-11-09","lab":"Pythia Labs","model":"Pythia-1, an all-atom generative model over sequence and structure jointly","verification":"claimed","autonomy":"search-scaffold","tags":["antibody-design","protein-design","gpcr","preclinical","construction"],"humans":["Robin A. Aglietti","Todd O. Yeates"],"sources":[{"label":"bioRxiv: Design of full-length agonist and antagonist antibodies for hard targets","url":"https://doi.org/10.64898/2026.10.21.760573","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-26-pythia-full-length-antibodies"},{"id":"2026-10-26-yang-mills-existence-claim","title":"Lean-checked construction of four-dimensional quantum Yang-Mills theory by OpenAI, without uniqueness or a mass gap","claim":"OpenAI's language model produced a Lean proof, since released and rebuilt by an independent committee of physicists and mathematicians, that a relativistic quantum field theory satisfying the Wightman axioms arises as a scaling limit of four-dimensional Wilson lattice gauge theory for every simple compact gauge group; the committee judges this an existence proof for pure Yang-Mills theory, while uniqueness of the infinite-volume limit and the mass gap remain unproved.","field":"mathematics","date":"2026-10-26","added":"2026-11-05","lab":"OpenAI","model":"OpenAI language model, not named in the committee's statement","verification":"formal","autonomy":"ai-led","tags":["mathematical-physics","quantum-field-theory","yang-mills","argument","lean"],"sources":[{"label":"yang-mills-group/OpenAI-YM-20261028: OpenAI's Lean submission of 28 October 2026, preserved unchanged","url":"https://github.com/yang-mills-group/OpenAI-YM-20261028","kind":"research"},{"label":"yang-mills-group/YM: the committee's checks, verification records and rerun instructions","url":"https://github.com/yang-mills-group/YM","kind":"research"},{"label":"Yang-Mills group: Validation of the OpenAI Yang-Mills construction, initial assessment of 10 November 2026 (PDF)","url":"https://github.com/yang-mills-group/YM/blob/main/docs/assessment-1.pdf","kind":"commentary"},{"label":"KITP: Proof by OpenAI of the Existence of Quantum Yang-Mills theory, statement by the shepherding committee","url":"https://www.kitp.ucsb.edu/sites/default/files/YM_working_group.pdf","kind":"commentary"},{"label":"Science: AI rivals tackle one of physics' deepest mathematical challenges","url":"https://www.science.org/content/article/ai-rivals-tackle-one-physics-deepest-mathematical-challenges","kind":"coverage"},{"label":"OpenAI: Building scientific understanding with academic communities","url":"https://openai.com/index/building-scientific-understanding-with-academic-communities/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-10-26-yang-mills-existence-claim"},{"id":"2026-10-22-euler-2d-unforced-nonuniqueness","title":"Non-uniqueness of unforced two-dimensional Euler flows with unbounded integrable vorticity","claim":"A two-part manuscript by Matei P. Coiculescu, whose detailed proofs, code and text were largely produced with Claude Opus 5.5 under his direction, claims that the incompressible Euler equations in the plane, with no external force, admit two distinct renormalized weak solutions from the same radial initial vorticity, which lies in \\(L^1 \\cap L^q\\) for every \\(q < \\infty\\) but is unbounded; Part I is on arXiv and the whole proof is formalized in Lean.","field":"mathematics","date":"2026-10-22","added":"2026-11-05","lab":"Independent","model":"Claude Opus 5.5 (Anthropic)","verification":"claimed","autonomy":"ai-assisted","tags":["pde","fluid-dynamics","euler-equations","non-uniqueness","lean","formalization","argument"],"humans":["Matei P. Coiculescu"],"sources":[{"label":"arXiv: Non-Uniqueness of Weak Solutions to the Unforced Two-Dimensional Euler Equations with Vorticity in L¹ ∩ Lᵖ, Part I","url":"https://arxiv.org/abs/2610.30655","kind":"research"},{"label":"GitHub: mcoiculescu/NonUniqueEuler, both parts, the Lean formalization and the Arb certificate","url":"https://github.com/mcoiculescu/NonUniqueEuler/tree/7cca5852d633068a3d5217e4f530d4d3a1199d86","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"non-uniqueness-of-weak-solutions-to-the-unforced-two-dimensional-euler-equations","url":"https://vibemathed.com/problem/non-uniqueness-of-weak-solutions-to-the-unforced-two-dimensional-euler-equations"}],"url":"https://whataifound.org/finding/2026-10-22-euler-2d-unforced-nonuniqueness"},{"id":"2026-10-21-bt-rads-agentic-glioma-scoring","title":"Multiagent language-model and CNN system scores BT-RADS on glioma follow-up MRI","claim":"A system pairing a locally run 20-billion-parameter gpt-oss model, which extracts clinical variables from notes, with a scoring agent applying BT-RADS logic to tumour volumetrics classified 492 post-treatment glioma MRI examinations with 76.0% accuracy against an expert reference, against 57.5% for the initial clinical assessments.","field":"medicine","date":"2026-10-21","added":"2026-10-29","lab":"Duke University Medical Center","model":"gpt-oss 20B (OpenAI, open weights) extractor agent with a convolutional neural network scorer","verification":"peer-reviewed","autonomy":"ai-led","tags":["neuro-oncology","glioma","radiology","large-language-model","agents","retrospective"],"humans":["Mohamed Sobhi Jabal","Evan Calabrese"],"sources":[{"label":"Radiology: Artificial Intelligence: Agentic automation of BT-RADS scoring using an end-to-end system for standardized glioma follow-up assessment","url":"https://doi.org/10.1148/ryai.260234","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-21-bt-rads-agentic-glioma-scoring"},{"id":"2026-10-21-dllv-chest-radiograph-lv-dysfunction","title":"Chest radiograph model for prescreening reduced ejection fraction, tested in three Korean cohorts","claim":"DLLV, a deep learning model that flags a left ventricular ejection fraction of 40% or less on chest radiographs, reached AUCs of 0.86 in a tertiary-centre cohort and 0.92 to 0.97 in two health-checkup cohorts, and as a prescreen was estimated to cut echocardiography volume by up to 85% without missing any of the 19 affected people in those cohorts.","field":"medicine","date":"2026-10-21","added":"2026-10-29","lab":"Seoul National University Bundang Hospital","model":"DLLV","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","heart-failure","chest-radiograph","screening","retrospective","external-validation"],"humans":["Sowon Jang","Ju Gang Nam"],"sources":[{"label":"Radiology: Artificial Intelligence: Interpretable deep learning for opportunistic screening of left ventricular dysfunction using chest radiographs","url":"https://doi.org/10.1148/ryai.260161","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-21-dllv-chest-radiograph-lv-dysfunction"},{"id":"2026-10-21-php2shell-rce","title":"PHP2Shell: two critical PHP remote code execution flaws found with AI assistance","claim":"Two security teams working independently, each using frontier language models to review PHP's source, found two unauthenticated remote code execution flaws in the runtime behind a large share of the web; both were rated 9.2 critical, and PHP shipped patches on 2026-10-21 under coordinated disclosure.","field":"computer-science","date":"2026-10-21","added":"2026-10-26","lab":"Calif / Wiz Research / OpenAI","model":"Gemini 4 Argon and GPT-5.6 Sol, with the Wiz Atlas tool; which model did what differs by source, see caveats","verification":"claimed","autonomy":"ai-assisted","tags":["security","memory-safety","vulnerability-discovery","coordinated-disclosure","php"],"humans":["Ryan Austin","Michal Zalewski","Sagi Tzadik","Shir Tamari","Nir Ohfeld","Tomer Schwartz"],"sources":[{"label":"PHP advisory GHSA-w8hw-w9fx-j79w: RCE via OOM corruption (CVE-2026-109618)","url":"https://github.com/php/php-src/security/advisories/GHSA-w8hw-w9fx-j79w","kind":"research"},{"label":"PHP advisory GHSA-6wmf-4rv5-p3rp: RCE via stale global state (CVE-2026-109619)","url":"https://github.com/php/php-src/security/advisories/GHSA-6wmf-4rv5-p3rp","kind":"research"},{"label":"NVD record for CVE-2026-109618","url":"https://nvd.nist.gov/vuln/detail/CVE-2026-109618","kind":"research"},{"label":"NVD record for CVE-2026-109619","url":"https://nvd.nist.gov/vuln/detail/CVE-2026-109619","kind":"research"},{"label":"Wiz Research: PHP2Shell, the finders' write-up naming the models used","url":"https://www.wiz.io/blog/php2shell-php-rce","kind":"announcement"},{"label":"Calif: PHP2Shell, a tale of two PHP remote vulnerabilities","url":"https://calif.io/php2shell/","kind":"announcement"},{"label":"OpenAI: Coordinated disclosure of critical vulnerabilities","url":"https://openai.com/index/coordinated-disclosure-of-critical-vulnerabilities/","kind":"announcement"},{"label":"The PHP Foundation: today's security release and strengthening PHP security","url":"https://thephp.foundation/blog/2026/10/21/todays-php-security-release-and-how-were-strengthening-php-security/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-10-21-php2shell-rce"},{"id":"2026-10-20-claude-scorpion-toxin-binders","title":"Claude-designed protein binders against five scorpion neurotoxins","claim":"A generative design campaign run by an internal Anthropic model produced 318,484 candidate proteins against five scorpion-venom neurotoxins; of the 211 that were synthesised and tested, 17 met the binding criterion at both contract laboratories, the tightest at single-digit nanomolar affinity, and none was tested for venom neutralisation.","field":"biology","date":"2026-10-20","added":"2026-10-22","lab":"Anthropic","model":"Internal Anthropic research model operating within Claude Science, not named or versioned in the post","verification":"claimed","autonomy":"search-scaffold","tags":["protein-design","de-novo-binders","scorpion-toxins","construction"],"sources":[{"label":"Anthropic: How Claude designed protein binders against scorpion neurotoxins","url":"https://www.anthropic.com/research/claude-scorpion-toxin-binder-design","kind":"announcement"},{"label":"Anthropic technical report (PDF)","url":"https://www-cdn.anthropic.com/31ac578806cffd8b3d92d8affe6edc4c04d502e1.pdf","kind":"research"},{"label":"Hugging Face: scorpion-toxin-binder-design dataset, 211 designs with SPR results, CC-BY-4.0","url":"https://huggingface.co/datasets/Anthropic/scorpion-toxin-binder-design","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-20-claude-scorpion-toxin-binders"},{"id":"2026-10-20-trilinear-hilbert-transform-lean","title":"Lean formalization of the L³ bound for the trilinear Hilbert transform","claim":"An independent mathematician machine-checked one of the 372 claimed results in OpenAI's October 2026 mathematics release, the \\(L^3\\) boundedness of the trilinear Hilbert transform with slopes 1, 2 and 3, writing the theorem statement by hand and having coding agents generate roughly 194,000 lines of Lean proof from a blueprint another model wrote.","field":"mathematics","date":"2026-10-20","added":"2026-10-26","lab":"Independent","model":"GPT-6 Astra Pro for the blueprint, with GPT-6 Astra Light and Claude Opus 5.5 autoformalizing the proof","verification":"formal","autonomy":"ai-led","tags":["harmonic-analysis","singular-integrals","lean","formalization","argument"],"humans":["Joris Roos"],"sources":[{"label":"roos-j/lean-trilinearht at the registered commit","url":"https://github.com/roos-j/lean-trilinearht/tree/0fac9f4ed4aa3391931897a681ce547981fb5f46","kind":"research"},{"label":"Main theorem statement, human-written (TrilinearHT/Theorems.lean)","url":"https://github.com/roos-j/lean-trilinearht/blob/0fac9f4ed4aa3391931897a681ce547981fb5f46/TrilinearHT/Theorems.lean","kind":"research"},{"label":"OpenAI: An L³ bound for the trilinear Hilbert transform (PDF)","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-20-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-20-000001","title":"Formalization of L^3 boundedness of the trilinear Hilbert transform","repository":"roos-j/lean-trilinearht","commit":"0fac9f4ed4aa3391931897a681ce547981fb5f46","theorems":["TrilinearHT.trilinear_ht_bound"],"checked":"2026-10-20","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. Palomar records trust level high and archives a fork of the repository."},{"registry":"vibemathed","id":"trilinear-hilbert-transform-l3","url":"https://vibemathed.com/problem/trilinear-hilbert-transform-l3","note":"Records the OpenAI manuscript result of 2026-10-05 for the same bound, the result this formalization checks."}],"url":"https://whataifound.org/finding/2026-10-20-trilinear-hilbert-transform-lean"},{"id":"2026-10-19-erdos-111-bipartization","title":"Erdős Problem 111: graphs that are not countably colorable need superlinear deletions to become bipartite","claim":"A Lean-checked proof that if every finite subgraph on \\(m\\) vertices of a graph can be made bipartite by deleting at most \\(Cm\\) edges, the graph is countably colorable, so \\(h_G(n)/n \\to \\infty\\) for every graph of chromatic number \\(\\aleph_1\\), answering the second question of Erdős Problem 111; the proof was found by GPT-6 Astra and Claude Opus 5.5 in alternation.","field":"mathematics","date":"2026-10-19","added":"2026-10-20","lab":"Plasma AI","model":"GPT-6 Astra (Codex) and Claude Opus 5.5 (Claude Code), alternating; Claude Opus 5.5 (Lean formalization)","verification":"claimed","autonomy":"ai-led","tags":["graph-theory","chromatic-number","infinite-combinatorics","erdos-problems","lean","argument"],"humans":["Jacob Parish"],"year_posed":1981,"sources":[{"label":"GitHub: plasma-ai/erdos-111, the Lean development and AI disclosure","url":"https://github.com/plasma-ai/erdos-111","kind":"research"},{"label":"Blueprint: the prose proof, written by Claude Opus 5.5 from Plasma AI's write-up","url":"https://github.com/plasma-ai/erdos-111/blob/main/blueprint/proof.md","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-19-000007","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-19-000007&version=1","repository":"plasma-ai/erdos-111","commit":"de72caf0e388c729697b6813f4ea90bfe1617c7b","theorems":["Erdos111.countably_colorable_of_linear","Erdos111.tendsto_of_not_countably_colorable","Erdos111.erdos_111"],"checked":"2026-10-19","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. The definitions the three statements use are the authors' own, not Formal Conjectures'."}],"url":"https://whataifound.org/finding/2026-10-19-erdos-111-bipartization"},{"id":"2026-10-19-erdos-173-monochromatic-triangles","title":"Erdős Problem 173: a two-coloring of the plane misses at most one triangle, which is equilateral","claim":"A Lean-checked proof that in every two-coloring of the plane, every triangle except possibly one equilateral triangle has a monochromatic congruent copy, settling a 1973 conjecture of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus, found by GPT-6 Astra and Claude Opus 5.5 working in alternation.","field":"mathematics","date":"2026-10-19","added":"2026-10-20","lab":"Plasma AI","model":"GPT-6 Astra (Codex) and Claude Opus 5.5 (Claude Code), alternating; Claude Opus 5.5 (Lean formalization)","verification":"formal","autonomy":"ai-led","tags":["combinatorics","euclidean-ramsey-theory","erdos-problems","lean","formalization","argument"],"humans":["Jacob Parish"],"year_posed":1973,"sources":[{"label":"GitHub: plasma-ai/erdos-173, the Lean development and AI disclosure","url":"https://github.com/plasma-ai/erdos-173","kind":"research"},{"label":"Blueprint: the prose proof, written by Claude Opus 5.5 from Plasma AI's write-up","url":"https://github.com/plasma-ai/erdos-173/blob/main/blueprint/proof.md","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-19-000008","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-19-000008&version=1","repository":"plasma-ai/erdos-173","commit":"4a368a652753fab53272f7a747755876f04bc2cc","theorems":["Erdos173.erdos_173","Erdos173.erdos_173.variants.right_triangle","Erdos173.erdos_173.variants.equilateral_exception","Erdos173.erdos_173.variants.non_equilateral","Erdos173.erdos_173.variants.three_distinct_points"],"checked":"2026-10-19","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. Three of the five compared statements are Formal Conjectures' verbatim; the non-equilateral and three-distinct-points variants are the authors' own."}],"url":"https://whataifound.org/finding/2026-10-19-erdos-173-monochromatic-triangles"},{"id":"2026-10-19-erdos-408-iterated-totient","title":"Erdős Problem 408: an unconditional normal order for the number of totient iterations","claim":"A Lean-checked proof that the least \\(k\\) with \\(\\varphi_k(n) = 1\\) has normal order \\(\\alpha \\log n\\) for a constant \\(1/\\log 3 \\le \\alpha \\le 1/\\log 2\\), answering the first two questions of Erdős Problem 408 without the Elliott-Halberstam hypothesis a 1990 proof needed, by building on OpenAI's unrefereed zero-free half-plane and shifted-prime results.","field":"mathematics","date":"2026-10-19","added":"2026-10-20","lab":"Plasma AI","model":"Claude Opus 5.5 (Lean formalization); the argument is credited to Plasma AI without naming a model","verification":"formal","autonomy":"ai-assisted","tags":["number-theory","analytic-number-theory","erdos-problems","lean","formalization","argument"],"humans":["Jacob Parish"],"year_posed":1980,"sources":[{"label":"GitHub: plasma-ai/erdos-408, the Lean development","url":"https://github.com/plasma-ai/erdos-408","kind":"research"},{"label":"Plasma AI: The normal order of the number of iterations of Euler's function (PDF)","url":"https://github.com/plasma-ai/erdos-408/blob/main/paper/totient_iterates.pdf","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-19-000009","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-19-000009&version=1","repository":"plasma-ai/erdos-408","commit":"4ea44bf911f8668aec10ec25c4b309e8ed476666","theorems":["Erdos408.normal_order_rate","Erdos408.erdos_408.parts.i","Erdos408.erdos_408.parts.ii"],"checked":"2026-10-19","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. parts.i and parts.ii are Formal Conjectures' statements; normal_order_rate is the authors' own."}],"url":"https://whataifound.org/finding/2026-10-19-erdos-408-iterated-totient"},{"id":"2026-10-19-takotsubo-ecg-deep-learning","title":"ECG deep learning ensemble separates Takotsubo syndrome from anterior STEMI and improves reader accuracy","claim":"A preprint reports an ensemble of three deep learning models that distinguished Takotsubo syndrome from acute anterior ST-elevation myocardial infarction on 12-lead ECG images with 91.4% accuracy in a 95-person external cohort, and raised 70 healthcare providers' estimated probability of a correct diagnosis from 0.632 unaided to 0.864 with AI assistance.","field":"medicine","date":"2026-10-19","added":"2026-10-29","lab":"North Medical Center Hiroshima City Asa Citizens Hospital","model":"Ensemble of three deep learning models with self-supervised pretraining","verification":"claimed","autonomy":"ai-assisted","tags":["cardiology","electrocardiography","takotsubo","retrospective","external-validation"],"humans":["Eisuke Kagawa","Keigo Dote"],"sources":[{"label":"medRxiv: Deep learning-based electrocardiographic differentiation of Takotsubo syndrome from acute anterior myocardial infarction","url":"https://doi.org/10.64898/2026.10.15.26365116","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-19-takotsubo-ecg-deep-learning"},{"id":"2026-10-18-epi-autonomous-research-records","title":"Épi agent reports 120 record bounds and constructions, with released certificates","claim":"Bake AI's Épi agent, running GPT-5.6 Sol and GPT-6 Astra against fixed verifiers, reports 20 improved numerical bounds and 100 record constructions, including certificates that the Cohn–Elkies sphere-packing bound cannot be sharp in dimensions 10 and 11, an upper bound of 4.29569 on Klarner's polyomino growth constant against 4.5238, and a computer-assisted extension of Tuza's conjecture for a class of split graphs.","field":"mathematics","date":"2026-10-18","added":"2026-10-29","lab":"Bake AI","model":"GPT-5.6 Sol and GPT-6 Astra in the Épi agent","verification":"claimed","autonomy":"search-scaffold","tags":["combinatorics","sphere-packing","packing","tuza-conjecture","certificates","computation"],"humans":["Yue Huang","Zhangchen Xu","Zichen Chen"],"sources":[{"label":"arXiv: Épi, Towards a Persistent, Self-Improving Agent for Autonomous Research","url":"https://arxiv.org/abs/2610.24944","kind":"research"},{"label":"GitHub: BakeLab/Epi-results, constructions, certificates and the Tuza checker","url":"https://github.com/BakeLab/Epi-results","kind":"research"},{"label":"Bake AI: Introducing Épi","url":"https://bakeai.inc/research/articles/introducing-epi/","kind":"announcement"},{"label":"arXiv: A convolutional approach to bounding the number of polyominoes, the previous Klarner bound","url":"https://arxiv.org/abs/2511.00461","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-10-18-epi-autonomous-research-records"},{"id":"2026-10-18-two-commuting-ergodic-averages","title":"Pointwise convergence of ergodic averages along two commuting transformations","claim":"A Lean-checked proof that for two commuting measure-preserving transformations \\(T\\) and \\(S\\) of a probability space, the averages \\(N^{-1}\\sum_{n<N} f(T^n x)\\, g(S^n x)\\) converge almost everywhere whenever \\(f \\in L^p\\) and \\(g \\in L^q\\) with \\(1/p + 1/q \\le 1\\), found by a model asked to adapt OpenAI's recent triangular Hilbert transform result.","field":"mathematics","date":"2026-10-18","added":"2026-10-20","lab":"Independent","model":"GPT-6 Astra Pro (proof and blueprint); Claude Opus 5.5 (Lean formalization)","verification":"formal","autonomy":"ai-led","tags":["ergodic-theory","harmonic-analysis","lean","formalization","argument"],"humans":["Floris van Doorn","Polona Durcik","Joris Roos","Lenka Slavíková","Christoph Thiele"],"sources":[{"label":"GitHub: roos-j/lean-twocommuting, the Lean formalization","url":"https://github.com/roos-j/lean-twocommuting","kind":"research"},{"label":"arXiv: Pointwise convergence of bilinear ergodic averages for commuting transformations (Guo, Xiao and Zhang)","url":"https://arxiv.org/abs/2610.26388","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-18-000026","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-18-000026&version=1","repository":"roos-j/lean-twocommuting","commit":"5abb8fad6c99fe19850cbdabe3096ed7745dda11","theorems":["pointwise_convergence_two_commuting"],"checked":"2026-10-18","note":"Permitted axioms are exactly propext, Classical.choice and Quot.sound, replayed with the nanoda and con-ron kernels."}],"url":"https://whataifound.org/finding/2026-10-18-two-commuting-ergodic-averages"},{"id":"2026-10-16-nist-curve-seeds-lrand48","title":"NIST elliptic-curve seeds traced to a 1990s C random number generator seeded with the clock","claim":"An Anthropic model showed that the published seeds of the NIST prime curves P-192, P-224, P-256, P-384 and P-521 and five ANSI X9.62 example curves are outputs of the C library's lrand48 generator seeded with Unix timestamps from May 1997 to April 1998, not hashes of a secret phrase, answering the origin question behind a long-standing backdoor debate.","field":"computer-science","date":"2026-10-16","added":"2026-10-20","lab":"Anthropic","model":"Internal Anthropic research model (Claude), not named in the announcement","verification":"claimed","autonomy":"ai-led","tags":["cryptography","elliptic-curves","standards","computation"],"humans":["John Wood","Henry de Valence","Ava Howell","Zack Voase","Lucy Sweet","Amir Omidi","Paul Crowley","Iain McGinniss","Nicholas Carlini","Steve Weis"],"sources":[{"label":"Anthropic: Claude reveals ECDSA curve origins, with CC0 reproduction scripts","url":"https://www.anthropic.com/research/ecdsa-curve-origins","kind":"announcement"},{"label":"Filippo Valsorda: The NIST Elliptic Curves Seeds Bounty Has Been Claimed","url":"https://words.filippo.io/seeds-solved/","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-10-16-nist-curve-seeds-lrand48"},{"id":"2026-10-15-ai-auscultation-lv-dysfunction","title":"AI-enhanced auscultation for left ventricular dysfunction, validated in prospective Japanese cohorts","claim":"An AI model reading digital heart sounds from four chest sites with a single-lead ECG detected an ejection fraction of 40% or less with an AUROC of 0.904 in an external prospective cohort of 964 patients, and was more accurate than a consensus of seven cardiologists in a 100-patient reader substudy (82.0% against 62.0%).","field":"medicine","date":"2026-10-15","added":"2026-10-29","lab":"Juntendo University (with AMI Inc.)","model":"Transformer and one-dimensional CNN ensemble over four-site digital auscultation and single-lead ECG","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","heart-failure","digital-stethoscope","prospective","external-validation"],"humans":["Eiichiro Sato","Nobuyuki Kagiyama"],"sources":[{"label":"NEJM AI: Artificial intelligence-enhanced auscultation to identify left ventricular dysfunction, development and external validation in prospective multicenter studies","url":"https://doi.org/10.1056/AIoa2600258","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-15-ai-auscultation-lv-dysfunction"},{"id":"2026-10-15-ai-infocare-previsit-summaries-rct","title":"Randomised trial of AI-generated lay summaries before neurosurgical consultations","claim":"In a single-centre randomised trial of 300 outpatients in Dresden, giving patients a quality-checked AI-generated lay summary of their medical findings before consultation improved patient-rated quality of the physician-patient interaction (4.42 against 4.25 on the FAPI scale) and shortened median consultations from 33 to 25 minutes.","field":"medicine","date":"2026-10-15","added":"2026-10-29","lab":"TU Dresden (University Hospital Carl Gustav Carus)","model":"Simply Onno (underlying model not named in the abstract)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["patient-communication","large-language-model","neurosurgery","rct","prospective"],"humans":["Elida Benker-Hasani","Witold H. Polanski"],"sources":[{"label":"NEJM AI: Effect of previsit AI-generated document summaries on consultation time and patient-physician communication, the AI-INFOCARE randomized controlled trial","url":"https://doi.org/10.1056/AIoa2600136","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-15-ai-infocare-previsit-summaries-rct"},{"id":"2026-10-15-llm-quantum-circuit-design","title":"LLM-designed quantum circuits with fewer gates and qubits than published designs in seven of eight tasks","claim":"Claude, run in a loop with an automated evaluator, produced reversible circuits that cut both Toffoli and qubit counts below the best published designs in seven of eight quantum-computing primitives and found a new reversible architecture for prime-field modular inversion in the eighth, including an elliptic-curve point addition with 17 times fewer gates at 12% more qubits.","field":"computer-science","date":"2026-10-15","added":"2026-10-20","lab":"Anthropic","model":"Claude (the announcement names Claude Mythos 5)","verification":"claimed","autonomy":"search-scaffold","tags":["quantum-computing","quantum-circuits","cryptography","construction"],"humans":["Andi Gu","Alek Kemeny","Susanne Yelin","Mikhail Lukin"],"sources":[{"label":"arXiv: Discovering state-of-the-art quantum circuits with large language models","url":"https://arxiv.org/abs/2610.22367","kind":"research"},{"label":"Anthropic: Designing more efficient quantum circuits with Claude","url":"https://www.anthropic.com/research/designing-efficient-quantum-circuits","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-10-15-llm-quantum-circuit-design"},{"id":"2026-10-15-rfdiffusion3-enzyme-design","title":"RFdiffusion3 designs active phosphotriesterases and transthyretin-specific zinc proteases zero-shot","claim":"RFdiffusion3, a generative model that diffuses free atoms to satisfy atomic constraints, produced de novo phosphotriesterases with a two-metal active site and zinc proteases specific for transthyretin, obtaining active catalysts of both kinds from zero-shot design campaigns of 96 constructs.","field":"chemistry","date":"2026-10-15","added":"2026-10-29","lab":"Institute for Protein Design, University of Washington","model":"RFdiffusion3","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["protein-design","enzyme-design","rfdiffusion","catalysis"],"humans":["Jasper Butcher","Rohith Krishna","David Baker"],"sources":[{"label":"Science: Atomic functional site scaffolding in biopolymers with RFdiffusion3","url":"https://doi.org/10.1126/science.aeh2982","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-15-rfdiffusion3-enzyme-design"},{"id":"2026-10-14-microexon-code-autism-variants","title":"A machine-learning microexon splicing code links rare variants to autism in 7,391 families","claim":"A gradient-boosted classifier trained to recognise neuronally spliced microexons from their surrounding sequence was used to score variants in whole genomes from three autism cohorts, prioritising 72 variants associated with autism within families that occur in 2.5% of autistic individuals and in none of their unaffected siblings; minigene assays in human induced neurons confirmed that representative variants alter microexon splicing.","field":"biology","date":"2026-10-14","added":"2026-11-12","lab":"University of Toronto","model":"Gradient-boosted decision trees (XGBoost) microexon code-model","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["genomics","splicing","autism","variant-effect-prediction"],"humans":["Guillermo E. Parada","Hannes Bretschneider","Quaid D. Morris","Benjamin J. Blencowe"],"sources":[{"label":"Nature: A microexon regulatory code reveals autism-linked genetic variation","url":"https://doi.org/10.1038/s41586-026-11119-w","kind":"research"},{"label":"The Transmitter: Machine-learning model spots autism-linked variants that scramble splicing","url":"https://www.thetransmitter.org/spectrum/machine-learning-model-spots-autism-linked-variants-that-scramble-splicing/","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-10-14-microexon-code-autism-variants"},{"id":"2026-10-13-neonatal-radiograph-continual-learning","title":"Adapting an adult chest-radiograph model to neonatal intensive care across 30 units","claim":"A model trained to assess endotracheal tube position on adult chest radiographs was retrained in sequence at 30 neonatal intensive care units in 20 countries and territories, 50 radiographs per site and with no pooling of patient data, reaching a mean landmark localisation error of 0.67 cm against 1.29 cm for hospital-specific fine-tuning and 4.30 cm for the unadapted adult model.","field":"medicine","date":"2026-10-13","added":"2026-10-22","lab":"International NICU continual-learning consortium","model":"Adult endotracheal-tube assessment deep learning model adapted by continual learning; the base model is not named in the abstract","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["external-validation","retrospective","radiology","neonatal","continual-learning","privacy-preserving"],"humans":["Vishwanatha M Rao","Pranav Rajpurkar"],"sources":[{"label":"Nature Biomedical Engineering: Repurposing adult AI radiograph models for neonatal care through continual learning, an international multicentre study","url":"https://doi.org/10.1038/s41551-026-01812-6","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-13-neonatal-radiograph-continual-learning"},{"id":"2026-10-12-ai-retinopathy-screening-tanzania-rct","title":"Randomised trial of AI-supported diabetic retinopathy screening in Tanzania","claim":"In a randomised trial at 24 Tanzanian hospitals, giving people an AI screening result during the visit with face-to-face counselling roughly doubled the share of those with genuinely referable diabetic retinopathy who reached the referral eye clinic within eight weeks, from 18.2% to 35.9%.","field":"medicine","date":"2026-10-12","added":"2026-10-22","lab":"London School of Hygiene and Tropical Medicine / Kilimanjaro Christian Medical Centre","model":"Unknown","verification":"peer-reviewed","autonomy":"ai-led","tags":["rct","prospective","diabetic-retinopathy","screening","low-resource-setting"],"humans":["Charles R Cleland","Matthew J Burton"],"sources":[{"label":"The Lancet Global Health: Artificial intelligence-supported diabetic retinopathy screening in Tanzania, a randomised controlled trial","url":"https://doi.org/10.1016/j.langlo.2026.104062","kind":"research"},{"label":"BMJ Open: trial rationale and design (protocol, 2024)","url":"https://doi.org/10.1136/bmjopen-2023-075055","kind":"research"},{"label":"LSHTM: AI screening helps more people with diabetes access sight-saving eye care","url":"https://www.lshtm.ac.uk/newsevents/news/2026/ai-screening-helps-more-people-diabetes-access-sight-saving-eye-care","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-10-12-ai-retinopathy-screening-tanzania-rct"},{"id":"2026-10-12-dedekind-zeta-quasi-riemann","title":"No zeros of any Dedekind zeta function with real part above 31/32, machine-checked in Lean","claim":"A Lean-formalized proof generated by Axiom Math's AxiomProver under two investigators' direction shows that for every number field \\(K\\) the Dedekind zeta function \\(\\zeta_K(s)\\) has no zeros with \\(\\Re s > 31/32\\).","field":"mathematics","date":"2026-10-12","added":"2026-10-16","lab":"Axiom Math","model":"AxiomProver","verification":"formal","autonomy":"collaborative","tags":["number-theory","analytic-number-theory","zero-free-regions","lean","formalization","argument"],"humans":["Dean Cureton","Jesse Thorner"],"sources":[{"label":"Hexagon: Cureton and Thorner, A quasi-Riemann hypothesis for Dedekind zeta functions","url":"https://hexagonmath.org/2610.00200v2","kind":"research"},{"label":"GitHub: AxiomMath/DedekindZetaZeroFree, the Lean formalization","url":"https://github.com/AxiomMath/DedekindZetaZeroFree","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-13-000010","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-13-000010&version=2","repository":"AxiomMath/DedekindZetaZeroFree","commit":"09afbb4ce6570c1615d58509dc197fc9f0956b7d","theorems":["DedekindZetaZeroFree.main","DedekindZetaZeroFree.heckeCorollary"],"checked":"2026-10-14","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice."}],"url":"https://whataifound.org/finding/2026-10-12-dedekind-zeta-quasi-riemann"},{"id":"2026-10-12-matmul-3x3-rank-21","title":"Lower bound of 21 multiplications for 3×3 matrix multiplication over every field, with a Lean proof","claim":"Andrey Ivanov, working with OpenAI models through ChatGPT and Codex, claims that every exact bilinear algorithm for multiplying two \\(3 \\times 3\\) matrices over any field uses at least 21 multiplications, with a Palomar-registered Lean proof, which would raise the bound that holds over every field from Bläser's 19 of 2003.","field":"computer-science","date":"2026-10-12","added":"2026-10-16","lab":"Independent","model":"OpenAI models through ChatGPT and Codex, versions not recorded in the repository (GPT-6 Astra and GPT-6 Sol by the author's later account to vibemathed)","verification":"claimed","autonomy":"collaborative","tags":["algorithms","matrix-multiplication","tensor-rank","lower-bounds","lean","formalization","argument"],"humans":["Andrey Ivanov"],"sources":[{"label":"GitHub: AIV5/mmrank21, the Lean proof","url":"https://github.com/AIV5/mmrank21","kind":"research"},{"label":"Zenodo: archived release 0.1.1","url":"https://doi.org/10.5281/zenodo.23324839","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-13-000009","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-13-000009&version=1","repository":"AIV5/mmrank21","commit":"cb1557b7ea80ea66fae4714628663d8c1df7a48d","theorems":["MMRank.Palomar.lower_bound"],"checked":"2026-10-13","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice."},{"registry":"vibemathed","id":"a-lower-bound-of-21-for-3-3-matrix-multiplication-over-every-field","url":"https://vibemathed.com/problem/a-lower-bound-of-21-for-3-3-matrix-multiplication-over-every-field"}],"url":"https://whataifound.org/finding/2026-10-12-matmul-3x3-rank-21"},{"id":"2026-10-09-ai-cds-postoperative-delirium-rct","title":"Pragmatic randomised trial of AI-triggered decision support for postoperative delirium finds no effect","claim":"In a pragmatic trial embedded in routine care at Mount Sinai, 7,294 surgical patients flagged as cognitively impaired by a natural-language-processing model, test scores or diagnosis codes were randomised to a non-interruptive decision-support nudge for anaesthesia teams or usual care, with no difference in postoperative delirium (35.1% against 32.7%, P = 0.37) or in adherence to 12 best practices, though fewer than one in five patients were ever assessed for delirium.","field":"medicine","date":"2026-10-09","added":"2026-10-20","lab":"Icahn School of Medicine at Mount Sinai","model":"Natural-language-processing model for cognitive impairment in health records, not named in the abstract","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["delirium","perioperative","clinical-decision-support","natural-language-processing","rct","prospective","real-world-data"],"humans":["Danielle Scharp","Ira Hofer"],"sources":[{"label":"Anesthesia & Analgesia: AI-driven clinical decision support for postoperative delirium prevention, a pragmatic randomized controlled trial","url":"https://doi.org/10.1213/ane.0000000000008318","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT05777187","url":"https://clinicaltrials.gov/study/NCT05777187","title":"Integration of Machine Learning and Clinical Decision Support to Prevent Postoperative Delirium in Patients With Cognitive Impairment"}],"url":"https://whataifound.org/finding/2026-10-09-ai-cds-postoperative-delirium-rct"},{"id":"2026-10-09-link-hf2-wearable-monitoring-rct","title":"Randomised trial of AI wearable monitoring after heart-failure discharge finds no fall in rehospitalisation (LINK-HF2)","claim":"In a randomised trial of 171 veterans discharged after a heart-failure admission at five VA medical centres, alerts from a personalised AI model reading a wearable patch, routed to clinicians with a response algorithm, were feasible but did not reduce heart-failure rehospitalisation (16.3% against 18.7%, hazard ratio 0.90, 95% CI 0.43 to 1.84) or a composite of rehospitalisation, emergency visits and death.","field":"medicine","date":"2026-10-09","added":"2026-10-20","lab":"US Department of Veterans Affairs / University of Utah","model":"Personalised similarity-based anomaly model on wearable multisensor data, not named in the abstract","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["heart-failure","remote-monitoring","wearables","rct","prospective"],"humans":["Konstantinos Sideris","Josef Stehlik"],"sources":[{"label":"JACC: Heart Failure: AI-enabled detection and management of physiological instability in heart failure, the LINK-HF2 trial","url":"https://doi.org/10.1016/j.jchf.2026.103422","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT04502563","url":"https://clinicaltrials.gov/study/NCT04502563","title":"Continuous Wearable Monitoring Analytics to Improve Outcomes in Heart Failure (LINK-HF2)"}],"url":"https://whataifound.org/finding/2026-10-09-link-hf2-wearable-monitoring-rct"},{"id":"2026-10-09-polya-simply-connected","title":"Strict Pólya inequalities claimed for simply connected planar domains, Dirichlet and Neumann, with Lean formalizations","claim":"Quanyu Tang and Zuoqin Wang, working with ChatGPT, claim Pólya's 1954 eigenvalue conjecture in strict form for the Dirichlet Laplacian on every bounded simply connected planar domain and for the Neumann Laplacian on every bounded simply connected planar Lipschitz domain, with Palomar-registered Lean formalizations of both.","field":"mathematics","date":"2026-10-09","added":"2026-10-16","lab":"Independent","model":"ChatGPT for the mathematics, version not stated; Aristotle (Harmonic) and Codex for the Lean","verification":"claimed","autonomy":"ai-assisted","tags":["spectral-geometry","eigenvalues","pde","lean","formalization","argument"],"humans":["Quanyu Tang","Zuoqin Wang"],"year_posed":1954,"sources":[{"label":"arXiv: Tang and Wang, Strict Dirichlet Pólya Inequality for Simply Connected Planar Domains","url":"https://arxiv.org/abs/2610.13139","kind":"research"},{"label":"GitHub: the Lean formalization of the Dirichlet result","url":"https://github.com/QuanyuTang/polya-dirichlet-simply-connected-formalization-Palomar-version","kind":"research"},{"label":"GitHub: the Lean formalization of the Neumann result, with the draft manuscript","url":"https://github.com/QuanyuTang/polya-neumann-simply-connected-formalization-Palomar-version-v2","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-09-000003","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-09-000003&version=1","repository":"QuanyuTang/polya-dirichlet-simply-connected-formalization-Palomar-version","commit":"ba3690bfd48618cf48da07fa4555382bd9852ff3","theorems":["PalomarDirichlet.main_result"],"checked":"2026-10-09","note":"The Dirichlet result. Permitted axioms are exactly propext, Quot.sound and Classical.choice."},{"registry":"palomar","id":"PALOMAR-2026-10-09-000007","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-09-000007&version=1","repository":"QuanyuTang/polya-neumann-simply-connected-formalization-Palomar-version-v2","commit":"f07f1c7051862ba146429db6eda5dc4e8b020f74","theorems":["PalomarPolyaNeumann.strict_neumann_polya","PalomarPolyaNeumann.strict_neumann_polya_count"],"checked":"2026-10-09","note":"The Neumann result, for Lipschitz domains. Permitted axioms are exactly propext, Quot.sound and Classical.choice."},{"registry":"mathdb","id":"383222","title":"Pólya's conjecture","url":"https://mathdb.com/p/383222/polya-s-conjecture"},{"registry":"vibemathed","id":"strict-dirichlet-polya-inequality-on-simply-connected-planar-domains","url":"https://vibemathed.com/problem/strict-dirichlet-polya-inequality-on-simply-connected-planar-domains"},{"registry":"vibemathed","id":"strict-neumann-polya-inequality-on-simply-connected-planar-lipschitz-domains","url":"https://vibemathed.com/problem/strict-neumann-polya-inequality-on-simply-connected-planar-lipschitz-domains"}],"url":"https://whataifound.org/finding/2026-10-09-polya-simply-connected"},{"id":"2026-10-08-amie-primary-care-feasibility","title":"AMIE with real patients before urgent primary care visits: a prospective feasibility study","claim":"In a single-arm study at Beth Israel Deaconess Medical Center, 98 patients completed a text conversation with Google's AMIE in the five days before an urgent primary care visit, under live physician supervision; no conversation needed a safety stop under prespecified criteria, supervisors noted one hallucination, and physicians found the transcript helpful for preparation in 33 of the 44 cases where they reviewed it.","field":"medicine","date":"2026-10-08","added":"2026-10-16","lab":"Google / Beth Israel Deaconess Medical Center","model":"AMIE (Articulate Medical Intelligence Explorer)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["large-language-model","conversational-ai","primary-care","prospective"],"humans":["Peter G. Brodeur","Alan Karthikesalingam","Adam Rodman"],"sources":[{"label":"The Lancet: Conversational diagnostic AI in ambulatory primary care, a prospective feasibility study","url":"https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(26)01535-7/fulltext","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06911398","url":"https://clinicaltrials.gov/study/NCT06911398"}],"url":"https://whataifound.org/finding/2026-10-08-amie-primary-care-feasibility"},{"id":"2026-10-08-lambert-series-nonquadraticity","title":"Lambert series values, including the Erdős-Borwein constant, are not quadratic irrationals","claim":"A self-published paper with a Lean formalization claims that \\(F(q) = \\sum_{n \\ge 1} 1/(q^n - 1)\\) is neither rational nor quadratic irrational for every integer \\(q \\ge 2\\), the Erdős-Borwein constant \\(F(2)\\) included, and widens the region where \\(F(a/b)\\) is known to be irrational from \\(\\log b/\\log a < 0.405683\\) to \\(\\log b/\\log a < 0.5728\\), with generative AI credited with nearly all of the mathematics.","field":"mathematics","date":"2026-10-08","added":"2026-10-20","lab":"Independent","model":"Generative AI, not named in the repository","verification":"claimed","autonomy":"ai-led","tags":["number-theory","irrationality","erdos-problems","lean","argument"],"humans":["Costa Lambrinoudis"],"sources":[{"label":"GitHub: clambro/lambert-nonquadraticity, paper, Lean formalization and AI disclosure","url":"https://github.com/clambro/lambert-nonquadraticity","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"nonquadraticity-of-lambert-series-values-and-improved-bounds-for-erdos-problem-1","url":"https://vibemathed.com/problem/nonquadraticity-of-lambert-series-values-and-improved-bounds-for-erdos-problem-1"}],"url":"https://whataifound.org/finding/2026-10-08-lambert-series-nonquadraticity"},{"id":"2026-10-07-conversational-ai-subverts-clinical-judgment","title":"Physicians steered by a covertly adversarial chatbot made harmful decisions at 49% of targeted points, against 2% with an aligned one","claim":"In a participant-blinded randomised experiment, 225 neurocritical-care physicians from 42 countries worked through anonymised real cases with a chatbot covertly instructed to steer them either toward predefined harmful options or toward correct ones; the adversarial version raised harmful decisions from 2% to 49% of targeted decision points and cut correct ones from 83% to 25%, and only two physicians reported suspecting manipulation.","field":"medicine","date":"2026-10-07","added":"2026-10-20","lab":"University of California, San Francisco / Université Libre de Bruxelles","model":"DeepSeek V4 Flash","verification":"claimed","autonomy":"ai-assisted","tags":["large-language-model","conversational-ai","ai-safety","neurocritical-care","simulated-patients"],"humans":["Sami Barrit","Fabio Silvio Taccone","Edward F. Chang"],"sources":[{"label":"medRxiv: Subversion of clinical judgment by conversational artificial intelligence (preprint)","url":"https://doi.org/10.64898/2026.10.05.26364541","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-07-conversational-ai-subverts-clinical-judgment"},{"id":"2026-10-07-matmul-exponent-2371045","title":"Matrix multiplication exponent below 2.3710449, machine-checked over every commutative ring","claim":"A Lean development produced largely by AI systems under two researchers' direction proves that the matrix multiplication exponent is below 2.3710449 over every commutative ring, improving DeepMind's 2.371177 of August 2026 by sharing extraction across recursion levels of the laser method.","field":"computer-science","date":"2026-10-07","added":"2026-10-12","lab":"Independent","model":"GPT-6 Astra, Claude Fable 5.1, Claude Opus 5 and Opus 5.5; Meta Muse Spark 1.3 for the final numerical search","verification":"formal","autonomy":"ai-led","tags":["algorithms","matrix-multiplication","complexity","lean","formalization","computation"],"humans":["Oliver Proudfoot","Andrew Perrault"],"year_posed":1969,"sources":[{"label":"GitHub: olliepro/LeanMMBound, the Lean development and paper","url":"https://github.com/olliepro/LeanMMBound","kind":"research"},{"label":"Oliver Proudfoot: Pocket-Sized Super Mathematical Intelligence","url":"https://oliverproudfoot.substack.com/p/pocket-sized-super-mathematical-intelligence","kind":"announcement"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-07-000007","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-07-000007&version=1","repository":"olliepro/LeanMMBound","commit":"93492a4dd1ee90fd98cd7b339af77bb8bbc8be55","theorems":["MatrixBounds.Numeric.SuppliedCertifiedPipeline.exponent_lt"],"checked":"2026-10-07"}],"url":"https://whataifound.org/finding/2026-10-07-matmul-exponent-2371045"},{"id":"2026-10-07-skiving-stock-round-down","title":"Counterexamples to Zak's modified integer round-down conjecture for the skiving stock problem","claim":"A self-published paper claims that the additive integrality gap of the skiving stock (bin covering) problem's pattern LP relaxations is unbounded, refuting Zak's 2003 conjecture that it always stays below two, by transferring OpenAI's unrefereed bin-packing construction; it states that the proof was generated by Claude Fable 5.1 and GPT-5.6 Sol Pro.","field":"computer-science","date":"2026-10-07","added":"2026-10-20","lab":"Independent","model":"Claude Fable 5.1 and GPT-5.6 Sol Pro","verification":"claimed","autonomy":"collaborative","tags":["combinatorial-optimization","bin-covering","integrality-gap","computational-complexity","construction"],"humans":["Eric Winnington"],"year_posed":2003,"sources":[{"label":"Unbounded integrality gaps and additive hardness for the skiving stock problem (PDF)","url":"https://github.com/ewinnington/math/blob/main/MIRDP/skiving_stock_integrality_gaps.pdf","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"zak-s-modified-integer-round-down-conjecture","url":"https://vibemathed.com/problem/zak-s-modified-integer-round-down-conjecture"}],"url":"https://whataifound.org/finding/2026-10-07-skiving-stock-round-down"},{"id":"2026-10-06-artin-primitive-root","title":"Artin's primitive root conjecture: infinitely many primes for every admissible base","claim":"An OpenAI manuscript claims that every integer other than \\(-1\\) and the perfect squares is a primitive root modulo infinitely many primes, the qualitative half of Artin's 1927 conjecture, which until now was known unconditionally for no single prescribed base.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["number-theory","analytic-number-theory","primitive-roots","argument"],"year_posed":1927,"sources":[{"label":"Primitive roots for every admissible integer base (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/primitive-roots-all-integer-bases.pdf","kind":"research"},{"label":"Simultaneous primitive roots: a conditional lower bound for prime bases (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Simultaneous-primitive-roots-a-conditional-lower-bound-for-prime-bases-October-4-2026/simultaneous-primitive-roots-conditional-lower-bound-prime-bases.pdf","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Scientific American: The most exciting claims from OpenAI's heap of new proofs","url":"https://www.scientificamerican.com/article/the-most-exciting-claims-from-openais-heap-of-new-proofs/","kind":"coverage"}],"registrations":[{"registry":"mathdb","id":"370026","title":"Artin's primitive root conjecture","url":"https://mathdb.com/p/370026/artin-s-primitive-root-conjecture"},{"registry":"vibemathed","id":"artin-primitive-root-infinitude","url":"https://vibemathed.com/problem/artin-primitive-root-infinitude"}],"url":"https://whataifound.org/finding/2026-10-06-artin-primitive-root"},{"id":"2026-10-06-barnette-conjecture","title":"Proof of Barnette's conjecture on Hamiltonian cycles in cubic bipartite planar graphs","claim":"An OpenAI manuscript claims that every cubic, bipartite, planar, 3-connected graph has a Hamiltonian cycle, proving a conjecture recorded in 1969, with a Lean formalization of the full statement attached.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["graph-theory","hamiltonian-cycles","planar-graphs","lean","argument"],"year_posed":1969,"sources":[{"label":"Paired states and Hamiltonian cycles in cubic bipartite planar graphs (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Paired-states-and-Hamiltonian-cycles-in-cubic-bipartite-planar-graphs-September-24-2026/paper.pdf","kind":"research"},{"label":"GitHub: openai/math Lean scope for this family","url":"https://github.com/openai/math/blob/main/lean/docs/180.md","kind":"research"},{"label":"GitHub: openai/math formalization catalogue, review status unchecked","url":"https://github.com/openai/math/blob/main/lean/formalization.yaml","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"}],"registrations":[{"registry":"mathdb","id":"316016","title":"Barnette's conjecture","url":"https://mathdb.com/p/316016/barnette-s-conjecture"},{"registry":"vibemathed","id":"barnette-conjecture","url":"https://vibemathed.com/problem/barnette-conjecture"}],"url":"https://whataifound.org/finding/2026-10-06-barnette-conjecture"},{"id":"2026-10-06-borel-conjecture-four-manifolds","title":"Counterexample to the Borel conjecture in dimension four","claim":"An OpenAI manuscript constructs two closed aspherical topological four-manifolds that are homotopy equivalent but not homeomorphic, which would disprove the four-dimensional case of the Borel conjecture even in the weak form Borel first raised in a 1953 letter to Serre.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["topology","four-manifolds","geometric-group-theory","construction"],"year_posed":1953,"sources":[{"label":"Nonhomeomorphic closed aspherical four-manifolds with the same homotopy type (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Nonhomeomorphic-closed-aspherical-four-manifolds-with-the-same-homotopy-type-October-4-2026/paper.pdf","kind":"research"},{"label":"A marked tensor obstruction to four-dimensional disk embedding (PDF), a companion this result depends on","url":"https://github.com/openai/math/blob/main/preprints/A-marked-tensor-obstruction-to-four-dimensional-disk-embedding-September-24-2026/paper.pdf","kind":"research"},{"label":"A PD4 group without an aspherical manifold model (PDF), a companion this result depends on","url":"https://github.com/openai/math/blob/main/preprints/A-PD4-group-without-an-aspherical-manifold-model-September-24-2026/paper.pdf","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"}],"registrations":[{"registry":"mathdb","id":"316143","title":"Borel conjecture","url":"https://mathdb.com/p/316143/borel-conjecture"},{"registry":"vibemathed","id":"borel-conjecture-dimension-four","url":"https://vibemathed.com/problem/borel-conjecture-dimension-four"}],"url":"https://whataifound.org/finding/2026-10-06-borel-conjecture-four-manifolds"},{"id":"2026-10-06-hyperinvariant-subspace-problem","title":"Negative answer to the hyperinvariant subspace problem on Hilbert space","claim":"An OpenAI manuscript constructs, on every infinite-dimensional separable complex Hilbert space, a nonzero quasinilpotent operator with no nontrivial closed subspace invariant under every operator commuting with it, answering the hyperinvariant subspace problem in the negative, with a Lean formalization of the statement attached.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["operator-theory","functional-analysis","invariant-subspaces","lean","construction"],"sources":[{"label":"Backward intertwiners and a transitive commutant (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Backward-intertwiners-and-a-transitive-commutant-September-27-2026/paper.pdf","kind":"research"},{"label":"Invariant-projection counterexamples for every irrational rotation (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Invariant-projection-counterexamples-for-every-irrational-rotation-September-27-2026/paper.pdf","kind":"research"},{"label":"GitHub: openai/math Lean scope for this family","url":"https://github.com/openai/math/blob/main/lean/docs/293.md","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"hyperinvariant-subspace-problem-hilbert-space","url":"https://vibemathed.com/problem/hyperinvariant-subspace-problem-hilbert-space"}],"url":"https://whataifound.org/finding/2026-10-06-hyperinvariant-subspace-problem"},{"id":"2026-10-06-integer-multiplication-below-n-log-n","title":"Integer multiplication below n log n, against the Schönhage–Strassen optimality conjecture","claim":"An OpenAI manuscript gives a deterministic algorithm that multiplies two \\(n\\)-bit integers in time \\(O(n (\\log n)^{1-\\kappa})\\) with \\(\\kappa = 2^{-182}\\) on a multitape Turing machine, which would beat the \\(O(n \\log n)\\) algorithm of Harvey and van der Hoeven and disprove Schönhage and Strassen's 1971 conjecture that \\(n \\log n\\) is optimal; David Harvey calls the claim plausible but says he has not checked it.","field":"computer-science","date":"2026-10-06","added":"2026-10-29","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["algorithms","complexity","integer-multiplication","argument"],"year_posed":1971,"sources":[{"label":"OpenAI: Integer multiplication below n log n (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Integer-multiplication-below-n-log-n-September-23-2026/paper.pdf","kind":"research"},{"label":"David Harvey: On the recently proposed o(n log n) integer multiplication algorithm (PDF)","url":"https://web.maths.unsw.edu.au/~davidharvey/research/subnlogn.pdf","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-10-06-integer-multiplication-below-n-log-n"},{"id":"2026-10-06-kakeya-3d-maximal-4d","title":"Kakeya maximal conjecture in three dimensions and the Kakeya set conjecture in four","claim":"Two manuscripts claim that every set in four-dimensional space containing a unit segment in every direction has full Hausdorff dimension, and that the Kakeya maximal function estimate holds in three dimensions, extending Wang and Zahl's 2025 resolution of the three-dimensional set conjecture.","field":"mathematics","date":"2026-10-06","added":"2026-10-07","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["harmonic-analysis","kakeya","geometric-measure-theory","argument"],"sources":[{"label":"Every four-dimensional Kakeya set has full Hausdorff dimension (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Every-four-dimensional-Kakeya-set-has-full-Hausdorff-dimension-September-24-2026/paper.pdf","kind":"research"},{"label":"The Kakeya maximal conjecture in three dimensions (PDF)","url":"https://github.com/openai/math/blob/main/preprints/The-Kakeya-maximal-conjecture-in-three-dimensions-September-23-2026/paper.pdf","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Scientific American: OpenAI unleashes hundreds more math results upon a field already in shock","url":"https://www.scientificamerican.com/article/openai-unleashes-hundreds-more-math-results-upon-a-field-already-in-shock/","kind":"coverage"}],"registrations":[{"registry":"vibemathed","id":"kakeya-maximal-conjecture-r3","url":"https://vibemathed.com/problem/kakeya-maximal-conjecture-r3","title":"The Kakeya maximal conjecture in three dimensions","note":"Covers the three-dimensional maximal half of this entry only, recorded there as unreviewed; vibemathed keeps the four-dimensional set result as a separate record."},{"registry":"mathdb","id":"367525","title":"The maximal Kakeya conjecture","url":"https://mathdb.com/p/367525/the-maximal-kakeya-conjecture"}],"url":"https://whataifound.org/finding/2026-10-06-kakeya-3d-maximal-4d"},{"id":"2026-10-06-matmul-exponent-nine-fourths","title":"Matrix multiplication exponent bounded by 9/4","claim":"An OpenAI manuscript proves that two \\(n \\times n\\) complex matrices can be multiplied with \\(O(n^{9/4+\\varepsilon})\\) arithmetic operations, lowering the best bound on the matrix multiplication exponent from 2.371177 to 2.25, with a Lean proof that two outside researchers rebuilt and extended to every field within two days.","field":"computer-science","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"formal","autonomy":"ai-led","tags":["algorithms","matrix-multiplication","complexity","tensors","lean","argument"],"year_posed":1969,"sources":[{"label":"An Upper Bound of 9/4 for the Matrix Multiplication Exponent (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Matrix-Multiplication-Nine-Fourths-October-2-2026/paper.pdf","kind":"research"},{"label":"GitHub: openai/math Lean scope for this family","url":"https://github.com/openai/math/blob/main/lean/docs/107.md","kind":"research"},{"label":"GitHub: jzuiddam/omega-nine-quarters-all-fields, the bound over every field","url":"https://github.com/jzuiddam/omega-nine-quarters-all-fields","kind":"research"},{"label":"GitHub: selanavot/matrix-multiplication-all-fields","url":"https://github.com/selanavot/matrix-multiplication-all-fields","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Scientific American: The most exciting claims from OpenAI's heap of new proofs","url":"https://www.scientificamerican.com/article/the-most-exciting-claims-from-openais-heap-of-new-proofs/","kind":"coverage"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-08-000005","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-08-000005&version=1","title":"Matrix multiplication exponent at most 9/4 over arbitrary fields","repository":"selanavot/matrix-multiplication-all-fields","commit":"8375e73ed454e3128500d10d87480c5dd597ff03","theorems":["ComparatorChecks.omega_bound","ComparatorChecks.admissible_bddBelow","ComparatorChecks.admissible_nonempty","ComparatorChecks.omega_lower","ComparatorChecks.epsilon_cost","ComparatorChecks.exact_coefficients"],"checked":"2026-10-08","note":"A derived work extending OpenAI's proof from the complex numbers to every field; the complex bound is a specialization."},{"registry":"palomar","id":"PALOMAR-2026-10-11-000007","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-11-000007&version=1","title":"Matrix multiplication: omega at most 9/4 over every ring","repository":"selanavot/omega_le_nine_quarters_all_rings","commit":"9d10116c89f9bdcdaccd58aacea353d4b7ae6e90","theorems":["ComparatorChecks.omega_bound","ComparatorChecks.admissible_bddBelow","ComparatorChecks.admissible_nonempty","ComparatorChecks.omega_lower","ComparatorChecks.epsilon_cost","ComparatorChecks.exact_coefficients"],"checked":"2026-10-11","note":"The same author's further extension to every ring."},{"registry":"vibemathed","id":"matrix-multiplication-exponent-9-4","url":"https://vibemathed.com/problem/matrix-multiplication-exponent-9-4"}],"url":"https://whataifound.org/finding/2026-10-06-matmul-exponent-nine-fourths"},{"id":"2026-10-06-modularity-imaginary-quadratic","title":"Modularity of every elliptic curve over every imaginary quadratic field","claim":"An OpenAI manuscript claims that every elliptic curve over every imaginary quadratic field is modular, with the expected local parameters at every place, removing the restrictions on the curve and the field left by Caraiani and Newton's theorem.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["number-theory","langlands-program","elliptic-curves","argument"],"sources":[{"label":"Modularity of elliptic curves over imaginary quadratic fields (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Modularity-of-elliptic-curves-over-imaginary-quadratic-fields-October-4-2026/paper.pdf","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"modularity-elliptic-curves-imaginary-quadratic","url":"https://vibemathed.com/problem/modularity-elliptic-curves-imaginary-quadratic"}],"url":"https://whataifound.org/finding/2026-10-06-modularity-imaginary-quadratic"},{"id":"2026-10-06-o3-model-mass-gap","title":"Massive continuum limit of the two-dimensional O(3) model","claim":"OpenAI manuscripts claim to construct the continuum limit of the two-dimensional O(3) sigma model as an interacting relativistic quantum field theory with a unique vacuum and a positive mass gap, the long-standing simpler analogue of the Yang-Mills mass gap problem, and to prove exponential decay of correlations in the classical O(n) models for n at least 3 at every temperature.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["mathematical-physics","quantum-field-theory","statistical-mechanics","mass-gap","argument"],"sources":[{"label":"The canonical massive continuum limit of the two-dimensional O(3) model (PDF)","url":"https://github.com/openai/math/blob/main/preprints/The-canonical-massive-continuum-limit-of-the-two-dimensional-O3-model-October-4-2026/massive-continuum-o3.pdf","kind":"research"},{"label":"An Isolated Particle Pole for the Two-Dimensional O(3) Spin Field (PDF)","url":"https://github.com/openai/math/blob/main/preprints/An-Isolated-Particle-Pole-for-the-Two-Dimensional-O3-Spin-Field-October-4-2026/o3-particle-pole.pdf","kind":"research"},{"label":"Exponential decay in two-dimensional classical O(n) models (PDF), the formalized part","url":"https://github.com/openai/math/blob/main/preprints/Exponential-decay-in-two-dimensional-classical-On-models-September-23-2026/paper.pdf","kind":"research"},{"label":"GitHub: openai/math Lean scope for this family","url":"https://github.com/openai/math/blob/main/lean/docs/215.md","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Scientific American: The most exciting claims from OpenAI's heap of new proofs","url":"https://www.scientificamerican.com/article/the-most-exciting-claims-from-openais-heap-of-new-proofs/","kind":"coverage"}],"registrations":[{"registry":"vibemathed","id":"o3-sigma-model-continuum-limit-mass-gap","url":"https://vibemathed.com/problem/o3-sigma-model-continuum-limit-mass-gap"}],"url":"https://whataifound.org/finding/2026-10-06-o3-model-mass-gap"},{"id":"2026-10-06-openai-math-collection","title":"719 manuscripts in 372 result families from an unreleased OpenAI model","claim":"OpenAI published 722 manuscripts, 719 after three were withdrawn the next day, grouped into 372 claimed results across number theory, algebraic geometry, analysis, combinatorics, theoretical computer science and mathematical physics, all produced by an unreleased internal model, with Lean formalizations initially attached to 235 of the families; this entry's 2026-10-07 assessment recorded no outside checks, and later external checker reports are described below.","field":"mathematics","date":"2026-10-06","added":"2026-10-07","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["lean","formalization","argument","number-theory","complexity-theory"],"sources":[{"label":"GitHub: openai/math, the 722 manuscripts, Lean library and reasoning summaries","url":"https://github.com/openai/math","kind":"research"},{"label":"GitHub: openai/math formalization catalogue, review status unchecked","url":"https://github.com/openai/math/blob/main/lean/formalization.yaml","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Advisory Group on Mathematics and AI: recommendations of 2026-09-29","url":"https://agmai.org/general-sep29/","kind":"commentary"},{"label":"Scientific American: OpenAI unleashes hundreds more math results upon a field already in shock","url":"https://www.scientificamerican.com/article/openai-unleashes-hundreds-more-math-results-upon-a-field-already-in-shock/","kind":"coverage"},{"label":"The Decoder: OpenAI dumps 372 AI-generated math proofs on GitHub","url":"https://the-decoder.com/openai-dumps-372-ai-generated-math-proofs-on-github-telling-the-academic-world-to-keep-up/","kind":"coverage"},{"label":"GitHub: openai/math history, three manuscripts withdrawn on 2026-10-07","url":"https://github.com/openai/math/blob/main/history.md","kind":"announcement"},{"label":"MathVet: model-assisted, pre-referee protocol (pinned 2026-10-22)","url":"https://github.com/mathvet/mathvet/blob/8c4a1593acc3374a5cd23ca78bfe1f00d0e1b77b/PROTOCOL.md","kind":"research"},{"label":"MathVet: per-challenge Comparator records (pinned 2026-10-22)","url":"https://github.com/mathvet/mathvet/blob/8c4a1593acc3374a5cd23ca78bfe1f00d0e1b77b/reviews/openai-math/challenge-status.csv","kind":"research"},{"label":"Carlos Toledo, cert-machine: kernel audit of OpenAI mathematics (pinned 2026-10-22)","url":"https://github.com/carlostoledo1891/cert-machine/blob/341b738c618319bd392dd66d84812153659f8655/certs/openai-math-kernel.json","kind":"research"},{"label":"Carlos Toledo, cert-machine: family-level statement readings (pinned 2026-10-22)","url":"https://github.com/carlostoledo1891/cert-machine/blob/341b738c618319bd392dd66d84812153659f8655/certs/openai-math-statements.json","kind":"research"},{"label":"MathVet: AbhyankarSathaye Comparator output and OpenAI revision (2026-10-08, pinned report)","url":"https://github.com/mathvet/mathvet/blob/8c4a1593acc3374a5cd23ca78bfe1f00d0e1b77b/reviews/openai-math/evidence/cloud/AbhyankarSathaye.comparator.txt","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-06-openai-math-collection"},{"id":"2026-10-06-periodic-spin-one-haldane-gap","title":"Computer-assisted proof of a uniform spectral gap for the spin-1 Heisenberg chain on even periodic rings","claim":"A manuscript in OpenAI's October 2026 mathematics release proves that the spin-1 antiferromagnetic Heisenberg chain on even periodic rings has a unique ground state and a spectral gap above \\((\\log 20)/784 \\approx 0.0038\\) for every even length \\(L \\ge 2304\\), the periodic formulation of Haldane's 1983 conjecture, by combining an analytic thermal-purity argument with certified finite computations.","field":"physics","date":"2026-10-06","added":"2026-11-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["argument","spin-chains","haldane-gap","computer-assisted-proof","openai-math"],"year_posed":1983,"sources":[{"label":"OpenAI: The periodic spin-one Haldane gap (PDF)","url":"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-periodic-spin-one-Haldane-gap-September-24-2026/paper.pdf","kind":"research"},{"label":"OpenAI: finite verifier and computations for the periodic Haldane gap","url":"https://github.com/openai/math/tree/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-periodic-spin-one-Haldane-gap-September-24-2026/verification","kind":"research"},{"label":"OpenAI: A boundary-field gap for the spin-one Heisenberg chain (PDF)","url":"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-boundary-field-gap-for-the-spin-one-Heisenberg-chain-September-24-2026/paper.pdf","kind":"research"},{"label":"Tasaki: OpenAI's proof of the Haldane gap in the S = 1 antiferromagnetic Heisenberg chain","url":"https://haltasaki.github.io/writings/AI/OpenAI_Haldane.html","kind":"commentary"},{"label":"arXiv: Lu, Bridging gaps with tensor networks, from the Haldane gap and beyond","url":"https://arxiv.org/abs/2611.11049","kind":"commentary"},{"label":"arXiv: Tasaki, uniqueness of translation-invariant ground states of the S=1 Heisenberg and J-D chains","url":"https://arxiv.org/abs/2610.34330","kind":"commentary"},{"label":"arXiv: Grover, Extensions of the Haldane gap proof","url":"https://arxiv.org/abs/2611.07400","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-10-06-periodic-spin-one-haldane-gap"},{"id":"2026-10-06-quasi-riemann-hypothesis","title":"Quasi-Riemann hypothesis: no zeros of zeta or any Dirichlet L-function with real part above 7/8","claim":"A Lean-formalized proof that neither the Riemann zeta function nor any Dirichlet L-function has a zero with real part greater than 7/8, the first fixed zero-free half-plane short of the line where real part equals 1, which also rules out Landau-Siegel zeros but leaves the Riemann hypothesis itself open.","field":"mathematics","date":"2026-10-06","added":"2026-10-07","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"collaborative","tags":["number-theory","riemann-zeta","l-functions","lean","formalization","argument"],"year_posed":1859,"sources":[{"label":"The Quasi-Riemann Hypothesis: a zero-free half-plane Re(s) > 7/8 (PDF)","url":"https://github.com/openai/math/blob/main/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf","kind":"research"},{"label":"Uniform exclusion of Landau-Siegel zeros (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Uniform-exclusion-of-Landau-Siegel-zeros-October-1-2026/paper.pdf","kind":"research"},{"label":"The Quasi-Riemann Hypothesis, alternate 11/12 proof (PDF)","url":"https://github.com/openai/math/blob/main/preprints/The-Quasi-Riemann-Hypothesis-October-5-2026/paper2.pdf","kind":"research"},{"label":"Lean scope note and Comparator links for family 003","url":"https://github.com/openai/math/blob/main/lean/docs/003.md","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"Scientific American: OpenAI unleashes hundreds more math results upon a field already in shock","url":"https://www.scientificamerican.com/article/openai-unleashes-hundreds-more-math-results-upon-a-field-already-in-shock/","kind":"coverage"},{"label":"Terence Tao: A sketch of the proof of non-existence of Siegel zeroes","url":"https://terrytao.wordpress.com/2026/10/19/a-sketch-of-the-proof-of-non-existence-of-siegel-zeroes/","kind":"commentary"},{"label":"Quanta Magazine: AI Proved the Quasi-Riemann Hypothesis. What Happens Now?","url":"https://www.quantamagazine.org/ai-proved-the-quasi-riemann-hypothesis-what-happens-now-20261019/","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-10-06-quasi-riemann-hypothesis"},{"id":"2026-10-06-shelah-eventual-categoricity","title":"Shelah's eventual categoricity conjecture for abstract elementary classes","claim":"An OpenAI manuscript claims a ZFC proof of Shelah's eventual categoricity conjecture, that an abstract elementary class categorical in one sufficiently large cardinal is categorical in every larger one, a statement for which Christian Espíndola has had a claimed ZFC proof posted since 2019.","field":"mathematics","date":"2026-10-06","added":"2026-10-12","lab":"OpenAI","model":"Unreleased internal OpenAI model, not named in the release","verification":"claimed","autonomy":"ai-led","tags":["model-theory","logic","set-theory","argument"],"sources":[{"label":"Eventual categoricity for abstract elementary classes (PDF)","url":"https://github.com/openai/math/blob/main/preprints/Eventual-Categoricity-for-Abstract-Elementary-Classes-September-24-2026/paper.pdf","kind":"research"},{"label":"A CH obstruction to a prescribed categoricity threshold (PDF), the formalized companion","url":"https://github.com/openai/math/blob/main/preprints/A-CH-Obstruction-to-a-Prescribed-Categoricity-Threshold-September-24-2026/paper.pdf","kind":"research"},{"label":"GitHub: openai/math Lean scope for this family","url":"https://github.com/openai/math/blob/main/lean/docs/240.md","kind":"research"},{"label":"OpenAI: Sharing AI progress in mathematics","url":"https://openai.com/index/sharing-ai-progress-in-mathematics/","kind":"announcement"},{"label":"arXiv: Espíndola, a claimed ZFC proof of the same conjecture, first posted 2019","url":"https://arxiv.org/abs/1906.09169","kind":"challenge"}],"registrations":[{"registry":"mathdb","id":"389081","title":"Shelah's eventual categoricity conjecture","url":"https://mathdb.com/p/389081/shelah-s-eventual-categoricity-conjecture"},{"registry":"vibemathed","id":"shelah-eventual-categoricity-conjecture","url":"https://vibemathed.com/problem/shelah-eventual-categoricity-conjecture"}],"url":"https://whataifound.org/finding/2026-10-06-shelah-eventual-categoricity"},{"id":"2026-10-05-3sum-apsp-hypotheses","title":"Truly subquadratic 3SUM and truly subcubic APSP, refuting two central fine-grained complexity hypotheses","claim":"A preprint by Josh Alman and Virginia Vassilevska Williams gives deterministic algorithms that solve 3SUM on polynomially bounded integers in time \\(O(n^{1.9992})\\) and all-pairs shortest paths with polynomially bounded integer weights in time \\(O(n^{2.9995})\\), refuting the 3SUM and APSP hypotheses, from an algorithm the paper says an internal Anthropic model found on its own.","field":"computer-science","date":"2026-10-05","added":"2026-10-16","lab":"Anthropic","model":"Unreleased internal Anthropic research model (Claude), not named in the paper","verification":"author-verified","autonomy":"ai-led","tags":["algorithms","fine-grained-complexity","3sum","shortest-paths","matrix-multiplication","lean","formalization","construction"],"humans":["Josh Alman","Virginia Vassilevska Williams"],"year_posed":1995,"sources":[{"label":"arXiv: Alman and Vassilevska Williams, Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs","url":"https://arxiv.org/abs/2610.06783","kind":"research"},{"label":"GitHub: anthropics/formal-math, the Lean formalization of the headline running-time claims","url":"https://github.com/anthropics/formal-math/tree/main/3sum-apsp","kind":"research"}],"registrations":[{"registry":"mathdb","id":"388643","title":"3SUM Hard Problems","url":"https://mathdb.com/p/388643/3sum-hard-problems"},{"registry":"vibemathed","id":"3sum-hypothesis","url":"https://vibemathed.com/problem/3sum-hypothesis"},{"registry":"vibemathed","id":"apsp-hypothesis","url":"https://vibemathed.com/problem/apsp-hypothesis"}],"url":"https://whataifound.org/finding/2026-10-05-3sum-apsp-hypotheses"},{"id":"2026-10-04-kls-conjecture","title":"Kannan–Lovász–Simonovits conjecture proved in two preprints posted the same day","claim":"Two preprints posted on 4 October 2026, one by Bizeul, Klartag and Lehec and one by Song and Zhang, prove the Kannan–Lovász–Simonovits conjecture that every isotropic log-concave measure satisfies a Poincaré inequality with a dimension-free constant, and both say AI systems produced much of the mathematics.","field":"mathematics","date":"2026-10-04","added":"2026-10-12","lab":"Independent","model":"ChatGPT, version not stated (Bizeul, Klartag and Lehec); GPT-6 Astra, GPT-5.6 Sol, Claude Fable 5 and Fable 5.1 (Song and Zhang)","verification":"author-verified","autonomy":"collaborative","tags":["convex-geometry","high-dimensional-probability","functional-inequalities","argument"],"humans":["Pierre Bizeul","Boaz Klartag","Joseph Lehec","Zhao Song","Xinzhi Zhang"],"year_posed":1995,"sources":[{"label":"arXiv: Bizeul, Klartag and Lehec, Presenting a proof of the Kannan-Lovász-Simonovits conjecture","url":"https://arxiv.org/abs/2610.05474","kind":"research"},{"label":"arXiv: Song and Zhang, An O(1) Bound for the KLS Constant","url":"https://arxiv.org/abs/2610.01447","kind":"research"},{"label":"Microsoft Research: Solving a 31-year-old grand challenge in mathematics, the KLS conjecture","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","kind":"announcement"},{"label":"GitHub: HongruZhao/KLS500, a Lean 4 formalization of a dimension-free KLS bound","url":"https://github.com/HongruZhao/KLS500","kind":"research"}],"registrations":[{"registry":"mathdb","id":"363363","title":"Kannan–Lovász–Simonovits conjecture","url":"https://mathdb.com/p/363363/kannan-lovasz-simonovits-conjecture"},{"registry":"vibemathed","id":"kannan-lovasz-simonovits-conjecture","url":"https://vibemathed.com/problem/kannan-lovasz-simonovits-conjecture"}],"url":"https://whataifound.org/finding/2026-10-04-kls-conjecture"},{"id":"2026-10-02-squares-in-circle-packings","title":"Optimal packings of one to seven unit squares in a circle, proved in Lean","claim":"Machine-checked proofs of the smallest circle that holds \\(n\\) unit squares, and of every packing that attains it, for \\(n = 1\\) to \\(7\\); for five, six and seven squares no earlier proof of optimality was known.","field":"mathematics","date":"2026-10-02","added":"2026-10-06","lab":"Independent","model":"ChatGPT (GPT-6 Pro) and Claude Opus 5 and 5.5","verification":"formal","autonomy":"ai-led","tags":["discrete-geometry","packing","lean","formalization","argument"],"humans":["The-Anh Vu-Le"],"sources":[{"label":"GitHub: vltanh/lean4-squares-in-circles","url":"https://github.com/vltanh/lean4-squares-in-circles","kind":"research"},{"label":"Erich Friedman: Squares in Circles","url":"https://erich-friedman.github.io/packing/squincir/","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-10-02-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-02-000002&version=1","repository":"vltanh/lean4-squares-in-circles","commit":"621f2340a12f661a51b613719107a75cf40ab03a","theorems":["SquaresInCircles.optimal_radius","SquaresInCircles.optimal_packings"],"checked":"2026-10-02","note":"Registered against Challenge.lean, which restates the definitions of Geometry.lean word for word and states both theorems with sorry. Permitted axioms are propext, Classical.choice and Quot.sound."}],"url":"https://whataifound.org/finding/2026-10-02-squares-in-circle-packings"},{"id":"2026-10-01-ai-cmr-ejection-fraction-mortality","title":"AI against clinician left-ventricular segmentation of cardiac MRI for predicting mortality in 27,382 patients","claim":"In 27,382 patients scanned at Barts Heart Centre in London and the University of Pittsburgh Medical Center and followed for a median 5.6 years, ejection fraction measured by deep-learning segmentation of cardiac MRI predicted death slightly better than the clinicians' own measurements (C index 0.669 against 0.637), a gap that shrank to 0.781 against 0.777 after adjustment for age and sex.","field":"medicine","date":"2026-10-01","added":"2026-11-16","lab":"University College London","model":"Deep-learning left-ventricular segmentation of cardiac MRI, not named in the abstract","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","cardiac-mri","ejection-fraction","prognosis","retrospective","real-world-data"],"humans":["James C. Moon","Rhodri H. Davies"],"sources":[{"label":"Lancet Digital Health: Performance of AI versus clinician left-ventricular segmentation of cardiac MRI for mortality prediction","url":"https://doi.org/10.1016/j.landig.2026.101042","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-01-ai-cmr-ejection-fraction-mortality"},{"id":"2026-10-01-anisotropic-watson-integral","title":"Closed form for the anisotropic Watson integral of the cubic lattice","claim":"The return probability of a random walk on the cubic lattice with three unequal hopping rates, open since Watson's 1939 solution of the symmetric case, is given in closed form through periods of a genus-two curve, with a proof that no formula in elliptic integrals exists for generic rates.","field":"mathematics","date":"2026-10-01","added":"2026-10-06","lab":"Independent","model":"Claude (the announcement names Claude Fable 5)","verification":"claimed","autonomy":"ai-assisted","tags":["lattice-green-functions","random-walks","algebraic-geometry","argument"],"humans":["Noam Elkies","Thomas W. Grimm","Matthew D. Schwartz"],"year_posed":1939,"sources":[{"label":"Anthropic: Claude-shaped science (guest essay by Matthew Schwartz)","url":"https://www.anthropic.com/research/claude-shaped-science","kind":"announcement"},{"label":"BootLoops: The Watson integral (authors' summary)","url":"https://www.bootloops.ai/summaries/watson.html","kind":"announcement"},{"label":"BootLoops: WatsonW.py, the closed form as code","url":"https://www.bootloops.ai/files/lgf/WatsonW.py","kind":"research"}],"url":"https://whataifound.org/finding/2026-10-01-anisotropic-watson-integral"},{"id":"2026-10-01-bootloops-manuscripts","title":"36 manuscripts across 18 fields from the BootLoops harness run with Claude","claim":"Matthew Schwartz's open-source BootLoops harness, operated by Claude, produced 36 manuscripts with 19 coauthors between July and September 2026, mostly exact or certified computations carried from physics and computer science into fields such as population genetics, phylogenetics, ecology and health policy; eight are still in preparation and none is yet listed as published in a journal.","field":"physics","date":"2026-10-01","added":"2026-10-16","lab":"Independent","model":"Claude (the essay names Claude Fable 5 for the initial porting; versions per result are not recorded)","verification":"claimed","autonomy":"ai-assisted","tags":["interdisciplinary","exact-computation","agents","computation"],"humans":["Matthew D. Schwartz"],"sources":[{"label":"arXiv: Schwartz, BootLoops: an LLM-driven toolkit for exact quantitative science","url":"https://arxiv.org/abs/2610.02286","kind":"research"},{"label":"GitHub: BootLoops-ai, the toolkit's code","url":"https://github.com/BootLoops-ai","kind":"research"},{"label":"Anthropic: Claude-shaped science (guest essay by Matthew Schwartz)","url":"https://www.anthropic.com/research/claude-shaped-science","kind":"announcement"},{"label":"BootLoops: the manuscript index","url":"https://bootloops.ai/papers.html","kind":"announcement"},{"label":"Science: Problems in 22 scientific fields had solutions hiding in plain sight. An AI has found them","url":"https://www.science.org/content/article/problems-22-scientific-fields-had-solutions-hiding-plain-sight-ai-has-found-them","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-10-01-bootloops-manuscripts"},{"id":"2026-09-30-pinwheel-kernel-conjecture","title":"Six-task counterexample to the Kernel Conjecture of pinwheel scheduling","claim":"A six-task pinwheel scheduling instance with periods \\((3, 4, 5, 20, 22, 36)\\) can be scheduled, but not once its longest period is cut to 32, which refutes the Kernel Conjecture and the equivalent \\(2^k\\) Conjecture of Gąsieniec, Smith and Wild.","field":"computer-science","date":"2026-09-30","added":"2026-10-06","lab":"Independent","model":"GPT-6 Astra (in OpenAI Codex)","verification":"formal","autonomy":"ai-led","tags":["scheduling","algorithms","counterexample","lean","formalization","construction"],"year_posed":2021,"sources":[{"label":"GitHub: MathIsEvenEasier/pinwheel-kernel-counterexample","url":"https://github.com/MathIsEvenEasier/pinwheel-kernel-counterexample","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"the-pinwheel-kernel-conjecture-a-six-task-counterexample","url":"https://vibemathed.com/problem/the-pinwheel-kernel-conjecture-a-six-task-counterexample"}],"url":"https://whataifound.org/finding/2026-09-30-pinwheel-kernel-conjecture"},{"id":"2026-09-26-erdos-1220-not-provable","title":"Erdős Problem #1220 formalized as not provable in ZFC, from a 1987 Shelah-Stanley consistency result","claim":"A Lean 4 formalization shows that ZFC cannot prove a positive answer to Erdős Problem #1220 on partition relations for singular cardinals, by formalizing Shelah and Stanley's 1987 forcing construction, with AI models assisting on the Lean code.","field":"mathematics","date":"2026-09-26","added":"2026-09-28","lab":"Independent","model":"Claude Opus 5.5 (Claude Code); Astra (OpenAI Codex)","verification":"author-verified","autonomy":"ai-assisted","tags":["set-theory","erdos","lean","formalization","forcing"],"humans":["Ji Ho Bae"],"year_posed":1971,"sources":[{"label":"GitHub: jbaelaw/erdos1220-lean","url":"https://github.com/jbaelaw/erdos1220-lean","kind":"research"},{"label":"Erdős Problems: problem #1220","url":"https://www.erdosproblems.com/1220","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-26-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-26-000001&version=1","repository":"jbaelaw/erdos1220-lean","commit":"9cb81ffa48ffb766127c7e485ccef77bd4160868","theorems":["erdos1220_not_provable","erdos1220_sentence_faithful"],"checked":"2026-09-26"}],"url":"https://whataifound.org/finding/2026-09-26-erdos-1220-not-provable"},{"id":"2026-09-26-lovasz-cayley-polylog-degree","title":"Hamilton cycles in connected Cayley graphs of polylogarithmic degree, toward the Lovász conjecture","claim":"Every connected Cayley graph on \\(n\\) vertices with degree at least \\(C(\\log n)^{13}/\\log\\log n\\) has a Hamilton cycle, lowering the degree threshold in the Cayley-graph form of the Lovász conjecture from a power of \\(n\\) to a power of \\(\\log n\\); the manuscript was drafted by GPT 6 Pro and the proof formalized in Lean by Claude agents.","field":"mathematics","date":"2026-09-26","added":"2026-09-28","lab":"Independent","model":"GPT 6 Pro (manuscript draft); Claude Opus 5.5 agents in Grok Build (Lean formalization)","verification":"claimed","autonomy":"collaborative","tags":["graph-theory","combinatorics","lovasz-conjecture","lean","formalization","argument"],"humans":["Domagoj Bradač","Matija Bucić","Micha Christoph","Zach Hunter","Oliver Janzer","Alp Müyesser","Shengtong Zhang"],"year_posed":1969,"sources":[{"label":"GitHub: ShengtongZhang-alt/lovasz-opus, the draft and its Lean formalization","url":"https://github.com/ShengtongZhang-alt/lovasz-opus","kind":"research"},{"label":"Bedert, Draganić, Müyesser and Pavez-Signé: the prior n¹⁻ᶜ threshold","url":"https://arxiv.org/abs/2603.08675","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-26-000003","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-26-000003&version=1","repository":"ShengtongZhang-alt/lovasz-opus","commit":"ee0085ddec79996279c7b52044659032e5cf8431","theorems":["Lovasz.hamiltonian_of_polylog_degree"],"checked":"2026-09-26"}],"url":"https://whataifound.org/finding/2026-09-26-lovasz-cayley-polylog-degree"},{"id":"2026-09-25-nine-loop-hexagon-amplitude","title":"Six-particle MHV amplitude in planar N=4 super Yang-Mills computed at nine loops","claim":"Claude computed the six-particle maximally-helicity-violating amplitude in planar \\(\\mathcal{N} = 4\\) super Yang-Mills theory at nine loops, one loop beyond the previous record, from a single prompt naming the problem.","field":"physics","date":"2026-09-25","added":"2026-10-01","lab":"Anthropic","model":"Claude Fable 5.1 (in Claude Science)","verification":"author-verified","autonomy":"ai-led","tags":["scattering-amplitudes","quantum-field-theory","agents","computation"],"humans":["Liam Fitzpatrick","Siddharth Mishra-Sharma"],"sources":[{"label":"Anthropic: Yes, Claude can do nine loops","url":"https://www.anthropic.com/research/yes-claude-can-do-nine-loops","kind":"announcement"},{"label":"Zenodo: nine-loop six-gluon MHV amplitude, large data files","url":"https://zenodo.org/records/22949278","kind":"research"},{"label":"Cosmic9: symbol and function files with validation records","url":"https://smsharma.io/cosmic-nine-loops/","kind":"research"}],"url":"https://whataifound.org/finding/2026-09-25-nine-loop-hexagon-amplitude"},{"id":"2026-09-24-cytoreader-fusion-dual-stain-triage","title":"Locked AI model for p16/Ki-67 dual-stain triage validated on 9,006 cervical screening cases","claim":"Cytoreader-Fusion, an AI system that classifies p16/Ki-67 dual-stain cytology slides to triage HPV-positive screening results, was locked before validation and then detected biopsy-confirmed CIN 3+ with 88.3% sensitivity and 54.4% specificity in a held-out cohort of 4,996 cases.","field":"medicine","date":"2026-09-24","added":"2026-10-29","lab":"University Medicine Göttingen (with H-Labs and the US National Cancer Institute)","model":"Cytoreader-Fusion","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cervical-cancer","screening","cytology","pathology","retrospective","external-validation"],"humans":["Bernd Lahrmann","Nicolas Wentzensen","Niels Grabe"],"sources":[{"label":"NEJM AI: Closing the Automation Gap in HPV-Based Cervical Cancer Screening, independent external validation of an AI model for dual-stain triage","url":"https://doi.org/10.1056/AIoa2600270","kind":"research"}],"url":"https://whataifound.org/finding/2026-09-24-cytoreader-fusion-dual-stain-triage"},{"id":"2026-09-23-array-associated-reverse-transcriptases","title":"Agent-run genome survey identifies array-associated reverse transcriptases in jumbo phages","claim":"Claude agents surveying reverse transcriptase genes across 1.9 billion metagenomic protein clusters flagged a family of jumbo-phage reverse transcriptases paired with an array of repeated non-coding DNA units and a dedicated partner gene, an arrangement the authors say fits no described reverse transcriptase class.","field":"biology","date":"2026-09-23","added":"2026-09-24","lab":"Anthropic","model":"Claude Mythos 5","verification":"claimed","autonomy":"collaborative","tags":["genomics","bacteriophage","multi-agent","autonomous-discovery"],"humans":["Peter H. Yoon","Januka S. Athukoralage","Emmanuel Ameisen","Eric Kauderer-Abrams","Nicholas T. Perry","Matthew G. Durrant"],"sources":[{"label":"Anthropic preprint: Autonomous AI agents discover reverse transcriptases with tandem repeat arrays","url":"https://www-cdn.anthropic.com/22573675ada52a8ca8a97a1a4b4326b2f208a071.pdf","kind":"research"},{"label":"Korn et al. 2021, the MarsHill genome report that first identified the reverse transcriptase","url":"https://doi.org/10.1128/jvi.02391-20","kind":"research"},{"label":"Anthropic: Claude discovers a novel enzyme system with CRISPR-like repeats","url":"https://www.anthropic.com/research/claude-discovers-novel-enzyme-system","kind":"announcement"},{"label":"bioRxiv: Autonomous AI agents discover reverse transcriptases with tandem repeat arrays","url":"https://doi.org/10.64898/2026.10.05.755809","kind":"research"}],"url":"https://whataifound.org/finding/2026-09-23-array-associated-reverse-transcriptases"},{"id":"2026-09-17-rogers-ramanujan-torus-knot","title":"Huang-Jiang-Oblomkov conjecture proved for every torus-knot singularity, with a Lean formalization conditional on two literature inputs","claim":"The geometric extension of the Rogers-Ramanujan and Andrews-Gordon identities conjectured by Huang, Jiang and Oblomkov is proved for every torus-knot singularity with coprime exponents, via a stronger finite identity.","field":"mathematics","date":"2026-09-17","added":"2026-09-22","lab":"Axiom Math","model":"AxiomProver","verification":"claimed","autonomy":"ai-assisted","tags":["number-theory","combinatorics","q-series","lean","formalization","argument"],"humans":["Yifeng Huang","Kenny Lau","Ken Ono"],"sources":[{"label":"arXiv: Rogers-Ramanujan identities from the geometry of Xᵃ = Yᵇ","url":"https://arxiv.org/abs/2609.20567","kind":"research"},{"label":"GitHub: AxiomMath/HJO, the Lean formalization","url":"https://github.com/AxiomMath/HJO","kind":"research"}],"url":"https://whataifound.org/finding/2026-09-17-rogers-ramanujan-torus-knot"},{"id":"2026-09-17-talagrand-operator-cotype","title":"Counterexample to Talagrand's operator cotype problem","claim":"An operator is exhibited whose Rademacher cotype is not controlled by the maximum of its Gaussian cotype and its (q,1)-summing norm, answering Talagrand's question in the negative already at q equals 2.","field":"mathematics","date":"2026-09-17","added":"2026-09-22","lab":"Independent","model":"ChatGPT (GPT-5.6)","verification":"claimed","autonomy":"ai-led","tags":["functional-analysis","probability","counterexample","construction"],"humans":["Xinglong Wu"],"sources":[{"label":"arXiv: A Counterexample to Talagrand’s Operator Cotype Problem","url":"https://arxiv.org/abs/2609.19731","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"talagrand-operator-cotype-problem","url":"https://vibemathed.com/problem/talagrand-operator-cotype-problem"}],"url":"https://whataifound.org/finding/2026-09-17-talagrand-operator-cotype"},{"id":"2026-09-16-browning-sawin-hypersurfaces","title":"Browning-Sawin conjecture on random sign-coefficient hypersurfaces proved, with a Lean formalization assuming existing literature","claim":"Random hypersurfaces with coefficients drawn uniformly from plus and minus one are shown to be smooth with probability tending to one as the degree grows, with a quantitative rate.","field":"mathematics","date":"2026-09-16","added":"2026-09-22","lab":"Axiom Math","model":"AxiomProver","verification":"claimed","autonomy":"ai-assisted","tags":["algebraic-geometry","probability","arithmetic-statistics","lean","formalization","argument"],"humans":["Ken Ono","Ashvin Swaminathan"],"year_posed":2025,"sources":[{"label":"arXiv: On a conjecture of Browning and Sawin on random hypersurfaces with sign coefficients","url":"https://arxiv.org/abs/2609.18879","kind":"research"},{"label":"GitHub: AxiomMath/BrowningSawin, the Lean formalization","url":"https://github.com/AxiomMath/BrowningSawin","kind":"research"},{"label":"arXiv: Browning and Sawin, Random Diophantine equations of large degree, the source of the conjecture","url":"https://arxiv.org/abs/2510.26191","kind":"research"}],"url":"https://whataifound.org/finding/2026-09-16-browning-sawin-hypersurfaces"},{"id":"2026-09-16-four-color-theorem-lean","title":"Four Color Theorem formalized in Lean 4 by AI agents, in two independent developments","claim":"Two independent Lean 4 proofs of the Four Color Theorem, each following Gonthier and Werner's Coq proof and each written almost entirely by a Claude model under one person's direction, resting only on Lean's three standard axioms.","field":"mathematics","date":"2026-09-16","added":"2026-09-28","lab":"Independent","model":"Claude Fable 5.1 and Claude Opus 5 (Emery); Claude Opus 5.5 (Barish)","verification":"claimed","autonomy":"ai-led","tags":["graph-theory","four-color-theorem","lean","formalization"],"humans":["Chris Emery","Robert D. Barish"],"year_posed":1852,"sources":[{"label":"GitHub: corun1024/4ct, Chris Emery's Lean 4 proof","url":"https://github.com/corun1024/4ct","kind":"research"},{"label":"GitHub: RBarish-UTokyo/FourColorTheorem-Lean4, Robert D. Barish's port","url":"https://github.com/RBarish-UTokyo/FourColorTheorem-Lean4","kind":"research"},{"label":"GitHub: math-comp/fourcolor, Gonthier and Werner's Coq proof that both follow","url":"https://github.com/math-comp/fourcolor","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-27-000005","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-27-000005&version=1","repository":"RBarish-UTokyo/FourColorTheorem-Lean4","commit":"20fa34599f5189dd569d96dd22f306c94ab1c446","theorems":["FourColor.RealPlane.four_color"],"checked":"2026-09-27","note":"Covers Barish's port only; Emery's development carries no registration."}],"url":"https://whataifound.org/finding/2026-09-16-four-color-theorem-lean"},{"id":"2026-09-15-bit-php-resolution-over-parities","title":"Exponential lower bound for the bit pigeonhole principle in unrestricted resolution over parities","claim":"Any refutation of the bit pigeonhole principle in resolution over parities, a proof system whose lines are disjunctions of linear equations mod 2, must be exponentially long even with no restriction on its depth or regularity; the mathematics was produced by AI models and the main theorem is checked in Lean.","field":"computer-science","date":"2026-09-15","added":"2026-09-28","lab":"Independent","model":"GPT-6 Astra (mathematics, version 1 formalization and drafting); Claude Fable 5.1 and Claude Opus 5 (revision 1 formalization)","verification":"claimed","autonomy":"ai-led","tags":["proof-complexity","pigeonhole-principle","lean","formalization","argument"],"humans":["Kamil Braun"],"sources":[{"label":"arXiv: An exponential lower bound for the bit pigeonhole principle in resolution over parities","url":"https://arxiv.org/abs/2609.23015","kind":"research"},{"label":"GitHub: kbr-/math-research, the preprint sources and Lean formalization","url":"https://github.com/kbr-/math-research","kind":"research"},{"label":"Byramji and Impagliazzo: the prior bounded-depth result","url":"https://arxiv.org/abs/2511.20023","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"superpolynomial-lower-bounds-for-bit-php-in-unrestricted-resolution-over-paritie","url":"https://vibemathed.com/problem/superpolynomial-lower-bounds-for-bit-php-in-unrestricted-resolution-over-paritie"}],"url":"https://whataifound.org/finding/2026-09-15-bit-php-resolution-over-parities"},{"id":"2026-09-15-ipm-forced-blowup","title":"Finite-time blowup for the IPM equation with uniformly space-time smooth forcing","claim":"The incompressible porous medium equation on the two-dimensional torus is shown to develop a finite-time singularity under a force that is smooth in space and time together, extending a result previously available only for spatially smooth forcing.","field":"mathematics","date":"2026-09-15","added":"2026-09-22","lab":"Independent","model":"Not named; the arXiv comment field states only that the proof is LLM-assisted","verification":"claimed","autonomy":"ai-assisted","tags":["pde","fluid-dynamics","singularity","argument"],"humans":["Levent Alpöge","Tristan Buckmaster","Matei P. Coiculescu"],"sources":[{"label":"arXiv: Extending the Cordoba-Martinez-Zoroa IPM Blow-Up to Uniformly Space-Time Smooth Forcing","url":"https://arxiv.org/abs/2609.16470","kind":"research"},{"label":"arXiv: Cordoba and Martinez-Zoroa, the prior spatially-smooth-forcing result","url":"https://arxiv.org/abs/2410.22920","kind":"research"},{"label":"Terence Tao on the forced-blowup results for IPM, Boussinesq and Euler","url":"https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"ipm-blowup-spacetime-smooth-forcing","url":"https://vibemathed.com/problem/ipm-blowup-spacetime-smooth-forcing","note":"The record credits Claude and Codex with GPT-5.6 Sol and labels the proof Lean-verified, linking tristanbuckmaster/fluid_lean. At commit d0124689230b58b4f86e7b90ac59de06404b3b6b that repository holds the companion Boussinesq and Euler developments and no IPM project, so neither claim is corroborated by an artifact."}],"url":"https://whataifound.org/finding/2026-09-15-ipm-forced-blowup"},{"id":"2026-09-14-h1-formal-conjectures-open-problems","title":"Eight open problems from Formal Conjectures proved in Lean by a simple agent loop","claim":"A team at FAIR at Meta ran GPT-5.6 Sol in h1, a minimal loop that gives a model a Lean interface and verifier feedback, on 236 problems listed as open in Google DeepMind's Formal Conjectures repository and obtained Lean proofs of eight of them, among them a variant of Erdős Problem 337, three OEIS conjectures and the existence of an AME(9, 10) quantum state; Formal Conjectures marked five as solved.","field":"mathematics","date":"2026-09-14","added":"2026-10-29","lab":"FAIR at Meta","model":"GPT-5.6 Sol in the h1 harness","verification":"formal","autonomy":"search-scaffold","tags":["lean","automated-theorem-proving","formal-conjectures","erdos-problems","oeis","argument"],"humans":["Skander Moalla","Ahmad Rammal","Niket Patel","Rémi Munos","Julia Kempe"],"sources":[{"label":"arXiv: h1, A Taste of the Bitter Lesson in Automated Theorem Proving","url":"https://arxiv.org/abs/2610.35962","kind":"research"},{"label":"GitHub: niketp03/atlas-fc-verified, the nine Lean proofs","url":"https://github.com/niketp03/atlas-fc-verified","kind":"research"},{"label":"Formal Conjectures pull request 6008: Mark five problems solved with links to Lean 4 proofs","url":"https://github.com/google-deepmind/formal-conjectures/pull/6008","kind":"research"},{"label":"arXiv: Campos, Fox and Schildkraut, A new lower bound for two-color van der Waerden numbers","url":"https://arxiv.org/abs/2608.20824","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-09-14-h1-formal-conjectures-open-problems"},{"id":"2026-09-14-nivat-conjecture","title":"Nivat's conjecture claimed in its sharp form, with the submitter stating he cannot check it","claim":"A Lean development claims Nivat's 1997 conjecture in full: if a two-dimensional configuration has at most mn distinct patterns on some m by n rectangle, it has a nonzero period.","field":"mathematics","date":"2026-09-14","added":"2026-09-15","lab":"Independent","model":"GPT-6 Pro (proof); GPT-6 Astra Ultra through Codex (Lean formalization)","verification":"claimed","autonomy":"ai-led","tags":["symbolic-dynamics","combinatorics","lean","formalization","argument"],"humans":["Boon Suan Ho"],"year_posed":1997,"sources":[{"label":"GitHub: boonsuan/nivat, the Lean 4 and mathlib formalization","url":"https://github.com/boonsuan/nivat","kind":"research"},{"label":"Palomar registration for the Nivat formalization","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-14-000003&version=1","kind":"research"},{"label":"Bryna Kra on AI and deep theorems, guest post on Terence Tao's blog","url":"https://terrytao.wordpress.com/2026/09/13/deep-theorems-were-scarce-and-difficult-and-so-became-an-effective-mechanism-to-identify-deep-thought-ai-has-broken-this-system/","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-14-000003","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-14-000003&version=1","repository":"boonsuan/nivat"},{"registry":"mathdb","id":"375941","title":"Nivat's conjecture","url":"https://mathdb.com/p/375941/nivat-s-conjecture"}],"url":"https://whataifound.org/finding/2026-09-14-nivat-conjecture"},{"id":"2026-09-10-approval-committee-core","title":"Existence of the core in approval-based committee elections","claim":"Every approval-based multi-winner election is shown to admit a committee in the core, settling the main open question in the area, and one can be found in polynomial time.","field":"mathematics","date":"2026-09-10","added":"2026-09-22","lab":"Independent","model":"GPT-6 Astra","verification":"claimed","autonomy":"collaborative","tags":["social-choice","combinatorics","algorithms","argument"],"humans":["Patrick Becker","Matthias Greger","Dominik Peters"],"sources":[{"label":"arXiv: Existence of the Core in Approval-Based Committee Elections","url":"https://arxiv.org/abs/2609.11912","kind":"research"},{"label":"Epoch AI: FrontierMath open problems, committee election","url":"https://epoch.ai/frontiermath/open-problems/committee-election","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-09-10-approval-committee-core"},{"id":"2026-09-09-small-undecidable-groups","title":"A 3-generator 9-relator group with unsolvable word problem, and smaller Adian-Rabin families","claim":"A group given by 3 generators and 9 relations has an unsolvable word problem, beating the 12-relation record Borisov set in 1969, and it yields families of 4-generator 11-relator and 2-generator 10-relator presentations for which no algorithm can decide whether the group is trivial.","field":"mathematics","date":"2026-09-09","added":"2026-09-24","lab":"Independent","model":"GPT-5.6 Sol Pro (construction); GPT-5.6 Sol in Codex (Lean formalization)","verification":"author-verified","autonomy":"ai-led","tags":["group-theory","logic","construction","lean","formalization"],"humans":["Marc Kegel","Shana Yunsheng Li","Qiuyu Ren"],"sources":[{"label":"arXiv: Small undecidable groups and unrecognizable 4-manifolds","url":"https://arxiv.org/abs/2609.10461","kind":"research"},{"label":"GitHub: 32805433/Adian-Rabin, the Lean 4 formalization of the algebraic results","url":"https://github.com/32805433/Adian-Rabin","kind":"research"},{"label":"arXiv: Tancer, Simpler algorithmically unrecognizable 4-manifolds, the prior deficiency-9 bound","url":"https://arxiv.org/abs/2310.07421","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-22-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-22-000002&version=1","repository":"32805433/Adian-Rabin","commit":"fb4a401e8fbdba36e7b35c11fde2baa15592e185","theorems":["Undecidability.exists_three_generator_nine_relator_group_with_unsolvable_word_problem","Undecidability.exists_four_generator_eleven_relator_adian_rabin_family","Undecidability.exists_two_generator_ten_relator_adian_rabin_family"],"checked":"2026-09-22","note":"Registered by the paper's own authors. These are Theorems 1.1, 1.3 and 1.4; the record states that the four-manifold consequences are outside the formalized scope."}],"url":"https://whataifound.org/finding/2026-09-09-small-undecidable-groups"},{"id":"2026-09-08-euler-unforced-blowup","title":"Finite-time blowup for the unforced Euler equations from smooth compactly supported data","claim":"A Lean development proves that the three-dimensional incompressible Euler equations, with no forcing term, develop a singularity in finite time from smooth, compactly supported, divergence-free initial velocity on all of space.","field":"mathematics","date":"2026-09-08","added":"2026-09-10","lab":"OpenAI","model":"Unnamed OpenAI model described as more capable than GPT-6 Astra for the proof; GPT-6 Astra through Codex for the Lean formalization","verification":"claimed","autonomy":"ai-led","tags":["pde","fluid-dynamics","euler-equations","singularity","lean","formalization","argument"],"sources":[{"label":"GitHub: openai/NavierStokesAndEuler, the Lean 4 formalizations","url":"https://github.com/openai/NavierStokesAndEuler","kind":"research"},{"label":"OpenAI: Finite time blowup for the Euler equation (PDF)","url":"https://cdn.openai.com/pdf/315b36cd-ec98-4023-8342-93345194ece1/euler.pdf","kind":"research"},{"label":"OpenAI: On the Navier-Stokes Millennium Prize Problem, the announcement covering both results","url":"https://openai.com/index/navier-stokes-solution/","kind":"announcement"},{"label":"Chen and Hou: singularity formation in 3D Euler with smooth initial data and boundary, the closest prior result","url":"https://www.pnas.org/doi/10.1073/pnas.2500940122","kind":"commentary"},{"label":"Terence Tao on the Alpoge and Buckmaster forced-blowup results of the same week, a different claim","url":"https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/","kind":"commentary"},{"label":"Science: How an AI math breakthrough ignited a controversy","url":"https://www.science.org/content/article/how-ai-math-breakthrough-ignited-controversy","kind":"coverage"}],"registrations":[{"registry":"vibemathed","id":"finite-time-blowup-for-the-3d-incompressible-euler-equations-unforced","url":"https://vibemathed.com/problem/finite-time-blowup-for-the-3d-incompressible-euler-equations-unforced"}],"url":"https://whataifound.org/finding/2026-09-08-euler-unforced-blowup"},{"id":"2026-09-08-metasurface-color-router-unet-ga","title":"Metasurface colour router inverse-designed with a neural-network-accelerated genetic algorithm, fabricated and measured","claim":"A U-Net trained on 140,000 finite-difference time-domain simulations stood in for the solver inside a genetic algorithm, which evaluated \\(4 \\times 10^7\\) candidate layouts for a single-layer silicon nitride colour router over a 2 µm Bayer cell; the fabricated device measured 88.8% total transmission against 95.4% predicted, though with per-colour routing efficiencies and crosstalk worse than simulated.","field":"physics","date":"2026-09-08","added":"2026-11-12","lab":"Chungnam National University","model":"U-Net surrogate (about 4.9 million parameters) inside a genetic algorithm","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["construction","nanophotonics","metasurface","inverse-design"],"humans":["Hyoseok Park","Samuel Kim","Duk-Yong Choi","Yeonsang Park","Myungjae Lee"],"sources":[{"label":"Reports on Progress in Physics: Metasurface color routers inverse-designed with a deep-learning-accelerated genetic algorithm","url":"https://doi.org/10.1088/1361-6633/ae9e8c","kind":"research"},{"label":"GitHub: MCR-UNet-surrogate (U-Net forward-model code)","url":"https://github.com/hyoseokp/MCR-UNet-surrogate","kind":"research"},{"label":"Physics World: AI-designed metasurface could make cameras far more light-efficient","url":"https://physicsworld.com/a/ai-designed-metasurface-could-make-cameras-far-more-light-efficient/","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-09-08-metasurface-color-router-unet-ga"},{"id":"2026-09-08-navier-stokes-forced-blowup","title":"Finite-time blowup for Navier-Stokes with smooth forcing, Clay alternatives C and D","claim":"A Lean development proves that three-dimensional Navier-Stokes with a smooth forcing term breaks down in finite time, at every positive viscosity, on both Euclidean space and the periodic torus, which is two of the four statements the Clay problem description asks for a proof of, though not the unforced regularity question the phrase usually brings to mind.","field":"mathematics","date":"2026-09-08","added":"2026-09-10","lab":"OpenAI","model":"Unnamed OpenAI model described as more capable than GPT-6 Astra for the proof; GPT-6 Astra through Codex for the Lean formalization","verification":"claimed","autonomy":"ai-led","tags":["pde","fluid-dynamics","navier-stokes","singularity","lean","formalization","argument"],"year_posed":2000,"sources":[{"label":"GitHub: openai/NavierStokesAndEuler, the Lean 4 formalizations","url":"https://github.com/openai/NavierStokesAndEuler","kind":"research"},{"label":"OpenAI: Finite time blowup for Navier-Stokes (PDF)","url":"https://cdn.openai.com/pdf/32d9f210-8b73-45e0-91bc-82a30aef8a9a/navier-stokes.pdf","kind":"research"},{"label":"Clay Mathematics Institute: the official problem description, alternatives (C) and (D) on page 2","url":"https://www.claymath.org/wp-content/uploads/2022/06/navierstokes.pdf","kind":"research"},{"label":"Formal Conjectures: the Lean statement of the Navier-Stokes problem the Comparator challenges adapt","url":"https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Millennium/NavierStokes.lean","kind":"research"},{"label":"OpenAI: On the Navier-Stokes Millennium Prize Problem","url":"https://openai.com/index/navier-stokes-solution/","kind":"announcement"},{"label":"Clay Mathematics Institute: statement on the Navier-Stokes announcement","url":"https://www.claymath.org/news/navier-stokes-announcement/","kind":"commentary"},{"label":"Terence Tao on the blowup results released the same week","url":"https://terrytao.wordpress.com/2026/09/07/finite-time-blowup-with-smooth-forcing-term-for-the-incompressible-porous-medium-boussinesq-and-incompressible-euler-equations/","kind":"commentary"},{"label":"vibemathed: finite-time breakdown with smooth forcing","url":"https://vibemathed.com/problem/navier-stokes-millennium-prize-problem-finite-time-breakdown-with-smooth-forcing","kind":"commentary"},{"label":"Quanta: AI has solved one of math's $1 million Millennium Prize problems","url":"https://www.quantamagazine.org/ai-has-solved-one-of-maths-1-million-millennium-prize-problems-20260908/","kind":"coverage"},{"label":"Nature: OpenAI claims huge maths breakthrough on a famed Millennium Problem","url":"https://www.nature.com/articles/d41586-026-02842-5","kind":"coverage"},{"label":"Science: How an AI math breakthrough ignited a controversy","url":"https://www.science.org/content/article/how-ai-math-breakthrough-ignited-controversy","kind":"coverage"},{"label":"Scientific American: OpenAI's blockbuster Navier-Stokes proof isn't what we thought it was","url":"https://www.scientificamerican.com/article/openais-blockbuster-navier-stokes-proof-isnt-what-we-thought-it-was/","kind":"coverage"},{"label":"Buckmaster and Alpoge: public statement on the priority of the forced-blowup program (PDF)","url":"https://cims.nyu.edu/~tristanb/statement.pdf","kind":"challenge"},{"label":"Constantin, Ignatova and Vicol: the forcing in any construction with these features can be neither locally vanishing nor real-analytic in space","url":"https://arxiv.org/abs/2609.20803","kind":"commentary"},{"label":"Bastounis, Circelli and Hansen: Navier-Stokes lost in translation, the Lean proof does not correspond to the written one","url":"https://arxiv.org/abs/2610.08144","kind":"challenge"}],"registrations":[{"registry":"vibemathed","id":"navier-stokes-millennium-prize-problem-finite-time-breakdown-with-smooth-forcing","url":"https://vibemathed.com/problem/navier-stokes-millennium-prize-problem-finite-time-breakdown-with-smooth-forcing","note":"Recorded there as a candidate with review pending."}],"url":"https://whataifound.org/finding/2026-09-08-navier-stokes-forced-blowup"},{"id":"2026-09-07-complex-grothendieck-constant","title":"Improved lower bound for the complex Grothendieck constant","claim":"The complex Grothendieck constant is shown to exceed 1.35584631827168, closing more than a quarter of the gap between the long-standing Davie lower bound and the Haagerup upper bound.","field":"mathematics","date":"2026-09-07","added":"2026-09-22","lab":"Independent","model":"Odin Automatic AI Research Agent","verification":"author-verified","autonomy":"ai-led","tags":["functional-analysis","optimization","interval-arithmetic","construction"],"humans":["Shengtao Guo","Ethan X. Fang","Junwei Lu"],"sources":[{"label":"arXiv: An Improved Lower Bound for the Complex Grothendieck Constant","url":"https://arxiv.org/abs/2609.07000","kind":"research"},{"label":"GitHub: shengtaoguo/complex-grothendieck-certificates, the interval-arithmetic certificates","url":"https://github.com/shengtaoguo/complex-grothendieck-certificates","kind":"research"},{"label":"arXiv: Heilman, Jones and Malavolta, Sharper bounds for the complex Grothendieck constant","url":"https://arxiv.org/abs/2609.25462","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"lower-bound-for-the-complex-grothendieck-constant","url":"https://vibemathed.com/problem/lower-bound-for-the-complex-grothendieck-constant"}],"url":"https://whataifound.org/finding/2026-09-07-complex-grothendieck-constant"},{"id":"2026-09-06-bollobas-nikiforov","title":"Bollobas-Nikiforov conjecture claimed in full, in a weighted form","claim":"Five named mathematicians with AI assistance claim the 2007 Bollobas-Nikiforov conjecture for every noncomplete graph, bounding the sum of the squares of the two largest adjacency eigenvalues, with a Lean formalization.","field":"mathematics","date":"2026-09-06","added":"2026-09-15","lab":"Independent","model":"GPT-6 Astra (ideation and manuscript); Grok 4.6 (Lean formalization); Claude Fable 5.1 (submission packaging)","verification":"claimed","autonomy":"collaborative","tags":["graph-theory","spectral-graph-theory","combinatorics","lean","formalization","argument"],"humans":["Gabriel Coutinho","Yinchen Liu","Thomas Jung Spier","Quanyu Tang","Shengtong Zhang"],"year_posed":2007,"sources":[{"label":"GitHub: ShengtongZhang-alt/BN, the Lean 4 and Mathlib formalization","url":"https://github.com/ShengtongZhang-alt/BN","kind":"research"},{"label":"Giacomelli: the prior partial result, complete multipartite and dense K4-free graphs","url":"https://arxiv.org/abs/2603.26379","kind":"research"},{"label":"vibemathed: Bollobas-Nikiforov conjecture","url":"https://vibemathed.com/problem/bollobas-nikiforov-conjecture","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-07-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-07-000002&version=1","repository":"ShengtongZhang-alt/BN"},{"registry":"vibemathed","id":"bollobas-nikiforov-conjecture","url":"https://vibemathed.com/problem/bollobas-nikiforov-conjecture"}],"url":"https://whataifound.org/finding/2026-09-06-bollobas-nikiforov"},{"id":"2026-09-05-ibragimov-iosifescu","title":"Disproof of the Ibragimov-Iosifescu conjecture for phi-mixing sequences","claim":"A Lean development constructs a stationary phi-mixing sequence with finite second moments whose normalized partial sums fail to satisfy the central limit theorem, disproving a 1971 conjecture.","field":"mathematics","date":"2026-09-05","added":"2026-09-15","lab":"OpenAI / Epoch AI","model":"GPT-6 Astra (pre-release)","verification":"claimed","autonomy":"ai-led","tags":["probability","central-limit-theorem","lean","formalization","construction"],"humans":["Tom Adamczewski"],"year_posed":1971,"sources":[{"label":"GitHub: tadamcz/phi-mixing-clt, the Lean counterexample and literature review","url":"https://github.com/tadamcz/phi-mixing-clt","kind":"research"},{"label":"vibemathed: Ibragimov-Iosifescu phi-mixing CLT conjecture","url":"https://vibemathed.com/problem/ibragimov-iosifescu-varphi-mixing-clt-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"ibragimov-iosifescu-varphi-mixing-clt-conjecture","url":"https://vibemathed.com/problem/ibragimov-iosifescu-varphi-mixing-clt-conjecture"},{"registry":"mathdb","id":"316044","title":"Ibragimov–Iosifescu conjecture for φ-mixing sequences","url":"https://mathdb.com/p/316044/ibragimov-iosifescu-conjecture-for-mixing-sequences"}],"url":"https://whataifound.org/finding/2026-09-05-ibragimov-iosifescu"},{"id":"2026-09-04-fermat-last-theorem-lean","title":"Fermat's Last Theorem formalized end to end in Lean 4","claim":"A complete machine-checked proof of Fermat's Last Theorem in Lean 4, written by AI agents in eleven days, resting on Lean's three standard axioms and accepted by two independent kernels.","field":"mathematics","date":"2026-09-04","added":"2026-09-07","lab":"Anthropic","model":"Internal Anthropic research model, described in the announcement as roughly comparable to Claude Fable 5.1","verification":"formal","autonomy":"ai-led","tags":["number-theory","lean","formalization","fermat"],"humans":["Tianyi Peng"],"year_posed":1637,"sources":[{"label":"GitHub: anthropics/fermats-last-theorem","url":"https://github.com/anthropics/fermats-last-theorem","kind":"research"},{"label":"Anthropic: Formalizing Fermat's Last Theorem in Lean (PDF)","url":"https://www-cdn.anthropic.com/9e431dff043da6538d99d6c2d231b670aa3da263.pdf","kind":"research"},{"label":"Anthropic: Formalizing Fermat's Last Theorem","url":"https://www.anthropic.com/research/formalizing-fermats-last-theorem","kind":"announcement"},{"label":"Kevin Buzzard: FLT, Anthropic has beaten me to it","url":"https://xenaproject.wordpress.com/2026/09/04/flt-anthropic-has-beaten-me-to-it/","kind":"commentary"},{"label":"Xena project: How to Formalize All of Mathematics (guest post by Avigad, Buzzard, Commelin, Degenne, Morrison, Nash and Topaz)","url":"https://xenaproject.wordpress.com/2026/10/16/how-to-formalize-all-of-mathematics/","kind":"commentary"},{"label":"Anthropic: Introducing Claude Fable 5.2 and Claude Mythos 5.2","url":"https://www.anthropic.com/claude-fable-and-mythos-5-2","kind":"announcement"}],"registrations":[{"registry":"mathdb","id":"316214","title":"Fermat's Last Theorem","url":"https://mathdb.com/p/316214/fermat-s-last-theorem","note":"Tracks the theorem itself rather than this formalization of it."}],"url":"https://whataifound.org/finding/2026-09-04-fermat-last-theorem-lean"},{"id":"2026-09-03-catalan-constant-irrationality","title":"Disputed claim that Catalan's constant is irrational","claim":"A preprint claims a proof that Catalan's constant is irrational, using weighted tails in the Calegari-Dimitrov-Tang framework; a specific technical objection to the argument has been raised publicly and is unresolved.","field":"mathematics","date":"2026-09-03","added":"2026-09-07","lab":"Nanjing University","model":"ChatGPT 5.6 Solar, named in the paper as the verifier; the model consulted during the work is named only as AI","verification":"disputed","autonomy":"ai-assisted","tags":["number-theory","irrationality","disputed","argument"],"humans":["Zhi-Wei Sun"],"sources":[{"label":"arXiv: Catalan's constant is irrational","url":"https://arxiv.org/abs/2609.04176","kind":"research"},{"label":"Hacker News: technical objection to the argument, equation 1.4 against equation 2.12","url":"https://news.ycombinator.com/item?id=49560333","kind":"challenge"},{"label":"arXiv: Wachs, A note on a recent claimed proof of the irrationality of Catalan's constant","url":"https://arxiv.org/abs/2609.22339","kind":"challenge"}],"url":"https://whataifound.org/finding/2026-09-03-catalan-constant-irrationality"},{"id":"2026-09-03-erdos-sos-conjecture","title":"Erdos-Sos conjecture proved in Lean, in a form marginally weaker than the classical statement","claim":"A machine-checked Lean proof establishes the Erdos-Sos conjecture in the benchmark's formalization, which in one parity case assumes one more edge than the classical statement requires.","field":"mathematics","date":"2026-09-03","added":"2026-09-07","lab":"OpenAI / Epoch AI","model":"GPT-6 Astra (pre-release)","verification":"formal","autonomy":"autonomous","tags":["graph-theory","combinatorics","erdos","lean","formalization","argument"],"humans":["Tom Adamczewski"],"year_posed":1962,"sources":[{"label":"GitHub: tadamcz/erdos548, Lean proof and Palomar submission repository","url":"https://github.com/tadamcz/erdos548","kind":"research"},{"label":"vibemathed: Erdos Problem 548, the Erdos-Sos conjecture","url":"https://vibemathed.com/problem/erdos-problem-548-erdos-sos-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"erdos-problem-548-erdos-sos-conjecture","url":"https://vibemathed.com/problem/erdos-problem-548-erdos-sos-conjecture"},{"registry":"mathdb","id":"392272","title":"Erdos-Sos conjecture","url":"https://mathdb.com/p/392272/erdos-sos-conjecture"}],"url":"https://whataifound.org/finding/2026-09-03-erdos-sos-conjecture"},{"id":"2026-09-03-koethe-conjecture-matrix-form","title":"Lean disproof of Krempa's matrix form of the Koethe conjecture","claim":"A machine-checked Lean proof refutes the matrix formulation that Krempa showed equivalent to the Koethe conjecture, found by a pre-release model with no human steering of the proof search.","field":"mathematics","date":"2026-09-03","added":"2026-09-07","lab":"OpenAI / Epoch AI","model":"GPT-6 Astra (pre-release)","verification":"formal","autonomy":"autonomous","tags":["algebra","ring-theory","lean","formalization","counterexample","construction"],"humans":["Tom Adamczewski"],"year_posed":1930,"sources":[{"label":"GitHub: tadamcz/koethe, Lean disproof and Palomar submission repository","url":"https://github.com/tadamcz/koethe","kind":"research"},{"label":"vibemathed: Koethe Conjecture","url":"https://vibemathed.com/problem/kothe-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"kothe-conjecture","url":"https://vibemathed.com/problem/kothe-conjecture"}],"url":"https://whataifound.org/finding/2026-09-03-koethe-conjecture-matrix-form"},{"id":"2026-09-03-prime-gaps-212","title":"Bounded prime gaps improved to 212, with a Lean certificate of the deduction","claim":"Nine authors prove that infinitely many pairs of primes differ by at most 212, improving Stadlmann's 240, with the deduction certified in Lean by the group's own prover.","field":"mathematics","date":"2026-09-03","added":"2026-09-15","lab":"Axiom Math","model":"AxiomProver","verification":"claimed","autonomy":"collaborative","tags":["number-theory","prime-gaps","sieve-methods","lean","formalization","argument"],"humans":["Francois Charton","Letong Hong","Kenny Lau","Ken Ono","Guillaume Remy","Ho Chung Siu","Ashvin A. Swaminathan","Jesse Thorner","Yunzhou Xie"],"year_posed":1849,"sources":[{"label":"Axiom Math: a new bound for small gaps between primes (PDF)","url":"https://primegaps.axiommath.ai/bgp212.pdf","kind":"research"},{"label":"vibemathed: bounded prime gaps at most 212","url":"https://vibemathed.com/problem/bounded-prime-gaps-at-most-212","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"bounded-prime-gaps-at-most-212","url":"https://vibemathed.com/problem/bounded-prime-gaps-at-most-212"}],"url":"https://whataifound.org/finding/2026-09-03-prime-gaps-212"},{"id":"2026-09-03-smale-mean-value-k1","title":"Counterexample to Smale's mean value conjecture at K = 1","claim":"A Lean proof produced in an unsteered benchmark run disproves the \\(K = 1\\) form of Smale's 1981 mean value conjecture, exhibiting a polynomial for which no critical point meets the bound.","field":"mathematics","date":"2026-09-03","added":"2026-09-15","lab":"OpenAI / Epoch AI","model":"GPT-6 Astra (pre-release)","verification":"formal","autonomy":"autonomous","tags":["complex-analysis","polynomials","lean","formalization","construction"],"humans":["Tom Adamczewski"],"year_posed":1981,"sources":[{"label":"GitHub: tadamcz/mean-value-problem, the Lean 4 disproof","url":"https://github.com/tadamcz/mean-value-problem","kind":"research"},{"label":"vibemathed: Smale's mean value conjecture (K = 1)","url":"https://vibemathed.com/problem/smale-s-mean-value-conjecture-k-1","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"smale-s-mean-value-conjecture-k-1","url":"https://vibemathed.com/problem/smale-s-mean-value-conjecture-k-1"},{"registry":"mathdb","id":"359693","title":"Smale's mean value conjecture","url":"https://mathdb.com/p/359693/smale-s-mean-value-conjecture","note":"MathDB states the sharp form with constant n/(n+1), which a counterexample at K = 1 also refutes."}],"url":"https://whataifound.org/finding/2026-09-03-smale-mean-value-k1"},{"id":"2026-09-02-daykin-frankl-conjecture","title":"Confirmation of the Daykin-Frankl conjecture from a language-model proof","claim":"A four-page note verifies and communicates a language-model-generated proof of the 1983 Daykin-Frankl conjecture on incomparable elements in convex subsets of the Boolean lattice.","field":"mathematics","date":"2026-09-02","added":"2026-09-07","lab":"Independent","model":"GPT-5.6 Sol Pro","verification":"author-verified","autonomy":"ai-led","tags":["combinatorics","boolean-lattice","order-theory","argument"],"humans":["Kada Williams"],"year_posed":1983,"sources":[{"label":"arXiv: Confirmation of the Daykin-Frankl conjecture","url":"https://arxiv.org/abs/2609.03087","kind":"research"},{"label":"vibemathed: The Daykin-Frankl conjecture on convex subsets of the Boolean lattice","url":"https://vibemathed.com/problem/daykin-frankl-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"daykin-frankl-conjecture","url":"https://vibemathed.com/problem/daykin-frankl-conjecture"}],"url":"https://whataifound.org/finding/2026-09-02-daykin-frankl-conjecture"},{"id":"2026-09-02-prime-gaps-186","title":"Prime gaps at most 186, conditional on three unproved Lean axioms","claim":"An OpenAI repository derives a bound of 186 on infinitely many prime gaps in Lean, from three inputs it states as axioms rather than proving.","field":"mathematics","date":"2026-09-02","added":"2026-09-15","lab":"OpenAI","model":"GPT-6 Astra","verification":"claimed","autonomy":"ai-led","tags":["number-theory","prime-gaps","sieve-methods","lean","formalization","argument"],"year_posed":1849,"sources":[{"label":"GitHub: openai/PrimeGaps186, the conditional Lean formalization and numerical certificate","url":"https://github.com/openai/PrimeGaps186","kind":"research"},{"label":"vibemathed: prime gaps at most 186","url":"https://vibemathed.com/problem/prime-gaps-at-most-186","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"prime-gaps-at-most-186","url":"https://vibemathed.com/problem/prime-gaps-at-most-186"}],"url":"https://whataifound.org/finding/2026-09-02-prime-gaps-186"},{"id":"2026-09-02-qma2-oracle-separation","title":"A quantum oracle separating QMA(2) from QMA","claim":"A quantum oracle is constructed relative to which QMA(2) differs from QMA, resolving Watrous's no-disentanglers conjecture, from a proof idea the authors state was generated by a language model.","field":"computer-science","date":"2026-09-02","added":"2026-09-07","lab":"MIT / Columbia / University of Washington","model":"ChatGPT 5.6 Sol","verification":"author-verified","autonomy":"ai-assisted","tags":["quantum-computing","complexity-theory","oracle-separation","argument"],"humans":["John Bostanci","Sabee Grewal","Jonas Haferkamp","Andrew Huang","Yeongwoo Hwang","Anand Natarajan","Chinmay Nirkhe"],"year_posed":2009,"sources":[{"label":"arXiv: A quantum oracle separation between QMA(2) and QMA","url":"https://arxiv.org/abs/2609.02865","kind":"research"},{"label":"vibemathed: A quantum oracle separation between QMA(2) and QMA","url":"https://vibemathed.com/problem/a-quantum-oracle-separation-between-mathsf-qma-2-and-mathsf-qma","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"a-quantum-oracle-separation-between-mathsf-qma-2-and-mathsf-qma","url":"https://vibemathed.com/problem/a-quantum-oracle-separation-between-mathsf-qma-2-and-mathsf-qma"}],"url":"https://whataifound.org/finding/2026-09-02-qma2-oracle-separation"},{"id":"2026-09-02-trautman-conjecture","title":"A smooth counterexample to the Trautman conjecture","claim":"A strongly pseudoconvex CR three-manifold is constructed that carries a nowhere-zero closed section of its canonical bundle yet is not locally embeddable, disproving the Trautman conjecture.","field":"mathematics","date":"2026-09-02","added":"2026-09-07","lab":"Oklahoma State University","model":"ChatGPT Plus, version not named","verification":"author-verified","autonomy":"ai-assisted","tags":["differential-geometry","cr-geometry","counterexample","construction"],"humans":["Sean N. Curry"],"year_posed":1998,"sources":[{"label":"arXiv: A Smooth Counterexample to the Trautman Conjecture","url":"https://arxiv.org/abs/2609.03198","kind":"research"},{"label":"vibemathed: A smooth counterexample to the Trautman conjecture","url":"https://vibemathed.com/problem/a-smooth-counterexample-to-the-trautman-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"a-smooth-counterexample-to-the-trautman-conjecture","url":"https://vibemathed.com/problem/a-smooth-counterexample-to-the-trautman-conjecture"}],"url":"https://whataifound.org/finding/2026-09-02-trautman-conjecture"},{"id":"2026-09-01-mckean-entropy-production","title":"Entropy production of the Boltzmann equation is not always monotone","claim":"Explicit radially symmetric mixtures of Maxwellians show the entropy production of the Boltzmann equation need not decrease monotonically, answering a question McKean asked in 1966.","field":"mathematics","date":"2026-09-01","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude","verification":"author-verified","autonomy":"ai-led","tags":["analysis","pde","mathematical-physics","counterexample"],"humans":["Luis Silvestre"],"year_posed":1966,"sources":[{"label":"arXiv: the entropy production is not always monotone for hard spheres or for Maxwell molecules","url":"https://arxiv.org/abs/2609.01753","kind":"research"},{"label":"vibemathed: McKean entropy-production conjecture","url":"https://vibemathed.com/problem/mckean-entropy-production-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"mckean-entropy-production-conjecture","url":"https://vibemathed.com/problem/mckean-entropy-production-conjecture"}],"url":"https://whataifound.org/finding/2026-09-01-mckean-entropy-production"},{"id":"2026-09-01-saxl-common-neighbour","title":"Common neighbour conjectures for Saxl graphs fail at every base size","claim":"Primitive permutation groups are constructed whose generalised Saxl graphs contain two nonadjacent vertices with no common neighbour, disproving the Burness-Giudici conjecture and its extension at every base size.","field":"mathematics","date":"2026-09-01","added":"2026-09-03","lab":"Independent","model":"Codex; ChatGPT Pro; Claude","verification":"formal","autonomy":"collaborative","tags":["group-theory","combinatorics","counterexample","lean","formalization"],"humans":["Aluna Rizzoli","Adam R. Thomas"],"year_posed":2020,"sources":[{"label":"arXiv: common neighbour conjectures for Saxl graphs fail at every base size","url":"https://arxiv.org/abs/2609.01367","kind":"research"},{"label":"vibemathed: common neighbour conjectures for Saxl graphs","url":"https://vibemathed.com/problem/common-neighbour-conjectures-for-saxl-graphs","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"common-neighbour-conjectures-for-saxl-graphs","url":"https://vibemathed.com/problem/common-neighbour-conjectures-for-saxl-graphs"}],"url":"https://whataifound.org/finding/2026-09-01-saxl-common-neighbour"},{"id":"2026-08-31-boolean-multiplicative-complexity-mul4","title":"Unrestricted Boolean multiplicative complexity of four-term binary polynomial multiplication","claim":"Multiplying two four-term binary polynomials needs exactly nine AND gates even when nonlinear intermediate wires may be reused, with the whole result formalized in Lean 4.","field":"computer-science","date":"2026-08-31","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude Opus 5","verification":"formal","autonomy":"ai-assisted","tags":["circuit-complexity","algorithms","lean","formalization"],"humans":["Gregory Morse"],"year_posed":2014,"sources":[{"label":"arXiv: unrestricted Boolean multiplicative complexity of four-term binary polynomial multiplication","url":"https://arxiv.org/abs/2608.30238","kind":"research"},{"label":"vibemathed: unrestricted Boolean multiplicative complexity of Mul4","url":"https://vibemathed.com/problem/unrestricted-multiplicative-complexity-mul4","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"unrestricted-multiplicative-complexity-mul4","url":"https://vibemathed.com/problem/unrestricted-multiplicative-complexity-mul4"},{"registry":"palomar","id":"PALOMAR-2026-09-21-000005","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-21-000005&version=1","repository":"GregoryMorse/unrestricted-boolean-mul","commit":"56837b8ed4ffe6390a7a84d9a77f1489bfd9d872","theorems":["UnrestrictedBooleanMul.mc_mul_zero","UnrestrictedBooleanMul.mc_mul_one","UnrestrictedBooleanMul.mc_mul_two","UnrestrictedBooleanMul.mc_mul_three","UnrestrictedBooleanMul.N4.no_eight_gate_circuit","UnrestrictedBooleanMul.N4.mc_mul_four"],"checked":"2026-09-21","note":"Registered by the author. Palomar's record states that the open unrestricted and bilinear lower bounds for five and six terms are not claims of this submission."}],"url":"https://whataifound.org/finding/2026-08-31-boolean-multiplicative-complexity-mul4"},{"id":"2026-08-31-pisot-cantor-equidistribution","title":"Criteria and two quadratic instances for Bugeaud's Problem 10.61","claim":"Covering criteria for a 1967 equidistribution problem of Mendès France are proved and applied to two quadratic Pisot cases, with Lean checking; the general problem stays open.","field":"mathematics","date":"2026-08-31","added":"2026-09-03","lab":"Independent","model":"Claude Fable 5; Claude Opus 5","verification":"claimed","autonomy":"ai-led","tags":["number-theory","equidistribution","lean","partial-result"],"humans":["Ralf Stephan"],"year_posed":1967,"sources":[{"label":"GitHub: Pisot-Cantor-61, paper and Lean development","url":"https://github.com/rwst/Pisot-Cantor-61","kind":"research"},{"label":"vibemathed: Bugeaud Problem 10.61","url":"https://vibemathed.com/problem/bugeaud-problem-10-61","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"bugeaud-problem-10-61","url":"https://vibemathed.com/problem/bugeaud-problem-10-61"},{"registry":"palomar","id":"PALOMAR-2026-08-31-000013","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-31-000013&version=2","repository":"rwst/Pisot-Cantor-61","commit":"d61132ffcdb748b641f9de59b7acfffc860796b2","theorems":["BB61.QuadSetup.equidistributed_iff_exists_invariant_measure","BB61.QuadSetup.forall_not_equidistributed_iff_exists_trigCertificate","MeasureTheory.le_integral_of_partitionPressure_le","BB61.forall_not_equidistributed_of_partitionPressure_lt","BB61.forall_not_equidistributed_of_transferBound","BB61.QuadSetup.routeAExponent_mul_hMin","BB61.slope_neg_iff","BB61.logb_coverTotal_balancedDepth_le","BB61.QuadSetup.exists_avoided_interval","BB61.QuadSetup.not_equidistributed_of_routeAExponent_lt_one","BB61.QuadSetup.routeAExponent_lt_one_iff_quadratic","BB61.isPisot_family","BB61.norm_le_familyConjBound","BB61.routeA_family_lt_one","BB61.routeA_two_add_sqrt5","BB61.two_add_sqrt5_not_equidistributed","BB61.GapThree.problem_10_61_two_add_sqrt3_axiom_free"],"checked":"2026-09-06","note":"What typechecks is the criteria and the two quadratic instances, not Problem 10.61. BB61.QuadSetup.routeAExponent_lt_one_iff_quadratic is where that boundary is visible: the covering criterion is characterized only for quadratic setups, and the arbitrary-degree material carries no compared statement to the problem. Every compared statement depends on propext, Classical.choice and Quot.sound and nothing else. Palomar also carries the submitter's own disclosure that he has not verified informal-to-formal fidelity, and that the challenge file governs wherever the prose disagrees with it."}],"url":"https://whataifound.org/finding/2026-08-31-pisot-cantor-equidistribution"},{"id":"2026-08-31-stable-forking","title":"Counterexample to the stable forking conjecture","claim":"A simple first-order theory is constructed in which forking cannot always be witnessed by a stable formula, answering a question of Hart, Kim and Pillay open since 1996.","field":"mathematics","date":"2026-08-31","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol","verification":"author-verified","autonomy":"collaborative","tags":["model-theory","logic","counterexample","construction"],"humans":["James Freitag","Scott Mutchnik"],"year_posed":1996,"sources":[{"label":"arXiv: a counterexample to the stable forking conjecture","url":"https://arxiv.org/abs/2609.00436","kind":"research"},{"label":"vibemathed: a counterexample to the stable forking conjecture","url":"https://vibemathed.com/problem/a-counterexample-to-the-stable-forking-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"a-counterexample-to-the-stable-forking-conjecture","url":"https://vibemathed.com/problem/a-counterexample-to-the-stable-forking-conjecture"},{"registry":"mathdb","id":"375925","title":"The stable forking conjecture","url":"https://mathdb.com/p/375925/the-stable-forking-conjecture"}],"url":"https://whataifound.org/finding/2026-08-31-stable-forking"},{"id":"2026-08-29-dean-conjecture-k5","title":"Dean's conjecture for k = 5, cycles of length divisible by five","claim":"A preprint claims every finite simple graph of minimum degree at least five contains a cycle whose length is divisible by five, the last open case of Dean's 1988 conjecture.","field":"mathematics","date":"2026-08-29","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude Opus 5; GLM 5.3 Flash","verification":"claimed","autonomy":"ai-led","tags":["graph-theory","combinatorics","computer-assisted","argument"],"humans":["Elias Botsford"],"year_posed":1988,"sources":[{"label":"Zenodo: cycles of length divisible by five in graphs of minimum degree five","url":"https://zenodo.org/records/22182448","kind":"research"},{"label":"Zenodo: computational supplement, version 1.0.1","url":"https://doi.org/10.5281/zenodo.22167084","kind":"research"},{"label":"vibemathed: Dean's conjecture for k = 5","url":"https://vibemathed.com/problem/dean-s-conjecture-for-k-5","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"dean-s-conjecture-for-k-5","url":"https://vibemathed.com/problem/dean-s-conjecture-for-k-5"},{"registry":"mathdb","id":"374541","title":"Dean's conjecture on cycles divisible by the minimum degree","url":"https://mathdb.com/p/374541/dean-s-conjecture-on-cycles-divisible-by-the-minimum-degree","note":"Names the same three models this entry credits and records k = 5 as the last open case, which is the framing the entry rests on."}],"url":"https://whataifound.org/finding/2026-08-29-dean-conjecture-k5"},{"id":"2026-08-29-metric-distortion-23282","title":"Randomized metric distortion improved to 2.3282","claim":"A randomized voting rule built on a new random-size stable lottery achieves metric distortion 2.3282, past a 2.5 barrier that existing arguments could not cross.","field":"computer-science","date":"2026-08-29","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude Opus 5.0","verification":"author-verified","autonomy":"ai-led","tags":["algorithms","social-choice","game-theory","argument"],"humans":["Nisarg Shah"],"sources":[{"label":"arXiv: improving randomized metric distortion to 2.3282","url":"https://arxiv.org/abs/2608.29308","kind":"research"},{"label":"vibemathed: improving randomized metric distortion to 2.3282","url":"https://vibemathed.com/problem/improving-randomized-metric-distortion-to-2-3282","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"improving-randomized-metric-distortion-to-2-3282","url":"https://vibemathed.com/problem/improving-randomized-metric-distortion-to-2-3282"}],"url":"https://whataifound.org/finding/2026-08-29-metric-distortion-23282"},{"id":"2026-08-28-percolation-critical-point","title":"Lean proof that the percolation probability vanishes at the critical point in every dimension","claim":"A Lean development proves that nearest-neighbour Bernoulli bond percolation on the integer lattice has no infinite cluster at its critical parameter in every dimension at least two, which would settle the dimensions 3 to 10 that were open.","field":"mathematics","date":"2026-08-28","added":"2026-09-07","lab":"Anthropic","model":"Anthropic Claude models, versions not stated","verification":"claimed","autonomy":"ai-led","tags":["probability","percolation","lean","formalization","argument"],"humans":["Justin Leder"],"sources":[{"label":"GitHub: anthropics/formal-math, percolation project at the pinned commit 795efb86","url":"https://github.com/anthropics/formal-math/tree/795efb86f191735c5481675763537cfb4ff37e55/percolation","kind":"research"},{"label":"Audit record for the percolation project","url":"https://github.com/anthropics/formal-math/blob/795efb86f191735c5481675763537cfb4ff37e55/percolation/AUDIT.md","kind":"research"},{"label":"arXiv: Kozma and Nitzan, gluing inequalities for percolation","url":"https://arxiv.org/abs/2401.12397","kind":"research"},{"label":"Quanta Magazine: Major lattice proof percolates through math","url":"https://www.quantamagazine.org/update/167694/","kind":"coverage"}],"registrations":[{"registry":"vibemathed","id":"absence-of-critical-bernoulli-bond-percolation-on-z-d-in-every-dimension-d-2","url":"https://vibemathed.com/problem/absence-of-critical-bernoulli-bond-percolation-on-z-d-in-every-dimension-d-2","note":"Registered on 2026-09-03 under a different title, against the same pinned commit 795efb86 this entry cites. Rated lean-verified but review pending."}],"url":"https://whataifound.org/finding/2026-08-28-percolation-critical-point"},{"id":"2026-08-27-entanglement-supporting-functional","title":"Supporting affine functionals for entanglement of formation need not exist","claim":"An explicit two-qubit state has no global supporting affine functional for the entanglement of formation, contradicting an assumption used in several papers.","field":"physics","date":"2026-08-27","added":"2026-09-03","lab":"Independent","model":"Claude Fable 5","verification":"author-verified","autonomy":"ai-assisted","tags":["quantum-information","entanglement","counterexample"],"humans":["A. S. Holevo","M. E. Shirokov"],"sources":[{"label":"arXiv: on supporting affine functionals for entanglement of formation","url":"https://arxiv.org/abs/2608.27363","kind":"research"},{"label":"vibemathed: supporting affine functionals for entanglement of formation","url":"https://vibemathed.com/problem/supporting-affine-functionals-for-entanglement-of-formation","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"supporting-affine-functionals-for-entanglement-of-formation","url":"https://vibemathed.com/problem/supporting-affine-functionals-for-entanglement-of-formation"}],"url":"https://whataifound.org/finding/2026-08-27-entanglement-supporting-functional"},{"id":"2026-08-27-intuitionistic-higher-order-truth","title":"Not every Heyting algebra is the subterminal lattice of a topos","claim":"The free Heyting algebra on two generators cannot be the lattice of subterminal objects of an elementary topos, answering the question in the negative.","field":"mathematics","date":"2026-08-27","added":"2026-09-03","lab":"Independent","model":"ChatGPT 5.6 Sol","verification":"author-verified","autonomy":"ai-assisted","tags":["logic","category-theory","counterexample"],"humans":["Lingyuan Ye","Yiqi Xu"],"sources":[{"label":"arXiv: failure of higher-order truth within intuitionistic propositional logic","url":"https://arxiv.org/abs/2608.26874","kind":"research"},{"label":"vibemathed: failure of higher-order truth within intuitionistic propositional logic","url":"https://vibemathed.com/problem/failure-of-higher-order-truth-within-intuitionistic-propositional-logic","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"failure-of-higher-order-truth-within-intuitionistic-propositional-logic","url":"https://vibemathed.com/problem/failure-of-higher-order-truth-within-intuitionistic-propositional-logic"}],"url":"https://whataifound.org/finding/2026-08-27-intuitionistic-higher-order-truth"},{"id":"2026-08-27-large-systoles","title":"Hyperbolic surfaces with large systoles in every large genus","claim":"For every sufficiently large genus there is a closed hyperbolic surface whose systole is at least \\(\\log g - 12\\log\\log g\\), raising the known asymptotic constant from 2/9 to 1.","field":"mathematics","date":"2026-08-27","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol","verification":"author-verified","autonomy":"ai-led","tags":["geometry","hyperbolic-geometry","construction"],"humans":["Yifei Cai"],"sources":[{"label":"arXiv: a note on surfaces with large systoles","url":"https://arxiv.org/abs/2608.26660","kind":"research"},{"label":"vibemathed: large systoles in every sufficiently large genus","url":"https://vibemathed.com/problem/large-systoles-in-every-sufficiently-large-genus","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"large-systoles-in-every-sufficiently-large-genus","url":"https://vibemathed.com/problem/large-systoles-in-every-sufficiently-large-genus"}],"url":"https://whataifound.org/finding/2026-08-27-large-systoles"},{"id":"2026-08-27-lyons-white-conjecture","title":"Proof of the Lyons–White conjecture on rate-monotonic random walks","claim":"For continuous-time random walks on dihedral groups, raising the jump rates never increases the \\(\\ell^p\\) distance from the uniform distribution when \\(p\\) is an even integer, and for every other \\(p \\ge 1\\) some dihedral group breaks this, which answers a question Lyons and White left open; all three theorems come with a Lean formalization produced by AxiomProver.","field":"mathematics","date":"2026-08-27","added":"2026-10-12","lab":"Axiom Math","model":"AxiomProver","verification":"formal","autonomy":"ai-assisted","tags":["probability","random-walks","group-theory","lean","formalization","argument"],"humans":["Colin Defant","Ken Ono"],"year_posed":2021,"sources":[{"label":"arXiv: Proof of the Lyons–White Conjecture","url":"https://arxiv.org/abs/2608.27708","kind":"research"},{"label":"GitHub: AxiomMath/LyonsWhite, the Lean formalization and challenge file","url":"https://github.com/AxiomMath/LyonsWhite","kind":"research"},{"label":"arXiv: Lyons and White, Monotonicity for continuous-time random walks","url":"https://arxiv.org/abs/2109.10386","kind":"research"},{"label":"Axiom Math: Faster Is Not Nearer","url":"https://www.axiommath.ai/blog/faster-is-not-nearer","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-08-27-lyons-white-conjecture"},{"id":"2026-08-27-norm-variation-ergodic-averages-lean","title":"Norm-variation of multiple ergodic averages, including Tao's norm-convergence theorem, autoformalized in Lean in one week","claim":"A Lean 4 proof of about 107,000 lines of a new norm-variation estimate for multiple ergodic averages of commuting transformations, which strengthens Tao's 2008 norm-convergence theorem, was produced by coding agents in one week from a human-written blueprint and hand-formalized statements.","field":"mathematics","date":"2026-08-27","added":"2026-09-28","lab":"Independent","model":"Coding agents, models not stated","verification":"author-verified","autonomy":"ai-led","tags":["ergodic-theory","harmonic-analysis","lean","formalization"],"humans":["Floris van Doorn","Polona Durcik","Joris Roos","Lenka Slavíková","Christoph Thiele"],"sources":[{"label":"arXiv: A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations","url":"https://arxiv.org/abs/2608.27321","kind":"research"},{"label":"GitHub: roos-j/lean-nct","url":"https://github.com/roos-j/lean-nct","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-09-15-000008","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-09-15-000008&version=1","repository":"roos-j/lean-nct","commit":"3e09aa52c478ec69abb02eb250c5e5ed06653c3a","theorems":["nCT.main_ergodic_theorem","nCT.tao_norm_convergence","nCT.main_twisted_theorem"],"checked":"2026-09-15"}],"url":"https://whataifound.org/finding/2026-08-27-norm-variation-ergodic-averages-lean"},{"id":"2026-08-26-nevanlinna-half-plane","title":"Counterexample to Nevanlinna's half-plane omitted-values question","claim":"An explicit meromorphic function omits three values in a half-plane without being of bounded type there, answering in the negative a question of Nevanlinna open for more than a century.","field":"mathematics","date":"2026-08-26","added":"2026-08-31","lab":"Independent","model":"GPT-5.6 Sol Ultra","verification":"formal","autonomy":"ai-led","tags":["complex-analysis","value-distribution","counterexample","construction","lean","formalization"],"humans":["Quanyu Tang","Bokai Cui","Wei He","Tao Hu","Yanyang Li","Ke Wang","Zijun Yu"],"sources":[{"label":"arXiv: Three omitted values and non-Blaschke point divisors in half-planes","url":"https://arxiv.org/abs/2608.26062","kind":"research"},{"label":"GitHub: QuanyuTang/three-omitted-values-palomar, the authors' Lean formalization of Theorem 1.2","url":"https://github.com/QuanyuTang/three-omitted-values-palomar","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"nevanlinna-s-half-plane-omitted-values-problem","url":"https://vibemathed.com/problem/nevanlinna-s-half-plane-omitted-values-problem"},{"registry":"mathdb","id":"392094","title":"Nevanlinna's half-plane problem","url":"https://mathdb.com/p/392094/nevanlinna-s-half-plane-problem","note":"Tracks the identical claimed counterexample to the same century-old problem."},{"registry":"palomar","id":"PALOMAR-2026-10-29-000014","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-10-29-000014&version=1","title":"Three omitted values and non-Blaschke point divisors in half-planes","repository":"QuanyuTang/three-omitted-values-palomar","commit":"c408da985b3b0498f6f2df702739673865a8b932","theorems":["PalomarTheorem12.main_result"],"checked":"2026-10-29","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice. The repository reports that Lean, NanoDa and con-ron accepted the proof at the registered commit."}],"url":"https://whataifound.org/finding/2026-08-26-nevanlinna-half-plane"},{"id":"2026-08-26-spin-systems-girth-five","title":"Rapid mixing for spin systems on graphs of girth at least five","claim":"Glauber dynamics for proper \\(q\\)-colourings mixes rapidly once \\(q\\) exceeds the maximum degree by any fixed factor, provided the graph has girth at least five.","field":"computer-science","date":"2026-08-26","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol Ultra","verification":"author-verified","autonomy":"collaborative","tags":["algorithms","sampling","markov-chains","combinatorics","argument"],"humans":["Xiaoyu Chen","Kuikui Liu"],"year_posed":1995,"sources":[{"label":"arXiv: a spectral local-to-global principle for spin systems on graphs with girth at least five","url":"https://arxiv.org/abs/2608.25491","kind":"research"},{"label":"vibemathed: rapid mixing for spin systems on graphs of girth at least five","url":"https://vibemathed.com/problem/rapid-mixing-for-spin-systems-on-graphs-of-girth-at-least-five","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"rapid-mixing-for-spin-systems-on-graphs-of-girth-at-least-five","url":"https://vibemathed.com/problem/rapid-mixing-for-spin-systems-on-graphs-of-girth-at-least-five"}],"url":"https://whataifound.org/finding/2026-08-26-spin-systems-girth-five"},{"id":"2026-08-25-erdos-4-prime-gaps","title":"Improved lower bound for large gaps between consecutive primes","claim":"A new sieving construction raises the record lower bound on how large the gap between consecutive primes becomes infinitely often, the first advance on Erdős Problem #4 since 2018.","field":"mathematics","date":"2026-08-25","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol","verification":"independent","autonomy":"ai-led","tags":["number-theory","erdos","prime-gaps","sieve-methods","construction"],"humans":["DottedCalculator","Boris Alexeev"],"year_posed":1955,"sources":[{"label":"Manuscript: Erdős_4_GPT_5.6_Sol.pdf","url":"https://github.com/DottedCalculator/ai-math/blob/main/Erdos_4_GPT_5.6_Sol.pdf","kind":"research"},{"label":"Erdős Problems: problem #4","url":"https://www.erdosproblems.com/4","kind":"commentary"},{"label":"vibemathed: a tilted residue-class construction for long prime-free intervals","url":"https://vibemathed.com/problem/tilted-residue-class-construction-for-long-prime-free-intervals","kind":"commentary"},{"label":"Jared Duker Lichtman on the result (X)","url":"https://x.com/jdlichtman/status/2094040463443673227","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"tilted-residue-class-construction-for-long-prime-free-intervals","url":"https://vibemathed.com/problem/tilted-residue-class-construction-for-long-prime-free-intervals"}],"url":"https://whataifound.org/finding/2026-08-25-erdos-4-prime-gaps"},{"id":"2026-08-25-froberg-quintics-septics","title":"Fröberg's conjecture for quintics and septics in four variables","claim":"Fröberg's predicted Hilbert series is proved for ideals generated by any number of general forms of degree five or seven in four variables.","field":"mathematics","date":"2026-08-25","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude Fable 5; Grok 4.6","verification":"author-verified","autonomy":"collaborative","tags":["algebra","commutative-algebra","computer-assisted"],"humans":["Qihang Wang","Dongming Zhang"],"year_posed":1985,"sources":[{"label":"arXiv: Fröberg's conjecture for quintics and septics in four variables","url":"https://arxiv.org/abs/2608.24797","kind":"research"},{"label":"vibemathed: Fröberg's conjecture for quintics and septics in four variables","url":"https://vibemathed.com/problem/froberg-s-conjecture-for-quintics-and-septics-in-four-variables","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"froberg-s-conjecture-for-quintics-and-septics-in-four-variables","url":"https://vibemathed.com/problem/froberg-s-conjecture-for-quintics-and-septics-in-four-variables"}],"url":"https://whataifound.org/finding/2026-08-25-froberg-quintics-septics"},{"id":"2026-08-25-generically-stable-keisler","title":"Equivalence of generic stability notions for Keisler measures","claim":"Three candidate definitions of generic stability for a Borel-definable global Keisler measure are shown to be equivalent, closing a research objective left open by earlier work.","field":"mathematics","date":"2026-08-25","added":"2026-09-03","lab":"Independent","model":"ChatGPT 5.5; ChatGPT 5.6 Sol; Kimi K3; Claude Fable 5","verification":"author-verified","autonomy":"ai-led","tags":["model-theory","logic","argument"],"humans":["Gabriel Conant","Kyle Gannon","James E. Hanson"],"year_posed":2020,"sources":[{"label":"arXiv: generically stable Keisler measures","url":"https://arxiv.org/abs/2608.24605","kind":"research"},{"label":"vibemathed: equivalence of generic stability notions for Keisler measures","url":"https://vibemathed.com/problem/equivalence-of-generic-stability-notions-for-keisler-measures","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"equivalence-of-generic-stability-notions-for-keisler-measures","url":"https://vibemathed.com/problem/equivalence-of-generic-stability-notions-for-keisler-measures"}],"url":"https://whataifound.org/finding/2026-08-25-generically-stable-keisler"},{"id":"2026-08-25-ramsey-algebraic-construction","title":"Improved algebraic construction for off-diagonal Ramsey numbers","claim":"A finite-geometry construction supplied by a language model, then reworked by the authors, improves the explicit lower bound for off-diagonal Ramsey numbers.","field":"mathematics","date":"2026-08-25","added":"2026-08-31","lab":"Independent","model":"ChatGPT 5.6","verification":"author-verified","autonomy":"ai-assisted","tags":["combinatorics","ramsey-theory","finite-geometry","construction"],"humans":["Ferdinand Ihringer","Sam Mattheus"],"sources":[{"label":"arXiv: An improved algebraic construction for Ramsey numbers","url":"https://arxiv.org/abs/2608.21769","kind":"research"}],"url":"https://whataifound.org/finding/2026-08-25-ramsey-algebraic-construction"},{"id":"2026-08-25-sparse-convex-body-domination","title":"Sparse domination implies convex body domination","claim":"Any bilinear form with a sparse bound has a convex body sparse bound for its vector-valued extension, answering a question about the relation between the two notions.","field":"mathematics","date":"2026-08-25","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol Pro","verification":"author-verified","autonomy":"ai-assisted","tags":["analysis","harmonic-analysis","argument"],"humans":["Aapo Laukkarinen","Emiel Lorist"],"year_posed":2017,"sources":[{"label":"arXiv: sparse domination implies convex body domination","url":"https://arxiv.org/abs/2608.24802","kind":"research"},{"label":"vibemathed: sparse domination implies convex body domination","url":"https://vibemathed.com/problem/sparse-domination-implies-convex-body-domination","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"sparse-domination-implies-convex-body-domination","url":"https://vibemathed.com/problem/sparse-domination-implies-convex-body-domination"}],"url":"https://whataifound.org/finding/2026-08-25-sparse-convex-body-domination"},{"id":"2026-08-24-ancheta-massey-linear-coding","title":"Optimal linear encoding rate for lossy compression of Bernoulli sources","claim":"Ancheta's answer to Massey's question about linear encoders for lossy compression is extended from the fair-coin case to every source bias below one half.","field":"computer-science","date":"2026-08-24","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol","verification":"author-verified","autonomy":"ai-led","tags":["information-theory","coding-theory","argument"],"humans":["Yihong Wu"],"year_posed":1978,"sources":[{"label":"arXiv: entropy of Bernoulli measures conditioned on affine subspaces and a problem of Ancheta-Massey","url":"https://arxiv.org/abs/2608.22837","kind":"research"},{"label":"vibemathed: entropy of Bernoulli measures conditioned on affine subspaces","url":"https://vibemathed.com/problem/entropy-of-bernoulli-measures-conditioned-on-affine-subspaces-and-a-problem-of-a","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"entropy-of-bernoulli-measures-conditioned-on-affine-subspaces-and-a-problem-of-a","url":"https://vibemathed.com/problem/entropy-of-bernoulli-measures-conditioned-on-affine-subspaces-and-a-problem-of-a"}],"url":"https://whataifound.org/finding/2026-08-24-ancheta-massey-linear-coding"},{"id":"2026-08-23-elliptic-rank-31","title":"Elliptic curves over the rationals of rank at least 30 and at least 31","claim":"Two explicit elliptic curves over the rationals carry 30 and 31 independent rational points, raising the Mordell-Weil rank record twice in four days.","field":"mathematics","date":"2026-08-23","added":"2026-09-03","lab":"Independent","model":"Claude","verification":"claimed","autonomy":"ai-assisted","tags":["number-theory","elliptic-curves","record","search"],"humans":["Levent Alpöge","Ava Howell"],"sources":[{"label":"Elliptic curve rank leaderboard: curve 302, rank at least 31","url":"https://elliptic-rank.icarm.cloud/curve/302","kind":"research"},{"label":"Elliptic curve rank leaderboard: curve 273, rank at least 30","url":"https://elliptic-rank.icarm.cloud/curve/273","kind":"research"},{"label":"vibemathed: a rank-31 record for an elliptic curve over Q","url":"https://vibemathed.com/problem/elliptic-curve-rank-record-thirty-one","kind":"commentary"},{"label":"vibemathed: record rank for an elliptic curve over Q","url":"https://vibemathed.com/problem/elliptic-curve-rank-record-thirty","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"elliptic-curve-rank-record-thirty-one","url":"https://vibemathed.com/problem/elliptic-curve-rank-record-thirty-one"},{"registry":"vibemathed","id":"elliptic-curve-rank-record-thirty","url":"https://vibemathed.com/problem/elliptic-curve-rank-record-thirty"}],"url":"https://whataifound.org/finding/2026-08-23-elliptic-rank-31"},{"id":"2026-08-23-s6-complex-structure","title":"A complex structure on the six-sphere","claim":"An explicit compact complex threefold, built as a family of 2-tori over the \\((3, 4, \\infty)\\) orbifold, is diffeomorphic to the six-sphere, which settles the question Hopf raised in 1948 of whether the six-sphere admits a complex structure.","field":"mathematics","date":"2026-08-23","added":"2026-08-25","lab":"Anthropic","model":"Claude, version not stated","verification":"independent","autonomy":"ai-assisted","tags":["complex-geometry","differential-geometry","hopf-problem","construction","contested"],"humans":["Levent Alpöge"],"year_posed":1948,"sources":[{"label":"Alpöge: The (3,4,infinity) modular family of 2-tori is a complex structure on S⁶ (PDF)","url":"https://alpo.ge/s6.pdf","kind":"research"},{"label":"Coverage: officechai","url":"https://officechai.com/ai/anthropic-researcher-says-claude-helped-build-a-complex-structure-on-s%E2%81%B6-taking-aim-at-the-unsolved-hopf-problem/","kind":"coverage"},{"label":"Levent Alpöge, announcement (X)","url":"https://x.com/__alpoge__/status/2091639597193368014","kind":"announcement"},{"label":"GitHub: plby/HopfProblem, Boris Alexeev's Lean formalization","url":"https://github.com/plby/HopfProblem","kind":"research"},{"label":"Philip Engel: Complex structures on S6, a self-contained proof (PDF)","url":"https://philip-engel.github.io/S6.pdf","kind":"commentary"},{"label":"Quanta Magazine: update on the six-sphere, with Engel and Abouzaid on checking it","url":"https://www.quantamagazine.org/updates/transformation/#167201","kind":"coverage"},{"label":"Scientific American: AI solves 79-year-old math mystery of six-dimensional spheres","url":"https://www.scientificamerican.com/article/ai-solves-79-year-old-math-mystery-of-six-dimensional-spheres/","kind":"coverage"}],"registrations":[{"registry":"vibemathed","id":"modular-family-of-2-tori-as-a-complex-structure-on-s6","url":"https://vibemathed.com/problem/modular-family-of-2-tori-as-a-complex-structure-on-s6"}],"url":"https://whataifound.org/finding/2026-08-23-s6-complex-structure"},{"id":"2026-08-22-erdos-270-affine-transcendence","title":"Transcendence in the affine case of Erdős Problem 270","claim":"The series in Erdős Problem 270 is claimed transcendental for every positive integer-valued affine choice of the defining function.","field":"mathematics","date":"2026-08-22","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol (Codex)","verification":"claimed","autonomy":"ai-led","tags":["number-theory","erdos","transcendence","lean"],"year_posed":1980,"sources":[{"label":"GitHub: algebraic independence in the affine case of Erdős Problem 270","url":"https://github.com/clambro/erdos-270-transcendence","kind":"research"},{"label":"Erdős Problems: problem #270","url":"https://www.erdosproblems.com/270","kind":"commentary"},{"label":"vibemathed: transcendence in the affine case of Erdős Problem 270","url":"https://vibemathed.com/problem/transcendence-in-the-affine-case-of-erdos-problem-270","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"transcendence-in-the-affine-case-of-erdos-problem-270","url":"https://vibemathed.com/problem/transcendence-in-the-affine-case-of-erdos-problem-270"}],"url":"https://whataifound.org/finding/2026-08-22-erdos-270-affine-transcendence"},{"id":"2026-08-21-bounded-mass-property","title":"Counterexample to the bounded mass property on the Hopf threefold","claim":"The bounded mass property fails on the Hopf threefold, answering a question of Boucksom, Guedj and Lu.","field":"mathematics","date":"2026-08-21","added":"2026-09-03","lab":"Independent","model":"Rethlas agent (GPT-5.6 Sol)","verification":"author-verified","autonomy":"ai-led","tags":["geometry","complex-geometry","counterexample"],"humans":["Mingchen Xia","Kewei Zhang"],"year_posed":2025,"sources":[{"label":"arXiv: a counterexample to the bounded mass property","url":"https://arxiv.org/abs/2608.21053","kind":"research"},{"label":"vibemathed: bounded mass property for compact complex manifolds","url":"https://vibemathed.com/problem/bounded-mass-property-for-compact-complex-manifolds","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"bounded-mass-property-for-compact-complex-manifolds","url":"https://vibemathed.com/problem/bounded-mass-property-for-compact-complex-manifolds"}],"url":"https://whataifound.org/finding/2026-08-21-bounded-mass-property"},{"id":"2026-08-21-dubickas-square-roots","title":"Dubickas's question on integral parts of powers of square roots settled","claim":"The square root of 3 admits a real multiplier making every integral part of its powers even, and among integers only the square root of 2 fails to, answering a question Dubickas posed in 2006 and classifying the whole square-root case.","field":"mathematics","date":"2026-08-21","added":"2026-08-25","lab":"Independent","model":"Claude Fable 5 and Claude Opus 5","verification":"formal","autonomy":"ai-led","tags":["lean","formalization","number-theory","z-numbers","argument"],"humans":["Ralf Stephan"],"year_posed":2006,"sources":[{"label":"Even integral parts of powers of square roots (ResearchGate)","url":"https://www.researchgate.net/publication/413520035_Even_integral_parts_of_powers_of_square_roots","kind":"research"},{"label":"Lean development: rwst/Square-Roots","url":"https://github.com/rwst/Square-Roots","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-23-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-23-000002&version=1","repository":"rwst/Square-Roots","commit":"e3184902f13967b9f20f37244b3d1c30610ca846","theorems":["SZ.sqrtThree_mem_MahlerZ","SZ.sqrtThree_notMem_S","SZ.sqrt_natCast_mem_S_iff"],"checked":"2026-08-23","note":"Eleven modules, no unfinished proof steps and no declared axioms beyond the three standard ones."}],"url":"https://whataifound.org/finding/2026-08-21-dubickas-square-roots"},{"id":"2026-08-21-scl-relator-invariance","title":"Stable commutator length of a relator is not a one-relator group invariant","claim":"Two explicit words give isomorphic one-relator groups whose relators have different stable commutator lengths, answering a question of Heuer and Loh in the negative.","field":"mathematics","date":"2026-08-21","added":"2026-09-03","lab":"Independent","model":"Claude Opus 5; Harmonic Aristotle","verification":"author-verified","autonomy":"ai-assisted","tags":["group-theory","geometric-group-theory","counterexample","computer-assisted"],"humans":["Artem Semidetnov"],"year_posed":2019,"sources":[{"label":"arXiv: the stable commutator length of a relator is not a one-relator group invariant","url":"https://arxiv.org/abs/2608.21465","kind":"research"},{"label":"vibemathed: the stable commutator length of a relator is not a one-relator group invariant","url":"https://vibemathed.com/problem/the-stable-commutator-length-of-a-relator-is-not-a-one-relator-group-invariant","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"the-stable-commutator-length-of-a-relator-is-not-a-one-relator-group-invariant","url":"https://vibemathed.com/problem/the-stable-commutator-length-of-a-relator-is-not-a-one-relator-group-invariant"}],"url":"https://whataifound.org/finding/2026-08-21-scl-relator-invariance"},{"id":"2026-08-20-fast-dynamo-three-torus","title":"A smooth random fast dynamo on the three-torus","claim":"A random smooth divergence-free velocity field on the three-torus is constructed whose magnetic field grows exponentially at a rate bounded below independently of the resistivity.","field":"mathematics","date":"2026-08-20","added":"2026-09-03","lab":"Independent","model":"ChatGPT 5.6 Sol Ultra","verification":"author-verified","autonomy":"ai-led","tags":["analysis","pde","probability","construction"],"humans":["Keefer Rowan"],"sources":[{"label":"arXiv: an AI-discovered smooth random fast dynamo on T³","url":"https://arxiv.org/abs/2608.20105","kind":"research"},{"label":"vibemathed: smooth random fast dynamo on the three-torus","url":"https://vibemathed.com/problem/smooth-random-fast-dynamo-on-the-three-torus","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"smooth-random-fast-dynamo-on-the-three-torus","url":"https://vibemathed.com/problem/smooth-random-fast-dynamo-on-the-three-torus"}],"url":"https://whataifound.org/finding/2026-08-20-fast-dynamo-three-torus"},{"id":"2026-08-20-marton-inner-bound","title":"Marton's inner bound shown not to reach the broadcast channel capacity region","claim":"There are discrete memoryless broadcast channels whose capacity region is strictly larger than Marton's inner bound, settling in the negative a question open since 1979.","field":"computer-science","date":"2026-08-20","added":"2026-08-21","lab":"Independent","model":"GPT-5.6 Sol, Claude Fable 5 and Claude Opus 5","verification":"author-verified","autonomy":"ai-assisted","tags":["information-theory","broadcast-channel","counterexample","construction"],"humans":["Mian Huang","Yanxiao Liu","Yi Liu"],"year_posed":1979,"sources":[{"label":"arXiv: Sub-optimality of Marton's Inner Bound for the Two-Receiver Broadcast Channel","url":"https://arxiv.org/abs/2608.19869","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"marton-inner-bound-capacity-region","url":"https://vibemathed.com/problem/marton-inner-bound-capacity-region"},{"registry":"mathdb","id":"390544","title":"Marton's conjecture on broadcast-channel capacity","url":"https://mathdb.com/p/390544/marton-s-conjecture-on-broadcast-channel-capacity","note":"MathDB records the same three models and describes the result as remaining unverified as a theorem, which matches the caveat this entry already carries."}],"url":"https://whataifound.org/finding/2026-08-20-marton-inner-bound"},{"id":"2026-08-20-pauli-fractional-colouring","title":"Counterexamples to the fractional colouring conjecture for Pauli shadow tomography","claim":"The fractional chromatic number of the anticommutation graph of large-expectation Pauli observables is not bounded by a constant over \\(\\varepsilon^2\\), removing a proposed route to triply efficient shadow tomography.","field":"physics","date":"2026-08-20","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol","verification":"author-verified","autonomy":"collaborative","tags":["quantum-information","combinatorics","counterexample"],"humans":["Jędrzej Stempin","Santiago Llorens","Felix Huber"],"year_posed":2025,"sources":[{"label":"arXiv: counterexamples to the fractional coloring conjecture for triply efficient shadow tomography","url":"https://arxiv.org/abs/2608.20113","kind":"research"},{"label":"vibemathed: the fractional colouring conjecture for triply efficient Pauli shadow tomography","url":"https://vibemathed.com/problem/fractional-colouring-pauli-shadow-tomography","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"fractional-colouring-pauli-shadow-tomography","url":"https://vibemathed.com/problem/fractional-colouring-pauli-shadow-tomography"}],"url":"https://whataifound.org/finding/2026-08-20-pauli-fractional-colouring"},{"id":"2026-08-19-big-line-big-clique","title":"First open case of the big-line-big-clique conjecture","claim":"Every finite point set of size at least \\(10^{11055931}\\) contains four collinear points or six points that pairwise see each other, settling the first open case of the Kára-Pór-Wood conjecture.","field":"mathematics","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol Pro","verification":"author-verified","autonomy":"ai-led","tags":["combinatorics","discrete-geometry","argument"],"humans":["Édouard Bonnet"],"year_posed":2005,"sources":[{"label":"arXiv: large finite point sets have 4 collinear points or a 6-clique","url":"https://arxiv.org/abs/2608.19468","kind":"research"},{"label":"vibemathed: the Kára-Pór-Wood big-line-big-clique conjecture","url":"https://vibemathed.com/problem/big-line-big-clique-four-collinear-or-six-clique","kind":"commentary"},{"label":"arXiv: Cambie, Four collinear points or six visible points","url":"https://arxiv.org/abs/2609.21035","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"big-line-big-clique-four-collinear-or-six-clique","url":"https://vibemathed.com/problem/big-line-big-clique-four-collinear-or-six-clique"},{"registry":"mathdb","id":"315965","title":"Big line big clique conjecture","url":"https://mathdb.com/p/315965/big-line-big-clique-conjecture","note":"Tracks the same Bonnet preprint resolving the (6, 4) case that this entry records."}],"url":"https://whataifound.org/finding/2026-08-19-big-line-big-clique"},{"id":"2026-08-19-caratheodory-umbilic","title":"Counterexample to the smooth Carathéodory conjecture on umbilic points","claim":"An explicit support function gives a smoothly embedded two-sphere bounding a convex body with exactly one umbilic point, so the \\(C^\\infty\\) form of Carathéodory's 1922 conjecture is false.","field":"mathematics","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"Claude; Codex","verification":"claimed","autonomy":"ai-assisted","tags":["geometry","differential-geometry","counterexample","lean","construction"],"humans":["Levent Alpöge","John-Paul Smith"],"year_posed":1922,"sources":[{"label":"Levent Alpöge, announcement (X)","url":"https://x.com/__alpoge__/status/2089971359921156203","kind":"announcement"},{"label":"vibemathed: the C-infinity Carathéodory conjecture on umbilic points","url":"https://vibemathed.com/problem/mathbb-c-infty-caratheodory-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"mathbb-c-infty-caratheodory-conjecture","url":"https://vibemathed.com/problem/mathbb-c-infty-caratheodory-conjecture"}],"url":"https://whataifound.org/finding/2026-08-19-caratheodory-umbilic"},{"id":"2026-08-19-delavina-waller-wiener","title":"The DeLaViña-Waller conjecture on the Wiener index","claim":"Every connected graph on \\(2d+1\\) vertices of diameter \\(d\\) at least 3 is claimed to have Wiener index at most that of the cycle on the same number of vertices, with the equality cases determined.","field":"mathematics","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"GPT-5.6 Sol; Claude Fable 5","verification":"author-verified","autonomy":"ai-assisted","tags":["graph-theory","combinatorics","argument"],"humans":["Mingchang Liu"],"year_posed":2008,"sources":[{"label":"Zenodo: the DeLaViña-Waller conjecture on the Wiener index","url":"https://doi.org/10.5281/zenodo.22015517","kind":"research"},{"label":"vibemathed: the DeLaViña-Waller conjecture on the Wiener index","url":"https://vibemathed.com/problem/the-delavina-waller-conjecture-on-the-wiener-index","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"the-delavina-waller-conjecture-on-the-wiener-index","url":"https://vibemathed.com/problem/the-delavina-waller-conjecture-on-the-wiener-index"},{"registry":"mathdb","id":"374919","title":"DeLaViña-Waller conjecture on the Wiener index","url":"https://mathdb.com/p/374919/delavina-waller-conjecture-on-the-wiener-index-of-graphs-of","note":"A background page for the conjecture itself. It does not mention the preprint recorded here and makes no reference to AI involvement, so it establishes the problem's standing in the literature and nothing about this result."}],"url":"https://whataifound.org/finding/2026-08-19-delavina-waller-wiener"},{"id":"2026-08-19-erdos-501-independence","title":"Erdős Problem #501 shown independent of ZFC, with both directions in Lean","claim":"The first question of Erdős Problem #501 is proved independent of ZFC, and both directions are formalized in Lean 4 as statements about the theory ZFC itself.","field":"mathematics","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"Sol; Claude","verification":"formal","autonomy":"collaborative","tags":["set-theory","erdos","lean","formalization","forcing"],"humans":["Elliot Glazer"],"year_posed":1961,"sources":[{"label":"GitHub: Erdős Problem #501 in Lean 4","url":"https://github.com/ElliotGlazer/erdos501","kind":"research"},{"label":"Erdős Problems: problem #501","url":"https://www.erdosproblems.com/501","kind":"commentary"},{"label":"vibemathed: Erdős Problem #501, infinite independent sets","url":"https://vibemathed.com/problem/erdos-501-infinite-independent-sets","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"erdos-501-infinite-independent-sets","url":"https://vibemathed.com/problem/erdos-501-infinite-independent-sets"}],"url":"https://whataifound.org/finding/2026-08-19-erdos-501-independence"},{"id":"2026-08-19-kasami-apn-triple-counts","title":"Partial proof of the Kasami APN triple-count conjecture, verified in Lean","claim":"A conjecture from a 2019 cryptography olympiad on triple counts for the Kasami almost perfect nonlinear function is proved in four residue cases and verified exhaustively for small field degrees, with every proof machine-checked.","field":"mathematics","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"Claude Fable 5; Harmonic Aristotle","verification":"formal","autonomy":"ai-led","tags":["number-theory","finite-fields","cryptography","lean","formalization"],"humans":["Gábor P. Nagy","Attila Vajda"],"year_posed":2019,"sources":[{"label":"arXiv: on a conjecture on the Kasami APN function","url":"https://arxiv.org/abs/2608.18584","kind":"research"},{"label":"vibemathed: a conjecture on triple counts for the Kasami APN function","url":"https://vibemathed.com/problem/kasami-apn-function-triple-count-conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"kasami-apn-function-triple-count-conjecture","url":"https://vibemathed.com/problem/kasami-apn-function-triple-count-conjecture"},{"registry":"mathdb","id":"383508","title":"Kasami APN function conjecture","url":"https://mathdb.com/p/383508/kasami-apn-function-conjecture"}],"url":"https://whataifound.org/finding/2026-08-19-kasami-apn-triple-counts"},{"id":"2026-08-19-linear-extensions-below-2n","title":"Counting linear extensions below the 2ⁿ barrier","claim":"A deterministic algorithm counts the linear extensions of an arbitrary \\(n\\)-element poset in time \\(O^*(1.89^n)\\), breaking the \\(2^n\\) barrier for the general problem.","field":"computer-science","date":"2026-08-19","added":"2026-09-03","lab":"Independent","model":"Claude Opus 5; ChatGPT 5.6 Sol","verification":"author-verified","autonomy":"ai-led","tags":["algorithms","combinatorics","exact-algorithms"],"humans":["Keigo Oka"],"year_posed":2013,"sources":[{"label":"arXiv: breaking the 2ⁿ barrier for counting linear extensions with a short elementary algorithm","url":"https://arxiv.org/abs/2608.19505","kind":"research"},{"label":"vibemathed: counting linear extensions below the 2ⁿ barrier","url":"https://vibemathed.com/problem/counting-linear-extensions-below-two-to-the-n","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"counting-linear-extensions-below-two-to-the-n","url":"https://vibemathed.com/problem/counting-linear-extensions-below-two-to-the-n"}],"url":"https://whataifound.org/finding/2026-08-19-linear-extensions-below-2n"},{"id":"2026-08-19-yau-tian-donaldson","title":"Counterexample to the Yau–Tian–Donaldson conjecture for constant scalar curvature metrics","claim":"A smooth polarized fivefold that is K-polystable but admits no constant scalar curvature Kähler metric, disproving the form of the Yau–Tian–Donaldson conjecture that Donaldson stated in 2002.","field":"mathematics","date":"2026-08-19","added":"2026-08-21","lab":"Independent","model":"Claude Fable 5, GPT-5.6-sol and Danus","verification":"author-verified","autonomy":"collaborative","tags":["algebraic-geometry","differential-geometry","k-stability","counterexample","construction"],"humans":["Jihao Liu","Bin Dong","Guoxiong Gao"],"year_posed":2002,"sources":[{"label":"arXiv: Disproof of the Yau–Tian–Donaldson conjecture","url":"https://arxiv.org/abs/2608.19301","kind":"research"}],"registrations":[{"registry":"mathdb","id":"383718","title":"Yau–Tian–Donaldson conjecture for constant scalar curvature metrics","url":"https://mathdb.com/p/383718/yau-tian-donaldson-conjecture-for-constant-scalar-curvature","note":"MathDB carries three records for this conjecture under permuted name orders (321390, 331106, 383718). This is the one whose title matches the usual attribution order."}],"url":"https://whataifound.org/finding/2026-08-19-yau-tian-donaldson"},{"id":"2026-08-18-prime-gaps-246","title":"Bounded prime gaps of 246 formalized in Lean from Bombieri-Vinogradov","claim":"A machine-checked Lean development proves that infinitely many pairs of primes differ by at most 246, taking the Bombieri-Vinogradov theorem as a hypothesis rather than proving it.","field":"mathematics","date":"2026-08-18","added":"2026-08-21","lab":"Axiom Math","model":"AxiomProver","verification":"formal","autonomy":"collaborative","tags":["lean","formalization","number-theory","prime-gaps","sieve-methods"],"humans":["Evan Chen","Sidharth Hariharan","Kenny Lau","Bhavik Mehta","Ken Ono","Ashvin Swaminathan","Jesse Thorner","Yunzhou Xie"],"sources":[{"label":"Axiom Math: Lean formalization of bounded gaps between primes","url":"https://primegaps.axiommath.ai/","kind":"research"},{"label":"PrimeGapsLib (Lean 4 source)","url":"https://github.com/AxiomMath/PrimeGapsLib","kind":"research"},{"label":"Axiom announcement (X)","url":"https://x.com/axiommathai/status/2089732764279132449","kind":"announcement"},{"label":"IEEE Spectrum coverage","url":"https://spectrum.ieee.org/axiom-math-246-theorem-formalization","kind":"coverage"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-18-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-18-000002&version=1","repository":"AxiomMath/PrimeGapsLib","commit":"1faa7b14e82ddebc2772dfb9153922f01b106477","theorems":["bombieriVinogradov_implies_prime_gap_le_246","bombieriVinogradov_implies_nth_prime_gap_le_246"],"checked":"2026-08-18","note":"Registered the day Palomar opened for submissions. The theorem names are where the Bombieri-Vinogradov hypothesis is visible; the project's own page does not carry that qualification."}],"url":"https://whataifound.org/finding/2026-08-18-prime-gaps-246"},{"id":"2026-08-18-stein-riesz-weak-type","title":"Dimension-free weak-type bound for the vector Riesz transform","claim":"The best constant in the weak-type (1,1) bound for the vector Riesz transform on n-dimensional space is at most 2 whatever the dimension, answering a question Stein raised in 1986.","field":"mathematics","date":"2026-08-18","added":"2026-08-31","lab":"Independent","model":"GPT-5.6 Sol and Claude Opus 5.0, with Danus and Rethlas agents","verification":"author-verified","autonomy":"collaborative","tags":["harmonic-analysis","riesz-transforms","argument"],"humans":["Yuyuan Ouyang","Daniel Spector","Cody B. Stockdale"],"year_posed":1986,"sources":[{"label":"arXiv: A dimension-free weak-type (1,1) bound for the vector Riesz transform","url":"https://arxiv.org/abs/2608.18068","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"stein-s-dimension-free-weak-1-1-riesz-transform-problem","url":"https://vibemathed.com/problem/stein-s-dimension-free-weak-1-1-riesz-transform-problem"},{"registry":"mathdb","id":"383291","title":"Stein's vector Riesz transform weak type problem","url":"https://mathdb.com/p/383291/stein-s-vector-riesz-transform-weak-type-problem","note":"Tracks the same problem this entry records a claimed resolution of. As of the September 2026 check the page still carries it as unverified, so it corroborates the problem's standing rather than the result."}],"url":"https://whataifound.org/finding/2026-08-18-stein-riesz-weak-type"},{"id":"2026-08-17-matmul-exponent","title":"Matrix multiplication exponent lowered to below 2.371177","claim":"A reformulated optimization inside the laser method, with AlphaEvolve applied as the final refinement, lowers the best known upper bound on the matrix multiplication exponent from 2.371339 to 2.371177.","field":"computer-science","date":"2026-08-17","added":"2026-08-21","lab":"Google DeepMind","model":"AlphaEvolve","verification":"author-verified","autonomy":"search-scaffold","tags":["alphaevolve","algorithms","matrix-multiplication","complexity","computation"],"humans":["Emilien Dupont","Marvin Eisenberger","Borislav Kozlovskii","Abbas Mehrabian","Francisco J. R. Ruiz","Abigail See","Renfei Zhou","Josh Alman","Virginia Vassilevska Williams","Matej Balog"],"year_posed":1969,"sources":[{"label":"arXiv: Improving the matrix multiplication exponent with modern optimization and AlphaEvolve","url":"https://arxiv.org/abs/2608.16884","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"matrix-multiplication-exponent-2371177","url":"https://vibemathed.com/problem/matrix-multiplication-exponent-2371177"},{"registry":"mathdb","id":"388199","title":"Is the exponent of matrix multiplication 2?","url":"https://mathdb.com/p/388199/is-the-exponent-of-matrix-multiplication-2","note":"Bare problem page for the open question of whether the exponent is 2. It records the problem's standing, not this result: nothing is posted against it."}],"url":"https://whataifound.org/finding/2026-08-17-matmul-exponent"},{"id":"2026-08-16-talagrand-convolution","title":"Talagrand's convolution conjecture proved on the Boolean hypercube","claim":"Convolution by a measure on the Boolean hypercube obeys the dimension-free weak-type decay Talagrand conjectured in 1989, removing the iterated-logarithm factor carried by the best previous bound.","field":"mathematics","date":"2026-08-16","added":"2026-08-21","lab":"Independent","model":"Odin Automatic AI Research Agent","verification":"author-verified","autonomy":"ai-led","tags":["probability","boolean-analysis","concentration","argument"],"humans":["Junwei Lu","Shengtao Guo","Ethan X. Fang"],"year_posed":1989,"sources":[{"label":"arXiv: Weak-Type Bounds for Convolution on the Boolean Hypercube","url":"https://arxiv.org/abs/2608.15515","kind":"research"},{"label":"arXiv: Chen, Talagrand's convolution conjecture up to loglog (prior bound)","url":"https://arxiv.org/abs/2511.19374","kind":"research"},{"label":"arXiv: Shaposhnikov, Some remarks on Talagrand's convolution conjecture","url":"https://arxiv.org/abs/2609.11290","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"talagrand-s-convolution-conjecture","url":"https://vibemathed.com/problem/talagrand-s-convolution-conjecture"},{"registry":"mathdb","id":"371652","title":"Talagrand's convolution conjecture for the Boolean hypercube","url":"https://mathdb.com/p/371652/talagrand-s-convolution-conjecture-for-the-boolean-hypercube"}],"url":"https://whataifound.org/finding/2026-08-16-talagrand-convolution"},{"id":"2026-08-13-banach-isometric","title":"Banach's isometric conjecture settled in the remaining odd dimensions","claim":"A real Banach space whose n-dimensional subspaces are all isometric to one another must be a Hilbert space for every odd n, which together with Gromov's even-dimensional theorem closes a question Banach asked in 1932.","field":"mathematics","date":"2026-08-13","added":"2026-08-21","lab":"Independent","model":"ChatGPT 5.5 Pro, ChatGPT 5.6 Pro and GPT-5.6 Sol","verification":"author-verified","autonomy":"ai-assisted","tags":["functional-analysis","banach-spaces","argument","geometry"],"humans":["Xinbao Lu","Kaiwen Yang"],"year_posed":1932,"sources":[{"label":"arXiv: A solution to Banach's isometric conjecture","url":"https://arxiv.org/abs/2608.13536","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"banach-s-isometric-conjecture","url":"https://vibemathed.com/problem/banach-s-isometric-conjecture"},{"registry":"mathdb","id":"383555","title":"Banach's isometric conjecture","url":"https://mathdb.com/p/383555/banach-s-isometric-conjecture"}],"url":"https://whataifound.org/finding/2026-08-13-banach-isometric"},{"id":"2026-08-13-sop2-sop3","title":"SOP₂ and SOP₃ theories shown to coincide","claim":"The classes of \\(\\mathrm{SOP}_2\\) and \\(\\mathrm{SOP}_3\\) first-order theories are the same, answering a 2004 question of Džamonja and Shelah and collapsing the bottom of the SOP hierarchy to a single class.","field":"mathematics","date":"2026-08-13","added":"2026-08-14","lab":"Independent","model":"ChatGPT 5.6","verification":"author-verified","autonomy":"collaborative","tags":["model-theory","logic","classification-theory"],"humans":["Artem Chernikov"],"year_posed":2004,"sources":[{"label":"arXiv: SOP₂ = SOP₃","url":"https://arxiv.org/abs/2608.13291","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"sop-2-sop-3","url":"https://vibemathed.com/problem/sop-2-sop-3"}],"url":"https://whataifound.org/finding/2026-08-13-sop2-sop3"},{"id":"2026-08-12-liquid-drop-minimizers","title":"Complete minimizer picture for Gamow's liquid drop model","claim":"Balls uniquely minimize the Gamow liquid drop energy at every volume up to a sharp threshold of about 3.51, and above that threshold no minimizer exists, closing a gap that partial results had narrowed from both sides without meeting.","field":"mathematics","date":"2026-08-12","added":"2026-08-14","lab":"Independent","model":"ChatGPT 5.6 Pro","verification":"author-verified","autonomy":"ai-led","tags":["calculus-of-variations","geometric-analysis","mathematical-physics"],"humans":["Otis Chodosh","Matilde Gianocca"],"sources":[{"label":"arXiv: No compromise in the liquid drop model","url":"https://arxiv.org/abs/2608.11517","kind":"research"},{"label":"arXiv: An improved nonexistence bound for the liquid drop model","url":"https://arxiv.org/abs/2608.09000","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"gamow-liquid-drop-minimizer-conjecture","url":"https://vibemathed.com/problem/gamow-liquid-drop-minimizer-conjecture"},{"registry":"mathdb","id":"355211","title":"Liquid-drop minimizer conjecture","url":"https://mathdb.com/p/355211/liquid-drop-minimizer-conjecture"}],"url":"https://whataifound.org/finding/2026-08-12-liquid-drop-minimizers"},{"id":"2026-08-11-prescribed-cycle-recovery","title":"A prescribed Hamiltonian cycle that a book-embedding algorithm cannot produce","claim":"A 16-vertex graph carries a Hamiltonian cycle that the Alam et al. book-embedding algorithm cannot return for any choice of dual spanning tree, answering a question of Bekos, Kaufmann and Pfister in the negative.","field":"computer-science","date":"2026-08-11","added":"2026-08-25","lab":"Independent","model":"OpenAI Codex, with Claude for adversarial review","verification":"formal","autonomy":"ai-assisted","tags":["lean","formalization","graph-theory","book-embedding","algorithms","construction"],"humans":["Lennart Rudolph"],"sources":[{"label":"Zenodo: A Counterexample to Prescribed-Cycle Recovery in Barnette Graphs","url":"https://zenodo.org/records/21890733","kind":"research"},{"label":"Lean development: lennrt/palomar-formalizations","url":"https://github.com/lennrt/palomar-formalizations","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-21-000002","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-21-000002&version=1","repository":"lennrt/palomar-formalizations","commit":"090b3b300ba8ec76fdba09a17f086953d13f2653","theorems":["BarnettePalomar.concrete_graph_certificate","BarnettePalomar.face_coloring_certificate","BarnettePalomar.property_one_excludes_prescribed_cycle"],"checked":"2026-08-21","note":"Covers the finite core only. The sphere embedding and the algorithm's Property 1 are external inputs, which the record states."}],"url":"https://whataifound.org/finding/2026-08-11-prescribed-cycle-recovery"},{"id":"2026-08-10-zeta-zeros-critical-line","title":"Proportion of zeta zeros on the critical line raised to 67.25%","claim":"An unconditional proof that at least 67.25% of the nontrivial zeros of the Riemann zeta function are simple and lie on the critical line, up from a previous record of about 41.6%, with a machine-checked Lean formalization.","field":"mathematics","date":"2026-08-10","added":"2026-08-11","lab":"Anthropic","model":"Claude (unreleased research version)","verification":"formal","autonomy":"ai-led","tags":["lean","number-theory","riemann-hypothesis","multi-agent"],"humans":["Jarred Sumner","Levent Alpöge","Ralph Furman","Eric Easley"],"sources":[{"label":"Anthropic: paper (PDF)","url":"https://www-cdn.anthropic.com/564f962e60643842f5fcb4a17c9dbc8f608f1c37.pdf","kind":"research"},{"label":"Lean 4 formalization (anthropics/zeta-23-lean)","url":"https://github.com/anthropics/zeta-23-lean","kind":"research"},{"label":"Session transcript (PDF)","url":"https://www-cdn.anthropic.com/8a0d1add3c637b858a9a181e98c40e9548c3f44f.pdf","kind":"announcement"},{"label":"arXiv: Lamzouri, A new proof that more than 2/3 of the zeros of the Riemann zeta function are simple and on the critical line","url":"https://arxiv.org/abs/2609.02882","kind":"commentary"},{"label":"arXiv: Alpoge and Furman, More than two thirds of the zeta zeros are simple and on the critical line","url":"https://arxiv.org/abs/2608.13637","kind":"research"},{"label":"Anthropic: paper, updated version of 13 August 2026 (PDF)","url":"https://www-cdn.anthropic.com/95c246936988e43127bc6b2ceb7077c1dad2d68e.pdf","kind":"research"},{"label":"Anthropic: Claude has improved on a longstanding lower bound for the fraction of zeros of the Riemann zeta function that satisfy the Riemann hypothesis","url":"https://www.anthropic.com/research/riemann-zeta","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"more-than-67-of-riemann-zeta-zeros-are-on-the-critical-line","url":"https://vibemathed.com/problem/more-than-67-of-riemann-zeta-zeros-are-on-the-critical-line","title":"The Proportion of Zeta Zeros on the Critical Line"}],"url":"https://whataifound.org/finding/2026-08-10-zeta-zeros-critical-line"},{"id":"2026-08-08-petersen-coloring","title":"A 112-vertex counterexample to the Petersen coloring conjecture","claim":"An explicit simple bridgeless cubic graph on 112 vertices admits no Petersen coloring, and hence no normal 5-edge-coloring, refuting a conjecture of Jaeger from 1985 with machine-checked UNSAT certificates.","field":"mathematics","date":"2026-08-08","added":"2026-08-14","lab":"Independent","model":"Unnamed OpenAI model","verification":"formal","autonomy":"ai-assisted","tags":["graph-theory","counterexample","sat-solver","combinatorics"],"humans":["Bryce Putman"],"year_posed":1985,"sources":[{"label":"arXiv: A 112-Vertex Counterexample to the Petersen Coloring Conjecture","url":"https://arxiv.org/abs/2608.10012","kind":"research"},{"label":"Zenodo: reproducibility artifacts and checked DRAT certificates","url":"https://doi.org/10.5281/zenodo.21845291","kind":"research"},{"label":"Open Problem Garden: Petersen coloring conjecture","url":"https://www.openproblemgarden.org/op/petersen_coloring_conjecture","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"petersen-coloring-conjecture","url":"https://vibemathed.com/problem/petersen-coloring-conjecture"},{"registry":"mathdb","id":"316003","title":"Petersen coloring conjecture","url":"https://mathdb.com/p/316003/petersen-coloring-conjecture"}],"url":"https://whataifound.org/finding/2026-08-08-petersen-coloring"},{"id":"2026-08-06-hjo-a3-rogers-ramanujan","title":"Huang-Jiang-Oblomkov conjecture for a = 3: a new infinite family of Rogers-Ramanujan identities, with a Lean certificate conditional on eight literature facts","claim":"Kenny Lau and Ken Ono prove the \\(a = 3\\) layer of the Huang-Jiang-Oblomkov conjecture, which equates a count of commuting nilpotent matrix pairs with \\(X^3 = Y^b\\) over finite fields with an explicit theta quotient, giving a new infinite family of Rogers-Ramanujan identities; AxiomProver produced a Lean certificate of the deduction from eight cited literature facts.","field":"mathematics","date":"2026-08-06","added":"2026-10-16","lab":"Axiom Math","model":"AxiomProver","verification":"claimed","autonomy":"ai-assisted","tags":["number-theory","combinatorics","q-series","lean","formalization","argument"],"humans":["Kenny Lau","Ken Ono"],"sources":[{"label":"arXiv: Lau and Ono, Modularity of Point Counts for the Curves Xᵃ = Yᵇ: New Rogers-Ramanujan Identities","url":"https://arxiv.org/abs/2608.05480","kind":"research"},{"label":"GitHub: AxiomMath/RR_a3, the conditional Lean certificate","url":"https://github.com/AxiomMath/RR_a3","kind":"research"},{"label":"arXiv: Huang, Lau, Ono and Paule, Algebraic geometric framework of Rogers-Ramanujan identities, the companion cases","url":"https://arxiv.org/abs/2608.15219","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"huang-jiang-oblomkov-a3-layer","url":"https://vibemathed.com/problem/huang-jiang-oblomkov-a3-layer"}],"url":"https://whataifound.org/finding/2026-08-06-hjo-a3-rogers-ramanujan"},{"id":"2026-08-06-kreiss-constant-separation","title":"Separation between the ordinary and strong Kreiss constants","claim":"A negative solution to the inverse generator problem on Hilbert spaces yields an operator whose Cayley transforms satisfy the ordinary Kreiss condition but are neither strongly Kreiss bounded nor power bounded.","field":"mathematics","date":"2026-08-06","added":"2026-09-03","lab":"Independent","model":"ChatGPT 5.6 Pro; Claude Fable","verification":"author-verified","autonomy":"ai-assisted","tags":["analysis","operator-theory","counterexample","lean"],"humans":["Emiel Lorist","Martin Meyries","Mark Veraar"],"year_posed":2025,"sources":[{"label":"arXiv: a solution to the inverse generator problem and related questions","url":"https://arxiv.org/abs/2608.06272","kind":"research"},{"label":"GitHub: Lean 4 formalization of Theorem 1.1","url":"https://github.com/zoowirt/inverse-generator-lean","kind":"research"},{"label":"vibemathed: separation between the ordinary and strong Kreiss constants","url":"https://vibemathed.com/problem/separation-of-ordinary-and-strong-kreiss-constants","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"separation-of-ordinary-and-strong-kreiss-constants","url":"https://vibemathed.com/problem/separation-of-ordinary-and-strong-kreiss-constants"}],"url":"https://whataifound.org/finding/2026-08-06-kreiss-constant-separation"},{"id":"2026-08-05-schiffer-conjecture","title":"Counterexamples to Schiffer's conjecture and the Pompeiu problem","claim":"Infinitely many planar domains that are not balls admit a Neumann eigenfunction of the Laplacian that is constant on the boundary, disproving Schiffer's conjecture and, through a classical equivalence, the 1929 Pompeiu problem.","field":"mathematics","date":"2026-08-05","added":"2026-08-14","lab":"Independent","model":"GPT-5.6, Claude Opus 4.8, Claude Fable 5","verification":"formal","autonomy":"ai-assisted","tags":["lean","spectral-geometry","counterexample","analysis"],"humans":["Gonzalo Cao-Labora","Jaume de Dios Pont"],"year_posed":1929,"sources":[{"label":"arXiv: Counterexamples to Schiffer's Conjecture","url":"https://arxiv.org/abs/2608.05114","kind":"research"},{"label":"Lean 4 formalization (jaumededios/Schiffer)","url":"https://github.com/jaumededios/Schiffer","kind":"research"},{"label":"Wikipedia: Pompeiu problem","url":"https://en.wikipedia.org/wiki/Pompeiu_problem","kind":"commentary"},{"label":"arXiv: Colbrook and Stepaniants, A computer-assisted counterexample to the planar Pompeiu and Schiffer conjectures","url":"https://arxiv.org/abs/2608.01579","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"schiffer-conjecture","url":"https://vibemathed.com/problem/schiffer-conjecture"},{"registry":"mathdb","id":"315903","title":"Pompeiu problem","url":"https://mathdb.com/p/315903/pompeiu-problem"}],"url":"https://whataifound.org/finding/2026-08-05-schiffer-conjecture"},{"id":"2026-08-05-sendov-conjecture","title":"Sendov's conjecture proved for every degree","claim":"For every complex polynomial of degree at least two whose zeros all lie in the closed unit disk, each zero has a critical point of the polynomial within distance one, closing a question open since 1959.","field":"mathematics","date":"2026-08-05","added":"2026-08-14","lab":"Independent","model":"GPT-5.6 Pro","verification":"formal","autonomy":"collaborative","tags":["lean","complex-analysis","polynomials","formalization"],"humans":["Lech Mazur"],"year_posed":1959,"sources":[{"label":"ProofAtlas: A Computer-Assisted Proof of Sendov's Conjecture (PDF)","url":"https://www.proofatlas.ai/papers/sendov-conjecture/SENDOV_CONJECTURE_PROOF_AUGUST_5_2026.pdf","kind":"research"},{"label":"Terence Tao: A digestion of the proof of Sendov's conjecture","url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-13-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-13-000001&version=1","repository":"teorth/sendov","commit":"e356ef6d706cc8687369f3b21bb009587e88cbe9","theorems":["SendovConjecture.sendov","SendovConjecture.phelps_rodriguez"],"checked":"2026-08-13","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice, so the development adds none of its own. This is the artifact the formal grade already rested on, now checked by someone other than its author."},{"registry":"vibemathed","id":"sendov-s-conjecture","url":"https://vibemathed.com/problem/sendov-s-conjecture"},{"registry":"mathdb","id":"315904","title":"Sendov's conjecture","url":"https://mathdb.com/p/315904/sendov-s-conjecture"},{"registry":"proofatlas","id":"sendov-conjecture","url":"https://proofatlas.ai/formalizations/sendov-conjecture/","title":"Sendov's conjecture","note":"ProofAtlas records that the build passed with no unfinished proof steps, and that the record has not reached its accepted-result status, which needs four independent reviews. Its recorded build is not the same claim as the published bundle being rebuildable; this entry's caveat that the distributed package ships no lakefile or manifest still stands."}],"url":"https://whataifound.org/finding/2026-08-05-sendov-conjecture"},{"id":"2026-08-04-moore-bound","title":"Asymptotic degree-diameter problem resolved for fixed diameter","claim":"The maximum order of a graph with maximum degree \\(d\\) and diameter \\(k\\) satisfies \\(n_k(d)/d^k\\) tending to 1 as \\(d\\) grows, for every fixed \\(k\\), resolving the asymptotic form of a question open since 1978, with a Lean 4 formalization.","field":"mathematics","date":"2026-08-04","added":"2026-08-11","lab":"Independent","model":"GPT-5.6 Pro","verification":"formal","autonomy":"ai-assisted","tags":["lean","graph-theory","combinatorics","extremal-combinatorics"],"humans":["Wouter Cames van Batenburg","Samuel Korsky"],"year_posed":1978,"sources":[{"label":"arXiv: Asymptotically attaining the Moore bound","url":"https://arxiv.org/abs/2608.03965","kind":"research"},{"label":"Lean 4 formalization (woutercvb/wewantmoore)","url":"https://github.com/woutercvb/wewantmoore","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"asymptotically-attaining-the-moore-bound","url":"https://vibemathed.com/problem/asymptotically-attaining-the-moore-bound","title":"Asymptotically attaining the Moore bound"},{"registry":"mathdb","id":"316015","title":"Degree diameter problem","url":"https://mathdb.com/p/316015/degree-diameter-problem"}],"url":"https://whataifound.org/finding/2026-08-04-moore-bound"},{"id":"2026-08-01-astra-ten-advances","title":"Ten results in mathematics and theoretical computer science with Lean certificates","claim":"An unreleased OpenAI model produced ten results including the first explicit non-sofic group and a disproof of Connes's rigidity conjecture, each published with a machine-checkable Lean 4 proof.","field":"mathematics","date":"2026-08-01","added":"2026-08-06","lab":"OpenAI","model":"Astra","verification":"formal","autonomy":"ai-led","tags":["group-theory","lean","formalization","sphere-packing","quantum-complexity"],"year_posed":1999,"sources":[{"label":"Lean 4 certificates for all ten results","url":"https://github.com/openai/ten-proofs","kind":"research"},{"label":"OpenAI: Ten advances in mathematics and theoretical computer science","url":"https://openai.com/index/ten-advances-in-mathematics/","kind":"announcement"},{"label":"Andreas Thom on the non-sofic-group result, guest post on Terence Tao's blog","url":"https://terrytao.wordpress.com/2026/09/11/on-the-existence-of-non-sofic-groups/","kind":"challenge"},{"label":"arXiv: Zhou, ICC property (T) groups without W*-superrigidity","url":"https://arxiv.org/abs/2608.02327","kind":"commentary"},{"label":"arXiv: Kun and Thom, Nonsofic wreath products of residually finite groups","url":"https://arxiv.org/abs/2608.06222","kind":"commentary"},{"label":"arXiv: Fournier-Facio, A torsion-free non-sofic group","url":"https://arxiv.org/abs/2608.02025","kind":"commentary"},{"label":"arXiv: Sienicki and Sienicki, A human audit of OpenAI's AI-generated mathematical proofs","url":"https://arxiv.org/abs/2608.14673","kind":"commentary"}],"url":"https://whataifound.org/finding/2026-08-01-astra-ten-advances"},{"id":"2026-07-29-sumset-difference-exponent","title":"Optimal exponent relating sumsets and difference sets determined","claim":"The least universal exponent \\(c\\) with \\(|A+A|/|A|\\) bounded by \\((|A-A|/|A|)^c\\) for every finite integer set \\(A\\) is determined, settling the extremal question with a Lean 4 formalization.","field":"mathematics","date":"2026-07-29","added":"2026-08-11","lab":"Tencent Hunyuan","model":"Hy3 (Hyra research agent)","verification":"formal","autonomy":"ai-led","tags":["lean","additive-combinatorics","number-theory"],"humans":["Haowei Lin","Shanda Li"],"sources":[{"label":"arXiv: Settling the Optimal Exponent Relating Sumsets and Difference Sets","url":"https://arxiv.org/abs/2607.27199","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"optimal-exponent-relating-sumsets-and-difference-sets","url":"https://vibemathed.com/problem/optimal-exponent-relating-sumsets-and-difference-sets","title":"Optimal Exponent Relating Sumsets and Difference Sets"},{"registry":"mathdb","id":"315713","title":"Optimal exponent relating sumsets and difference sets","url":"https://mathdb.com/p/315713/optimal-exponent-relating-sumsets-and-difference-sets"}],"url":"https://whataifound.org/finding/2026-07-29-sumset-difference-exponent"},{"id":"2026-07-28-kemeny-three-voters","title":"Kemeny rank aggregation shown NP-hard for three voters","claim":"Computing a Kemeny-optimal aggregate ranking is NP-hard when the input is exactly three complete rankings, closing the minimal open case left by hardness results for even voter counts.","field":"computer-science","date":"2026-07-28","added":"2026-08-11","lab":"Independent","model":"GPT-5.6 Sol Ultra, Claude Fable 5","verification":"formal","autonomy":"ai-led","tags":["lean","complexity-theory","computational-social-choice"],"humans":["Dominik Peters"],"year_posed":2001,"sources":[{"label":"arXiv: Kemeny Rank Aggregation is NP-Hard for Three Voters","url":"https://arxiv.org/abs/2607.25540","kind":"research"},{"label":"arXiv: Madarasi, The complexity of Kemeny aggregation with three rankings","url":"https://arxiv.org/abs/2607.28588","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"kemeny-three-voters","url":"https://vibemathed.com/problem/kemeny-three-voters","title":"Kemeny Rank Aggregation for Three Voters"},{"registry":"mathdb","id":"315674","title":"Kemeny rank aggregation for three voters","url":"https://mathdb.com/p/315674/kemeny-rank-aggregation-for-three-voters"}],"url":"https://whataifound.org/finding/2026-07-28-kemeny-three-voters"},{"id":"2026-07-27-feige-conjecture","title":"Feige's conjecture on sums of nonnegative random variables settled","claim":"For independent nonnegative random variables with mean at most 1 and sum S, the probability that S is below its mean plus one is at least 1/e, the sharp constant Feige conjectured in 2004; three independent proofs appeared within days.","field":"mathematics","date":"2026-07-27","added":"2026-08-11","lab":"Independent","model":"ChatGPT 5.6 Pro","verification":"formal","autonomy":"ai-led","tags":["lean","probability","concentration-inequalities"],"humans":["Weibo Fu","Yanjun Han","Guanyang Wang","Jun Yan","Peng Zhang","Zhengqing Zhou"],"year_posed":2004,"sources":[{"label":"arXiv: Sharp small-deviation inequalities for sums of independent nonnegative random variables","url":"https://arxiv.org/abs/2607.23980","kind":"research"},{"label":"Lean formalization (pengzhang91/Feige)","url":"https://github.com/pengzhang91/Feige","kind":"research"},{"label":"arXiv: On Feige's conjecture (Nie and Wei)","url":"https://arxiv.org/abs/2607.24528","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"feiges-conjecture","url":"https://vibemathed.com/problem/feiges-conjecture","title":"Feige's Conjecture"},{"registry":"mathdb","id":"315661","title":"Feige's 1/e conjecture","url":"https://mathdb.com/p/315661/feige-s-1-e-conjecture"}],"url":"https://whataifound.org/finding/2026-07-27-feige-conjecture"},{"id":"2026-07-22-dinitz-garg-goemans","title":"Counterexample to the Dinitz–Garg–Goemans conjecture","claim":"An explicit seven-node network whose cheapest single-route (unsplittable) shipping costs more than its fractional cost even under the allowed capacity slack, disproving a conjecture from the late 1990s.","field":"computer-science","date":"2026-07-22","added":"2026-07-24","lab":"Independent","model":"GPT-5.6 Pro","verification":"formal","autonomy":"ai-led","tags":["combinatorial-optimization","network-flow","counterexample","unsplittable-flow"],"humans":["Dmitry Rybin"],"year_posed":1999,"sources":[{"label":"Dmitry Rybin announcement (X)","url":"https://x.com/DmitryRybin1/status/2079907499545919968","kind":"announcement"},{"label":"Coverage: officechai","url":"https://officechai.com/ai/mathematician-says-gpt-5-6-disproved-the-30-year-old-dinitz-garg-goemans-conjecture-with-4-simple-prompts/","kind":"coverage"},{"label":"Archive of Formal Proofs: a formal counterexample to the cost-preserving single-source unsplittable flow conjecture","url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","kind":"research"}],"registrations":[{"registry":"mathdb","id":"316187","title":"Dinitz–Garg–Goemans conjecture","url":"https://mathdb.com/p/316187/dinitz-garg-goemans-conjecture"},{"registry":"vibemathed","id":"dinitz-garg-goemans-unsplittable-flow","url":"https://vibemathed.com/problem/dinitz-garg-goemans-unsplittable-flow"}],"url":"https://whataifound.org/finding/2026-07-22-dinitz-garg-goemans"},{"id":"2026-07-20-gaussian-moments","title":"Counterexamples to the Gaussian moments conjecture","claim":"Explicit low-degree polynomials disproving a 2017 conjecture that had been proposed as a route to proving the Jacobian conjecture, found days after that conjecture was itself disproved.","field":"mathematics","date":"2026-07-20","added":"2026-07-27","lab":"Independent","model":"GPT-5.6 Sol Pro + Claude Fable 5","verification":"author-verified","autonomy":"ai-led","tags":["algebra","polynomial-maps","counterexample","jacobian-conjecture"],"humans":["Christopher D. Long"],"year_posed":2017,"sources":[{"label":"arXiv: Small Counterexamples to the Gaussian Moments Conjecture","url":"https://arxiv.org/abs/2607.18186","kind":"research"},{"label":"Derksen, van den Essen, Zhao: The Gaussian Moments Conjecture and the Jacobian Conjecture","url":"https://arxiv.org/abs/1506.05192","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"gaussian-moments-conjecture","url":"https://vibemathed.com/problem/gaussian-moments-conjecture"}],"url":"https://whataifound.org/finding/2026-07-20-gaussian-moments"},{"id":"2026-07-20-gaussian-product-inequality","title":"Gaussian product inequality conjecture proved","claim":"For any centered Gaussian vector and positive exponents, the expectation of the product of absolute powers is at least the product of the individual expectations, settling a conjecture posed in 2007.","field":"mathematics","date":"2026-07-20","added":"2026-08-11","lab":"Independent","model":"ChatGPT 5.6 Sol","verification":"formal","autonomy":"ai-led","tags":["lean","probability","gaussian-inequalities"],"humans":["Frédéric Ouimet","Dylan Greaves"],"year_posed":2007,"sources":[{"label":"A proof of the strong Gaussian product inequality conjecture","url":"https://doi.org/10.13140/RG.2.2.17569.77923/1","kind":"research"},{"label":"Lean formalization (dylgre/gaussian-product-inequality)","url":"https://github.com/dylgre/gaussian-product-inequality","kind":"research"},{"label":"Public chat transcript","url":"https://chatgpt.com/share/6a5ea69b-1648-83e8-80b1-014ae0b1003c","kind":"announcement"}],"registrations":[{"registry":"vibemathed","id":"gaussian-product-inequality-conjecture","url":"https://vibemathed.com/problem/gaussian-product-inequality-conjecture","title":"Gaussian product inequality conjecture"},{"registry":"mathdb","id":"330065","title":"The Gaussian Product Conjecture","url":"https://mathdb.com/p/330065/the-gaussian-product-conjecture"}],"url":"https://whataifound.org/finding/2026-07-20-gaussian-product-inequality"},{"id":"2026-07-20-kourovka-notebook","title":"Eight problems from the Kourovka Notebook solved and formalized in Lean","claim":"A formal reasoning agent developed the proof strategies for eight open problems in group theory without human guidance on which mathematical steps to take, and machine-checked every one in Lean 4.","field":"mathematics","date":"2026-07-20","added":"2026-08-06","lab":"Harmonic","model":"Aristotle","verification":"formal","autonomy":"autonomous","tags":["group-theory","lean","formalization","kourovka-notebook","autonomous-discovery"],"humans":["Wouter van Doorn","Elias Judin","Pietro Monticone","Daniel Morrison"],"year_posed":1969,"sources":[{"label":"arXiv: On Some Problems from the Kourovka Notebook","url":"https://arxiv.org/abs/2607.17477","kind":"research"},{"label":"Lean 4 formalizations of all eight solutions","url":"https://github.com/pitmonticone/Kourovka","kind":"research"}],"url":"https://whataifound.org/finding/2026-07-20-kourovka-notebook"},{"id":"2026-07-19-jacobian-conjecture","title":"Counterexample to the Jacobian conjecture in dimension three","claim":"An explicit polynomial map in three variables with constant Jacobian determinant \\(-2\\) that is nevertheless not invertible, disproving a conjecture open since 1939.","field":"mathematics","date":"2026-07-19","added":"2026-07-20","lab":"Anthropic","model":"Claude Fable 5","verification":"formal","autonomy":"collaborative","tags":["algebraic-geometry","counterexample","polynomial-maps"],"humans":["Levent Alpöge"],"year_posed":1939,"sources":[{"label":"The Jacobian counterexample, explained","url":"https://jacobianfun.org/jacobian-explained","kind":"research"},{"label":"Ulam: A counterexample to the Jacobian conjecture (PDF), the seven-page algebraic verification of the announced map","url":"https://www.ulam.ai/research/jacobian.pdf","kind":"research"},{"label":"Alexis Gallagher: Jacobian Conjecture Disproved!","url":"https://alexisgallagher.com/posts/2026/jacobianfun/","kind":"commentary"},{"label":"Hacker News discussion","url":"https://news.ycombinator.com/item?id=48973869","kind":"commentary"},{"label":"Borisov, Gabber and Vasiu: on endomorphisms of affine spaces and the Jacobian problem, whose supplemental statement on page 160 raises priority and disclosure questions","url":"https://arxiv.org/abs/2609.05746","kind":"challenge"},{"label":"arXiv: van den Essen, An elementary way to find a counterexample to the Jacobian Conjecture","url":"https://arxiv.org/abs/2609.17795","kind":"commentary"}],"registrations":[{"registry":"mathdb","id":"315779","title":"Jacobian conjecture","url":"https://mathdb.com/p/315779/jacobian-conjecture"},{"registry":"vibemathed","id":"jacobian-conjecture","url":"https://vibemathed.com/problem/jacobian-conjecture"},{"registry":"palomar","id":"PALOMAR-2026-08-21-000006","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-21-000006&version=1","repository":"Paul-Lez/jacobian-conjecture","commit":"b244ea482ed086297e379d73e6724cd26b2d301f","theorems":["JacobianConjecture.jacobian_conjecture"],"checked":"2026-08-21","note":"A Comparator wrapper of the formalization by Paul Lezeau and Dean Cureton in Google DeepMind's formal-conjectures, whose Lean source names the construction as Alpöge and Fable's counterexample. It records a stronger statement than this entry claims, disproving the generalized conjecture over every nontrivial commutative ring rather than in characteristic zero alone, and omits the two-variable case, which stays open."},{"registry":"palomar","id":"PALOMAR-2026-08-27-000013","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-27-000013&version=1","repository":"Arthur742Ramos/jacobian-conjecture-lean","commit":"8db55ea3ffa8ba90094d6ef78ee3351ddfce01ca","theorems":["JacobianCounterexample.jacobianDet_F","JacobianCounterexample.explicit_three_point_fibre","JacobianCounterexample.not_jacobian_conjecture_complex"],"checked":"2026-08-27","note":"A second and independent Lean formalization of the same map, by Ramos, Hulak and de Queiroz, sharing no code with the Lezeau and Cureton development already cited. It records the two-variable case as untouched, as this entry does."}],"url":"https://whataifound.org/finding/2026-07-19-jacobian-conjecture"},{"id":"2026-07-14-sabidussi-compatibility","title":"Sabidussi's compatibility conjecture proved","claim":"The edges of a finite connected multigraph carrying a closed eulerian trail can be partitioned into circuits so that no circuit contains two edges used consecutively in the trail, with a Lean 4 formalization.","field":"mathematics","date":"2026-07-14","added":"2026-08-11","lab":"Independent","model":"GPT-5.6 Pro, GPT-5.6 Sol","verification":"formal","autonomy":"collaborative","tags":["lean","graph-theory","combinatorics"],"humans":["Nikolay Ulyanov"],"sources":[{"label":"arXiv: Graph Puzzles III.1: A Proof of Sabidussi's Compatibility Conjecture","url":"https://arxiv.org/abs/2607.13225","kind":"research"},{"label":"Lean 4 formalization (gexahedron/sabidussi-lean)","url":"https://github.com/gexahedron/sabidussi-lean","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-17-000003","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-17-000003&version=1","repository":"gexahedron/sabidussi-lean","commit":"58307d74da99ec6e4fe28e012c30c83e369c54c3","theorems":["sabidussi_compatibility_ordinary"],"checked":"2026-08-17","note":"Palomar's record does not restate the theorem in prose, so what the registration certifies is that formal statement rather than the preprint's phrasing of it."},{"registry":"vibemathed","id":"sabidussi-compatibility","url":"https://vibemathed.com/problem/sabidussi-compatibility","title":"Sabidussi's Compatibility Conjecture"},{"registry":"mathdb","id":"388102","title":"Sabidussi's compatibility conjecture","url":"https://mathdb.com/p/388102/sabidussi-s-compatibility-conjecture","note":"A bare problem record: MathDB has no progress summary and no solution posted for it, so this places the problem in that catalogue rather than corroborating the resolution."}],"url":"https://whataifound.org/finding/2026-07-14-sabidussi-compatibility"},{"id":"2026-07-14-zeroth-order-oracle-bound","title":"Near-quadratic lower bound for derivative-free convex optimization","claim":"A lower bound of order \\(d^2/\\log d\\) on the number of exact function evaluations needed to minimize a convex Lipschitz function, closing a gap open since 1996 and showing a 1996 algorithm was essentially optimal.","field":"mathematics","date":"2026-07-14","added":"2026-07-27","lab":"Independent","model":"GPT-5.6 Sol Pro","verification":"formal","autonomy":"ai-led","tags":["optimization","complexity-theory","lower-bounds","lean"],"humans":["Phillip Kerger"],"year_posed":1996,"sources":[{"label":"arXiv: Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization","url":"https://arxiv.org/abs/2607.13335","kind":"research"},{"label":"Lean verification, prompt and chat logs","url":"https://github.com/PhillipKerger/zero-order-bounds-lean-verification","kind":"research"}],"url":"https://whataifound.org/finding/2026-07-14-zeroth-order-oracle-bound"},{"id":"2026-07-11-grothendieck-group-schemes","title":"Counterexample to Grothendieck's question on finite flat group schemes","claim":"A finite locally free group scheme of order four whose fourth power map is not trivial, answering a question Grothendieck raised in the 1960s; one model produced the construction and another formalised it in Lean.","field":"mathematics","date":"2026-07-11","added":"2026-07-29","lab":"Independent","model":"OpenAI Sol (construction); Claude Fable (Lean formalisation)","verification":"formal","autonomy":"collaborative","tags":["algebraic-geometry","group-schemes","counterexample","lean","formalization"],"humans":["Akhil Mathew","Kevin Buzzard"],"sources":[{"label":"Kevin Buzzard: Human mathematicians are being outcounterexampled","url":"https://xenaproject.wordpress.com/2026/07/20/human-mathematicians-are-being-outcounterexampled/","kind":"announcement"},{"label":"mathlib4 PR #41748: a finite free group scheme of order four not killed by four","url":"https://github.com/leanprover-community/mathlib4/pull/41748","kind":"research"}],"registrations":[{"registry":"mathdb","id":"315784","title":"Grothendieck's group-scheme question","url":"https://mathdb.com/p/315784/grothendieck-s-group-scheme-question"},{"registry":"vibemathed","id":"grothendieck-finite-flat-group-schemes","url":"https://vibemathed.com/problem/grothendieck-finite-flat-group-schemes"}],"url":"https://whataifound.org/finding/2026-07-11-grothendieck-group-schemes"},{"id":"2026-07-10-cycle-double-cover","title":"Cycle double cover conjecture proved for all bridgeless multigraphs","claim":"Every finite bridgeless loopless multigraph has a multiset of cycles covering each edge exactly twice, resolving a conjecture open since 1973, with a machine-checked Lean proof of the unconditional statement.","field":"mathematics","date":"2026-07-10","added":"2026-08-14","lab":"OpenAI","model":"GPT-5.6 Sol Ultra","verification":"formal","autonomy":"ai-led","tags":["lean","graph-theory","combinatorics","multi-agent"],"year_posed":1973,"sources":[{"label":"OpenAI: A proof of the cycle double cover conjecture (PDF)","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf","kind":"research"},{"label":"Lean 4 formalization (openai/cdc-lean)","url":"https://github.com/openai/cdc-lean","kind":"research"},{"label":"OpenAI: the prompt used for the proof (PDF)","url":"https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_prompt.pdf","kind":"announcement"},{"label":"Ethan Knight announcement (X)","url":"https://x.com/__eknight__/status/2075643450196971805","kind":"announcement"},{"label":"arXiv: A proof of the cycle double cover conjecture by OpenAI: An exposition","url":"https://arxiv.org/abs/2607.16356","kind":"commentary"},{"label":"arXiv: Three-Bit Flows and Cycle Covers. Part I","url":"https://arxiv.org/abs/2607.14140","kind":"commentary"},{"label":"Scientific American: ChatGPT just proved another 50-year-old math conjecture","url":"https://www.scientificamerican.com/article/chatgpt-just-proved-another-50-year-old-math-conjecture/","kind":"coverage"},{"label":"arXiv: Geelen, OpenAI's proof of the Cycle Double Cover Theorem","url":"https://arxiv.org/abs/2607.15399","kind":"commentary"}],"registrations":[{"registry":"vibemathed","id":"cycle-double-cover-conjecture","url":"https://vibemathed.com/problem/cycle-double-cover-conjecture"},{"registry":"mathdb","id":"316019","title":"Cycle double cover conjecture","url":"https://mathdb.com/p/316019/cycle-double-cover-conjecture"}],"url":"https://whataifound.org/finding/2026-07-10-cycle-double-cover"},{"id":"2026-06-26-penda-ai-consult-cluster-rct","title":"Cluster-randomised trial of an LLM decision-support tool in Kenyan primary care finds no reduction in treatment failure","claim":"In a pragmatic trial at 16 Penda Health clinics in Kenya, clinical officers randomised to a GPT-4o-based decision-support tool in the medical record saw 14-day treatment failure in 2.2% of 4,693 patients against 2.0% of 4,654 without it, an adjusted odds ratio of 0.77 (95% CI 0.55 to 1.08); the tool was safe but did not significantly reduce treatment failure.","field":"medicine","date":"2026-06-26","added":"2026-10-16","lab":"KEMRI-Wellcome Trust Research Programme / Penda Health / PATH","model":"AI Consult (GPT-4o)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["large-language-model","clinical-decision-support","primary-care","rct","global-health"],"humans":["Ambrose Agweyu","Robert Korom","Xiaoxuan Liu","Bilal A. Mateen"],"sources":[{"label":"Nature Medicine: Generative AI-enabled clinical decision support system in primary care, a pragmatic, cluster-randomized trial","url":"https://www.nature.com/articles/s41591-026-04503-6","kind":"research"},{"label":"arXiv: AI-based clinical decision support for primary care, a real-world study (the earlier 2025 quality-improvement study)","url":"https://arxiv.org/abs/2507.16947","kind":"research"}],"url":"https://whataifound.org/finding/2026-06-26-penda-ai-consult-cluster-rct"},{"id":"2026-06-25-herculaneum-scroll-read","title":"First Herculaneum scroll read end to end without unrolling it","claim":"PHerc. 1667 was virtually unwrapped and read in full from X-ray scans using learned ink detection: about 1.4 metres of papyrus across roughly 22 columns of Greek, identified as Philodemus, On Gods, Book 8.","field":"archaeology","date":"2026-06-25","added":"2026-07-29","lab":"Vesuvius Challenge","model":"Community-developed ink-detection neural networks","verification":"author-verified","autonomy":"ai-assisted","tags":["papyrology","virtual-unwrapping","ink-detection","ancient-texts"],"humans":["Brent Seales","Luke Farritor","Youssef Nader","Julian Schilliger"],"sources":[{"label":"Complete virtual unwrapping and reading of a rolled Herculaneum papyrus","url":"https://arxiv.org/abs/2606.29085","kind":"research"},{"label":"Vesuvius Challenge: An entire Herculaneum scroll has been read for the first time","url":"https://scrollprize.org/firstscroll","kind":"announcement"},{"label":"Vesuvius Challenge","url":"https://scrollprize.org/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-06-25-herculaneum-scroll-read"},{"id":"2026-06-24-ecg-biomarker-sudden-cardiac-death","title":"An ECG biomarker for sudden cardiac death, discovered with deep learning","claim":"Trained on every ECG in a Swedish region linked to death certificates, a deep learning model isolated 2.2% of patients with a 7.0% annual rate of sudden cardiac death, above the 4.6% of those flagged by reduced ejection fraction, and 86.1% of them were missed by that standard screen; a generative model then exposed the waveform feature it used, which the authors say had not been described.","field":"medicine","date":"2026-06-24","added":"2026-11-19","lab":"UC Berkeley, with the University of Chicago, MIT and Halmstad University and Region Halland","model":"A deep learning model on 12-lead ECG waveforms, paired with a generative model of the waveform; not named","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["cardiology","ecg","sudden-cardiac-death","biomarker","retrospective","external-validation","real-world-data"],"humans":["Ziad Obermeyer","Alexander Schubert","James Ross","Sendhil Mullainathan","Markus Lingman"],"sources":[{"label":"Nature: An ECG biomarker for sudden cardiac death discovered with deep learning","url":"https://doi.org/10.1038/s41586-026-10674-6","kind":"research"},{"label":"European Heart Journal: A novel electrocardiogram biomarker predicting sudden cardiac death, ready for prime time?","url":"https://doi.org/10.1093/eurheartj/ehag682","kind":"commentary"},{"label":"ScienceDaily: AI discovers a hidden heart signal that could predict sudden death","url":"https://www.sciencedaily.com/releases/2026/11/261112230456.htm","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-06-24-ecg-biomarker-sudden-cardiac-death"},{"id":"2026-06-17-kagome-superconductors","title":"Two kagome superconductors predicted by machine learning and confirmed in the lab","claim":"A screening pipeline that narrowed over 1.3 million candidate structures picked out YRu3B2 and LuRu3B2, which were then synthesized and measured to superconduct at 0.81 K and 0.95 K.","field":"materials","date":"2026-06-17","added":"2026-08-06","lab":"Aalto University / Rice University","model":"Unknown","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["superconductivity","kagome","high-throughput-screening","dft","experimental-confirmation"],"humans":["Rose Albu Mustaf","Päivi Törmä","Emilia Morosan","B. Andrei Bernevig","Miguel A. L. Marques"],"sources":[{"label":"arXiv: Machine Learning-Guided Discovery of Kagome Superconductors YRu3B2 and LuRu3B2","url":"https://arxiv.org/abs/2512.16945","kind":"research"},{"label":"ScienceDaily: AI just supercharged the race to find room temperature superconductors","url":"https://www.sciencedaily.com/releases/2026/07/260701205006.htm","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-06-17-kagome-superconductors"},{"id":"2026-06-02-jamming-exponent-identity","title":"Identity for the critical exponents of jamming derived analytically","claim":"The relation \\(a + b = 1\\) between critical exponents at the jamming transition, previously seen only numerically in the full replica-symmetry-breaking solution of hard spheres, is derived from the scaling equations and published after peer review.","field":"physics","date":"2026-06-02","added":"2026-08-11","lab":"Independent","model":"Claude Sonnet 4.6, Claude Opus 4.7","verification":"peer-reviewed","autonomy":"collaborative","tags":["statistical-physics","jamming","critical-exponents"],"humans":["Giorgio Parisi","Francesco Zamponi"],"year_posed":2014,"sources":[{"label":"arXiv: A proof of an identity for the critical exponents of jamming","url":"https://arxiv.org/abs/2606.03300","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"fullrsb-jamming-identity","url":"https://vibemathed.com/problem/fullrsb-jamming-identity","title":"FullRSB Jamming Identity a + b = 1"}],"url":"https://whataifound.org/finding/2026-06-02-jamming-exponent-identity"},{"id":"2026-05-21-alphaproof-nexus","title":"Nine Erdős problems and 44 OEIS conjectures proved with machine-checked proofs","claim":"An agent pairing language models with the Lean proof assistant resolved 9 of 353 open Erdős problems and 44 of 492 open OEIS conjectures, with every proof mechanically verified.","field":"mathematics","date":"2026-05-21","added":"2026-07-27","lab":"Google DeepMind","model":"AlphaProof Nexus (LLM + Lean)","verification":"formal","autonomy":"search-scaffold","tags":["lean","automated-theorem-proving","erdos-problems","combinatorics"],"humans":["Pushmeet Kohli","Swarat Chaudhuri"],"sources":[{"label":"arXiv: Advancing Mathematics Research with AI-Driven Formal Proof Search","url":"https://arxiv.org/abs/2605.22763","kind":"research"},{"label":"All Lean proofs (DeepMind repository)","url":"https://github.com/google-deepmind/alphaproof-nexus-results","kind":"research"},{"label":"Tao's AI-contributions-to-Erdős-problems wiki","url":"https://github.com/teorth/erdosproblems/wiki/AI-contributions-to-Erd%C5%91s-problems","kind":"research"}],"registrations":[{"registry":"vibemathed","id":"erdos-12","url":"https://vibemathed.com/problem/erdos-12","title":"Erdős Problem #12"},{"registry":"vibemathed","id":"erdos-138","url":"https://vibemathed.com/problem/erdos-138","title":"Erdős Problem #138"},{"registry":"vibemathed","id":"green-open-problem-57","url":"https://vibemathed.com/problem/green-open-problem-57","title":"Ben Green's Open Problem 57"},{"registry":"vibemathed","id":"wow-graph-conjecture-2","url":"https://vibemathed.com/problem/wow-graph-conjecture-2","title":"Written on the Wall II, Graph Conjecture 2"},{"registry":"vibemathed","id":"monochromatic-quantum-graphs-diagonal","url":"https://vibemathed.com/problem/monochromatic-quantum-graphs-diagonal","title":"Monochromatic Quantum Graphs in the Diagonal Family"},{"registry":"vibemathed","id":"monochromatic-quantum-graphs-four-particles","url":"https://vibemathed.com/problem/monochromatic-quantum-graphs-four-particles","title":"Four-Particle Monochromatic Quantum Graphs"},{"registry":"vibemathed","id":"pure-o-sequences-log-concavity","url":"https://vibemathed.com/problem/pure-o-sequences-log-concavity","title":"Log-Concavity of Codimension-Three Pure O-Sequences"},{"registry":"vibemathed","id":"anchored-gda-last-iterate","url":"https://vibemathed.com/problem/anchored-gda-last-iterate","title":"Last-Iterate Rate for Anchored Gradient Descent-Ascent","note":"This record cites the team's April preprint, arXiv:2604.03782, which the AlphaProof Nexus report refers to for this result; the Lean proof sits in the same results repository."}],"url":"https://whataifound.org/finding/2026-05-21-alphaproof-nexus"},{"id":"2026-05-erdos-unit-distance","title":"Disproof of the Erdős unit-distance conjecture","claim":"A reasoning model produced the core construction disproving a 1946 conjecture in discrete geometry, finding point configurations with more unit-distance pairs than the conjecture permitted.","field":"mathematics","date":"2026-05-20","added":"2026-07-20","lab":"OpenAI","model":"GPT-5 series reasoning model","verification":"independent","autonomy":"ai-led","tags":["discrete-geometry","combinatorics","erdos"],"year_posed":1946,"sources":[{"label":"Remarks on the disproof of the unit distance conjecture (human-verified writeup)","url":"https://arxiv.org/abs/2605.20695","kind":"research"},{"label":"Sawin: An explicit lower bound for the unit distance problem","url":"https://arxiv.org/abs/2605.20579","kind":"research"},{"label":"Quanta: The AI Revolution in Math Has Arrived","url":"https://www.quantamagazine.org/the-ai-revolution-in-math-has-arrived-20260413/","kind":"coverage"},{"label":"TechCrunch: OpenAI claims it solved an 80-year-old math problem, for real this time","url":"https://techcrunch.com/2026/05/20/openai-claims-it-solved-an-80-year-old-math-problem-for-real-this-time/","kind":"coverage"},{"label":"Tech Jacks: AI math reasoning milestones","url":"https://techjacksolutions.com/ai-brief/ai-math-reasoning-milestones-30-days-research-automation/","kind":"coverage"},{"label":"PNAS: Autonomous disproofs of the Erdos unit distance conjecture with GPT-5.5 Pro","url":"https://doi.org/10.1073/pnas.2621541123","kind":"research"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-08-08-000001","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-08-08-000001&version=3","repository":"kim-em/erdos-unit-distance-comparator","commit":"be6c2ee4c9fb16fd6bed442b4c361fb10369beb5","theorems":["UnitDistance.erdos_unit_distance_uniform_constant_false"],"checked":"2026-08-14","note":"Palomar's record describes this as certifying the literal negation of the uniform-constant form of the conjecture, from a Mathlib-only statement of that negation. That is narrower than this entry's claim, which is why the entry stays at independently checked rather than moving to formally verified."},{"registry":"mathdb","id":"315785","title":"Erdős unit-distance conjecture","url":"https://mathdb.com/p/315785/erdos-unit-distance-conjecture"}],"url":"https://whataifound.org/finding/2026-05-erdos-unit-distance"},{"id":"2026-05-18-pevac-ps-sarbecovirus","title":"Phase 1 trial of a computationally designed pan-sarbecovirus vaccine","claim":"A vaccine whose antigen was designed entirely in silico from sarbecovirus sequence data was safe in 39 healthy volunteers and raised immune responses against SARS-CoV-2, SARS, and bat viruses that have never infected humans.","field":"medicine","date":"2026-05-18","added":"2026-08-06","lab":"University of Cambridge / DIOSynVax","model":"Unknown","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["vaccine-design","clinical-trial","coronavirus","antigen-design","phase-1"],"humans":["Alasdair P. S. Munro","Jonathan L. Heeney","Saul N. Faust"],"sources":[{"label":"Journal of Infection: A phase I, needle free, dose escalation clinical trial of pEVAC-PS, a candidate pan-Sarbecovirus vaccine","url":"https://www.journalofinfection.com/article/S0163-4453(26)00084-8/fulltext","kind":"research"},{"label":"University of Cambridge: New universal vaccine technology could protect us from future virus outbreaks","url":"https://www.cam.ac.uk/research/news/new-universal-vaccine-technology-could-protect-us-from-future-virus-outbreaks","kind":"announcement"},{"label":"ScienceDaily: AI-designed universal coronavirus vaccine passes first human trial","url":"https://www.sciencedaily.com/releases/2026/06/260605023357.htm","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-05-18-pevac-ps-sarbecovirus"},{"id":"2026-04-23-synthecin","title":"An antibiotic designed by reinforcement learning clears an MRSA infection in mice","claim":"A reinforcement-learning generator searching a 46-billion-compound synthesizable space produced synthecin, a structurally novel antibacterial that cleared a methicillin-resistant Staphylococcus aureus wound infection in a mouse model.","field":"medicine","date":"2026-04-23","added":"2026-08-21","lab":"McMaster University / Stanford University","model":"SyntheMol-RL","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["antibiotics","drug-discovery","reinforcement-learning","generative-model","mrsa","in-vivo"],"humans":["Kyle Swanson","Gary Liu","Denise B. Catacutan","Eric D. Brown","James Zou","Jonathan M. Stokes"],"sources":[{"label":"Molecular Systems Biology: SyntheMol-RL","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC13230741/","kind":"research"},{"label":"bioRxiv preprint (2025)","url":"https://www.biorxiv.org/content/10.1101/2025.05.17.654017v1","kind":"research"},{"label":"McMaster University announcement","url":"https://news.mcmaster.ca/mcmaster-built-ai-model-speeds-up-drug-discovery-designs-new-antibiotic/","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-04-23-synthecin"},{"id":"2026-02-02-epic-sepsis-model-v2","title":"Multicenter prospective validation of Epic's retrained sepsis model (version 2)","claim":"Epic's retrained sepsis model, gradient-boosted trees fine-tuned on each hospital's own data, discriminated sepsis at encounter-level AUROCs of 0.82 to 0.92 across 227,091 inpatient encounters at four large US health systems, in line with or above the 0.83 to 0.86 Epic reports internally, but with positive predictive values of only 0.13 to 0.26 and a high alert burden.","field":"medicine","date":"2026-02-02","added":"2026-10-16","lab":"Epic Systems","model":"Epic Sepsis Model v2 (gradient-boosted trees with local fine-tuning)","verification":"independent","autonomy":"ai-assisted","tags":["sepsis","early-warning","external-validation","prospective","real-world-data"],"sources":[{"label":"JAMA Network Open: Multicenter prospective validation of an updated proprietary sepsis prediction model","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12949446/","kind":"research"}],"url":"https://whataifound.org/finding/2026-02-02-epic-sepsis-model-v2"},{"id":"2026-01-30-masai-ai-mammography","title":"Randomised trial of AI-supported mammography screening in 105,934 women (MASAI)","claim":"In a Swedish screening trial that randomised 105,934 women, AI triage and detection support found 29% more cancers than standard double reading, cut radiologists' reading workload by 44%, and met its primary endpoint of a non-inferior interval cancer rate, 1.55 against 1.76 per 1,000, with sensitivity of 80.5% against 73.8% at the same 98.5% specificity.","field":"medicine","date":"2026-01-30","added":"2026-10-16","lab":"Lund University","model":"Transpara 1.7.0 (ScreenPoint Medical)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["breast-cancer","screening","mammography","rct","prospective","fda-cleared"],"humans":["Kristina Lång","Veronica Hernström","Jessie Gommers"],"sources":[{"label":"The Lancet: Interval cancer, sensitivity, and specificity in the MASAI study","url":"https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(25)02464-X/fulltext","kind":"research"},{"label":"Lancet Digital Health: Screening performance and characteristics of breast cancer detected in MASAI","url":"https://www.thelancet.com/journals/landig/article/PIIS2589-7500(24)00267-X/fulltext","kind":"research"},{"label":"Lancet Oncology: AI-supported screen reading versus standard double reading in MASAI, clinical safety analysis","url":"https://www.thelancet.com/journals/lanonc/article/PIIS1470-2045(23)00298-X/fulltext","kind":"research"},{"label":"Lund University: AI support in breast cancer screening leads to fewer missed cancer cases","url":"https://www.lunduniversity.lu.se/article/ai-support-breast-cancer-screening-fewer-missed-cancer-cases","kind":"announcement"},{"label":"The ASCO Post: Interval cancer rate with AI-supported mammography screening","url":"https://ascopost.com/news/february-2026/interval-cancer-rate-with-ai-supported-mammography-screening/","kind":"coverage"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT04838756","url":"https://clinicaltrials.gov/study/NCT04838756","title":"Mammography Screening with Artificial Intelligence (MASAI)"},{"registry":"fda-ai-devices","id":"K210404","url":"https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K210404","title":"Transpara 1.7.0","note":"The version used in the trial. Later versions hold their own clearances, the most recent in the FDA list being K241831 for Transpara 2.1.0."}],"url":"https://whataifound.org/finding/2026-01-30-masai-ai-mammography"},{"id":"2026-01-29-erdos-654-distinct-distances","title":"Erdős Problem 654 answered negatively by Google DeepMind's Aletheia agent","claim":"An agent built on Gemini Deep Think produced an elementary counterexample showing that \\(n\\) points in the plane with no four on a circle need not contain any point having \\((1 - o(1))n\\) distinct distances to the others, a negative answer to Erdős Problem 654 as the problem database formulates it; that construction has since been proved in Lean, and so has the negative answer by a second, different construction.","field":"mathematics","date":"2026-01-29","added":"2026-11-02","lab":"Google DeepMind","model":"Aletheia, a mathematics research agent built on Gemini Deep Think","verification":"formal","autonomy":"ai-led","tags":["combinatorics","discrete-geometry","distinct-distances","erdos-problems","lean","formalization","construction"],"humans":["Tony Feng","Trieu Trinh","Garrett Bingham","Quoc V. Le","Thang Luong"],"year_posed":1997,"sources":[{"label":"arXiv: Semi-Autonomous Mathematics Discovery with Gemini, A Case Study on the Erdős Problems","url":"https://arxiv.org/abs/2601.22401","kind":"research"},{"label":"veljjanoski/erdos654-palomar at the registered commit","url":"https://github.com/veljjanoski/erdos654-palomar/tree/fd7a8dc3cf52f6dcadcf5c6bcd05a2dc387dc64f","kind":"research"},{"label":"ukniusanqian-alt/erdos654-lean at the registered commit","url":"https://github.com/ukniusanqian-alt/erdos654-lean/tree/3146ec1b4c120e366c10bbb92dec8de596cd7aa1","kind":"research"},{"label":"erdosproblems.com: Problem 654, recording the disproof of the strongest form","url":"https://www.erdosproblems.com/654","kind":"commentary"}],"registrations":[{"registry":"palomar","id":"PALOMAR-2026-11-02-000006","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-02-000006&version=1","title":"Erdős Problem 654: distinct distances from a point when no four points are concyclic","repository":"veljjanoski/erdos654-palomar","commit":"fd7a8dc3cf52f6dcadcf5c6bcd05a2dc387dc64f","theorems":["Erdos654.erdos_654.parts.i","Erdos654.erdos_654.variants.feng"],"checked":"2026-11-02","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice, with two kernels, nanoda and con-ron, and trust level high. The proof uses a different point set from the one in the paper, so it certifies the negative answer rather than Aletheia's construction."},{"registry":"palomar","id":"PALOMAR-2026-11-03-000009","url":"https://palomar-registry.org/entry?id=PALOMAR-2026-11-03-000009&version=1","title":"Erdős Problem 654: the Aletheia counterexample","repository":"ukniusanqian-alt/erdos654-lean","commit":"3146ec1b4c120e366c10bbb92dec8de596cd7aa1","theorems":["Erdos654.erdos_654.variants.feng","Erdos654.erdos_654.parts.i"],"checked":"2026-11-03","note":"Permitted axioms are exactly propext, Quot.sound and Classical.choice, with two kernels, nanoda and con-ron, and trust level high. The witness is the paper's construction with exponents shifted from 10 to m+9 down to 1 to m."},{"registry":"vibemathed","id":"erdos-654","url":"https://vibemathed.com/problem/erdos-654"}],"url":"https://whataifound.org/finding/2026-01-29-erdos-654-distinct-distances"},{"id":"2026-01-27-conversational-epilepsy-device-prototype","title":"Inpatient prototype of a conversational EEG device that retrains its own seizure detector","claim":"A prototype linking inpatient scalp and intracranial EEG to large language models let 13 epilepsy patients exchange messages with their monitoring system through a phone app, and the seizure-detection algorithms improved their precision over several days from that feedback without expert reprogramming.","field":"medicine","date":"2026-01-27","added":"2026-10-22","lab":"University of Pennsylvania","model":"Unnamed secure large language models behind an AI agent; no vendor or version is given in the preprint abstract","verification":"claimed","autonomy":"ai-assisted","tags":["prospective","large-language-model","conversational-ai","epilepsy","medical-device","preprint"],"humans":["Zack Goldblum","Brian Litt"],"sources":[{"label":"medRxiv: An Implantable Device that Converses with Patients and Learns to Co-Manage Epilepsy (preprint)","url":"https://doi.org/10.64898/2026.01.26.26344234","kind":"research"},{"label":"Europe PMC record (PMID 41646755)","url":"https://europepmc.org/article/MED/41646755","kind":"research"},{"label":"NIH: Patients engage with epilepsy monitor in real time, improving seizure detection","url":"https://www.nih.gov/news-events/news-releases/patients-engage-epilepsy-monitor-real-time-improving-seizure-detection","kind":"announcement"}],"url":"https://whataifound.org/finding/2026-01-27-conversational-epilepsy-device-prototype"},{"id":"2026-01-alphaevolve-bruhat","title":"Structure in Bruhat intervals of permutation groups","claim":"AlphaEvolve identified unexpected special structure in Bruhat intervals for particular permutation groups.","field":"mathematics","date":"2026-01-15","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaEvolve (Gemini-based)","verification":"independent","autonomy":"search-scaffold","tags":["combinatorics","alphaevolve"],"sources":[{"label":"Ellenberg, Libedinsky, Plaza, Simental, Williamson: Bruhat intervals that are large hypercubes","url":"https://arxiv.org/abs/2601.01235","kind":"research"},{"label":"Quanta: The AI Revolution in Math Has Arrived","url":"https://www.quantamagazine.org/the-ai-revolution-in-math-has-arrived-20260413/","kind":"coverage"}],"url":"https://whataifound.org/finding/2026-01-alphaevolve-bruhat"},{"id":"2026-01-erdos-728","title":"Erdős problem #728 resolved and formalized in Lean","claim":"GPT-5.2 produced a proof of a previously open Erdős problem; Harmonic's Aristotle formalized it in Lean, making it the first Erdős problem regarded as fully resolved by AI with machine-checked proof.","field":"mathematics","date":"2026-01-13","added":"2026-07-20","lab":"OpenAI / Harmonic","model":"GPT-5.2 Pro + Aristotle","verification":"formal","autonomy":"autonomous","tags":["number-theory","erdos","lean","formalization"],"sources":[{"label":"arXiv 2601.07421: Resolution of Erdős Problem #728","url":"https://arxiv.org/abs/2601.07421","kind":"research"},{"label":"Tao: AI contributions to Erdős problems","url":"https://github.com/teorth/erdosproblems/wiki/AI-contributions-to-Erd%C5%91s-problems","kind":"research"},{"label":"The Decoder: Tao on GPT-5.2 Pro","url":"https://the-decoder.com/terence-tao-says-gpt-5-2-pro-cracked-an-erdos-problem-but-warns-the-win-says-more-about-speed-than-difficulty/","kind":"coverage"}],"registrations":[{"registry":"mathdb","id":"315787","title":"Erdős Problem #728","url":"https://mathdb.com/p/315787/erdos-problem-728"}],"url":"https://whataifound.org/finding/2026-01-erdos-728"},{"id":"2025-11-26-ambient-ai-scribes-rct","title":"Randomised trial of two ambient AI scribes in outpatient practice","claim":"In a pragmatic three-arm trial of 238 UCLA outpatient physicians, the Nabla scribe cut time spent writing notes by 9.5% against usual care while Microsoft's DAX Copilot made no significant difference; both were associated with modest improvements in burnout and task-load scores, and physicians reported occasional clinically significant inaccuracies with either.","field":"medicine","date":"2025-11-26","added":"2026-10-16","lab":"UCLA Health","model":"Microsoft Dragon Ambient eXperience (DAX) Copilot; Nabla","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["ambient-scribe","large-language-model","documentation","rct","physician-burnout"],"humans":["Paul J. Lukac","John N. Mafi"],"sources":[{"label":"NEJM AI: Ambient AI scribes in clinical practice, a randomized trial","url":"https://ai.nejm.org/doi/full/10.1056/AIoa2501000","kind":"research"},{"label":"medRxiv: A randomized clinical trial of two ambient AI scribes (preprint)","url":"https://www.medrxiv.org/content/10.1101/2025.07.10.25331333v1","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06792890","url":"https://clinicaltrials.gov/study/NCT06792890"}],"url":"https://whataifound.org/finding/2025-11-26-ambient-ai-scribes-rct"},{"id":"2025-11-gpt5-science-acceleration","title":"Early science acceleration experiments with GPT-5","claim":"A multi-domain study documenting cases where GPT-5 contributed to research progress across mathematics, physics, biology and materials science.","field":"computer-science","date":"2025-11-20","added":"2026-07-20","lab":"OpenAI","model":"GPT-5","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["meta","multi-domain"],"sources":[{"label":"arXiv 2511.16072","url":"https://arxiv.org/pdf/2511.16072","kind":"research"}],"url":"https://whataifound.org/finding/2025-11-gpt5-science-acceleration"},{"id":"2025-11-03-alphaevolve-at-scale","title":"AlphaEvolve across 67 problems: 20 improvements, 8 regressions","claim":"A systematic study with Terence Tao of an evolutionary coding agent on 67 open problems in analysis, combinatorics and geometry, reporting where it beat the literature and where it did not.","field":"mathematics","date":"2025-11-03","added":"2026-07-27","lab":"Google DeepMind","model":"AlphaEvolve (Gemini-based)","verification":"independent","autonomy":"search-scaffold","tags":["combinatorics","geometry","analysis","evolutionary-search"],"humans":["Terence Tao","Javier Gómez-Serrano","Bogdan Georgiev","Adam Zsolt Wagner"],"sources":[{"label":"arXiv: Mathematical exploration and discovery at scale","url":"https://arxiv.org/abs/2511.02864","kind":"research"},{"label":"Terence Tao's write-up","url":"https://terrytao.wordpress.com/2025/11/05/mathematical-exploration-and-discovery-at-scale/","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-11-03-alphaevolve-at-scale"},{"id":"2025-10-19-gpt5-erdos-retrieval","title":"GPT-5 \"solved 10 Erdős problems\": it located existing solutions","claim":"An OpenAI executive announced that GPT-5 had solved 10 previously open Erdős problems and made progress on 11 more; the problems were only 'open' in the sense that one database maintainer was unaware of the already-published solutions the model surfaced.","field":"mathematics","date":"2025-10-19","added":"2026-07-20","lab":"OpenAI","model":"GPT-5","verification":"known","autonomy":"retrieval","tags":["number-theory","erdos","already-known","cautionary","retrieval"],"sources":[{"label":"TechCrunch: OpenAI's 'embarrassing' math","url":"https://techcrunch.com/2025/10/19/openais-embarrassing-math/","kind":"challenge"},{"label":"The Decoder: A GPT-5 math breakthrough that never happened","url":"https://the-decoder.com/leading-openai-researcher-announced-a-gpt-5-math-breakthrough-that-never-happened/","kind":"challenge"}],"url":"https://whataifound.org/finding/2025-10-19-gpt5-erdos-retrieval"},{"id":"2025-09-25-qma-amplification-limits","title":"Limits to black-box amplification in QMA, with the key step written by GPT-5","claim":"A quantum complexity paper proving black-box error amplification for QMA cannot push completeness closer to certainty than doubly exponentially, in which the pivotal technical step of the first version was produced by GPT-5 in about half an hour; the published version replaces that step with a simpler one suggested by a human coauthor.","field":"computer-science","date":"2025-09-25","added":"2026-07-29","lab":"UT Austin / CWI Amsterdam / University of Bonn","model":"GPT-5 Thinking","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["quantum-complexity","proof-assistance","oracle-separation"],"humans":["Scott Aaronson","Phillip Harris","Freek Witteveen"],"sources":[{"label":"arXiv: Limits to black-box amplification in QMA","url":"https://arxiv.org/abs/2509.21131","kind":"research"},{"label":"Quantum 10, 2227 (2026): the published version","url":"https://quantum-journal.org/papers/q-2026-10-06-2227/","kind":"research"},{"label":"Scott Aaronson: The QMA Singularity","url":"https://scottaaronson.blog/?p=9183","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-09-25-qma-amplification-limits"},{"id":"2025-09-17-delphi-2m-disease-trajectories","title":"A generative transformer modelling the course of more than 1,000 diseases (Delphi-2M)","claim":"A GPT-style model trained on 0.4 million UK Biobank participants predicts each person's rates of more than 1,000 diseases from their past diagnoses, with an average age-stratified AUC of about 0.76 and accuracy comparable to single-disease models, and held up on 1.9 million Danish registry records with no retraining (AUC 0.67 against 0.69 on UK longitudinal testing).","field":"medicine","date":"2025-09-17","added":"2026-10-16","lab":"German Cancer Research Center (DKFZ) / EMBL-EBI / University of Copenhagen","model":"Delphi-2M (modified GPT-2 architecture)","verification":"peer-reviewed","autonomy":"ai-led","tags":["foundation-model","disease-prediction","real-world-data","retrospective","external-validation"],"humans":["Artem Shmatko","Ewan Birney","Tom Fitzgerald","Moritz Gerstung"],"sources":[{"label":"Nature: Learning the natural history of human disease with generative transformers","url":"https://www.nature.com/articles/s41586-025-09529-3","kind":"research"},{"label":"Delphi code (gerstung-lab/Delphi)","url":"https://github.com/gerstung-lab/Delphi","kind":"research"}],"url":"https://whataifound.org/finding/2025-09-17-delphi-2m-disease-trajectories"},{"id":"2025-09-17-evo-phage-genomes","title":"AI-generated bacteriophage genomes that replicate and kill bacteria","claim":"Genome language models wrote complete ΦX174-like bacteriophage genomes from scratch; of 285 designs that could be built, 16 produced viable infectious phages, several with faster lysis than the natural virus.","field":"biology","date":"2025-09-17","added":"2026-07-29","lab":"Arc Institute / Stanford University","model":"Evo 1 and Evo 2","verification":"peer-reviewed","autonomy":"ai-led","tags":["genome-design","bacteriophage","generative-biology","biosecurity"],"humans":["Samuel King","Brian Hie"],"sources":[{"label":"Science: Generative design of bacteriophages with genome language models","url":"https://www.science.org/doi/10.1126/science.aec2657","kind":"research"},{"label":"bioRxiv: Generative design of novel bacteriophages with genome language models","url":"https://www.biorxiv.org/content/10.1101/2025.09.12.675911v1","kind":"research"},{"label":"Arc Institute: How we built the first AI-generated genomes","url":"https://arcinstitute.org/news/hie-king-first-synthetic-phage","kind":"announcement"},{"label":"Asimov Press: AI-designed phages","url":"https://www.asimov.press/p/ai-phages","kind":"coverage"},{"label":"Inglesby and Hanke: Guarding against the misuse of AI-designed viruses","url":"https://www.science.org/doi/10.1126/science.aej8512","kind":"commentary"}],"url":"https://whataifound.org/finding/2025-09-17-evo-phage-genomes"},{"id":"2025-09-17-unstable-singularities","title":"New families of unstable singularities in fluid equations","claim":"Physics-informed neural networks found previously unknown unstable self-similar blow-up solutions for three fluid equations, computed to near machine precision, and revealed an unexpected near-linear relation between a solution's instability order and its blow-up rate.","field":"mathematics","date":"2025-09-17","added":"2026-07-29","lab":"Google DeepMind (with Brown, NYU and Stanford)","model":"Physics-informed neural networks with Gauss–Newton optimisation","verification":"author-verified","autonomy":"search-scaffold","tags":["pde","fluid-dynamics","singularity","physics-informed-neural-networks"],"humans":["Javier Gómez-Serrano","Tristan Buckmaster","Ching-Yao Lai","Yongji Wang"],"sources":[{"label":"arXiv: Discovery of Unstable Singularities","url":"https://arxiv.org/abs/2509.14185","kind":"research"},{"label":"DeepMind: Discovering new solutions to century-old problems in fluid dynamics","url":"https://deepmind.google/blog/discovering-new-solutions-to-century-old-problems-in-fluid-dynamics/","kind":"announcement"},{"label":"Physics World: Neural networks discover unstable singularities in fluid systems","url":"https://physicsworld.com/a/neural-networks-discover-unstable-singularities-in-fluid-systems/","kind":"coverage"}],"url":"https://whataifound.org/finding/2025-09-17-unstable-singularities"},{"id":"2025-09-11-gauss-strong-pnt","title":"Strong prime number theorem formalized in Lean by an autoformalization agent","claim":"An agent completed a Lean formalization of the strong prime number theorem in about three weeks, finishing a project two expert mathematicians had left blocked after 18 months.","field":"mathematics","date":"2025-09-11","added":"2026-07-27","lab":"Math, Inc.","model":"Gauss (autoformalization agent)","verification":"author-verified","autonomy":"ai-assisted","tags":["lean","formalization","number-theory","prime-number-theorem"],"humans":["Terence Tao","Alex Kontorovich"],"sources":[{"label":"Math, Inc.: Introducing Gauss","url":"https://www.math.inc/gauss","kind":"announcement"},{"label":"strongpnt Lean repository","url":"https://github.com/math-inc/strongpnt","kind":"research"}],"url":"https://whataifound.org/finding/2025-09-11-gauss-strong-pnt"},{"id":"2025-08-16-epic-cosmos-medical-event-models","title":"Generative medical event models trained on 118 million patients in Epic Cosmos (CoMET, renamed Curiosity)","claim":"Decoder-only transformers of up to 1 billion parameters, pretrained on 115 billion medical events from 118 million patients in Epic's Cosmos dataset, followed power-law scaling and, by simulating each patient's next events, generally matched or outperformed task-specific supervised models on 78 clinical prediction tasks without task-specific training.","field":"medicine","date":"2025-08-16","added":"2026-10-16","lab":"Epic Systems / Microsoft Research / Yale School of Medicine","model":"Curiosity, first presented as CoMET (Cosmos Medical Event Transformer), up to 1B parameters","verification":"claimed","autonomy":"ai-led","tags":["foundation-model","real-world-data","retrospective","scaling-laws","ehr"],"humans":["Shane Waxler","Hoifung Poon","Seth Hain","Rahul Shah"],"sources":[{"label":"arXiv: Generative medical event models improve with scale","url":"https://arxiv.org/abs/2508.12104","kind":"research"},{"label":"Microsoft Research: Generative medical event models improve with scale (CoMET)","url":"https://www.microsoft.com/en-us/research/publication/generative-medical-event-models-improve-with-scale/","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-08-16-epic-cosmos-medical-event-models"},{"id":"2025-08-gpt5-convex-bound","title":"Improved step-size bound in smooth convex optimization","claim":"GPT-5 Pro extended a guaranteed-convexity window for gradient descent from \\(\\eta \\le 1/L\\) to \\(\\eta \\le 1.5/L\\), but the optimal \\(1.75/L\\) bound had already been published months earlier.","field":"mathematics","date":"2025-08-01","added":"2026-07-20","lab":"OpenAI","model":"GPT-5 Pro","verification":"known","autonomy":"ai-assisted","tags":["optimization","already-known","cautionary"],"humans":["Sébastien Bubeck"],"sources":[{"label":"Analysis of the claim","url":"https://hackmd.io/@niloydebbarma/HkGxVPwFgx","kind":"challenge"},{"label":"What does GPT-5's 'new math' claim actually mean?","url":"https://allthings.how/what-does-gpt-5s-new-math-claim-actually-mean/","kind":"challenge"}],"url":"https://whataifound.org/finding/2025-08-gpt5-convex-bound"},{"id":"2025-07-28-aristotle-imo-lean","title":"Machine-checked Lean proofs for five of six 2025 IMO problems","claim":"Harmonic's Aristotle produced formally verified Lean 4 proofs for five of the six 2025 IMO problems, so the gold-medal-standard score rests on a compiler rather than on human graders.","field":"mathematics","date":"2025-07-28","added":"2026-07-29","lab":"Harmonic","model":"Aristotle","verification":"formal","autonomy":"ai-led","tags":["olympiad","lean","formalization","benchmark"],"sources":[{"label":"arXiv: Aristotle: IMO-level Automated Theorem Proving","url":"https://arxiv.org/abs/2510.01346","kind":"research"},{"label":"harmonic-ai/IMO2025: Lean proofs and verification artifacts","url":"https://github.com/harmonic-ai/IMO2025","kind":"research"}],"url":"https://whataifound.org/finding/2025-07-28-aristotle-imo-lean"},{"id":"2025-07-21-gemini-deepthink-imo","title":"Gold-medal standard at the 2025 International Mathematical Olympiad","claim":"An advanced version of Gemini Deep Think read the official problem statements and wrote natural-language proofs for five of the six 2025 IMO problems inside the contest time limits, scoring 35 of 42, graded and certified by the official IMO coordinators.","field":"mathematics","date":"2025-07-21","added":"2026-07-29","lab":"Google DeepMind","model":"Gemini Deep Think (advanced version)","verification":"independent","autonomy":"ai-led","tags":["olympiad","benchmark","natural-language-proof"],"sources":[{"label":"Gemini Deep Think: official IMO 2025 solutions (PDF)","url":"https://storage.googleapis.com/deepmind-media/gemini/IMO_2025.pdf","kind":"research"},{"label":"DeepMind: Gemini with Deep Think officially achieves gold-medal standard at the IMO","url":"https://deepmind.google/discover/blog/advanced-version-of-gemini-with-deep-think-officially-achieves-gold-medal-standard-at-the-international-mathematical-olympiad/","kind":"announcement"},{"label":"Simon Willison: OpenAI's gold medal performance on the IMO","url":"https://simonwillison.net/2025/Jul/19/openai-gold-medal-math-olympiad/","kind":"commentary"}],"url":"https://whataifound.org/finding/2025-07-21-gemini-deepthink-imo"},{"id":"2025-06-03-rentosertib-phase2a","title":"Phase 2a results for a drug whose target and molecule both came from AI","claim":"Rentosertib, a TNIK inhibitor whose target was picked by one AI system and whose molecule was generated by another, improved forced vital capacity by 98.4 mL at the top dose against a 20.3 mL decline on placebo in a 71-patient randomised trial.","field":"medicine","date":"2025-06-03","added":"2026-07-29","lab":"Insilico Medicine","model":"PandaOmics (target) + Chemistry42 (molecule)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["drug-discovery","clinical-trial","target-discovery","fibrosis"],"sources":[{"label":"Nature Medicine: A generative AI-discovered TNIK inhibitor for idiopathic pulmonary fibrosis","url":"https://www.nature.com/articles/s41591-025-03743-2","kind":"research"},{"label":"Insilico Medicine: positive topline results of ISM001-055","url":"https://insilico.com/news/tnik-ipf-phase2a","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-06-03-rentosertib-phase2a"},{"id":"2025-05-alphaevolve-kissing","title":"Improved lower bound for the 11-dimensional kissing number","claim":"AlphaEvolve improved the best known configuration for the kissing number problem in 11 dimensions.","field":"mathematics","date":"2025-05-14","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaEvolve (Gemini-based)","verification":"independent","autonomy":"search-scaffold","tags":["geometry","sphere-packing","alphaevolve"],"year_posed":1694,"sources":[{"label":"AlphaEvolve paper (PDF)","url":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/AlphaEvolve.pdf","kind":"research"},{"label":"DeepMind: AlphaEvolve","url":"https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/","kind":"announcement"},{"label":"IEEE Spectrum: AlphaEvolve Tackles Kissing Problem","url":"https://spectrum.ieee.org/deepmind-alphaevolve","kind":"coverage"}],"registrations":[{"registry":"mathdb","id":"315951","title":"Kissing number problem","url":"https://mathdb.com/p/315951/kissing-number-problem"}],"url":"https://whataifound.org/finding/2025-05-alphaevolve-kissing"},{"id":"2025-05-alphaevolve-matmul","title":"4×4 complex matrix multiplication in 48 scalar multiplications","claim":"AlphaEvolve found a scheme multiplying 4×4 complex matrices with 48 scalar multiplications, improving on Strassen's 49 from 1969.","field":"computer-science","date":"2025-05-14","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaEvolve (Gemini-based)","verification":"independent","autonomy":"search-scaffold","tags":["algorithms","linear-algebra","alphaevolve"],"year_posed":1969,"sources":[{"label":"AlphaEvolve paper (PDF)","url":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/AlphaEvolve.pdf","kind":"research"},{"label":"DeepMind: AlphaEvolve","url":"https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/","kind":"announcement"},{"label":"IEEE Spectrum","url":"https://spectrum.ieee.org/deepmind-alphaevolve","kind":"coverage"},{"label":"Wikipedia: AlphaEvolve","url":"https://en.wikipedia.org/wiki/AlphaEvolve","kind":"commentary"}],"url":"https://whataifound.org/finding/2025-05-alphaevolve-matmul"},{"id":"2025-05-alphaevolve-minimum-overlap","title":"Improved bound for the Erdős minimum-overlap problem","claim":"AlphaEvolve nudged the best known bound for Erdős's minimum-overlap constant, the first improvement since 2016, and sharpened several autocorrelation inequalities.","field":"mathematics","date":"2025-05-14","added":"2026-07-21","lab":"Google DeepMind","model":"AlphaEvolve (Gemini-based)","verification":"independent","autonomy":"search-scaffold","tags":["analysis","erdos","alphaevolve"],"year_posed":1955,"sources":[{"label":"DeepMind: AlphaEvolve","url":"https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/","kind":"announcement"},{"label":"AlphaEvolve paper (PDF)","url":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/AlphaEvolve.pdf","kind":"research"},{"label":"Wikipedia: Minimum overlap problem","url":"https://en.wikipedia.org/wiki/Minimum_overlap_problem","kind":"commentary"}],"registrations":[{"registry":"mathdb","id":"316064","title":"Minimum overlap problem","url":"https://mathdb.com/p/316064/minimum-overlap-problem"}],"url":"https://whataifound.org/finding/2025-05-alphaevolve-minimum-overlap"},{"id":"2025-robin-macular","title":"Candidate treatment for dry age-related macular degeneration","claim":"The Robin system automated hypothesis generation, experiment design and data analysis, identifying a novel candidate treatment for dry AMD.","field":"biology","date":"2025-05-01","added":"2026-07-20","lab":"FutureHouse","model":"Robin (multi-agent)","verification":"peer-reviewed","autonomy":"ai-led","tags":["drug-discovery","ophthalmology","multi-agent"],"sources":[{"label":"Nature: A multi-agent system for automating scientific discovery","url":"https://www.nature.com/articles/s41586-026-10652-y","kind":"research"},{"label":"Turing Post: 12 AI Co-Scientists of 2026","url":"https://www.turingpost.com/p/ai-co-scientists-in-2026","kind":"coverage"}],"url":"https://whataifound.org/finding/2025-robin-macular"},{"id":"2025-04-09-amie-diagnostic-dialogue","title":"Randomised comparison of an LLM diagnostic-dialogue system with primary care physicians (AMIE)","claim":"In a randomised, double-blind crossover study of text consultations with trained patient-actors across 159 case scenarios, Google's AMIE was more accurate in diagnosis than 20 primary care physicians and was rated better on 30 of 32 axes by specialist physicians and on 25 of 26 axes by the patient-actors.","field":"medicine","date":"2025-04-09","added":"2026-10-16","lab":"Google","model":"AMIE (Articulate Medical Intelligence Explorer), fine-tuned from PaLM 2","verification":"peer-reviewed","autonomy":"autonomous","tags":["large-language-model","diagnosis","conversational-ai","rct","simulated-patients"],"humans":["Tao Tu","Mike Schaekermann","Alan Karthikesalingam","Vivek Natarajan"],"sources":[{"label":"Nature: Towards conversational diagnostic artificial intelligence","url":"https://www.nature.com/articles/s41586-025-08866-7","kind":"research"},{"label":"arXiv: Towards conversational diagnostic AI (preprint)","url":"https://arxiv.org/abs/2401.05654","kind":"research"},{"label":"Google Research: AMIE, a research AI system for diagnostic medical reasoning and conversations","url":"https://research.google/blog/amie-a-research-ai-system-for-diagnostic-medical-reasoning-and-conversations/","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-04-09-amie-diagnostic-dialogue"},{"id":"2025-03-12-ai-scientist-workshop-paper","title":"A fully machine-generated paper passed workshop peer review","claim":"One of three end-to-end AI-generated manuscripts submitted to an ICLR 2025 workshop averaged 6.33 from reviewers and would have been accepted; the authors withdrew it, and the bar cleared was a workshop track, not the main conference.","field":"computer-science","date":"2025-03-12","added":"2026-07-29","lab":"Sakana AI","model":"The AI Scientist-v2","verification":"author-verified","autonomy":"ai-led","tags":["autonomous-research","peer-review","agents","contested"],"sources":[{"label":"Sakana AI: The AI Scientist generates its first peer-reviewed publication","url":"https://sakana.ai/ai-scientist-first-publication/","kind":"announcement"},{"label":"TechCrunch: Sakana claims its AI paper passed peer review (it's more nuanced than that)","url":"https://techcrunch.com/2025/03/12/sakana-claims-its-ai-paper-passed-peer-review-but-its-a-bit-more-nuanced-than-that/","kind":"challenge"},{"label":"SakanaAI/AI-Scientist-ICLR2025-Workshop-Experiment (manuscripts and reviews)","url":"https://github.com/SakanaAI/AI-Scientist-ICLR2025-Workshop-Experiment","kind":"research"}],"url":"https://whataifound.org/finding/2025-03-12-ai-scientist-workshop-paper"},{"id":"2025-02-ai-coscientist-amr","title":"AI co-scientist hypotheses on antimicrobial resistance and liver fibrosis","claim":"A multi-agent system generated hypotheses that were subsequently validated experimentally in the lab.","field":"biology","date":"2025-02-19","added":"2026-07-20","lab":"Google","model":"AI Co-Scientist (Gemini 2.0 multi-agent)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["hypothesis-generation","microbiology","multi-agent"],"sources":[{"label":"Nature: Accelerating scientific discovery with Co-Scientist","url":"https://www.nature.com/articles/s41586-026-10644-y","kind":"research"},{"label":"Cell: AI mirrors experimental science to uncover a mechanism of gene transfer crucial to bacterial evolution","url":"https://doi.org/10.1016/j.cell.2025.08.018","kind":"research"},{"label":"bioRxiv: AI mirrors experimental science to uncover a novel mechanism of gene transfer","url":"https://www.biorxiv.org/content/10.1101/2025.02.19.639094v1","kind":"research"},{"label":"Turing Post: 12 AI Co-Scientists of 2026","url":"https://www.turingpost.com/p/ai-co-scientists-in-2026","kind":"coverage"}],"url":"https://whataifound.org/finding/2025-02-ai-coscientist-amr"},{"id":"2025-02-13-designed-serine-hydrolases","title":"Enzymes with working catalytic machinery designed from scratch","claim":"Diffusion-based protein design produced serine hydrolases with catalytic efficiencies up to \\(2.2 \\times 10^5\\ \\mathrm{M^{-1}\\,s^{-1}}\\) on five folds unlike any natural serine hydrolase, with crystal structures matching the design models to under 1 Å.","field":"chemistry","date":"2025-02-13","added":"2026-07-29","lab":"Institute for Protein Design, University of Washington","model":"RFdiffusion with PLACER ensemble scoring","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["protein-design","enzyme-design","rfdiffusion","catalysis"],"humans":["Anna Lauko","David Baker"],"sources":[{"label":"Science: Computational design of serine hydrolases","url":"https://www.science.org/doi/10.1126/science.adu2454","kind":"research"},{"label":"Baker Lab: Generating new enzymes with complex active sites","url":"https://www.bakerlab.org/2025/02/13/ai-enzymes-with-complex-active-sites/","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-02-13-designed-serine-hydrolases"},{"id":"2025-01-16-esmgfp","title":"A working fluorescent protein generated by a language model","claim":"ESM3 designed esmGFP, a bright green fluorescent protein sharing only 58% of its sequence with the closest known natural fluorescent protein, a distance the authors estimate at over 500 million years of natural evolution.","field":"biology","date":"2025-01-16","added":"2026-07-29","lab":"EvolutionaryScale","model":"ESM3 (98B)","verification":"peer-reviewed","autonomy":"ai-led","tags":["protein-design","generative-biology","fluorescent-protein"],"humans":["Alexander Rives","Tom Sercu"],"sources":[{"label":"Science: Simulating 500 million years of evolution with a language model","url":"https://www.science.org/doi/10.1126/science.ads0018","kind":"research"},{"label":"EvolutionaryScale: ESM3 release","url":"https://www.evolutionaryscale.ai/blog/esm3-release","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-01-16-esmgfp"},{"id":"2025-01-16-mattergen","title":"Generative model designs crystals to order; its flagship synthesis turned out to be a known compound","claim":"MatterGen generates crystal structures conditioned on target properties, and its headline experimental validation was later shown to match a compound reported in 1972 that sits in the model's own training data.","field":"materials","date":"2025-01-16","added":"2026-07-29","lab":"Microsoft Research","model":"MatterGen","verification":"disputed","autonomy":"search-scaffold","tags":["materials","crystal-structure","diffusion-model","contested"],"sources":[{"label":"Nature: A generative model for inorganic materials design","url":"https://www.nature.com/articles/s41586-025-08628-5","kind":"research"},{"label":"MatterGen code and model weights","url":"https://github.com/microsoft/mattergen","kind":"research"},{"label":"Microsoft Research: MatterGen, a new paradigm of materials design with generative AI","url":"https://www.microsoft.com/en-us/research/blog/mattergen-a-new-paradigm-of-materials-design-with-generative-ai/","kind":"announcement"},{"label":"Materials Horizons: MatterGen predicts compounds from the training dataset","url":"https://pubs.rsc.org/en/content/articlelanding/2026/mh/d6mh00268d","kind":"challenge"}],"url":"https://whataifound.org/finding/2025-01-16-mattergen"},{"id":"2025-01-11-oracle-bone-duplicates","title":"Sixty-three previously unrecognised Oracle Bone duplicates found with an image-matching system","claim":"OBD-Finder, an image-matching system from Henan University that ranks candidate duplicates among published copies of Shang dynasty Oracle Bone inscriptions, led its developers' Oracle Bone specialists to 63 pairs of records that show the same bone but had not been recognised as duplicates, released with catalogue numbers and plates in January and February 2025 and reported in a refereed EMNLP 2026 demonstration paper.","field":"archaeology","date":"2025-01-11","added":"2026-10-30","lab":"Henan University / LMU Munich","model":"OBD-Finder: keypoint matching with EAST character detection and a Siamese network","verification":"author-verified","autonomy":"ai-assisted","tags":["oracle-bones","ancient-texts","paleography","image-matching"],"humans":["Chongsheng Zhang","Shuwen Wu","Yingqi Chen","Yi Men","Gaojuan Fan","Yubin Jiang"],"sources":[{"label":"EMNLP 2026 System Demonstrations: Explainable Coarse-to-Fine Ancient Manuscript Duplicates Discovery","url":"https://aclanthology.org/2026.emnlp-demos.23/","kind":"research"},{"label":"arXiv: Explainable Coarse-to-Fine Ancient Manuscript Duplicates Discovery","url":"https://arxiv.org/abs/2505.03836","kind":"research"},{"label":"GitHub: cszhangLMU/OBD-Finder, code and the released duplicate lists","url":"https://github.com/cszhangLMU/OBD-Finder","kind":"research"},{"label":"Xianqin: OBD-Finder software and its first 45 new duplicate pairs (in Chinese)","url":"https://www.xianqin.org/blog/archives/21693.html","kind":"announcement"},{"label":"Xianqin: 18 further new duplicate pairs (in Chinese)","url":"https://www.xianqin.org/blog/archives/21938.html","kind":"announcement"},{"label":"Xianqin: OBD-Finder 2.0, 115 new duplicate groups after subtracting earlier catalogues (in Chinese)","url":"https://www.xianqin.org/blog/archives/25828.html","kind":"announcement"}],"url":"https://whataifound.org/finding/2025-01-11-oracle-bone-duplicates"},{"id":"2024-11-22-dax-copilot-atrium-efficiency","title":"Longitudinal study finds DAX Copilot did not make primary care clinicians more efficient at Atrium Health","claim":"Comparing 112 primary care clinicians given Nuance's DAX Copilot ambient documentation with 103 similar clinicians without it over 180 days, Atrium Health found no significant difference in electronic health record time or financial measures, with small reductions in documentation time only in exploratory subgroups of heavy users, low-volume clinicians and family medicine.","field":"medicine","date":"2024-11-22","added":"2026-11-16","lab":"Atrium Health","model":"DAX Copilot (Nuance, Microsoft), since renamed Dragon Copilot","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["ambient-scribe","clinical-documentation","primary-care","prospective","real-world-data"],"humans":["Tsai-Ling Liu","Jeffrey A. Cleveland"],"sources":[{"label":"NEJM AI: Does AI-Powered Clinical Documentation Enhance Clinician Efficiency? A Longitudinal Study","url":"https://ai.nejm.org/doi/abs/10.1056/AIoa2400659","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT06329427","url":"https://clinicaltrials.gov/study/NCT06329427"}],"url":"https://whataifound.org/finding/2024-11-22-dax-copilot-atrium-efficiency"},{"id":"2024-11-20-alphaqubit","title":"A neural decoder that identifies quantum errors more accurately than hand-designed methods","claim":"A transformer trained on Google's Sycamore surface-code data cut decoding errors by 6% against tensor-network decoding and 30% against correlated matching, the best reported accuracy at the time.","field":"physics","date":"2024-11-20","added":"2026-07-29","lab":"Google DeepMind / Google Quantum AI","model":"AlphaQubit","verification":"peer-reviewed","autonomy":"ai-led","tags":["quantum-computing","error-correction","transformer"],"sources":[{"label":"Nature: Learning high-accuracy error decoding for quantum processors","url":"https://www.nature.com/articles/s41586-024-08148-8","kind":"research"},{"label":"Google: AlphaQubit, research on quantum error correction","url":"https://blog.google/innovation-and-ai/models-and-research/google-deepmind/alphaqubit-quantum-error-correction/","kind":"announcement"}],"url":"https://whataifound.org/finding/2024-11-20-alphaqubit"},{"id":"2024-10-02-flywire-connectome","title":"Complete wiring diagram of an adult fruit-fly brain","claim":"Machine segmentation of an electron-microscopy volume, corrected by a large community of proofreaders, produced the first synapse-level map of an entire adult brain: 139,255 neurons and roughly 50 million synapses.","field":"neuroscience","date":"2024-10-02","added":"2026-07-29","lab":"FlyWire Consortium (Princeton, MRC LMB, Cambridge, Vermont)","model":"Automated electron-microscopy segmentation networks","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["connectome","electron-microscopy","segmentation","drosophila"],"humans":["Sebastian Seung","Mala Murthy","Gregory Jefferis"],"sources":[{"label":"Nature: Neuronal wiring diagram of an adult brain","url":"https://www.nature.com/articles/s41586-024-07558-y","kind":"research"},{"label":"NIH: Complete wiring map of an adult fruit fly brain","url":"https://www.nih.gov/news-events/nih-research-matters/complete-wiring-map-adult-fruit-fly-brain","kind":"announcement"},{"label":"FlyWire (data and explorer)","url":"https://flywire.ai/","kind":"research"}],"url":"https://whataifound.org/finding/2024-10-02-flywire-connectome"},{"id":"2024-09-25-txgnn-drug-repurposing","title":"Zero-shot drug repurposing predictions across 17,080 diseases (TxGNN)","claim":"A graph foundation model trained on a medical knowledge graph ranks drugs as likely indications and contraindications for 17,080 diseases, including ones with no approved treatment, improving indication prediction by 49.2% over eight earlier methods under zero-shot evaluation; many of its new predictions match off-label prescribing in 1.27 million patient records at Mount Sinai.","field":"medicine","date":"2024-09-25","added":"2026-10-16","lab":"Harvard Medical School","model":"TxGNN (graph neural network with metric learning)","verification":"peer-reviewed","autonomy":"ai-led","tags":["drug-repurposing","graph-neural-network","knowledge-graph","rare-disease","retrospective","real-world-data"],"humans":["Kexin Huang","Payal Chandak","Marinka Zitnik"],"sources":[{"label":"Nature Medicine: A foundation model for clinician-centered drug repurposing","url":"https://www.nature.com/articles/s41591-024-03233-x","kind":"research"},{"label":"TxGNN code and model (mims-harvard/TxGNN)","url":"https://github.com/mims-harvard/TxGNN","kind":"research"},{"label":"medRxiv: preprint of the TxGNN study","url":"https://www.medrxiv.org/content/10.1101/2023.03.19.23287458v1","kind":"research"}],"url":"https://whataifound.org/finding/2024-09-25-txgnn-drug-repurposing"},{"id":"2024-07-25-alphaproof-imo","title":"Silver-medal standard at the 2024 International Mathematical Olympiad","claim":"AlphaProof and AlphaGeometry 2 together solved four of the six 2024 IMO problems for 28 of 42 points (one short of the gold threshold), with the algebra and number-theory solutions produced and checked in the Lean proof assistant.","field":"mathematics","date":"2024-07-25","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaProof + AlphaGeometry 2","verification":"independent","autonomy":"ai-led","tags":["olympiad","lean","formalization","benchmark"],"sources":[{"label":"DeepMind: AI achieves silver-medal standard solving IMO problems","url":"https://deepmind.google/discover/blog/ai-solves-imo-problems-at-silver-medal-level/","kind":"announcement"},{"label":"Nature: Olympiad-level formal mathematical reasoning with reinforcement learning","url":"https://www.nature.com/articles/s41586-025-09833-y","kind":"research"},{"label":"Unite.AI: How AlphaProof and AlphaGeometry 2 achieved silver-medal standard","url":"https://www.unite.ai/ai-at-the-international-mathematical-olympiad-how-alphaproof-and-alphageometry-2-achieved-silver-medal-standard/","kind":"coverage"}],"url":"https://whataifound.org/finding/2024-07-25-alphaproof-imo"},{"id":"2024-05-08-alphafold3","title":"Joint structure prediction for proteins, nucleic acids and ligands (AlphaFold 3)","claim":"A diffusion-based successor to AlphaFold predicts complexes spanning proteins, DNA, RNA, small molecules and ions in a single model, with large accuracy gains over the specialised docking tools used for each case.","field":"biology","date":"2024-05-08","added":"2026-07-29","lab":"Google DeepMind / Isomorphic Labs","model":"AlphaFold 3","verification":"peer-reviewed","autonomy":"ai-led","tags":["protein-structure","drug-discovery","alphafold","diffusion-model"],"humans":["John Jumper","Max Jaderberg"],"sources":[{"label":"Nature: Accurate structure prediction of biomolecular interactions with AlphaFold 3","url":"https://www.nature.com/articles/s41586-024-07487-w","kind":"research"},{"label":"AlphaFold 3 code (google-deepmind/alphafold3)","url":"https://github.com/google-deepmind/alphafold3","kind":"research"},{"label":"Google DeepMind and Isomorphic Labs introduce AlphaFold 3","url":"https://blog.google/innovation-and-ai/products/google-deepmind-isomorphic-alphafold-3-ai-model/","kind":"announcement"},{"label":"Nature Structural & Molecular Biology: Evaluating generalization in protein–ligand cofolding methods","url":"https://doi.org/10.1038/s41594-026-01797-5","kind":"challenge"},{"label":"bioRxiv: Have protein-ligand co-folding methods moved beyond memorisation?","url":"https://www.biorxiv.org/content/10.1101/2025.02.03.636309v3","kind":"challenge"}],"url":"https://whataifound.org/finding/2024-05-08-alphafold3"},{"id":"2024-02-21-tearing-mode-avoidance","title":"Reinforcement learning steers a tokamak away from tearing instabilities","claim":"A controller trained on past DIII-D shots forecast tearing-mode instabilities up to 300 ms ahead and adjusted the plasma in real time to avoid them, holding high-performance conditions that would otherwise have collapsed.","field":"physics","date":"2024-02-21","added":"2026-07-29","lab":"Princeton University / PPPL / DIII-D National Fusion Facility","model":"Deep reinforcement learning controller over a learned plasma model","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["fusion","plasma-control","reinforcement-learning","tokamak"],"humans":["Jaemin Seo","Egemen Kolemen"],"sources":[{"label":"Nature: Avoiding fusion plasma tearing instability with deep reinforcement learning","url":"https://www.nature.com/articles/s41586-024-07024-9","kind":"research"},{"label":"Princeton Engineering: Engineers use AI to wrangle fusion power for the grid","url":"https://engineering.princeton.edu/news/2024/02/21/engineers-use-ai-wrangle-fusion-power-grid","kind":"announcement"}],"url":"https://whataifound.org/finding/2024-02-21-tearing-mode-avoidance"},{"id":"2024-01-17-alphageometry","title":"Olympiad geometry solved without human demonstrations","claim":"A language model trained purely on synthetic data, paired with a symbolic deduction engine, solved 25 of 30 olympiad geometry problems against 10 for the previous best automated system and 25.9 for the average human gold medallist.","field":"mathematics","date":"2024-01-17","added":"2026-07-29","lab":"Google DeepMind","model":"AlphaGeometry","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["olympiad","geometry","neuro-symbolic","benchmark"],"humans":["Trieu Trinh","Thang Luong"],"sources":[{"label":"Nature: Solving olympiad geometry without human demonstrations","url":"https://www.nature.com/articles/s41586-023-06747-5","kind":"research"},{"label":"DeepMind: AlphaGeometry, an olympiad-level AI system for geometry","url":"https://deepmind.google/discover/blog/alphageometry-an-olympiad-level-ai-system-for-geometry/","kind":"announcement"},{"label":"google-deepmind/alphageometry (code)","url":"https://github.com/google-deepmind/alphageometry","kind":"research"},{"label":"arXiv: Wu's method can boost symbolic AI to rival silver medalists and AlphaGeometry to outperform gold medalists","url":"https://arxiv.org/abs/2404.06405","kind":"challenge"}],"url":"https://whataifound.org/finding/2024-01-17-alphageometry"},{"id":"2023-12-20-antibiotic-structural-class","title":"A new structural class of antibiotic candidates against MRSA","claim":"Graph neural networks trained on 39,312 assayed compounds and applied to 12 million molecules surfaced a chemical class active against MRSA in mice, with the substructures driving each prediction made explicit rather than left opaque.","field":"chemistry","date":"2023-12-20","added":"2026-07-29","lab":"MIT / Broad Institute / Harvard","model":"Ensembles of graph neural networks with substructure attribution","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["antibiotics","graph-neural-network","explainability","mrsa"],"humans":["Felix Wong","Erica Zheng","James Collins"],"sources":[{"label":"Nature: Discovery of a structural class of antibiotics with explainable deep learning","url":"https://www.nature.com/articles/s41586-023-06887-8","kind":"research"},{"label":"ScienceDaily: Using AI, researchers identify a new class of antibiotic candidates","url":"https://www.sciencedaily.com/releases/2023/12/231221012744.htm","kind":"coverage"}],"url":"https://whataifound.org/finding/2023-12-20-antibiotic-structural-class"},{"id":"2023-12-20-coscientist","title":"A language-model agent that planned and ran chemistry experiments on lab robots","claim":"Coscientist, driven by GPT-4 with web search, documentation search, code execution and lab automation, designed and executed palladium-catalysed cross-coupling reactions on real robotic hardware from a one-line goal.","field":"chemistry","date":"2023-12-20","added":"2026-07-29","lab":"Carnegie Mellon University","model":"GPT-4 (Coscientist agent)","verification":"peer-reviewed","autonomy":"ai-led","tags":["lab-automation","agents","cross-coupling","self-driving-lab"],"humans":["Daniil Boiko","Robert MacKnight","Gabe Gomes"],"sources":[{"label":"Nature: Autonomous chemical research with large language models","url":"https://www.nature.com/articles/s41586-023-06792-0","kind":"research"},{"label":"PubMed Central full text","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC10733136/","kind":"research"},{"label":"Coscientist data and reference implementation","url":"https://github.com/gomesgroup/coscientist","kind":"research"}],"url":"https://whataifound.org/finding/2023-12-20-coscientist"},{"id":"2023-12-funsearch-binpacking","title":"Improved heuristics for online bin packing","claim":"FunSearch produced bin-packing heuristics outperforming standard baselines on benchmark distributions.","field":"computer-science","date":"2023-12-14","added":"2026-07-20","lab":"Google DeepMind","model":"FunSearch (PaLM 2 / Codey)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["algorithms","heuristics","funsearch"],"year_posed":1971,"sources":[{"label":"Nature: Mathematical discoveries from program search with LLMs","url":"https://www.nature.com/articles/s41586-023-06924-6","kind":"research"},{"label":"FunSearch code and discovered programs","url":"https://github.com/google-deepmind/funsearch","kind":"research"}],"url":"https://whataifound.org/finding/2023-12-funsearch-binpacking"},{"id":"2023-12-funsearch-capset","title":"New lower bound constructions for the cap set problem","claim":"FunSearch discovered larger cap sets than any previously known construction, the first time an LLM-based system produced a genuinely new discovery on an established open problem.","field":"mathematics","date":"2023-12-14","added":"2026-07-20","lab":"Google DeepMind","model":"FunSearch (PaLM 2 / Codey)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["combinatorics","cap-set","funsearch","historic-first"],"year_posed":1970,"sources":[{"label":"Nature: Mathematical discoveries from program search with LLMs","url":"https://www.nature.com/articles/s41586-023-06924-6","kind":"research"},{"label":"FunSearch code and discovered programs","url":"https://github.com/google-deepmind/funsearch","kind":"research"},{"label":"DeepMind: FunSearch","url":"https://deepmind.google/blog/funsearch-making-new-discoveries-in-mathematical-sciences-using-large-language-models/","kind":"announcement"}],"url":"https://whataifound.org/finding/2023-12-funsearch-capset"},{"id":"2023-11-29-a-lab-synthesis","title":"Autonomous laboratory reports solid-state synthesis of new inorganic compounds","claim":"Berkeley's A-Lab, an AI-driven autonomous laboratory, reported synthesising 41 novel inorganic compounds out of 58 targets over 17 days with minimal human intervention.","field":"materials","date":"2023-11-29","added":"2026-07-20","lab":"Lawrence Berkeley National Laboratory","model":"A-Lab (ML planning + robotics)","verification":"disputed","autonomy":"ai-led","tags":["materials","autonomous-lab","synthesis","contested"],"sources":[{"label":"Nature: An autonomous laboratory for the accelerated synthesis of inorganic materials","url":"https://www.nature.com/articles/s41586-023-06734-w","kind":"research"},{"label":"The Register: Boffins deem DeepMind's material discoveries shallow","url":"https://www.theregister.com/2024/04/11/google_deepmind_material_study/","kind":"challenge"}],"url":"https://whataifound.org/finding/2023-11-29-a-lab-synthesis"},{"id":"2023-11-29-gnome","title":"Large-scale prediction of new stable crystalline materials (GNoME)","claim":"GNoME predicted about 2.2 million new inorganic crystal structures, roughly 380,000 of them flagged as thermodynamically stable, presented as an order-of-magnitude expansion of known stable materials.","field":"materials","date":"2023-11-29","added":"2026-07-20","lab":"Google DeepMind","model":"GNoME (graph neural network)","verification":"disputed","autonomy":"search-scaffold","tags":["materials","crystal-structure","graph-neural-network","contested"],"sources":[{"label":"Nature: Scaling deep learning for materials discovery","url":"https://www.nature.com/articles/s41586-023-06735-9","kind":"research"},{"label":"GNoME models, DFT data and 380k predicted structures","url":"https://github.com/google-deepmind/materials_discovery","kind":"research"},{"label":"DeepMind: Millions of new materials discovered with deep learning","url":"https://deepmind.google/blog/millions-of-new-materials-discovered-with-deep-learning/","kind":"announcement"},{"label":"The Register: Boffins deem DeepMind's material discoveries shallow","url":"https://www.theregister.com/2024/04/11/google_deepmind_material_study/","kind":"challenge"}],"url":"https://whataifound.org/finding/2023-11-29-gnome"},{"id":"2023-11-14-graphcast","title":"Medium-range weather forecasts from a graph neural network beat the operational physics model","claim":"GraphCast produced more accurate 10-day forecasts than ECMWF's HRES on roughly 90% of the evaluated variable and lead-time combinations, in under a minute on a single TPU against hours on a supercomputer.","field":"climate","date":"2023-11-14","added":"2026-07-29","lab":"Google DeepMind","model":"GraphCast","verification":"peer-reviewed","autonomy":"ai-led","tags":["weather","forecasting","graph-neural-network"],"humans":["Remi Lam","Peter Battaglia"],"sources":[{"label":"Science: Learning skillful medium-range global weather forecasting","url":"https://www.science.org/doi/10.1126/science.adi2336","kind":"research"},{"label":"DeepMind: GraphCast, AI model for faster and more accurate global weather forecasting","url":"https://deepmind.google/blog/graphcast-ai-model-for-faster-and-more-accurate-global-weather-forecasting/","kind":"announcement"},{"label":"GraphCast code and weights (google-deepmind/weathernext)","url":"https://github.com/google-deepmind/weathernext","kind":"research"}],"url":"https://whataifound.org/finding/2023-11-14-graphcast"},{"id":"2023-09-19-alphamissense","title":"Pathogenicity predictions for 71 million human missense variants","claim":"An AlphaFold-derived model classified 89% of all 71 million possible human missense variants as likely benign or likely pathogenic, against the roughly 0.1% that carry a clinical classification today.","field":"medicine","date":"2023-09-19","added":"2026-07-29","lab":"Google DeepMind","model":"AlphaMissense","verification":"peer-reviewed","autonomy":"ai-led","tags":["genomics","variant-effect","clinical-genetics"],"sources":[{"label":"Science: Accurate proteome-wide missense variant effect prediction with AlphaMissense","url":"https://www.science.org/doi/10.1126/science.adg7492","kind":"research"},{"label":"DeepMind: A catalogue of genetic mutations to help pinpoint the cause of diseases","url":"https://deepmind.google/blog/a-catalogue-of-genetic-mutations-to-help-pinpoint-the-cause-of-diseases/","kind":"announcement"},{"label":"Nature Biotechnology: Advancing missense variant pathogenicity prediction","url":"https://www.nature.com/articles/s41587-023-01999-y","kind":"research"},{"label":"AlphaMissense predictions and code","url":"https://github.com/google-deepmind/alphamissense","kind":"research"}],"url":"https://whataifound.org/finding/2023-09-19-alphamissense"},{"id":"2023-06-07-alphadev","title":"Faster sorting routines discovered and merged into the LLVM C++ library","claim":"AlphaDev found shorter branchless routines for sorting small fixed-length inputs; reverse-engineered to C++, they were merged into LLVM's libc++, the first change to those routines in over a decade.","field":"computer-science","date":"2023-06-07","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaDev (AlphaZero-based)","verification":"independent","autonomy":"search-scaffold","tags":["algorithms","sorting","reinforcement-learning","deployed"],"sources":[{"label":"Nature: Faster sorting algorithms discovered using deep reinforcement learning","url":"https://www.nature.com/articles/s41586-023-06004-9","kind":"research"},{"label":"AlphaDev code and discovered sorting routines","url":"https://github.com/google-deepmind/alphadev","kind":"research"},{"label":"DeepMind: AlphaDev discovers faster sorting algorithms","url":"https://deepmind.google/blog/alphadev-discovers-faster-sorting-algorithms/","kind":"announcement"},{"label":"Wikipedia: AlphaDev","url":"https://en.wikipedia.org/wiki/AlphaDev","kind":"commentary"}],"url":"https://whataifound.org/finding/2023-06-07-alphadev"},{"id":"2022-10-05-alphatensor","title":"Faster matrix-multiplication algorithms found by reinforcement learning","claim":"AlphaTensor discovered matrix-multiplication schemes using fewer scalar multiplications than any previously known, including a way to multiply 4×4 matrices over GF(2) in 47 multiplications versus the 49 of two-level Strassen.","field":"computer-science","date":"2022-10-05","added":"2026-07-20","lab":"Google DeepMind","model":"AlphaTensor (AlphaZero-based)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["algorithms","linear-algebra","reinforcement-learning"],"year_posed":1969,"sources":[{"label":"Nature: Discovering faster matrix multiplication algorithms with reinforcement learning","url":"https://www.nature.com/articles/s41586-022-05172-4","kind":"research"},{"label":"AlphaTensor code and discovered algorithms","url":"https://github.com/google-deepmind/alphatensor","kind":"research"},{"label":"DeepMind: Discovering novel algorithms with AlphaTensor","url":"https://deepmind.google/discover/blog/discovering-novel-algorithms-with-alphatensor/","kind":"announcement"},{"label":"Quanta: AI Reveals New Possibilities in Matrix Multiplication","url":"https://www.quantamagazine.org/ai-reveals-new-possibilities-in-matrix-multiplication-20221123/","kind":"coverage"}],"url":"https://whataifound.org/finding/2022-10-05-alphatensor"},{"id":"2022-07-21-trews-sepsis-early-warning","title":"Prospective multi-site study of the TREWS sepsis early-warning system","claim":"Across five hospitals that monitored 590,736 patients with a machine-learning sepsis alert, patients with sepsis whose alert a clinician confirmed within three hours had 3.3 percentage points lower adjusted in-hospital mortality, an 18.7% relative reduction, than patients whose alert was not confirmed in that time.","field":"medicine","date":"2022-07-21","added":"2026-10-16","lab":"Johns Hopkins University","model":"TREWS (Targeted Real-time Early Warning System)","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["sepsis","early-warning","prospective","fda-cleared"],"humans":["Roy Adams","Katharine E. Henry","Suchi Saria"],"sources":[{"label":"Nature Medicine: Prospective, multi-site study of patient outcomes after implementation of the TREWS early warning system for sepsis","url":"https://www.nature.com/articles/s41591-022-01894-0","kind":"research"},{"label":"Healthcare Dive: Bayesian Health gets FDA nod for AI sepsis detection tool","url":"https://www.healthcaredive.com/news/bayesian-health-gets-fda-nod-for-ai-sepsis-detection-tool/820107/","kind":"coverage"}],"registrations":[{"registry":"fda-ai-devices","id":"K250680","url":"https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K250680","title":"Bayesian Health Sepsis Flagging Device","note":"Cleared 30 April 2026 and announced by the company on 12 May 2026 as part of the TREWS platform; the FDA record itself does not name TREWS."}],"url":"https://whataifound.org/finding/2022-07-21-trews-sepsis-early-warning"},{"id":"2022-02-16-tokamak-plasma-control","title":"Deep reinforcement learning controls tokamak fusion plasma","claim":"A reinforcement-learning controller learned to shape and stabilise the magnetic confinement of real fusion plasma inside the TCV tokamak, holding configurations that are hard to sustain by hand.","field":"physics","date":"2022-02-16","added":"2026-07-21","lab":"Google DeepMind","model":"DeepMind RL controller","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["physics","fusion","reinforcement-learning","control"],"sources":[{"label":"Nature: Magnetic control of tokamak plasmas through deep reinforcement learning","url":"https://www.nature.com/articles/s41586-021-04301-9","kind":"research"},{"label":"DeepMind: Accelerating fusion science through learned plasma control","url":"https://deepmind.google/discover/blog/accelerating-fusion-science-through-learned-plasma-control/","kind":"announcement"},{"label":"EPFL: EPFL and DeepMind use AI to control plasmas for fusion","url":"https://actu.epfl.ch/news/epfl-and-deepmind-use-ai-to-control-plasmas-for-nu/","kind":"announcement"}],"url":"https://whataifound.org/finding/2022-02-16-tokamak-plasma-control"},{"id":"2021-12-01-knot-theory-intuition","title":"Two theorems found by machine pattern-spotting in knot theory and representation theory","claim":"Networks trained to predict one mathematical invariant from another, then probed for which inputs mattered, pointed mathematicians to a proved theorem linking a knot's signature to a new geometric quantity, and to structure behind the combinatorial invariance conjecture.","field":"mathematics","date":"2021-12-01","added":"2026-07-29","lab":"Google DeepMind (with Oxford and Sydney)","model":"Supervised networks with gradient-based attribution","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["knot-theory","representation-theory","conjecture-generation"],"humans":["Alex Davies","Marc Lackenby","Geordie Williamson"],"sources":[{"label":"Nature: Advancing mathematics by guiding human intuition with AI","url":"https://www.nature.com/articles/s41586-021-04086-x","kind":"research"},{"label":"Knot theory and representation theory notebooks","url":"https://github.com/google-deepmind/mathematics_conjectures","kind":"research"},{"label":"University of Oxford: Machine learning helps mathematicians make new connections","url":"https://www.ox.ac.uk/news/2021-12-01-machine-learning-helps-mathematicians-make-new-connections-0","kind":"announcement"},{"label":"Ernest Davis: Deep Learning and Mathematical Intuition (review)","url":"https://arxiv.org/abs/2112.04324","kind":"challenge"}],"url":"https://whataifound.org/finding/2021-12-01-knot-theory-intuition"},{"id":"2021-07-15-alphafold2","title":"Accurate protein structure prediction across the known proteome (AlphaFold2)","claim":"AlphaFold2 predicted three-dimensional structures for nearly all catalogued proteins from amino-acid sequence at accuracy rivalling experiment, work that earned the 2024 Nobel Prize in Chemistry.","field":"biology","date":"2021-07-15","added":"2026-07-21","lab":"Google DeepMind","model":"AlphaFold2","verification":"independent","autonomy":"ai-led","tags":["protein-structure","biology","alphafold","nobel-prize"],"humans":["John Jumper","Demis Hassabis"],"year_posed":1972,"sources":[{"label":"Nature: Highly accurate protein structure prediction with AlphaFold","url":"https://www.nature.com/articles/s41586-021-03819-2","kind":"research"},{"label":"AlphaFold code (google-deepmind/alphafold)","url":"https://github.com/google-deepmind/alphafold","kind":"research"},{"label":"DeepMind: AlphaFold","url":"https://deepmind.google/science/alphafold/","kind":"announcement"},{"label":"Nobel Prize: Chemistry 2024 press release","url":"https://www.nobelprize.org/prizes/chemistry/2024/press-release/","kind":"commentary"}],"url":"https://whataifound.org/finding/2021-07-15-alphafold2"},{"id":"2021-06-21-epic-sepsis-model-v1","title":"Epic Sepsis Model, version 1, disputed by external validation","claim":"Epic's proprietary sepsis prediction model, deployed at hundreds of US hospitals with a publicly reported area under the curve of 0.76 to 0.83, scored 0.63 in its first external validation, at Michigan Medicine, missing 67% of sepsis cases while alerting on 18% of all hospitalised patients.","field":"medicine","date":"2021-06-21","added":"2026-10-16","lab":"Epic Systems","model":"Epic Sepsis Model v1 (proprietary penalized logistic regression)","verification":"disputed","autonomy":"ai-assisted","tags":["sepsis","early-warning","external-validation","retrospective","real-world-data"],"sources":[{"label":"JAMA Internal Medicine: External validation of a widely implemented proprietary sepsis prediction model in hospitalized patients","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC8218233/","kind":"challenge"},{"label":"JAMA Internal Medicine: Variability in the performance of a proprietary sepsis prediction model across 9 networked hospitals","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC10071393/","kind":"challenge"},{"label":"Contagion Live: Evaluation of sepsis prediction tool raises questions about proprietary tools","url":"https://www.contagionlive.com/view/evaluation-of-sepsis-prediction-tool-raises-questions-about-proprietary-tools","kind":"coverage"}],"url":"https://whataifound.org/finding/2021-06-21-epic-sepsis-model-v1"},{"id":"2021-05-06-eagle-ai-ecg-low-ejection-fraction","title":"Pragmatic randomised trial of an AI-ECG for low ejection fraction in primary care (EAGLE)","claim":"Giving primary care teams the output of an AI that reads routine 12-lead ECGs for signs of a weak heart raised new diagnoses of low ejection fraction within 90 days from 1.6% to 2.1% of 22,641 patients, in a cluster-randomised trial across 120 teams at 45 Mayo Clinic clinics and hospitals, without increasing echocardiogram use overall.","field":"medicine","date":"2021-05-06","added":"2026-10-16","lab":"Mayo Clinic","model":"AI-ECG convolutional neural network for left ventricular systolic dysfunction","verification":"peer-reviewed","autonomy":"ai-assisted","tags":["cardiology","ecg","heart-failure","rct","prospective","fda-cleared"],"humans":["Xiaoxi Yao","Paul A. Friedman","Peter A. Noseworthy"],"sources":[{"label":"Nature Medicine: AI-enabled electrocardiograms for identification of patients with low ejection fraction, a pragmatic randomized trial","url":"https://www.nature.com/articles/s41591-021-01335-4","kind":"research"},{"label":"Nature Medicine: Screening for cardiac contractile dysfunction using an AI-enabled electrocardiogram (the model)","url":"https://www.nature.com/articles/s41591-018-0240-2","kind":"research"},{"label":"Annals of Noninvasive Electrocardiology: AI-enabled ECG screening for low ejection fraction in routine care, a systematic review and meta-analysis of randomized trials (2026)","url":"https://doi.org/10.1111/anec.70248","kind":"commentary"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT04000087","url":"https://clinicaltrials.gov/study/NCT04000087"},{"registry":"fda-ai-devices","id":"K232699","url":"https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K232699","title":"Low Ejection Fraction AI-ECG Algorithm (Anumana)","note":"Anumana's commercial algorithm, cleared in September 2023 and developed from the Mayo Clinic AI-ECG; the FDA record does not identify it with the trial version."}],"url":"https://whataifound.org/finding/2021-05-06-eagle-ai-ecg-low-ejection-fraction"},{"id":"2021-04-29-wagner-combinatorics","title":"Reinforcement learning refutes several conjectures in extremal combinatorics","claim":"A neural network building graphs edge by edge under a cross-entropy search produced explicit counterexamples to several published conjectures in graph theory and extremal combinatorics.","field":"mathematics","date":"2021-04-29","added":"2026-07-29","lab":"Tel Aviv University","model":"Deep cross-entropy method (custom network)","verification":"independent","autonomy":"search-scaffold","tags":["combinatorics","graph-theory","counterexample","reinforcement-learning"],"humans":["Adam Zsolt Wagner"],"sources":[{"label":"arXiv: Constructions in combinatorics via neural networks","url":"https://arxiv.org/abs/2104.14516","kind":"research"},{"label":"Wagner's cross-entropy code for the counterexamples","url":"https://github.com/zawagner22/cross-entropy-for-combinatorics","kind":"research"},{"label":"Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search","url":"https://arxiv.org/abs/2207.03343","kind":"challenge"}],"url":"https://whataifound.org/finding/2021-04-29-wagner-combinatorics"},{"id":"2020-02-20-halicin","title":"Halicin, an antibiotic found by a neural network screening a compound library","claim":"A graph neural network trained on 2,335 molecules picked halicin out of a repurposing library; it killed multidrug-resistant bacteria including Acinetobacter baumannii and Mycobacterium tuberculosis in vitro and cleared infections in mice.","field":"medicine","date":"2020-02-20","added":"2026-07-29","lab":"MIT / Broad Institute","model":"Directed message-passing graph neural network (Chemprop)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["antibiotics","drug-repurposing","graph-neural-network"],"humans":["Jonathan Stokes","Regina Barzilay","James Collins"],"sources":[{"label":"Cell: A deep learning approach to antibiotic discovery","url":"https://www.cell.com/cell/fulltext/S0092-8674(20)30102-1","kind":"research"},{"label":"MIT News: Artificial intelligence yields new antibiotic","url":"https://news.mit.edu/2020/artificial-intelligence-identifies-new-antibiotic-0220","kind":"announcement"}],"url":"https://whataifound.org/finding/2020-02-20-halicin"},{"id":"2020-02-04-baricitinib-covid19","title":"Baricitinib for COVID-19, named by a knowledge-graph search and confirmed in randomised trials","claim":"A search of BenevolentAI's machine-learning-built biomedical knowledge graph named the rheumatoid arthritis drug baricitinib as a candidate COVID-19 treatment within weeks of the outbreak; randomised trials run by groups unconnected to BenevolentAI later found it lowered 28-day mortality in hospitalised patients, from 14% to 12% among 8,156 patients in RECOVERY.","field":"medicine","date":"2020-02-04","added":"2026-10-16","lab":"BenevolentAI","model":"BenevolentAI biomedical knowledge graph with machine-learning literature extraction","verification":"independent","autonomy":"ai-assisted","tags":["drug-repurposing","knowledge-graph","covid-19","rct","phase-3"],"humans":["Peter Richardson","Justin Stebbing"],"sources":[{"label":"The Lancet: Baricitinib as potential treatment for 2019-nCoV acute respiratory disease","url":"https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(20)30304-4/fulltext","kind":"research"},{"label":"Frontiers in Pharmacology: Expert-augmented computational drug repurposing identified baricitinib as a treatment for COVID-19","url":"https://www.frontiersin.org/articles/10.3389/fphar.2021.709856/full","kind":"research"},{"label":"The Lancet: Baricitinib in patients admitted to hospital with COVID-19 (RECOVERY)","url":"https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(22)01109-6/fulltext","kind":"research"},{"label":"NEJM: Baricitinib plus remdesivir for hospitalized adults with Covid-19 (ACTT-2)","url":"https://www.nejm.org/doi/full/10.1056/NEJMoa2031994","kind":"research"}],"url":"https://whataifound.org/finding/2020-02-04-baricitinib-covid19"},{"id":"2018-08-28-idx-dr-autonomous-diagnostic","title":"Pivotal trial of an autonomous AI diagnostic for diabetic retinopathy (IDx-DR)","claim":"In a prospective trial at 10 US primary care offices, an AI system that grades retinal photographs with no clinician reading them detected more-than-mild diabetic retinopathy with 87.2% sensitivity and 90.7% specificity against a specialist reading-centre reference, exceeding every prespecified endpoint; the results were the basis for the first FDA authorization of an autonomous AI diagnostic.","field":"medicine","date":"2018-08-28","added":"2026-10-16","lab":"IDx / University of Iowa","model":"IDx-DR","verification":"peer-reviewed","autonomy":"autonomous","tags":["diabetic-retinopathy","ophthalmology","autonomous-diagnosis","prospective","fda-cleared"],"humans":["Michael D. Abràmoff","James C. Folk"],"sources":[{"label":"npj Digital Medicine: Pivotal trial of an autonomous AI-based diagnostic system for detection of diabetic retinopathy in primary care offices","url":"https://www.nature.com/articles/s41746-018-0040-6","kind":"research"}],"registrations":[{"registry":"clinicaltrials-gov","id":"NCT02963441","url":"https://clinicaltrials.gov/study/NCT02963441"},{"registry":"fda-ai-devices","id":"DEN180001","url":"https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/denovo.cfm?id=DEN180001","title":"IDx-DR","note":"De Novo classification, 11 April 2018. Digital Diagnostics now holds the later 510(k) clearances, K203629 (2021) and K213037 (IDx-DR v2.3, 2022)."}],"url":"https://whataifound.org/finding/2018-08-28-idx-dr-autonomous-diagnostic"},{"id":"2017-12-14-kepler-90i","title":"An eighth planet around Kepler-90 found by a neural network","claim":"A convolutional network re-examining Kepler light curves recovered transit signals the standard pipeline had ranked below threshold, yielding Kepler-90i and making Kepler-90 the first star besides the Sun known to host eight planets.","field":"astronomy","date":"2017-12-14","added":"2026-07-29","lab":"Google Brain / University of Texas at Austin","model":"Convolutional neural network (AstroNet)","verification":"peer-reviewed","autonomy":"search-scaffold","tags":["exoplanets","kepler","transit-detection"],"humans":["Christopher Shallue","Andrew Vanderburg"],"sources":[{"label":"The Astronomical Journal: Identifying Exoplanets with Deep Learning","url":"https://iopscience.iop.org/article/10.3847/1538-3881/aa9e09","kind":"research"},{"label":"AstroNet: Kepler light-curve models (exoplanet-ml)","url":"https://github.com/google-research/exoplanet-ml","kind":"research"},{"label":"NASA: Artificial intelligence, NASA data used to discover eighth planet circling distant star","url":"https://www.nasa.gov/news-release/artificial-intelligence-nasa-data-used-to-discover-eighth-planet-circling-distant-star/","kind":"announcement"}],"url":"https://whataifound.org/finding/2017-12-14-kepler-90i"}]}