Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (202 pages, 838 entries) |
Automatic refresh from the published result pages (203 pages, 850 entries) |
||
| Line 2: | Line 2: | ||
== Summary == | == Summary == | ||
* | * 203 result pages; 201 of them list at least one public follow-up. | ||
* | * 850 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 301 | ||
** Formalizations: 27 | ** Formalizations: 27 | ||
** Reviews and verifications: | ** Reviews and verifications: 423 | ||
** Critiques and corrections: 13 | ** Critiques and corrections: 13 | ||
** Catalogue entries, citations and exposition: 86 | ** Catalogue entries, citations and exposition: 86 | ||
| 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 || 36 || 27 || 1 || 7 || 0 || 1 || 2026-10-19 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 11 || 8 || 0 || 2 || 0 || 1 || 2026-10-15 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 11 || 8 || 0 || 2 || 0 || 1 || 2026-10-15 | ||
| Line 27: | Line 27: | ||
|- | |- | ||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-17 | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-17 | ||
|- | |||
| [[Prime-factor statistics of p − 1]] || Number theory || 8 || 5 || 2 || 1 || 0 || 0 || 2026-10-17 | |||
|- | |- | ||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | | [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | ||
| Line 43: | Line 45: | ||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | ||
|- | |||
| [[The irrationality exponent of π is 2]] || Number theory || 7 || 7 || 0 || 0 || 0 || 0 || 2026-10-18 | |||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Largest prime factors of consecutive integers]] || Number theory || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
| Line 63: | Line 67: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 7 || 3 || 0 || 2 || 0 || 2 || 2026-10-14 | |||
|- | |||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | |||
|- | |- | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-18 | | [[The Unique Games Conjecture]] || Computational complexity || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-18 | ||
|- | |- | ||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-17 | | [[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 | ||
|- | |- | ||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 97: | Line 101: | ||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | ||
|- | |- | ||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-11 | | [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 6 || 4 || 0 || 2 || 0 || 0 || 2026-10-11 | ||
| Line 225: | Line 227: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Positive lower density of large prime gaps]] || Number theory || 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 | ||
| Line 289: | Line 293: | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
Revision as of 07:44, 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
- 203 result pages; 201 of them list at least one public follow-up.
- 850 follow-up entries in total:
- Research follow-ups: 301
- Formalizations: 27
- Reviews and verifications: 423
- 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.
