Zhao Song and Xinzhi Zhang prove a universal, dimension-independent bound for the Kannan–Lovász–Simonovits constant of isotropic log-concave probability measures, resolving the KLS conjecture. Their proof repeatedly refines bounds on polynomial variance and curvature; the authors report that AI tools helped explore more than 100 approaches, obtain the earlier log-star bound, and develop and verify the final proof. Independent researchers also posted proofs, and the paper’s streamlined proof is being formalized in Lean. The 1 October preprint gave a slowly dimension-dependent bound; the 4 October version established the dimension-independent theorem described here.
Technology: GPT-6 Astra; GPT-5.6 Sol; Claude Fable 5; Fable (as named in the paper’s AI disclosure)
Family Claude: profile · models page
Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: prospective or independent check
- Tested: Zhao Song and Xinzhi Zhang prove a universal, dimension-independent bound for the Kannan–Lovász–Simonovits constant of isotropic log-concave probability measures, resolving the KLS conjecture.
- Still unknown: The proof is a recent arXiv preprint, not yet journal peer-reviewed in the source reviewed. Independent proofs were posted, and the Microsoft Research author account reports later Lean formalization of a streamlined proof; the paper version and posted revisions should be checked as the work develops. This entry counts the theorem result once, not the intermediate log-star bound separately.
- AI role: The authors state that they explored candidate approaches collaboratively with AI tools; the tools helped obtain the earlier log-star bound and develop detailed proof steps, while the researchers selected the direction and completed the repeated refinement argument. The authors state they checked the proofs with AI tools and take responsibility for correctness.
Evidence sources: https://arxiv.org/pdf/2610.01447v2 · https://arxiv.org/abs/2610.01447 · https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 4/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
The authors prove that, assuming Zieve-admissible branch data are realizable for three branch points, all such data with four or more branch points are realizable. This establishes that no additional obstruction arises solely from adding branch points; the underlying three-branch-point conjecture remains open. The paper discloses GPT-5.6 Sol and GPT-6 Astra assistance in exploring reduction strategies and in proof development and checking.
Technology: OpenAI GPT-5.6 Sol and GPT-6 Astra
Family GPT-5: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The authors prove that, assuming Zieve-admissible branch data are realizable for three branch points, all such data with four or more branch points are realizable.
- Still unknown: This is a new conditional mathematical reduction theorem, not a resolution of Zieve’s full conjecture: the three-branch-point case remains open. The source is an arXiv preprint; human authors report reviewing AI-assisted work and accept responsibility, but no independent verification of the proof is claimed here.
- AI role: Authors explicitly report that the models assisted throughout the research, including exploration of reduction strategies and proof development/checking, as well as notation consistency and manuscript work. Humans reviewed all AI-assisted content and take responsibility for the proof.
Evidence sources: https://arxiv.org/abs/2609.23663
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
The paper gives a negative answer, already for q=2, to Talagrand’s question whether an operator’s Rademacher cotype is universally bounded by its Gaussian cotype and its (q,1)-summing norm. For every sufficiently large power-of-two dimension it constructs a Banach space and operator violating such a universal bound. The same construction also yields a negative answer to Kwapień’s decomposition problem.
Technology: ChatGPT GPT-5.6
Family GPT-5: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The paper gives a negative answer, already for q=2, to Talagrand’s question whether an operator’s Rademacher cotype is universally bounded by its Gaussian cotype and its (q,1)-summing norm.
- Still unknown: This is a single-author arXiv preprint, not a peer-reviewed publication. GPT-5.6 is credited with discovering the counterexample during discussions; the author says they independently verified all arguments. No Lean or other proof-assistant formalization is reported. The mathematical scope is the stated q=2 counterexample and its stated corollary, not a complete characterization of operator cotype.
- AI role: The author states that the counterexample was discovered during discussions with GPT-5.6. The paper presents an explicit Walsh–Hadamard-based construction and proof; the author independently verified the arguments.
Evidence sources: https://arxiv.org/abs/2609.19731
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
Connected to MIT EQuS lab software, GPT-5.6 Sol selected parameters, ran measurements, and calibrated a six-qubit superconducting chip, measuring its frequencies and coherence. The demonstration covers known procedures on real hardware; weak or noisy signals sometimes required expert assistance, and no new physical property was demonstrated.
Technology: GPT-5.6 Sol and Codex
Family GPT-5: profile · models page
Publication: Announcement only · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Announcement only
- Test type: direct test
- Tested: Connected to MIT EQuS lab software, GPT-5.6 Sol ran measurements on an uncalibrated six-qubit chip of a standard type, chose parameters, operated the hardware and analyzed results.
- Still unknown: Not assessed: the technical case study with the detailed results was not read.
- AI role: GPT-5.6 Sol in Codex ran routine measurement workflows with measurement-specific skills provided by the researcher.
Evidence sources: https://openai.com/index/codex-quantum-computing-experiments/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: press release. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
A single-author preprint proves that every finite one-dimensional open O(n) spin chain with arbitrary inhomogeneous nearest- and next-nearest-neighbor interactions has an exact, temperature-independent Hamiltonian mapping to a simpler nearest-neighbor chain with axial single-spin potentials. A parallel result for q-state Potts chains yields a closed-form solution for every q ≥ 2 and finite chain length. The theorem generalizes a 1990 Heisenberg-chain challenge and connects spontaneous collective behavior from competing interactions to field-induced behavior.
Technology: OpenAI GPT-5.6 Sol; GPT-5.6 Sol Pro for final adversarial manuscript review
Family GPT-5: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: A single-author preprint proves that every finite one-dimensional open O(n) spin chain with arbitrary inhomogeneous nearest- and next-nearest-neighbor interactions has an exact, temperature-independent Hamiltonian mapping to a simpler nearest-neighbor chain with axial single-spin potentials.
- Still unknown: This is a single-author arXiv preprint, not yet peer reviewed. The theorem concerns classical one-dimensional open chains and exact Hamiltonian mappings; the paper discusses possible experimental relevance but reports no experimental test. The author assumes responsibility for reviewing and verifying AI-generated content; Mathematica 14.3 was also used to verify results.
- AI role: The author credits GPT-5.6 Sol with scientific discovery, including generating the recursive Householder moving-frame proof and recognizing broad generalizations. The author identified the hidden reciprocity, extended the theorem to arbitrary spatial inhomogeneity, and states that all AI-generated scientific content was reviewed and verified. GPT-5.6 Sol Pro conducted a final adversarial review.
Evidence sources: https://arxiv.org/abs/2609.00322
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
The system identified TEMPO as a useful additive for coupling primary sulfonamides; chemists reproduced yield improvements in 11 of 14 substrate pairs at bench scale. The work retains human supervision and specialized infrastructure; independent reproducibility and generalization remain to be checked.
Technology: GPT-5.4 and Maria
Family GPT-5: profile · models page
Publication: Announcement only · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Announcement only
- Test type: direct test
- Tested: Over two cycles in an automated lab, yields improved for 88% of boronic acids and 83% of sulfonamides tested (mean 16.6% to 25.2%); human chemists repeated representative reactions at bench scale, with higher yields for 11 of 14 substrate pairs.
- Still unknown: Not stated in the reviewed material
- AI role: GPT-5.4 connected to Molecule.one Maria proposed, designed and analyzed experiments; humans steered prompts, selected proposals, made limited corrections and validated the final result.
Evidence sources: https://openai.com/index/ai-chemist-improves-reaction/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: press release. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
OpenAI reports that an internal version of GPT-5.5, with a purpose-built scaffold, found a proof of a known asymptotic result on off-diagonal Ramsey numbers, then verified in Lean. The announcement appeared with the model launch on April 23, 2026; the full proof is in a separate PDF now linked. Page rechecked November 12, 2026: the text matches.
Technology: GPT-5.5 (internal version)
Family GPT-5: profile · models page
Publication: Announcement only · Test context: prospective or independent check. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Announcement only
- Test type: prospective or independent check
- Tested: GPT-5.5 found a proof of an asymptotic fact about off-diagonal Ramsey numbers, later verified in Lean.
- Still unknown: Not stated in the reviewed material
- AI role: An internal version of GPT-5.5 with a custom harness found the proof.
Evidence sources: https://openai.com/index/introducing-gpt-5-5/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 4/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
Building on work on gluons, GPT-5.2 Pro helped derive formulas for nonzero single-minus gravitational amplitudes in a special semi-collinear regime. The authors report analytical verification and checks against known physical limits; this is a theoretical preprint without experimental confirmation.
Technology: GPT-5.2 Pro
Family GPT-5: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The preprint derives explicit formulas for single-minus graviton tree amplitudes in the half-collinear regime and shows they follow from symmetry principles and recursion relations; no experimental test is described.
- Still unknown: The page calls it a small step towards reconciling quantum mechanics with general relativity.
- AI role: Researchers used GPT-5.2 Pro to help find the result; the paper is authored by named physicists on behalf of OpenAI.
Evidence sources: https://openai.com/index/extending-single-minus-amplitudes-to-gravitons/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: press release. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
GPT-5.2 conjectured a formula for gluon scattering amplitudes with a single negative helicity in a special semi-collinear regime. An internal model produced a proof that the authors analytically verified; the announcement describes a preprint, not experimental confirmation.
Technology: GPT-5.2 Pro
Family GPT-5: profile · models page
Publication: Preprint · Test context: retrospective or benchmark. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: retrospective or benchmark
- Tested: The arXiv abstract reports that the gluon formula satisfies several consistency conditions, including Weinberg's soft theorem, and that the formula is restricted to half-collinear configurations; no experimental test is described.
- Still unknown: Not reported (the abstract states no limitations beyond the restricted half-collinear and complexified-momentum setting).
- AI role: GPT-5.2 conjectured the formula; an internal model produced a proof that the authors verified analytically.
Evidence sources: https://arxiv.org/abs/2602.12176
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: press release. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 2/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
A cycle between GPT-5 and a robotic lab explored over 36,000 compositions and reduced protein-production cost by 40% compared with the previous baseline. This is an experimental result in one CFPS setup; it does not establish the same reduction for other proteins, scales, or facilities.
Technology: GPT-5
Family GPT-5: profile · models page
Publication: Announcement only · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Announcement only
- Test type: direct test
- Tested: Over six rounds in a cloud laboratory, the system tested more than 36,000 reaction compositions on 580 plates and reached a 40% lower protein production cost (57% lower reagent cost).
- Still unknown: Not stated in the reviewed material
- AI role: GPT-5 proposed and analyzed experiments in a closed loop with Ginkgo Bioworks automation.
Evidence sources: https://openai.com/index/gpt-5-lowers-protein-synthesis-cost/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: press release. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
GPT-5.2 Pro produced the argument and Harmonic's Aristotle a Lean proof of infinitely many triples with a logarithmic gap in a factorial divisibility condition. The arXiv writeup calls it resolved autonomously, which is the author's claim; no independent review is stated.
Technology: GPT-5.2 Pro and Aristotle (Lean)
Family GPT-5: profile · models page
Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: prospective or independent check
- Tested: The argument produced by GPT-5.2 Pro was formalized as a Lean proof by Harmonic's Aristotle; the proof is machine-checked, and the abstract describes no independent human review.
- Still unknown: The abstract states no limitations and describes only the formal Lean proof as verification.
- AI role: GPT-5.2 Pro produced the argument; Aristotle produced the Lean proof, which the author translated into informal mathematics.
Evidence sources: https://arxiv.org/abs/2601.07421
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 4/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
In a cycle with Red Queen Bio, GPT-5 optimized a cloning protocol, introducing RecA and gp32 as a new mechanism: 2.6-fold improvement with the enzymatic reaction, 36-fold with transformation, and 79-fold when combined. This applies to the model system used, with scientists carrying out the protocols; reported by OpenAI.
Technology: GPT-5
Family GPT-5: profile · models page
Publication: Announcement only · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Announcement only
- Test type: direct test
- Tested: Scientists carried out GPT-5-modified cloning protocols over several rounds; the final protocol recovered 79 times more sequence-verified clones for a fixed amount of input DNA than the baseline.
- Still unknown: The work used a benign experimental system with a limited task scope.
- AI role: GPT-5 reasoned about the protocol and proposed modifications, including a RecA and gp32 mechanism; humans only ran the protocol and uploaded data.
Evidence sources: https://openai.com/index/accelerating-biological-research-in-the-wet-lab/
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
GPT-5.2 Pro solved an open problem in statistical learning theory (learning curves are monotonic in the Gaussian case with known mean and unknown standard deviation), then extended it to higher dimensions. The authors checked the proof, including with outside experts. Reported by OpenAI.
Technology: GPT-5.2 Pro
Family GPT-5: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The authors verified and transcribed the model's proofs of monotonicity of the maximum likelihood estimator's KL divergence for Gaussian and Gamma families, with no outside expert review described.
- Still unknown: The guarantees cover only the listed well-specified parametric settings, and the reverse-KL result relies on a folklore trick; the page shows only the abstract.
- AI role: All results were derived by variants of GPT-5.2 Pro, with humans prompting for further results and verifying the proofs.
Evidence sources: https://arxiv.org/abs/2512.10220
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
Ernest Ryu (UCLA) proved why Nesterov's accelerated gradient method, introduced in 1983, remains stable despite the extra momentum that makes it faster. GPT-5's turning point was a rewrite of the equations: not correct as given, but with a structure Ryu then developed and proved himself, over about twelve hours across three days and after a dozen approaches. OpenAI's account says the model created no new mathematical tools and often produced plausible arguments that failed verification.
Technology: GPT-5
Family GPT-5: profile · models page
Publication: Preprint · Test context: Test context unspecified in annotation. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: not reported
- Tested: Not reported
- Still unknown: OpenAI states GPT-5 often produced plausible but flawed arguments; its restructuring suggestion was not correct as written. The proof was developed and written by Ryu. Whether peer review will confirm it is not reported.
- AI role: Per OpenAI, GPT-5 suggested approaches and restructured equations; Ryu checked each idea and wrote the final proof. About twelve hours over three days and nearly a dozen approaches. GPT-5 is not a co-author.
Evidence sources: https://openai.com/index/gpt-5-mathematical-discovery/
The legacy label “Not reported” does not distinguish information absent from reviewed material from information not assessed. It is not a scientific finding of absence.
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 1/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
A collection of case studies with universities and national labs in mathematics, physics, biology, computer science, astronomy, and materials. Examples: it helped complete a proof of an Erdős problem with Sawhney and Sellke, reconstructed the SL(2,R) symmetry of the Kerr wave equation, and proposed an immunology mechanism later confirmed by Unutmaz's lab. Reported by OpenAI; experts supervised the work.
Technology: GPT-5 and GPT-5 Pro
Family GPT-5: profile · models page
Publication: Publication status unspecified in annotation · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Not reported
- Test type: direct test
- Tested: The OpenAI page lists case studies, for example a mannose rescue experiment in T cells whose results matched GPT-5 predictions, and Erdos Problem 848, where authors turned a GPT-5 density estimate into a full proof.
- Still unknown: OpenAI says the cases are curated illustrations, not a systematic sample. GPT-5 can invent citations, mechanisms or proofs, and expert oversight is essential. One case reproduced an earlier published proof without citing it.
- AI role: GPT-5 suggested ideas, mechanisms, literature links and experiments; scientists set questions, verified results and ran lab work. OpenAI says the model is not autonomous.
Evidence sources: https://openai.com/index/accelerating-science-gpt-5/
The legacy label “Not reported” does not distinguish information absent from reviewed material from information not assessed. It is not a scientific finding of absence.
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.