Pith. sign in

REVIEW 2 major objections 7 minor 61 references

The Exact Worst-Case Tail Probability under Bounded Kurtosis

T0 review · 2 major / 7 minor · reviewed 2026-07-11 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A kurtosis bound buys an exact four-regime map for the worst one-sided tail, with a phase transition in proof degree.

desk verdict A complete, constructive four-regime map for the skewness-free kurtosis class, with matched SOS certificates and extremals that actually check out. read the letter →

arxiv 2607.05226 v2 pith:3N2P5P6M submitted 2026-07-06 math.PR math.STstat.MLstat.TH

Xiaoyu Li , Andi Han , Jiaojiao Jiang , Junbin Gao This is my paper · ORCID
classification math.PRmath.STstat.MLstat.TH MSC 60E1590C2262G32
keywords kurtosistailboundsmomentproblemsCantelliinequalitysumofsquaresproofdegreeextremaldistributionsmedianmeans
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

If you only know that a random variable has mean zero, variance one, and fourth moment at most κ, how large can the probability of exceeding a threshold t become? This paper answers that question completely. The answer is a four-regime phase diagram: inside an explicit tongue the classical two-moment Cantelli bound remains tight and the kurtosis constraint is worthless; far out in the tail a simple closed form improves Cantelli by converting 1/t^{2} decay into 1/t^{4} decay with the optimal constant κ−1; for small κ there is a plateau where the worst-case probability freezes independent of t; and in a central wedge the value is given exactly by an algebraic system that cannot be expressed in nested square roots. Beyond the tongue the one-sided and two-sided worst cases coincide, so Cantelli’s one-sided improvement over Chebyshev is annihilated by fourth-moment information. The same map tells you that the tight bound has a degree-2 sum-of-squares proof exactly on the tongue and requires degree 4 everywhere else. Every closed-form regime ships with an explicit extremal distribution and an explicit dual certificate that an independent exact-arithmetic checker re-verifies.

What carries the argument

The dual sum-of-squares certificate: a degree-2 or degree-4 polynomial that majorizes the indicator of the tail event, whose expectation under the moment constraints yields a sharp upper bound, matched by an explicit atomic extremal distribution.

What would settle it

Exhibit any single pair (t, κ) inside the claimed central wedge for which the algebraic system has no feasible solution, or any law with mean 0, variance 1 and fourth moment ≤ κ whose tail probability strictly exceeds the value asserted by the map.

Watch

Extended reading notes

Core claim

For every threshold t > 0 and every kurtosis budget κ ≥ 1 the worst-case one-sided tail probability over the class of mean-zero, unit-variance, fourth-moment-at-most-κ random variables equals an explicit four-regime map: the Cantelli value 1/(1+t^{2}) on the tongue b(κ) ≤ t ≤ c(κ), the closed form (κ−1)/((t^{2}−1)^{2}+κ−1) for t ≥ c(κ), a t-independent plateau for small κ, and the value of an explicit algebraic system in the remaining central wedge, each attained by a two- or three-point law.

Load-bearing premise

In the central regime the paper characterises the value by an algebraic system whose solvability is verified on a grid but not proved for every interior parameter point.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 7 minor

Summary. The paper determines the exact one-sided worst-case tail V₁(t,κ)=sup P(X≥t) over the skewness-free class C(κ) of mean-zero, unit-variance random variables with fourth moment at most κ. Theorem 3.1 gives a four-regime map: a Cantelli tongue where the two-moment bound 1/(1+t²) remains tight; a far-tail closed form (κ−1)/((t²−1)²+κ−1); a plateau (for κ≤3/2) on which the value freezes; and a central wedge characterized by an explicit algebraic system (S). Matching two- and three-point extremals and degree-2/4 SOS certificates are supplied for the closed-form regimes, with independent exact-arithmetic re-verification. The paper also proves a one-/two-sided collapse beyond c(κ), an exact proof-degree phase diagram (Theorem 3.4), the t=0 endpoint recovering He–Zhang–Zhang, and applications to quantiles, median-of-means, margins, and certifiable directional tails.

Significance. If correct, this is a complete, constructive solution of the natural univariate fourth-moment tail problem with free skewness—the form in which kurtosis assumptions typically arrive in robust statistics and SOS estimation. The closed forms, the collapse of Cantelli’s one-sided gain under binding kurtosis, and the exact proof-degree transition along κ=κ_c(t) are new and useful. Strengths that raise the contribution above a pure existence result include: explicit dual certificates and extremal laws for every closed-form regime; an independent exact-arithmetic verifier (fresh process, no shared producer code) that re-checks 47/48 grid instances; recovery of Cantelli, Zelen’s symmetric slice, and the He–Zhang–Zhang constant as special cases; and clean downstream corollaries (exact quantiles, a sharpened MoM block constant 2/11, directional tails under certifiable kurtosis). The machine-checked layer and the openly scoped limitation on IIIb solvability are genuine assets.

major comments (2)
  1. Theorem 3.1(IIIb) and Machine-Verified Fact C.12 characterize the central regime by system (S) and assert solvability only at evaluated grid points; the limitations section correctly flags the missing global existence proof. Proposition D.6 shows that any solution of (S) yields the exact value, and Lemma D.4 guarantees attainment of the supremum, but without existence of a solution to (S) the identification V₁=w₁+w₂ is not established for every interior (t,κ). This is the only incomplete piece of the map. Please either (i) prove solvability of (S) on the whole central wedge (e.g., via a continuous deformation from the plateau/tongue boundaries together with the gluing identities already verified), or (ii) restate Theorem 3.1(IIIb) so that the claim is explicitly conditional on solvability, with the grid evidence and the sandwich certificates of Section 4 recorded as the current scope. Do
  2. Section 3.4 and Fact C.10 rule out nested-square-root closed forms for IIIb by exhibiting an irreducible degree-6 minimal polynomial at (t,κ)=(1/2,2). The argument correctly uses Fact C.8 (degrees in iterated quadratic extensions). Higher-order radicals are explicitly not ruled out. For a complete negative statement, either compute the Galois group of the degree-6 polynomial (or of the second sample point (0.4,2.5)) or soften the abstract/introduction phrasing from “provably admitting no closed form in nested square roots” to the precise claim already proved in §3.4. This is load-bearing only for the “no closed form” slogan, not for the positive characterization via (S).
minor comments (7)
  1. Figure 1 is the paper’s main visual; the dashed curve t=τ(κ) and the two marked constants κ**, κ* are hard to read at print scale. Enlarge labels and consider a second panel zooming on the plateau region κ∈[1,3/2].
  2. Table 1’s last column (bounds at (t,κ)=(2,3)) is useful but the caption’s warning that values are not comparable across classes could be strengthened by adding a one-line “class size” note (e.g., Zelen pins m₃; this paper leaves m₃ free).
  3. Notation clash: in Regime II the statement uses u for (1−p t²)/(1−p) while the global shorthand is u=√(κ−1). The appendix already writes u*; promote that distinction into the main theorem statement.
  4. Section 4 and Appendix G devote substantial space to LemmaForge and the AI-guided search. The validation battery (Table 2) and the independent verifier are scientifically important; the discovery narrative can be shortened without loss of content, keeping the trusted-base discussion (checker lines, mutation tests, ε-retreat).
  5. Corollary 5.1(ii): the two-sided quantile formula is stated cleanly, but a one-sentence cross-reference to the gluing at p=1/κ (where the Chebyshev and kurtosis branches meet at √κ) would help readers invert Theorem 3.2 by hand.
  6. In the worked instance E.1, the weights w±= (9∓4√3)/22 are exact; the approximate decimals are fine for intuition but should be labeled as such to avoid any impression that the witness is numerical.
  7. References: Selberg (1940) and Guttman (1948) are cited in Table 4 with partial accessibility notes; if the primary texts remain unavailable, a secondary source or a clearer “formula not reproduced” flag would help.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the four-regime map is derived from first-principles matched pairs (SOS certificates + explicit atomic laws) with classical external facts only; numerics and self-citations are discovery/validation only.

full rationale

The central claim (Theorem 3.1) is obtained by constructing, for each regime, an explicit dual polynomial q of degree at most 4 that majorizes the indicator of [t,∞) (or the two-sided event) together with a matching two- or three-point law in C(κ) that attains the same value; weak duality (Lemma 2.3) then forces equality. The certificates rest only on the classical Markov–Lukács representations (proved from the fundamental theorem of algebra as Lemmas D.1–D.2) and elementary rational/surd arithmetic; the extremals are verified by direct moment matching. Classical constants (Cantelli 1/(1+t^{2}), He–Zhang–Zhang 2√3−3, Zelen’s symmetric-slice formula) appear solely as recovered special cases or external benchmarks for the pipeline; they are never used as inputs to the derivation. The AI/LemmaForge stage is explicitly discovery-only; every published identity is re-proved by hand and re-checked by an independent exact-arithmetic verifier that shares no producer code. The single self-citation (Li 2026) is confined to related-work discussion of SOS lower bounds and is not load-bearing. Global solvability of system (S) is scoped honestly as grid-verified only and is not required by any closed-form regime or application. Consequently the derivation chain does not reduce to its own inputs by construction, fit, or self-citation.

Assumptions & free parameters 0 free parameters · 3 assumptions · 1 invented entities

The paper is pure mathematics resting on standard real analysis, the fundamental theorem of algebra, weak-convergence facts from Billingsley, and the classical Markov–Lukács representation of non-negative univariate polynomials. No free parameters are fitted; the class C(κ) is the modelling assumption taken from applications. The only non-standard computational ingredients are the machine-verified minimal polynomials and grid solvability of system (S), both scoped as finite exact-arithmetic facts.

assumptions (3)
  • standard math Univariate non-negative polynomials of degree ≤4 admit exact sum-of-squares / Markov–Lukács representations (Lemmas D.1–D.2).
    Proved from the fundamental theorem of algebra; used to guarantee that degree-4 certificates always exist and that the dual SDP is exact.
  • standard math Tight sequences of probability measures on R have weakly convergent subsequences; Portmanteau and uniform-integrability preserve moments (Facts C.1–C.3).
    Used only for the abstract attainment lemma (Lemma D.4); all closed-form regimes are proved by explicit finite-support laws and need no measure theory.
  • domain assumption The modelling class is exactly C(κ) = {E X=0, E X²=1, E X⁴≤κ} with third moment free.
    Stated as Assumption 2.1; matches the form in which kurtosis bounds arrive in robust statistics and certifiable estimation.
invented entities (1)
  • LemmaForge pipeline independent evidence
    purpose: AI-guided discovery and exact certification of moment inequalities via SDP + rational rounding + independent verifier.
    Methodological instrument; the mathematical claims do not depend on it once the certificates are written down.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Exact Worst-Case Tail Probability under Bounded Kurtosis." pith.science (2026). https://pith.science/paper/3N2P5P6M

@misc{pith2026260705226,
  author       = {Pith},
  title        = {Pith review of: The Exact Worst-Case Tail Probability under Bounded Kurtosis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3N2P5P6M}},
  note         = {Machine review of arXiv:2607.05226}
}
abstract

We determine exactly what a kurtosis bound buys for one-sided tail control. For the class $\mathcal{C}(\kappa)$ of real random variables with mean $0$, variance $1$, and fourth moment at most $\kappa$, the skewness left free, we compute the worst-case tail probability $V_1(t,\kappa)=\sup_{X\in\mathcal{C}(\kappa)}\mathbb{P}(X\geq t)$ for every threshold $t>0$ and every $\kappa\geq 1$. The answer is a four-regime map: a Cantelli tongue $b(\kappa)\le t\le c(\kappa)$ on which the two-moment bound $1/(1+t^2)$ remains tight and the kurtosis constraint is worthless; a tail regime $t\geq c(\kappa)$ with the closed form $V_1=(\kappa-1)/((t^2-1)^2+\kappa-1)$; a plateau regime, present only for $\kappa\le 3/2$, on which the worst case freezes and the value does not depend on $t$; and a central regime described exactly by an explicit algebraic system, provably admitting no closed form in nested square roots. Beyond $c(\kappa)$ the one-sided and two-sided worst cases coincide: Cantelli's improvement over Chebyshev is annihilated by fourth-moment information. The minimal degree of a sum-of-squares proof of the tight bound is $2$ on the closed tongue and $4$ everywhere else, an exact phase diagram of proof degree. Every closed-form regime carries an explicit dual certificate and an explicit extremal distribution, re-verified on parameter grids by an independent checker in exact arithmetic. The closed forms invert to exact worst-case quantiles, sharpen a median-of-means constant, and give the exact per-direction tail available to degree-4 reasoning under certifiable kurtosis. We found the map through an AI-guided search around the certifying pipeline, LemmaForge, which is validated on classical benchmarks, independently reproduces the symmetric-slice bound of Zelen (1954), and recovers the $2\sqrt{3}-3$ constant of He, Zhang, and Zhang (2010) at $t=0$.

Figures

Figures reproduced from arXiv: 2607.05226 by the authors.

Figure 1
Figure 1. The one-sided map (Theorem 3.1). Inside the tongue 𝑏(𝜅) ≤ 𝑡 ≤ 𝑐(𝜅) (equivalently 𝜅 ≥ 𝜅c(𝑡)), Cantelli’s two-moment bound is tight and the proof degree is 2. To the right of 𝑡 = 𝑐(𝜅) the tail formula of (3.1) is tight, one-sided and two-sided worst cases coincide (Theorem 3.3), and the proof degree is 4. Left of the tongue: the plateau IIIa (value independent of 𝑡; only for 𝜅 ≤ 𝜅 ∗ = 3/2) and the central regime IIIb … view at source ↗
Figure 2
Figure 2. The exact map against the classical bounds at 𝜅 = 3 (log scale). The gap to Cantelli is the value of kurtosis information; the gap to the fourth-moment Markov bound 𝜅/𝑡 4 is the factor 𝜅/(𝜅 − 1); the gap to Zelen’s symmetric bound (valid for the smaller, 𝛾-pinned class, 𝑡 > 1) is the exact price of not knowing the skewness. 3.2 The two-sided map and the collapse Theorem 3.2 (Two-sided map). Under Theorem 2.1, for 𝑡 … view at source ↗
Figure 2
Figure 2. The exact map against the classical bounds at 𝜅 = 3 (log scale). The gap to Cantelli is the value of kurtosis information; the gap to the fourth-moment Markov bound 𝜅/𝑡 4 is the factor 𝜅/(𝜅 − 1); the gap to Zelen’s symmetric bound (valid for the smaller, 𝛾-pinned class, 𝑡 > 1) is the exact price of not knowing the skewness. to place all deviation mass on one side is worthless to the adversary: Cantelli’s strict one-… view at source ↗
Figures from the paper (4 more)
Figure 3
Figure 3. Figure 3: Worst-case distributions across the regimes (atoms and weights, exact where the regime has a closed form). Note the structural transitions: two-point laws (I: the Cantelli pair; IIIa: frozen at {𝑏, −𝑐}) against three-point laws (II, IIIb), and an atom at the threshold …
Figure 3
Figure 3. Figure 3: Worst-case distributions across the regimes (atoms and weights, exact where the regime has a closed form). Note the structural transitions: two-point laws (I: the Cantelli pair; IIIa: frozen at {𝑏, −𝑐}) against three-point laws (II, IIIb), and an atom at the threshold …
Figure 4
Figure 4. Figure 4: Dependency graph of the paper’s results (ours only). An arrow means “is used in the proof of”. The dashed box is Theorem 3.1, whose four regime clauses depend on one another as drawn; the two root lemmas at the lower left are used by everything above them (arrows drawn…
Figure 4
Figure 4. Figure 4: Dependency graph of the paper’s results (ours only). An arrow means “is used in the proof of”. The dashed box is Theorem 3.1, whose four regime clauses depend on one another as drawn; the two root lemmas at the lower left are used by everything above them (arrows drawn…

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 3 linked inside Pith

  1. [1]

    Journal of Research of the National Bureau of Standards , volume =

    Zelen, Marvin , title =. Journal of Research of the National Bureau of Standards , volume =. 1954 , verified =

    1954

  2. [2]

    Royden, H. L. , title =. Annals of Mathematical Statistics , volume =. 1953 , doi =

    1953

  3. [3]

    Richard , title =

    Savage, I. Richard , title =. Journal of Research of the National Bureau of Standards, Section B , volume =. 1961 , verified =

    1961

  4. [4]

    Annals of Mathematical Statistics , volume =

    Guttman, Louis , title =. Annals of Mathematical Statistics , volume =. 1948 , verified =

    1948

  5. [5]

    Bhattacharyya, B. B. , title =. Communications in Statistics -- Theory and Methods , volume =. 1987 , doi =

    1987

  6. [6]

    , title =

    Selberg, Henrik L. , title =. Skandinavisk Aktuarietidskrift , volume =. 1940 , verified =

    1940

  7. [7]

    Mathematics of Operations Research , volume =

    He, Simai and Zhang, Jiawei and Zhang, Shuzhong , title =. Mathematics of Operations Research , volume =. 2010 , doi =

    2010

  8. [8]

    SIAM Journal on Optimization , volume =

    Bertsimas, Dimitris and Popescu, Ioana , title =. SIAM Journal on Optimization , volume =. 2005 , doi =

    2005

Show all 61 references
  1. [9]

    , title =

    Maher, David G. , title =. arXiv preprint arXiv:1905.10164 , year =

    1905 arXiv

  2. [10]

    , title =

    Karlin, Samuel and Studden, William J. , title =. 1966 , verified =

    1966

  3. [11]

    High Performance Optimization , editor =

    Nesterov, Yurii , title =. High Performance Optimization , editor =. 2000 , doi =

    2000

  4. [12]

    , title =

    Peyrl, Helfried and Parrilo, Pablo A. , title =. Theoretical Computer Science , volume =. 2008 , doi =

    2008

  5. [13]

    Theorem Proving in Higher Order Logics (TPHOLs 2007) , series =

    Harrison, John , title =. Theorem Proving in Higher Order Logics (TPHOLs 2007) , series =. 2007 , doi =

    2007

  6. [14]

    ACM Communications in Computer Algebra , volume =

    Magron, Victor and. ACM Communications in Computer Algebra , volume =. 2018 , doi =

    2018

  7. [15]

    2010 , isbn =

    Lasserre, Jean-Bernard , title =. 2010 , isbn =

    2010

  8. [16]

    SIAM Journal on Optimization , volume =

    Lasserre, Jean-Bernard , title =. SIAM Journal on Optimization , volume =. 2001 , doi =

    2001

  9. [17]

    2015 , isbn =

    Lasserre, Jean-Bernard , title =. 2015 , isbn =

    2015

  10. [18]

    Indiana University Mathematics Journal , volume =

    Putinar, Mihai , title =. Indiana University Mathematics Journal , volume =. 1993 , doi =

    1993

  11. [19]

    Mathematical Programming , volume =

    Nie, Jiawang , title =. Mathematical Programming , volume =. 2014 , doi =

    2014

  12. [20]

    Solution of the Truncated Complex Moment Problem for Flat Data , journal =

    Curto, Ra. Solution of the Truncated Complex Moment Problem for Flat Data , journal =. 1996 , doi =

    1996

  13. [21]

    and Steurer, David , title =

    Kothari, Pravesh K. and Steurer, David , title =. arXiv preprint arXiv:1711.11581 , year =

    arXiv

  14. [22]

    and Li, Jerry , title =

    Hopkins, Samuel B. and Li, Jerry , title =. Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2018) , pages =. 2018 , doi =

    2018

  15. [23]

    Computational Complexity , volume =

    Grigoriev, Dima , title =. Computational Complexity , volume =. 2001 , doi =

    2001

  16. [24]

    Studia Mathematica , volume =

    Haagerup, Uffe , title =. Studia Mathematica , volume =. 1981 , verified =

    1981

  17. [25]

    Atti del Congresso Internazionale dei Matematici, Bologna , volume =

    Cantelli, Francesco Paolo , title =. Atti del Congresso Internazionale dei Matematici, Bologna , volume =. 1928 , verified =

    1928

  18. [26]

    1999 , doi =

    Billingsley, Patrick , title =. 1999 , doi =

    1999

  19. [27]

    Bienaym. Consid. Comptes Rendus des S. 1853 , verified =

  20. [28]

    , title =

    Chebyshev, Pafnuty L. , title =. Journal de Math. 1867 , verified =

  21. [29]

    Annals of the Institute of Statistical Mathematics , volume =

    Isii, Keiiti , title =. Annals of the Institute of Statistical Mathematics , volume =. 1962 , doi =

    1962

  22. [30]

    , title =

    Smith, James E. , title =. Operations Research , volume =. 1995 , doi =

    1995

  23. [31]

    Mathematics of Operations Research , volume =

    Popescu, Ioana , title =. Mathematics of Operations Research , volume =. 2005 , doi =

    2005

  24. [32]

    SIAM Review , volume =

    Vandenberghe, Lieven and Boyd, Stephen and Comanor, Katherine , title =. SIAM Review , volume =. 2007 , doi =

    2007

  25. [33]

    Operations Research , volume =

    Delage, Erick and Ye, Yinyu , title =. Operations Research , volume =. 2010 , doi =

    2010

  26. [34]

    Operations Research , volume =

    Wiesemann, Wolfram and Kuhn, Daniel and Sim, Melvyn , title =. Operations Research , volume =. 2014 , doi =

    2014

  27. [35]

    Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey , journal =

    Lugosi, G. Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey , journal =. 2019 , doi =

    2019

  28. [36]

    Annales de l'Institut Henri

    Catoni, Olivier , title =. Annales de l'Institut Henri. 2012 , doi =

    2012

  29. [37]

    2014 , verified =

    Barak, Boaz and Steurer, David , title =. 2014 , verified =

    2014

  30. [38]

    Foundations and Trends in Theoretical Computer Science , volume =

    Fleming, Noah and Kothari, Pravesh and Pitassi, Toniann , title =. Foundations and Trends in Theoretical Computer Science , volume =. 2019 , doi =

    2019

  31. [39]

    Krein, M. G. and Nudelman, A. A. , title =. 1977 , isbn =

    1977

  32. [40]

    and Li, Bin and Yang, Zhengfeng and Zhi, Lihong , title =

    Kaltofen, Erich L. and Li, Bin and Yang, Zhengfeng and Zhi, Lihong , title =. Journal of Symbolic Computation , volume =. 2012 , doi =

    2012

  33. [41]

    Journal of Combinatorial Theory, Series A , volume =

    Garnett, Brian , title =. Journal of Combinatorial Theory, Series A , volume =. 2020 , doi =

    2020

  34. [42]

    , title =

    Cifuentes, Diego and Kahle, Thomas and Parrilo, Pablo A. , title =. Journal of Software for Algebra and Geometry , volume =. 2020 , doi =

    2020

  35. [43]

    , title =

    Diakonikolas, Ilias and Kane, Daniel M. , title =. 2023 , isbn =

    2023

  36. [44]

    and Karmalkar, Sushrut and Pensia, Ankit and Pittas, Thanasis , title =

    Diakonikolas, Ilias and Kane, Daniel M. and Karmalkar, Sushrut and Pensia, Ankit and Pittas, Thanasis , title =. Proceedings of the 35th Annual Conference on Learning Theory (COLT) , series =. 2022 , verified =

    2022

  37. [45]

    and Kane, Daniel M

    Bakshi, Ainesh and Diakonikolas, Ilias and Hopkins, Samuel B. and Kane, Daniel M. and Karmalkar, Sushrut and Kothari, Pravesh K. , title =. Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages =. 2020 , doi =

    2020

  38. [46]

    and Kothari, Pravesh K

    Bakshi, Ainesh and Diakonikolas, Ilias and Jia, He and Kane, Daniel M. and Kothari, Pravesh K. and Vempala, Santosh S. , title =. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC) , pages =. 2022 , doi =

    2022

  39. [47]

    and Pensia, Ankit and Tiegel, Stefan , title =

    Diakonikolas, Ilias and Hopkins, Samuel B. and Pensia, Ankit and Tiegel, Stefan , title =. Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC) , pages =. 2025 , doi =

    2025

  40. [48]

    and Pensia, Ankit and Tiegel, Stefan , title =

    Diakonikolas, Ilias and Hopkins, Samuel B. and Pensia, Ankit and Tiegel, Stefan , title =. Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC) , year =. doi:10.1145/3717823.3718293 , verified =

    doi

  41. [49]

    and Steurer, David , title =

    Barak, Boaz and Kelner, Jonathan A. and Steurer, David , title =. Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC) , pages =. 2015 , doi =

    2015

  42. [50]

    and Shi, Jonathan and Steurer, David , title =

    Hopkins, Samuel B. and Shi, Jonathan and Steurer, David , title =. Proceedings of the 28th Conference on Learning Theory (COLT) , series =. 2015 , verified =

    2015

  43. [51]

    Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =

    Ma, Tengyu and Shi, Jonathan and Steurer, David , title =. Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =

  44. [52]

    and Steinhardt, Jacob and Steurer, David , title =

    Kothari, Pravesh K. and Steinhardt, Jacob and Steurer, David , title =. Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC) , pages =. 2018 , doi =

    2018

  45. [53]

    and Kothari, Pravesh K

    Klivans, Adam R. and Kothari, Pravesh K. and Meka, Raghu , title =. Proceedings of the 31st Conference on Learning Theory (COLT) , series =. 2018 , verified =

    2018

  46. [54]

    , title =

    Hopkins, Samuel B. , title =. Annals of Statistics , volume =. 2020 , doi =

    2020

  47. [55]

    Proceedings of the International Congress of Mathematicians (ICM 2018) , publisher =

    Raghavendra, Prasad and Schramm, Tselil and Steurer, David , title =. Proceedings of the International Congress of Mathematicians (ICM 2018) , publisher =. 2018 , doi =

    2018

  48. [56]

    and Kothari, Pravesh K

    Hopkins, Samuel B. and Kothari, Pravesh K. and Potechin, Aaron and Raghavendra, Prasad and Schramm, Tselil and Steurer, David , title =. Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages =. 2017 , verified =

    2017

  49. [57]

    2023 , isbn =

    Nie, Jiawang , title =. 2023 , isbn =. doi:10.1137/1.9781611977608 , verified =

    2023 doi

  50. [58]

    Journal of Complexity , volume =

    Nie, Jiawang and Schweighofer, Markus , title =. Journal of Complexity , volume =. 2007 , doi =

    2007

  51. [59]

    Foundations of Computational Mathematics , volume =

    Nie, Jiawang , title =. Foundations of Computational Mathematics , volume =. 2014 , doi =

    2014

  52. [60]

    SIAM Journal on Applied Algebra and Geometry , volume =

    Dressler, Mareike and Iliman, Sadik and de Wolff, Timo , title =. SIAM Journal on Applied Algebra and Geometry , volume =. 2017 , doi =

    2017

  53. [61]

    arXiv preprint arXiv:2606.17215 , year =

    Li, Xiaoyu , title =. arXiv preprint arXiv:2606.17215 , year =

    arXiv

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.