AI Science Tracker

GPT-6

9 discoveries name this family, 2026

Where GPT-6 appears in the catalog

Why linked?

These associations match family names in discovery titles and technology text. They are not verified model-version assignments or causal attribution. Missing links do not establish absence of use. A record may link to multiple families.

Represented fields

mathematics · 8 linked records
physics · 1 linked records

Test contexts

direct test · 4 linked records
prospective or independent check · 4 linked records
retrospective or benchmark · 1 linked records

Annotation coverage

Evidence annotation present · 9 linked records

Examples

Up to three linked records, newest publication date first, then stable ID. This selection is not a ranking.

Discoveries

GPT-6 Astra constructs mutually orthogonal Latin squares that improve lower bounds at 33 orders

GPT-6 Astra produced explicit mutually orthogonal Latin-square constructions that improve known lower bounds for N(n) at 33 values of n from 22 through 494. The standout construction gives four MOLS of order 22, completing the last open case needed to show N(n)≥4 for every n>10. The same paper reports resulting bounds at other orders and derives a strongly regular graph with parameters (484,126,40,30) from the order-22 construction; these connected consequences are counted once as one paper-level result.

Technology: OpenAI GPT-6 Astra, used through ChatGPT Pro and the OpenAI Codex harness

Family GPT-6: 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: GPT-6 Astra produced explicit mutually orthogonal Latin-square constructions that improve known lower bounds for N(n) at 33 values of n from 22 through 494.
  • Still unknown: This is an arXiv preprint. The constructions are finite combinatorial objects, checked by code written by the author and separately reconstructed/checked by Claude Opus 5.5 as reported in the paper. Counted once despite 33 parameter values and multiple corollaries.
  • AI role: The author states GPT-6 Astra found all listed MOLS constructions and wrote their descriptions/code. The author wrote independent verification code for each construction; the paper also reports an independent Claude Opus 5.5 recreation and verification from the descriptions without the supplied code.

Evidence sources: https://arxiv.org/html/2611.16299

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 2/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.

GPT-6 Astra resolves the spectral isometry conjecture for arbitrary unital C*-algebras

The paper proves that every unital surjective complex-linear spectral isometry between unital C*-algebras is a Jordan isomorphism; without unitality, such a map is a central-unitary multiple of a Jordan isomorphism. The proof establishes that entire one-parameter groups of unital spectral isometries are algebra automorphisms, then reduces the general case to the commutative case. The authors report that the result was formally verified in Lean.

Technology: OpenAI GPT-6 Astra

Family GPT-6: 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 paper proves that every unital surjective complex-linear spectral isometry between unital C*-algebras is a Jordan isomorphism; without unitality, such a map is a central-unitary multiple of a Jordan isomorphism.
  • Still unknown: ArXiv preprint. The authors explicitly describe the article as a human exposition/digestion of an AI-found proof. Their manuscript says formal verification is in Lean; The reported formalization was not independently audited in the source review.
  • AI role: Authors state GPT-6 Astra found the proof after a sequence of simple prompts. They then discussed it with ChatGPT 6 to understand the mechanisms, wrote the paper themselves, and used ChatGPT 6 only for minor language editing; the Lean formalization is evidence for proof checking.

Evidence sources: https://arxiv.org/abs/2610.40470

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 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-6 Pro proves a quadratic-size threshold suffices for random permutations to contain every length-n pattern

The paper proves that a uniformly random permutation of length 32n² contains every permutation of length n as a pattern with probability at least 1−exp(−c n/log n), for an absolute c>0 and sufficiently large n. This removes the prior log-log factor from the sufficient-length bound, resolves Alon’s open 1000n² problem, and establishes the correct Θ(n²) order.

Technology: OpenAI GPT-6 Pro

Family GPT-6: 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 proves that a uniformly random permutation of length 32n² contains every permutation of length n as a pattern with probability at least 1−exp(−c n/log n), for an absolute c>0 and sufficiently large n.
  • Still unknown: ArXiv preprint. Authors report checking and digesting the proof; no separate independent validation is claimed here. The result is an asymptotic sufficient bound with constant 32 (the paper explains the constant can be reduced to any value greater than 1), not a sharp threshold constant.
  • AI role: The authors state that GPT-6 Pro found the proof; they do not claim credit for its proof ideas, and say they verified and digested it and take responsibility for the manuscript.

Evidence sources: https://arxiv.org/abs/2610.13530

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.

GPT-6 Pro proves an optimal anticoncentration bound for polynomial Littlewood–Offord inequalities

The source presents a proof discovered autonomously by GPT-6 Pro establishing an O_d(r^{-1/2}) zero-probability bound for degree-d multilinear polynomials with r disjoint degree-d monomials, improving the prior bound by removing a polylogarithmic factor and resolving the Nguyen–Vu conjecture. The key argument also proves a total-influence estimate for bounded-degree rational functions, resolving a recent conjecture of Kothari, Kovacs-Deak, Wang and Yang; these are one connected paper-level result, not separate entries.

Technology: OpenAI GPT-6 Pro

Family GPT-6: 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 source presents a proof discovered autonomously by GPT-6 Pro establishing an O_d(r^{-1/2}) zero-probability bound for degree-d multilinear polynomials with r disjoint degree-d monomials, improving the prior bound by removing a polylogarithmic factor and resolving the Nguyen–Vu conjecture.
  • Still unknown: This is an arXiv preprint. The author reports personally verifying and rewriting the proof; this review has not independently formalized it. Bound and related rational-function influence result are counted once because the paper derives them as a connected argument.
  • AI role: The author states that GPT-6 Pro autonomously discovered the proof and that the author claims no credit for the proof ideas; the author subsequently verified, digested and rewrote the argument.

Evidence sources: https://arxiv.org/abs/2610.08708

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 4/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.

GPT-6 Astra assists a gauge-invariant lattice chiral-fermion measure construction

Nathaniel Craig proposes a smooth, exponentially local, gauge-invariant fermion measure on admissible four-dimensional lattices, with restrictions covering the Standard Model gauge groups. GPT-6 Astra helped develop the refinement construction and led the detailed proof. The supplementary report states that Lean kernel replay accepted the encoded measure-existence result and supporting inputs under their recorded assumptions. This is a candidate finite-lattice definition; reflection positivity, practical simulation and an interacting continuum theory remain outside the established claim. The October 6, 2026 preprint preceded the November 15 institutional announcement.

Technology: GPT-6 Astra; Lean 4 formalization

Family GPT-6: 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: Source-reported Lean kernel replay checked the concrete companion measure-existence theorem, its analytic/geometric inputs and Standard Model restrictions under encoded definitions and assumptions. Same-study mathematical and two-dimensional computational checks are also reported.
  • Still unknown: Review checked the preprint verification/conclusion sections and formal-verification supplement, not an independently executed Lean build. Formal-to-source correspondence was reviewed by AI agents. A separate frozen-reference comparator failed on generated proof names; the report distinguishes this from successful kernel replay. Kernel correctness is relative to the encoded claim and axioms; it does not establish reflection positivity, a physical continuum limit, independent scientific confirmation or practical usefulness.
  • AI role: Craig supplied the refinement strategy; Astra developed key construction steps, led proof development and carried out proposed verification work.

Evidence sources: https://arxiv.org/html/2610.09093v1 · https://arxiv.org/src/2610.09093v1/anc/lean-verification-report.pdf · https://arxiv.org/src/2610.09093v1/anc/mathematical-companion.pdf · https://openai.com/index/step-toward-defining-the-standard-model/

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 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.

AI-assisted proof establishes a dimension-independent KLS isoperimetric bound

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.

GPT-6 Astra proves a linear coloring bound for graphs excluding clique minors

The authors present a proof of the Linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is colorable with at most Ct colors. GPT-6 Astra developed the proof after the authors directed it to the dense case and then asked it to bridge existing bounds; the resulting proof combines several known frameworks with a new bootstrap argument. The result is an asymptotic linear bound, not the stronger Hadwiger conjecture χ(G)≤h(G).

Technology: OpenAI GPT-6 Astra (described in the paper as ChatGPT model Astra 6)

Family GPT-6: 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 present a proof of the Linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is colorable with at most Ct colors.
  • Still unknown: The result is an arXiv preprint and is not the full Hadwiger conjecture. It proves existence of an absolute linear-coloring constant for K_t-minor-free graphs. The authors take responsibility for the proof; Independent formal verification was not assessed in the source review.
  • AI role: Authors disclose that the proof was developed by the model following their research directions and feedback; the model supplied a new bootstrap argument after being prompted first on a dense case and then to bridge existing bounds. Authors independently wrote the exposition, reviewed the result and take responsibility for correctness.

Evidence sources: https://arxiv.org/abs/2610.05291

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 4/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.

GPT-assisted proof reduces Zieve’s Hurwitz realizability conjecture to the three-branch-point case

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.

GPT-6 Astra finds a counting proof of the Erdős–Sós tree-embedding conjecture

A counting argument proves that every finite graph with average degree greater than t−2 contains every tree on t vertices, resolving the Erdős–Sós conjecture. The proof counts adjacency-marked vertex orderings and uses an induction on the tree to bound those not supporting a rooted copy. The exposition states the sharp classical theorem and records its proof was discovered by GPT-6 Astra; a Lean repository checks the benchmark formalization of the result. Related expository papers of the same proof are aliases, not separate discoveries.

Technology: Pre-release OpenAI GPT-6 Astra in the FrontierMath Erdős benchmark

Family GPT-6: 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: A counting argument proves that every finite graph with average degree greater than t−2 contains every tree on t vertices, resolving the Erdős–Sós conjecture.
  • Still unknown: The arXiv paper is an exposition of the proof, not the original benchmark output. The linked Lean proof is machine-checked against the benchmark formalization; the registry notes a minor parity-case difference in that compared statement, while the paper’s counting lemma derives the sharp classical average-degree threshold. This remains a preprint and the formalization is not independently audited here.
  • AI role: GPT-6 Astra autonomously found the counting proof while solving Erdős problem 548 in the FrontierMath Erdős benchmark; the exposition author reports the discovery and lays out the proof. A Lean 4 repository states the proof was machine-checked by a Comparator against the benchmark’s formal statement.

Evidence sources: https://arxiv.org/abs/2609.17877

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 4/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.

Open the interactive profile for the timeline, or browse all organizations and model families.

5 model releases

Epoch AI data (CC BY 4.0), newest first. A discovery is attributed to a model family, not to a specific release.

DateModelAccess
GPT-6.1 Sol API access
GPT-6 Sol API access
GPT-6 Luna Decisions API access
GPT-6 Luna API access
GPT-6 Astra API access