Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (227 pages, 1014 entries) |
Automatic refresh from the published result pages (227 pages, 1026 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 227 result pages; 225 of them list at least one public follow-up. | * 227 result pages; 225 of them list at least one public follow-up. | ||
* | * 1026 follow-up entries in total: | ||
** Research follow-ups: 344 | ** Research follow-ups: 344 | ||
** Formalizations: 29 | ** Formalizations: 29 | ||
** Reviews and verifications: | ** Reviews and verifications: 510 | ||
** Critiques and corrections: 14 | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: 129 | ** Catalogue entries, citations and exposition: 129 | ||
| Line 37: | Line 37: | ||
|- | |- | ||
| [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | | [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | ||
|- | |||
| [[Hadwiger's conjecture]] || Combinatorics || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 8 || 1 || 0 || 3 || 1 || 3 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 8 || 1 || 0 || 3 || 1 || 3 || 2026-10-20 | ||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | |||
|- | |- | ||
| [[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 63: | Line 67: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | | [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | ||
| Line 75: | Line 75: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 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 | ||
|- | |- | ||
| [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 7 || 2 || 0 || 5 || 0 || 0 || 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 95: | Line 99: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[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 105: | Line 107: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Positive lower density of large prime gaps]] || Number theory || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
| Line 125: | Line 129: | ||
|- | |- | ||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-11 | | [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-11 | ||
| Line 159: | Line 161: | ||
|- | |- | ||
| [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 5 || 0 || 2 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
| Line 205: | Line 209: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The circulant Hadamard conjecture]] || Combinatorics || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-11 | | [[The circulant Hadamard conjecture]] || Combinatorics || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-11 | ||
| Line 235: | Line 237: | ||
|- | |- | ||
| [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 253: | Line 257: | ||
|- | |- | ||
| [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
| Line 287: | Line 289: | ||
|- | |- | ||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[An exact Hausdorff gauge for SLE]] || Probability || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
| Line 293: | Line 297: | ||
|- | |- | ||
| [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Free energies of random perceptrons]] || Probability || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[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 | ||
| Line 299: | Line 305: | ||
|- | |- | ||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Isomorphism of the free group factors]] || Operator algebras || 3 || 1 || 0 || 2 || 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 305: | Line 313: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Ostmann's inverse Goldbach conjecture]] || Number theory || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 341: | Line 351: | ||
|- | |- | ||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 3 || 0 || 1 || 0 || 0 || 2 || 2026-10-11 | | [[The hypercube Ramsey number has linear order]] || Combinatorics || 3 || 0 || 1 || 0 || 0 || 2 || 2026-10-11 | ||
|- | |- | ||
| [[The Kervaire conjecture]] || Group theory || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Kervaire conjecture]] || Group theory || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 361: | Line 369: | ||
|- | |- | ||
| [[Alperin's weight conjecture]] || Representation theory of algebras || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Alperin's weight conjecture]] || Representation theory of algebras || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Classifying spaces and geometric obstructions for Artin groups]] || Group theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Donovan's conjecture]] || Representation theory of algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Donovan's conjecture]] || Representation theory of algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 419: | Line 429: | ||
|- | |- | ||
| [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | | [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[The Courtade–Kumar conjecture]] || Information theory || 2 || 1 || 0 || 0 || 0 || 1 || 2026-10-15 | | [[The Courtade–Kumar conjecture]] || Information theory || 2 || 1 || 0 || 0 || 0 || 1 || 2026-10-15 | ||
|- | |- | ||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-12 | | [[Rigidity of the Turing degrees]] || Mathematical logic || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-12 | ||
|- | |- | ||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 2 || 0 || 1 || 0 || 0 || 1 || 2026-10-10 | | [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 2 || 0 || 1 || 0 || 0 || 1 || 2026-10-10 | ||
| Line 459: | Line 461: | ||
|- | |- | ||
| [[The Solomon–Yau least-volume conjecture]] || Differential geometry || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-15 | | [[The Solomon–Yau least-volume conjecture]] || Differential geometry || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-07 | | [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-07 | ||
Revision as of 04:15, 21 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 21 October 2026. The table can be re-sorted by any column.
Summary
- 227 result pages; 225 of them list at least one public follow-up.
- 1026 follow-up entries in total:
- Research follow-ups: 344
- Formalizations: 29
- Reviews and verifications: 510
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 129
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 (9 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.
