Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (256 pages, 1393 entries) |
Automatic refresh from the published result pages (256 pages, 1402 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 256 result pages; 256 of them list at least one public follow-up. | * 256 result pages; 256 of them list at least one public follow-up. | ||
* | * 1402 follow-up entries in total: | ||
** Research follow-ups: 459 | ** Research follow-ups: 459 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: | ** Reviews and verifications: 641 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 254 | ||
== Results == | == Results == | ||
| Line 61: | Line 61: | ||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 10 || 5 || 0 || 2 || 0 || 3 || 2026-10-16 | | [[The Erdős similarity conjecture]] || Real analysis || 10 || 5 || 0 || 2 || 0 || 3 || 2026-10-16 | ||
|- | |||
| [[The generalized Lax conjecture]] || Convex geometry || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-25 | |||
|- | |- | ||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 9 || 4 || 0 || 4 || 0 || 1 || 2026-10-23 | | [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 9 || 4 || 0 || 4 || 0 || 1 || 2026-10-23 | ||
| Line 79: | Line 81: | ||
|- | |- | ||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-26 | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[The Gaussian moat problem]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-22 | | [[The Gaussian moat problem]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-22 | ||
| Line 97: | Line 97: | ||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-18 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 8 || 2 || 0 || 3 || 0 || 3 || 2026-10-18 | ||
|- | |||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-17 | |||
|- | |- | ||
| [[Petty's projection-volume conjecture]] || Convex geometry || 8 || 3 || 0 || 3 || 0 || 2 || 2026-10-17 | | [[Petty's projection-volume conjecture]] || Convex geometry || 8 || 3 || 0 || 3 || 0 || 2 || 2026-10-17 | ||
| Line 113: | Line 115: | ||
|- | |- | ||
| [[Cannon's conjecture]] || Geometric topology || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-26 | | [[Cannon's conjecture]] || Geometric topology || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-26 | ||
|- | |||
| [[The Gaussian propeller conjecture]] || Probability || 7 || 3 || 0 || 2 || 0 || 2 || 2026-10-26 | |||
|- | |- | ||
| [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 7 || 0 || 0 || 7 || 0 || 0 || 2026-10-24 | | [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 7 || 0 || 0 || 7 || 0 || 0 || 2026-10-24 | ||
| Line 141: | Line 145: | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 7 || 2 || 4 || 0 || 0 || 1 || 2026-10-17 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 7 || 2 || 4 || 0 || 0 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 7 || 0 || 0 || 6 || 0 || 1 || 2026-10-17 | | [[Foulkes' conjecture]] || Algebra || 7 || 0 || 0 || 6 || 0 || 1 || 2026-10-17 | ||
| Line 165: | Line 167: | ||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-26 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[Koebe's circle-domain conjecture]] || Complex analysis || 6 || 0 || 0 || 5 || 0 || 1 || 2026-10-25 | | [[Koebe's circle-domain conjecture]] || Complex analysis || 6 || 0 || 0 || 5 || 0 || 1 || 2026-10-25 | ||
| Line 203: | Line 203: | ||
|- | |- | ||
| [[The Boone–Higman conjecture]] || Group theory || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The Boone–Higman conjecture]] || Group theory || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The optimal order of convex-body covering density]] || Convex geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 6 || 1 || 1 || 3 || 0 || 1 || 2026-10-13 | | [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 6 || 1 || 1 || 3 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 6 || 4 || 0 || 1 || 0 || 1 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 6 || 4 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
|- | |||
| [[Brennan's conjecture]] || Complex analysis || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-25 | |||
|- | |- | ||
| [[Ostmann's inverse Goldbach conjecture]] || Number theory || 5 || 0 || 0 || 2 || 0 || 3 || 2026-10-23 | | [[Ostmann's inverse Goldbach conjecture]] || Number theory || 5 || 0 || 0 || 2 || 0 || 3 || 2026-10-23 | ||
| Line 267: | Line 271: | ||
|- | |- | ||
| [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The randomized k-server problem on arbitrary metrics]] || Algorithms || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[The randomized k-server problem on arbitrary metrics]] || Algorithms || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
| Line 289: | Line 291: | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-11 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-11 | ||
|- | |||
| [[The logarithmic Brunn–Minkowski conjecture]] || Convex geometry || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-11 | |||
|- | |- | ||
| [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |||
| [[The Lang–Plaut problem]] || Functional analysis || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | |||
|- | |- | ||
| [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 5 || 1 || 0 || 3 || 1 || 0 || 2026-10-10 | | [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 5 || 1 || 0 || 3 || 1 || 0 || 2026-10-10 | ||
| Line 321: | Line 327: | ||
|- | |- | ||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | | [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-16 | | [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-16 | ||
| Line 351: | Line 355: | ||
|- | |- | ||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 4 || 0 || 1 || 2 || 0 || 1 || 2026-10-16 | | [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 4 || 0 || 1 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The logarithmic Sobolev conjecture for subgaussian log-concave measures]] || Probability || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | | [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | ||
| Line 357: | Line 363: | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-14 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-14 | ||
|- | |||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-12 | |||
|- | |- | ||
| [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 4 || 2 || 0 || 0 || 0 || 2 || 2026-10-12 | | [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 4 || 2 || 0 || 0 || 0 || 2 || 2026-10-12 | ||
|- | |- | ||
| [[Infinite finitely presented simple amenable groups]] || Group theory || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[Infinite finitely presented simple amenable groups]] || Group theory || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 367: | Line 373: | ||
|- | |- | ||
| [[Single-fold Diophantine representations]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Single-fold Diophantine representations]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 427: | Line 431: | ||
|- | |- | ||
| [[The isoperimetric conjecture for the cubic flat three-torus]] || Differential geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[The isoperimetric conjecture for the cubic flat three-torus]] || Differential geometry || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The sharp constant in random triangle removal]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[The sharp constant in random triangle removal]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-10 | | [[Memory–sample lower bounds for noiseless Gaussian regression]] || Information theory || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-10 | ||
Revision as of 04:42, 26 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 26 October 2026. The table can be re-sorted by any column.
Summary
- 256 result pages; 256 of them list at least one public follow-up.
- 1402 follow-up entries in total:
- Research follow-ups: 459
- Formalizations: 31
- Reviews and verifications: 641
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 254
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 (16 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.
