Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (239 pages, 1140 entries) |
Automatic refresh from the published result pages (239 pages, 1155 entries) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 239 result pages; 238 of them list at least one public follow-up. | * 239 result pages; 238 of them list at least one public follow-up. | ||
* | * 1155 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 409 | ||
** Formalizations: 30 | ** Formalizations: 30 | ||
** Reviews and verifications: 552 | ** Reviews and verifications: 552 | ||
** Critiques and corrections: | ** Critiques and corrections: 16 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 148 | ||
== Results == | == Results == | ||
| Line 17: | Line 17: | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 17 || 11 || 0 || 2 || 0 || 4 || 2026-10-21 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 17 || 11 || 0 || 2 || 0 || 4 || 2026-10-21 | ||
|- | |||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 16 || 9 || 0 || 5 || 0 || 2 || 2026-10-22 | |||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 10 || 5 || 0 || 1 || 4 || 0 || 2026-10-22 | ||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-21 | | [[The Unique Games Conjecture]] || Computational complexity || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-21 | ||
| Line 35: | Line 37: | ||
|- | |- | ||
| [[Exact Fourier transforms below n log n]] || Algorithms || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-17 | | [[Exact Fourier transforms below n log n]] || Algorithms || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 9 || 6 || 0 || 3 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | | [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | ||
| Line 55: | Line 59: | ||
|- | |- | ||
| [[Irrationality of Catalan's constant]] || Number theory || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-21 | | [[Irrationality of Catalan's constant]] || Number theory || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-21 | ||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | | [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | ||
| Line 69: | Line 71: | ||
|- | |- | ||
| [[The finitely presented Burnside problem]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[The finitely presented Burnside problem]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | | [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | ||
| Line 111: | Line 111: | ||
|- | |- | ||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-22 | | [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-22 | ||
|- | |||
| [[The Birch and Swinnerton-Dyer formula in low Selmer corank]] || Number theory || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[The circulant Hadamard conjecture]] || Combinatorics || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-21 | | [[The circulant Hadamard conjecture]] || Combinatorics || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-21 | ||
| Line 151: | Line 153: | ||
|- | |- | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Gaussian moat problem]] || Number theory || 6 || 3 || 0 || 1 || 0 || 2 || 2026-10-12 | |||
|- | |||
| [[Petty's projection-volume conjecture]] || Convex geometry || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-10 | |||
|- | |||
| [[Barnette's conjecture]] || Combinatorics || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-21 | |||
|- | |- | ||
| [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | | [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | ||
| Line 199: | Line 207: | ||
|- | |- | ||
| [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Boone–Higman conjecture]] || Group theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Boone–Higman conjecture]] || Group theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 227: | Line 233: | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | ||
|- | |- | ||
| [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 247: | Line 249: | ||
|- | |- | ||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | | [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 317: | Line 317: | ||
|- | |- | ||
| [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | | [[Rigidity of the Turing degrees]] || Mathematical logic || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | ||
|- | |- | ||
| [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-22 | | [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-22 | ||
|- | |||
| [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |||
| [[The unitary synthesis problem]] || Quantum information || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | |||
|- | |- | ||
| [[The generalized Mukai conjecture]] || Algebraic geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-21 | | [[The generalized Mukai conjecture]] || Algebraic geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-21 | ||
| Line 409: | Line 415: | ||
|- | |- | ||
| [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 449: | Line 453: | ||
|- | |- | ||
| [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The ionization and generalized ionization conjectures]] || Mathematical physics || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[The ionization and generalized ionization conjectures]] || Mathematical physics || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 457: | Line 459: | ||
|- | |- | ||
| [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Zariski's multiplicity conjecture]] || Algebraic geometry || 2 || 0 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[Zariski's multiplicity conjecture]] || Algebraic geometry || 2 || 0 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
| Line 496: | Line 496: | ||
* Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each. | * Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each. | ||
* Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two. | * Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two. | ||
* Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted ( | * Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted (16 rows at present). | ||
* Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition. | * Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition. | ||
* The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet. | * The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet. | ||
Latest revision as of 19:40, 22 October 2026
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 23 October 2026. The table can be re-sorted by any column.
Summary
- 239 result pages; 238 of them list at least one public follow-up.
- 1155 follow-up entries in total:
- Research follow-ups: 409
- Formalizations: 30
- Reviews and verifications: 552
- Critiques and corrections: 16
- Catalogue entries, citations and exposition: 148
Results
How the counts are made
- Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each.
- Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two.
- Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted (16 rows at present).
- Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition.
- The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet.
