Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (376 pages, 2782 entries) |
Automatic refresh from the published result pages (376 pages, 2797 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. | ||
* | * 2797 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 627 | ||
** 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: 1197 | ||
== 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 || 73 || 50 || 4 || 9 || 0 || 10 || 2026-10-31 | ||
|- | |- | ||
| [[The Exponential Time Hypothesis]] || Computational complexity || 37 || 11 || 0 || 14 || 0 || 12 || 2026-10-31 | | [[The Exponential Time Hypothesis]] || Computational complexity || 37 || 11 || 0 || 14 || 0 || 12 || 2026-10-31 | ||
| Line 33: | Line 33: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Prime-factor statistics of p − 1]] || Number theory || 17 || 7 || 2 || 3 || 0 || 5 || 2026-10-30 | |||
|- | |- | ||
| [[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 38: | Line 40: | ||
| [[The Mahler conjectures]] || Convex geometry || 17 || 4 || 0 || 4 || 0 || 9 || 2026-10-28 | | [[The Mahler conjectures]] || Convex geometry || 17 || 4 || 0 || 4 || 0 || 9 || 2026-10-28 | ||
|- | |- | ||
| [[ | | [[Exact Fourier transforms below n log n]] || Algorithms || 16 || 9 || 0 || 3 || 0 || 4 || 2026-10-28 | ||
|- | |- | ||
| [[The Snaky achievement game]] || Combinatorics || 15 || 6 || 0 || 6 || 0 || 3 || 2026-10-30 | | [[The Snaky achievement game]] || Combinatorics || 15 || 6 || 0 || 6 || 0 || 3 || 2026-10-30 | ||
|- | |- | ||
| [[Irrationality of Catalan's constant]] || Number theory || 15 || 7 || 0 || 3 || 0 || 5 || 2026-10-29 | | [[Irrationality of Catalan's constant]] || Number theory || 15 || 7 || 0 || 3 || 0 || 5 || 2026-10-29 | ||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 15 || 1 || 0 || 4 || 1 || 9 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 15 || 1 || 0 || 4 || 1 || 9 || 2026-10-20 | ||
| Line 99: | Line 99: | ||
|- | |- | ||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 11 || 2 || 0 || 4 || 0 || 5 || 2026-10-27 | | [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 11 || 2 || 0 || 4 || 0 || 5 || 2026-10-27 | ||
|- | |||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 11 || 4 || 0 || 3 || 0 || 4 || 2026-10-26 | |||
|- | |- | ||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 11 || 5 || 0 || 4 || 0 || 2 || 2026-10-23 | | [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 11 || 5 || 0 || 4 || 0 || 2 || 2026-10-23 | ||
| Line 127: | Line 129: | ||
|- | |- | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 11 || 3 || 0 || 3 || 0 || 5 || 2026-10-18 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 11 || 3 || 0 || 3 || 0 || 5 || 2026-10-18 | ||
|- | |||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 11 || 2 || 5 || 0 || 0 || 4 || 2026-10-17 | |||
|- | |- | ||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 10 || 3 || 1 || 2 || 0 || 4 || 2026-10-30 | | [[Hilbert's tenth problem over the rational numbers]] || Number theory || 10 || 3 || 1 || 2 || 0 || 4 || 2026-10-30 | ||
| Line 149: | Line 153: | ||
|- | |- | ||
| [[The Gaussian propeller conjecture]] || Probability || 10 || 3 || 0 || 2 || 0 || 5 || 2026-10-26 | | [[The Gaussian propeller conjecture]] || Probability || 10 || 3 || 0 || 2 || 0 || 5 || 2026-10-26 | ||
|- | |- | ||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 10 || 5 || 0 || 1 || 0 || 4 || 2026-10-26 | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 10 || 5 || 0 || 1 || 0 || 4 || 2026-10-26 | ||
| Line 173: | Line 175: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[The Bass trace conjecture]] || Group theory || 10 || 4 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
| Line 185: | Line 185: | ||
|- | |- | ||
| [[The Deligne–Drinfeld conjecture]] || Algebra || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-28 | | [[The Deligne–Drinfeld conjecture]] || Algebra || 9 || 4 || 0 || 2 || 0 || 3 || 2026-10-28 | ||
|- | |||
| [[Scheduling unit jobs with precedence constraints on three machines]] || Algorithms || 9 || 0 || 0 || 4 || 1 || 4 || 2026-10-27 | |||
|- | |- | ||
| [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-27 | | [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 9 || 2 || 0 || 4 || 0 || 3 || 2026-10-27 | ||
| Line 231: | Line 233: | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 8 || 2 || 0 || 2 || 0 || 4 || 2026-10-27 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 8 || 2 || 0 || 2 || 0 || 4 || 2026-10-27 | ||
|- | |- | ||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-27 | | [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-27 | ||
| Line 265: | Line 265: | ||
|- | |- | ||
| [[The anisotropic Calderón problem]] || Partial differential equations || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-19 | | [[The anisotropic Calderón problem]] || Partial differential equations || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-19 | ||
|- | |||
| [[Exponential semidefinite complexity of perfect matching]] || Computational complexity || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[The Lang–Plaut problem]] || Functional analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[The Lang–Plaut problem]] || Functional analysis || 8 || 1 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
| Line 301: | Line 303: | ||
|- | |- | ||
| [[Zariski's multiplicity conjecture]] || Algebraic geometry || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-30 | | [[Zariski's multiplicity conjecture]] || Algebraic geometry || 7 || 0 || 0 || 5 || 0 || 2 || 2026-10-30 | ||
|- | |||
| [[Iitaka's subadditivity conjecture]] || Algebraic geometry || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-29 | |||
|- | |- | ||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-29 | | [[The trilinear Hilbert transform]] || Harmonic analysis || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-29 | ||
| Line 355: | Line 359: | ||
|- | |- | ||
| [[Split tangent bundles and product decompositions]] || Algebraic geometry || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-18 | | [[Split tangent bundles and product decompositions]] || Algebraic geometry || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[The Sakoda–Sipser problem]] || Computational complexity || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[The cotype–cotype conjecture under the approximation property]] || Functional analysis || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | | [[The cotype–cotype conjecture under the approximation property]] || Functional analysis || 7 || 0 || 0 || 3 || 0 || 4 || 2026-10-18 | ||
| Line 373: | Line 379: | ||
|- | |- | ||
| [[The Kervaire conjecture]] || Group theory || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-17 | | [[The Kervaire conjecture]] || Group theory || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-17 | ||
|- | |- | ||
| [[Homogeneous depth-five lower bounds for iterated matrix multiplication]] || Algebraic complexity || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | | [[Homogeneous depth-five lower bounds for iterated matrix multiplication]] || Algebraic complexity || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | ||
| Line 403: | Line 407: | ||
|- | |- | ||
| [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | | [[Symplectic ball packing in higher dimensions]] || Differential geometry || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-29 | ||
|- | |||
| [[The log abundance conjecture in characteristic zero]] || Algebraic geometry || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-29 | |||
|- | |- | ||
| [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 6 || 2 || 0 || 0 || 1 || 3 || 2026-10-26 | | [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 6 || 2 || 0 || 0 || 1 || 3 || 2026-10-26 | ||
| Line 417: | Line 423: | ||
|- | |- | ||
| [[Generalized star height at most three]] || Computational complexity || 6 || 2 || 0 || 2 || 0 || 2 || 2026-10-22 | | [[Generalized star height at most three]] || Computational complexity || 6 || 2 || 0 || 2 || 0 || 2 || 2026-10-22 | ||
|- | |||
| [[The approximation threshold for metric k-median]] || Algorithms || 6 || 3 || 0 || 0 || 0 || 3 || 2026-10-22 | |||
|- | |- | ||
| [[De Giorgi's conjecture]] || Partial differential equations || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-21 | | [[De Giorgi's conjecture]] || Partial differential equations || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-21 | ||
| Line 431: | Line 439: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[Spontaneous magnetization and Bloch's law for the quantum Heisenberg ferromagnet]] || Mathematical physics || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[Spontaneous magnetization and Bloch's law for the quantum Heisenberg ferromagnet]] || Mathematical physics || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[The Courtade–Kumar conjecture]] || Information theory || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | |||
|- | |- | ||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | | [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 6 || 1 || 0 || 1 || 0 || 4 || 2026-10-18 | ||
| Line 449: | Line 457: | ||
|- | |- | ||
| [[The separable quotient problem]] || Functional analysis || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | | [[The separable quotient problem]] || Functional analysis || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Trace reconstruction from deletion channels]] || Computational complexity || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-18 | |||
|- | |- | ||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 6 || 0 || 1 || 1 || 0 || 4 || 2026-10-17 | | [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 6 || 0 || 1 || 1 || 0 || 4 || 2026-10-17 | ||
| Line 459: | Line 469: | ||
|- | |- | ||
| [[The free uniform spanning forest as a factor of IID]] || Probability || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-17 | | [[The free uniform spanning forest as a factor of IID]] || Probability || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-17 | ||
|- | |||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 6 || 2 || 0 || 1 || 0 || 3 || 2026-10-16 | |||
|- | |- | ||
| [[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 | ||
| Line 467: | Line 479: | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-16 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 6 || 1 || 0 || 2 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[Embedding edit distance into L1]] || Functional analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-14 | | [[Embedding edit distance into L1]] || Functional analysis || 6 || 0 || 0 || 3 || 0 || 3 || 2026-10-14 | ||
| Line 477: | Line 487: | ||
|- | |- | ||
| [[The LeBrun–Salamon conjecture]] || Differential geometry || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-28 | | [[The LeBrun–Salamon conjecture]] || Differential geometry || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-28 | ||
|- | |- | ||
| [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-27 | | [[Kobayashi's canonical-ampleness conjecture]] || Complex analysis || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-27 | ||
| Line 491: | Line 499: | ||
|- | |- | ||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-22 | | [[Rigidity of the Turing degrees]] || Mathematical logic || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-22 | ||
|- | |- | ||
| [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-22 | | [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-22 | ||
| Line 576: | Line 582: | ||
| [[The ionization and generalized ionization conjectures]] || Mathematical physics || 5 || 0 || 1 || 1 || 0 || 3 || 2026-10-17 | | [[The ionization and generalized ionization conjectures]] || Mathematical physics || 5 || 0 || 1 || 1 || 0 || 3 || 2026-10-17 | ||
|- | |- | ||
| [[ | | [[Approximating edit distance in almost-linear time]] || Algorithms || 5 || 2 || 0 || 0 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[Deterministic Ramanujan graphs in every degree]] || Combinatorics || 5 || 1 || 0 || 1 || 1 || 2 || 2026-10-16 | | [[Deterministic Ramanujan graphs in every degree]] || Combinatorics || 5 || 1 || 0 || 1 || 1 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 5 || 0 || 1 || 1 || 0 || 3 || 2026-10-16 | | [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 5 || 0 || 1 || 1 || 0 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 5 || 1 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
| Line 591: | Line 595: | ||
|- | |- | ||
| [[The smooth realization problem]] || Dynamical systems || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-16 | | [[The smooth realization problem]] || Dynamical systems || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[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 | ||
| Line 645: | Line 647: | ||
|- | |- | ||
| [[The random k-SAT satisfiability threshold]] || Probability || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-17 | | [[The random k-SAT satisfiability threshold]] || Probability || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[Milne's rationality conjecture]] || Number theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Milne's rationality conjecture]] || Number theory || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
Revision as of 17:38, 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.
- 2797 follow-up entries in total:
- Research follow-ups: 627
- Formalizations: 33
- Reviews and verifications: 919
- Critiques and corrections: 21
- Catalogue entries, citations and exposition: 1197
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.
