Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (226 pages, 985 entries) |
Automatic refresh from the published result pages (226 pages, 1005 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 226 result pages; 224 of them list at least one public follow-up. | * 226 result pages; 224 of them list at least one public follow-up. | ||
* | * 1005 follow-up entries in total: | ||
** Research follow-ups: 342 | ** Research follow-ups: 342 | ||
** Formalizations: 29 | ** Formalizations: 29 | ||
** Reviews and verifications: 495 | ** Reviews and verifications: 495 | ||
** Critiques and corrections: 14 | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 125 | ||
== Results == | == Results == | ||
| Line 18: | Line 18: | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 12 || 7 || 0 || 0 || 1 || 4 || 2026-10-16 | ||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | | [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | ||
| Line 31: | Line 31: | ||
|- | |- | ||
| [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 9 || 6 || 0 || 1 || 0 || 2 || 2026-10-17 | |||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | |||
|- | |- | ||
| [[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 | ||
| Line 40: | Line 44: | ||
| [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | | [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[The Erdős unit distance and pinned distance problems]] || Discrete geometry || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |- | ||
| [[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 49: | Line 51: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Largest prime factors of consecutive integers]] || Number theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-16 | |||
|- | |- | ||
| [[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 | |||
|- | |- | ||
| [[Hadwiger's conjecture]] || Combinatorics || 8 || 5 || 1 || 1 || 0 || 1 || 2026-10-12 | | [[Hadwiger's conjecture]] || Combinatorics || 8 || 5 || 1 || 1 || 0 || 1 || 2026-10-12 | ||
| Line 63: | Line 71: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[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 | ||
| Line 72: | Line 78: | ||
| [[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 | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[The Hilbert–Smith conjecture]] || Geometric topology || 7 || 2 || 2 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The | | [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[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 Falconer distance conjecture]] || Harmonic analysis || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-15 | | [[The Falconer distance conjecture]] || Harmonic analysis || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | | [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
| Line 91: | Line 95: | ||
|- | |- | ||
| [[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 | ||
| Line 116: | Line 118: | ||
| [[The affine Bernstein problem]] || Differential geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The affine Bernstein problem]] || Differential geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The | | [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 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 | | [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-11 | | [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-11 | ||
|- | |||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-11 | |||
|- | |- | ||
| [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | | [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | ||
| Line 191: | Line 195: | ||
|- | |- | ||
| [[Thomason model structures on strict higher categories]] || Homotopy theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Thomason model structures on strict higher categories]] || Homotopy theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 5 || 4 || 0 || 0 || 0 || 1 || 2026-10-15 | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 5 || 4 || 0 || 0 || 0 || 1 || 2026-10-15 | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The Gaussian moat problem]] || Number theory || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-12 | |||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Positive lower density of large prime gaps]] || Number theory || 5 || 1 || 0 || 2 || 0 || 2 || 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 247: | Line 251: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 4 || 0 || 2 || 0 || 0 || 2 || 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 253: | Line 259: | ||
|- | |- | ||
| [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[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 | ||
| Line 267: | Line 269: | ||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |||
| [[The Erdős similarity conjecture]] || Real analysis || 4 || 3 || 0 || 0 || 0 || 1 || 2026-10-10 | |||
|- | |- | ||
| [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 323: | Line 327: | ||
|- | |- | ||
| [[The spin-one Haldane gap]] || Mathematical physics || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The spin-one Haldane gap]] || Mathematical physics || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-14 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-14 | ||
| Line 335: | Line 337: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 3 || 0 || 1 || 0 || 0 || 2 || 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 | ||
|- | |- | ||
| [[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 345: | Line 347: | ||
|- | |- | ||
| [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[The Erdős–Gallai cycle-decomposition conjecture]] || Combinatorics || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-08 | |||
|- | |- | ||
| [[Urysohn width and macroscopic dimension under positive scalar curvature]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-21 | | [[Urysohn width and macroscopic dimension under positive scalar curvature]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-21 | ||
| Line 420: | Line 424: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Ostmann's inverse Goldbach conjecture]] || Number theory || 2 || 0 || 0 || 0 || 0 || 2 || 2026-10-11 | ||
|- | |- | ||
| [[An exact Hausdorff gauge for SLE]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | | [[An exact Hausdorff gauge for SLE]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[Free energies of random perceptrons]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | | [[Free energies of random perceptrons]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 2 || 0 || 1 || 0 || 0 || 1 || 2026-10-10 | |||
|- | |- | ||
| [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | | [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | ||
|- | |- | ||
| [[The | | [[The cycle–clique Ramsey conjecture]] || Combinatorics || 2 || 0 || 0 || 0 || 0 || 2 || 2026-10-08 | ||
|- | |- | ||
| [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 451: | Line 457: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Classifying spaces and geometric obstructions for Artin groups]] || Group theory || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-09 | | [[Classifying spaces and geometric obstructions for Artin groups]] || Group theory || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-09 | ||
|- | |- | ||
| [[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 01:34, 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
- 226 result pages; 224 of them list at least one public follow-up.
- 1005 follow-up entries in total:
- Research follow-ups: 342
- Formalizations: 29
- Reviews and verifications: 495
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 125
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.
