Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (201 pages, 814 entries) |
Automatic refresh from the published result pages (201 pages, 829 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 201 result pages; 199 of them list at least one public follow-up. | * 201 result pages; 199 of them list at least one public follow-up. | ||
* | * 829 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 287 | ||
** Formalizations: | ** Formalizations: 27 | ||
** Reviews and verifications: | ** Reviews and verifications: 416 | ||
** Critiques and corrections: 13 | ** Critiques and corrections: 13 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 86 | ||
== Results == | == Results == | ||
| Line 14: | Line 14: | ||
! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ||
|- | |- | ||
| [[The quasi-Riemann hypothesis]] || Number theory || | | [[The quasi-Riemann hypothesis]] || Number theory || 35 || 26 || 1 || 7 || 0 || 1 || 2026-10-19 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 10 || 7 || 0 || 2 || 0 || 1 || 2026-10-15 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 10 || 7 || 0 || 2 || 0 || 1 || 2026-10-15 | ||
| Line 21: | Line 21: | ||
|- | |- | ||
| [[Exact Fourier transforms below n log n]] || Algorithms || 9 || 8 || 0 || 1 || 0 || 0 || 2026-10-17 | | [[Exact Fourier transforms below n log n]] || Algorithms || 9 || 8 || 0 || 1 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 9 || 6 || 0 || 0 || 1 || 2 || 2026-10-15 | |||
|- | |- | ||
| [[Primitive roots for every admissible integer base]] || Number theory || 8 || 6 || 1 || 1 || 0 || 0 || 2026-10-19 | | [[Primitive roots for every admissible integer base]] || Number theory || 8 || 6 || 1 || 1 || 0 || 0 || 2026-10-19 | ||
|- | |||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-17 | |||
|- | |||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | |||
|- | |- | ||
| [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 29: | Line 35: | ||
|- | |- | ||
| [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 8 || 3 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 8 || 3 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 7 || 1 || 0 || 3 || 1 || 2 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 7 || 1 || 0 || 3 || 1 || 2 || 2026-10-20 | ||
| Line 41: | Line 45: | ||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Prime-factor statistics of p − 1]] || Number theory || 7 || 4 || 2 || 1 || 0 || 0 || 2026-10-17 | | [[Prime-factor statistics of p − 1]] || Number theory || 7 || 4 || 2 || 1 || 0 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-17 | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-17 | ||
| Line 63: | Line 63: | ||
|- | |- | ||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 7 || 4 || 0 || 1 || 2 || 0 || 2026-10-16 | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 7 || 4 || 0 || 1 || 2 || 0 || 2026-10-16 | ||
|- | |||
| [[The Unique Games Conjecture]] || Computational complexity || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-18 | |||
|- | |- | ||
| [[The irrationality exponent of π is 2]] || Number theory || 6 || 6 || 0 || 0 || 0 || 0 || 2026-10-18 | | [[The irrationality exponent of π is 2]] || Number theory || 6 || 6 || 0 || 0 || 0 || 0 || 2026-10-18 | ||
|- | |||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-17 | |||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
| Line 102: | Line 106: | ||
| [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 5 || 3 || 0 || 2 || 0 || 0 || 2026-10-19 | | [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 5 || 3 || 0 || 2 || 0 || 0 || 2026-10-19 | ||
|- | |- | ||
| [[ | | [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Bigeodesics in planar first-passage percolation]] || Probability || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Bigeodesics in planar first-passage percolation]] || Probability || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
| Line 163: | Line 165: | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | ||
|- | |||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | |||
|- | |- | ||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-11 | | [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-11 | ||
| Line 168: | Line 172: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Petty's projection-volume conjecture]] || Convex geometry || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[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 | ||
| Line 217: | Line 223: | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | | [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 231: | Line 233: | ||
|- | |- | ||
| [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |- | ||
| [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
| Line 245: | Line 245: | ||
|- | |- | ||
| [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 251: | Line 253: | ||
|- | |- | ||
| [[Optimal mixing of the Thorp shuffle]] || Probability || 3 || 1 || 0 || 1 || 1 || 0 || 2026-10-16 | | [[Optimal mixing of the Thorp shuffle]] || Probability || 3 || 1 || 0 || 1 || 1 || 0 || 2026-10-16 | ||
|- | |||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Singular Bernoulli convolutions]] || Real analysis || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Singular Bernoulli convolutions]] || Real analysis || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 311: | Line 315: | ||
|- | |- | ||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Goldfeld's conjecture for quadratic twists]] || Number theory || 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 | | [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 321: | Line 323: | ||
|- | |- | ||
| [[Milne's rationality conjecture]] || Number theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Milne's rationality conjecture]] || Number theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Smith–Toda complexes at every height]] || Homotopy theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Smith–Toda complexes at every height]] || Homotopy theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
Revision as of 05:55, 20 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 20 October 2026. The table can be re-sorted by any column.
Summary
- 201 result pages; 199 of them list at least one public follow-up.
- 829 follow-up entries in total:
- Research follow-ups: 287
- Formalizations: 27
- Reviews and verifications: 416
- Critiques and corrections: 13
- Catalogue entries, citations and exposition: 86
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 (8 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.
