Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (376 pages, 2766 entries) |
Automatic refresh from the published result pages (376 pages, 2782 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 376 result pages; 376 of them list at least one public follow-up. | * 376 result pages; 376 of them list at least one public follow-up. | ||
* | * 2782 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 625 | ||
** Formalizations: 33 | ** Formalizations: 33 | ||
** Reviews and verifications: 919 | ** Reviews and verifications: 919 | ||
** Critiques and corrections: 21 | ** Critiques and corrections: 21 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 1184 | ||
== Results == | == Results == | ||
| Line 16: | Line 16: | ||
| [[The quasi-Riemann hypothesis]] || Number theory || 72 || 49 || 4 || 9 || 0 || 10 || 2026-10-31 | | [[The quasi-Riemann hypothesis]] || Number theory || 72 || 49 || 4 || 9 || 0 || 10 || 2026-10-31 | ||
|- | |- | ||
| [[The Exponential Time Hypothesis]] || Computational complexity || | | [[The Exponential Time Hypothesis]] || Computational complexity || 37 || 11 || 0 || 14 || 0 || 12 || 2026-10-31 | ||
|- | |- | ||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 30 || 16 || 0 || 7 || 0 || 7 || 2026-10-26 | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 30 || 16 || 0 || 7 || 0 || 7 || 2026-10-26 | ||
| Line 29: | Line 29: | ||
|- | |- | ||
| [[The irrationality exponent of π is 2]] || Number theory || 19 || 12 || 0 || 2 || 0 || 5 || 2026-10-23 | | [[The irrationality exponent of π is 2]] || Number theory || 19 || 12 || 0 || 2 || 0 || 5 || 2026-10-23 | ||
|- | |||
| [[Primitive roots for every admissible integer base]] || Number theory || 18 || 10 || 1 || 2 || 0 || 5 || 2026-10-31 | |||
|- | |- | ||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 17 || 6 || 0 || 3 || 5 || 3 || 2026-11-01 | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 17 || 6 || 0 || 3 || 5 || 3 || 2026-11-01 | ||
|- | |- | ||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 17 || 8 || 0 || 3 || 0 || 6 || 2026-10-29 | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 17 || 8 || 0 || 3 || 0 || 6 || 2026-10-29 | ||
| Line 133: | Line 133: | ||
|- | |- | ||
| [[The strong isotropic constant conjecture]] || Convex geometry || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-30 | | [[The strong isotropic constant conjecture]] || Convex geometry || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-30 | ||
|- | |||
| [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 10 || 3 || 0 || 4 || 0 || 3 || 2026-10-29 | |||
|- | |- | ||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-29 | | [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-29 | ||
| Line 163: | Line 165: | ||
|- | |- | ||
| [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-19 | | [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-19 | ||
|- | |||
| [[Approximate counting of common bases of two matroids]] || Algorithms || 10 || 1 || 0 || 6 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[Hardness of coloring three-colorable graphs]] || Computational complexity || 10 || 2 || 0 || 3 || 0 || 5 || 2026-10-18 | | [[Hardness of coloring three-colorable graphs]] || Computational complexity || 10 || 2 || 0 || 3 || 0 || 5 || 2026-10-18 | ||
|- | |||
| [[Sampling and counting contingency tables]] || Algorithms || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 10 || 1 || 0 || 3 || 0 || 6 || 2026-10-18 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 10 || 1 || 0 || 3 || 0 || 6 || 2026-10-18 | ||
| Line 175: | Line 181: | ||
|- | |- | ||
| [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 9 || 3 || 0 || 3 || 0 || 3 || 2026-10-29 | | [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 9 || 3 || 0 || 3 || 0 || 3 || 2026-10-29 | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-28 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-28 | ||
| Line 213: | Line 217: | ||
|- | |- | ||
| [[The finitely presented Burnside problem]] || Group theory || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-17 | | [[The finitely presented Burnside problem]] || Group theory || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-17 | ||
|- | |- | ||
| [[The Gopalan–Servedio square-root degree conjecture]] || Computational complexity || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-16 | | [[The Gopalan–Servedio square-root degree conjecture]] || Computational complexity || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-16 | ||
| Line 223: | Line 223: | ||
|- | |- | ||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 8 || 0 || 1 || 3 || 0 || 4 || 2026-10-30 | | [[The hypercube Ramsey number has linear order]] || Combinatorics || 8 || 0 || 1 || 3 || 0 || 4 || 2026-10-30 | ||
|- | |||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 8 || 3 || 0 || 1 || 0 || 4 || 2026-10-29 | |||
|- | |||
| [[The Mézard–Parisi formula for diluted spin glasses]] || Probability || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-29 | |||
|- | |- | ||
| [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-29 | | [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-29 | ||
| Line 229: | Line 233: | ||
|- | |- | ||
| [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-27 | | [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 8 || 0 || 0 || 4 || 1 || 3 || 2026-10-27 | ||
|- | |||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-27 | |||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-26 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-26 | ||
| Line 277: | Line 283: | ||
|- | |- | ||
| [[The Friedgut–Kalai sharp-threshold conjecture]] || Probability || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-16 | | [[The Friedgut–Kalai sharp-threshold conjecture]] || Probability || 8 || 0 || 0 || 4 || 0 || 4 || 2026-10-16 | ||
|- | |||
| [[The modified integer round-up conjecture for bin packing]] || Algorithms || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-16 | |||
|- | |- | ||
| [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 8 || 2 || 0 || 0 || 0 || 6 || 2026-10-16 | | [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 8 || 2 || 0 || 0 || 0 || 6 || 2026-10-16 | ||
| Line 327: | Line 335: | ||
|- | |- | ||
| [[Strong forms of the Arnold conjecture]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[Strong forms of the Arnold conjecture]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[The Monge ansatz for the three-marginal Coulomb cost]] || Mathematical physics || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-19 | | [[The Monge ansatz for the three-marginal Coulomb cost]] || Mathematical physics || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-19 | ||
| Line 336: | Line 342: | ||
| [[Yau's harmonic dimension comparison problem]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[Yau's harmonic dimension comparison problem]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[ | | [[Approximability of uniform sparsest cut]] || Computational complexity || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[Black-box identity testing for noncommutative formulas]] || Algebraic complexity || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-18 | |||
|- | |- | ||
| [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-18 | | [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-18 | ||
| Line 383: | Line 391: | ||
|- | |- | ||
| [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | | [[The infinite matroid intersection and packing/covering conjectures]] || Combinatorics || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The second Kahn–Kalai conjecture]] || Probability || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-16 | | [[The second Kahn–Kalai conjecture]] || Probability || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-16 | ||
| Line 391: | Line 397: | ||
|- | |- | ||
| [[Randomized versus quantum query complexity]] || Computational complexity || 6 || 0 || 0 || 2 || 0 || 4 || 2026-10-30 | | [[Randomized versus quantum query complexity]] || Computational complexity || 6 || 0 || 0 || 2 || 0 || 4 || 2026-10-30 | ||
|- | |||
| [[Directional zero–one laws and ballisticity for random walks in random environment]] || Probability || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | |||
|- | |- | ||
| [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 6 || 2 || 0 || 2 || 0 || 2 || 2026-10-29 | | [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 6 || 2 || 0 || 2 || 0 || 2 || 2026-10-29 | ||
| Line 421: | Line 429: | ||
|- | |- | ||
| [[The Wu–Yau bounded-domain conjecture]] || Differential geometry || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[The Wu–Yau bounded-domain conjecture]] || Differential geometry || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-18 | | [[Gepner and large-volume stability conditions on threefolds]] || Algebraic geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-18 | ||
| Line 449: | Line 455: | ||
|- | |- | ||
| [[Spacetime Penrose inequalities]] || Differential geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-17 | | [[Spacetime Penrose inequalities]] || Differential geometry || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-17 | ||
|- | |- | ||
| [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 6 || 1 || 0 || 3 || 1 || 1 || 2026-10-17 | | [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 6 || 1 || 0 || 3 || 1 || 1 || 2026-10-17 | ||
| Line 457: | Line 461: | ||
|- | |- | ||
| [[Banach's simple Lebesgue-spectrum problem]] || Dynamical systems || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[Banach's simple Lebesgue-spectrum problem]] || Dynamical systems || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Ergodicity and weak mixing of irrational triangular billiards]] || Dynamical systems || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[Ergodicity and weak mixing of irrational triangular billiards]] || Dynamical systems || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
| Line 473: | Line 475: | ||
|- | |- | ||
| [[The duality conjecture for metric entropy]] || Convex geometry || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-29 | | [[The duality conjecture for metric entropy]] || Convex geometry || 5 || 0 || 0 || 1 || 0 || 4 || 2026-10-29 | ||
|- | |||
| [[The LeBrun–Salamon conjecture]] || Differential geometry || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-28 | |||
|- | |- | ||
| [[The log abundance conjecture in characteristic zero]] || Algebraic geometry || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-28 | | [[The log abundance conjecture in characteristic zero]] || Algebraic geometry || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-28 | ||
|- | |||
| [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-27 | |||
|- | |- | ||
| [[The critical dimension for one-phase Bernoulli minimizers]] || Partial differential equations || 5 || 1 || 1 || 1 || 0 || 2 || 2026-10-26 | | [[The critical dimension for one-phase Bernoulli minimizers]] || Partial differential equations || 5 || 1 || 1 || 1 || 0 || 2 || 2026-10-26 | ||
| Line 557: | Line 563: | ||
|- | |- | ||
| [[Conformal universality of weakly interacting and random-bond Ising models]] || Probability || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-17 | | [[Conformal universality of weakly interacting and random-bond Ising models]] || Probability || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[Factor-of-IID threshold for the free Ising model on regular trees]] || Probability || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-17 | | [[Factor-of-IID threshold for the free Ising model on regular trees]] || Probability || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-17 | ||
| Line 591: | Line 595: | ||
|- | |- | ||
| [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | | [[The Lipschitz isomorphism problem for separable Banach spaces]] || Functional analysis || 4 || 1 || 0 || 0 || 0 || 3 || 2026-10-28 | ||
|- | |||
| [[Campana's abelianity conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-27 | |||
|- | |- | ||
| [[The Campana–Peternell conjecture]] || Algebraic geometry || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-23 | | [[The Campana–Peternell conjecture]] || Algebraic geometry || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-23 | ||
| Line 611: | Line 617: | ||
|- | |- | ||
| [[Integral counterexamples to Gersten's conjecture]] || Algebra || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Integral counterexamples to Gersten's conjecture]] || Algebra || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Kuznetsov's rationality conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[Kuznetsov's rationality conjecture]] || Algebraic geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 625: | Line 629: | ||
|- | |- | ||
| [[The Hovey–Strickland conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The Hovey–Strickland conjecture]] || Homotopy theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[The Phillips–Toms conjecture]] || Operator algebras || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | | [[The Phillips–Toms conjecture]] || Operator algebras || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-18 | ||
| Line 653: | Line 655: | ||
|- | |- | ||
| [[Kurosh's problem for division rings]] || Algebra || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-30 | | [[Kurosh's problem for division rings]] || Algebra || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-30 | ||
|- | |- | ||
| [[Termination of flips for fourfolds]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-26 | | [[Termination of flips for fourfolds]] || Algebraic geometry || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-26 | ||
Revision as of 16:32, 1 November 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 2 November 2026. The table can be re-sorted by any column.
Summary
- 376 result pages; 376 of them list at least one public follow-up.
- 2782 follow-up entries in total:
- Research follow-ups: 625
- Formalizations: 33
- Reviews and verifications: 919
- Critiques and corrections: 21
- Catalogue entries, citations and exposition: 1184
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 (24 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.
