{"id":"a5775089-6abe-462a-9c14-c8b77c98a9b8","arxiv_id":"2608.11158","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"New rigorous bounds pin the Grothendieck constant to [6pi/11, pi/(2 log(1+sqrt 2)) - 10^-4], improving both known lower and upper bounds.","lead":"This paper proves the Grothendieck constant, a number that controls how well certain optimization problems can be approximated, lies between about 1.7135 and 1.7819. A smart generalist should read it because it improves both known sides of a famous open problem and introduces new proof frameworks.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The lower bound 6π/11 rests on the computer-assisted fiber inequality (Thm 9.3, App. D), whose interval-arithmetic certificate is not independently verified; this is more load-bearing than the sketched Lemma 11.2.","rationale":"The reader's weakest_assumption was Lemma 11.2, the reworking of Naor–Regev. I agree that lemma is sketched, but it is not the most load-bearing step: the same optimality conclusion is essentially the content of the published NR theorem, and the barrier Proposition 10.2 could be applied to any sequence of mixed schemes approaching K_G even if Lemma 11.2's approximation details were filled in differently. The real load-bearing step is the affine coefficient inequality, which is proved for all sign functions and then applied to the optimal sequence. Within that proof, the only non-analytic ingredient is the fiber inequality Theorem 9.3. Its proof in Appendix D consists of interval-arithmetic certificates for several tight regimes; the paper itself notes the splice margin is only 1.9×10^{-6} and the medium-band margins are of order 10^{-5}. A subtle coverage hole or rounding error in these certificates would invalidate the lower bound. The explicit computational certificate is not machine-checked, and the paper gives only a sketch of why the interval enclosure is complete. Therefore the single most load-bearing concern is the reliability of the fiber-inequality certificate, not Lemma 11.2. My proposed check is to independently reimplement the Appendix D branch-and-bound and run the provided scripts, which would settle whether the certificate actually establishes the inequality. Since the reader's verdict was already CONDITIONAL and my concern reinforces that conditionality, the verdict should remain unchanged.","tokens_in":36188,"tokens_out":18521,"duration_ms":195334,"concrete_test":"Independently implement the Appendix D.3 dual-envelope branch-and-bound (C2) with a different interval library (e.g., Julia's IntervalArithmetic.jl or MPFI) and an independent gridding of S^3 × [cM, 12]; separately re-verify C1, C3, and the splice inequality (S). Also run the provided lower_bound_reproducibility/run_all.sh in a clean environment and compare every printed certified margin. If any region is uncovered or any margin is not strictly positive, Theorem 9.3 is not established and the lower bound 6π/11 does not follow.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's novel lower bound K_G ≥ 6π/11 follows from the affine coefficient inequality b3 ≥ 2b1 − 11/6 (Section 9). That proof is complete except for Theorem 9.3, the fiber inequality V(u) ≤ 3νβ(u) − β(u)^2 for every ternary u. Theorem 9.3 is not proved analytically: Appendix D reduces it to interval-arithmetic certificates — the high-budget check (C1), the dual medium-band check (C2) over S^3 × [cM, 12], the tail checks (C3), and the splice inequality (S). If any certified region has a coverage hole or an outward-rounding bug, then D1(h,k) ≤ (11/6)ν^2 can fail, taking down the barrier γ ≤ 11/12 (Prop. 10.2) and the lower bound. The paper's own numbers show how tight this is: the splice margin is only about 1.9×10^{-6}, and the worst medium-band envelope margin is about 2.26×10^{-5}, so small numerical or coverage errors are not abstract. Lemma 11.2, by contrast, is a reworking of Naor–Regev's published optimality theorem; even if its Borel-partition approximation is sketched, the same barrier argument can run directly off the NR theorem. Thus the unverified computational certificate for the fiber inequality is the single point where the lower-bound claim could silently fail.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims new bounds on the Grothendieck constant: 6π/11 ≤ K_G ≤ π/(2 log(1+√2)) − 10^{-4}. The upper bound is obtained by introducing limiting Krivine rounding schemes, showing that they are limits of finite-dimensional classical schemes, and constructing a two-dimensional cubic–quintic scheme whose inverse majorant is certified numerically by interval arithmetic. The lower bound is obtained by proving an affine coefficient inequality b3 ≥ 2b1 − 11/6 for correlation functions of odd sign functions, transferring this to a universal barrier γ ≤ 11/12 for admissible inverse-majorant parameters, and then invoking a reworking of the Naor–Regev optimality construction to conclude K_G ≥ 6π/11. The lower-bound proof also relies on a computer-certified one-dimensional fiber inequality (Theorem 9.3, Appendix D).","tokens_in":36518,"tokens_out":14121,"duration_ms":139368,"significance":"If correct, the contribution is significant: it gives the first improvement over the Davie–Reeds lower bound by a non-infinitesimal amount, it constructs the first asymptotic family of rounding schemes for the upper bound, and together the bounds determine the tenths digit of K_G. The analytic skeleton is coherent: the limiting-scheme approximation theorem and the reduction of the upper-bound certificate to a small set of interval inequalities are clean, and the affine coefficient inequality is elegant. The manuscript is unusually transparent about its computational component, shipping deterministic Arb-based certificates with a one-command reproducibility driver. The lower bound, however, depends on two delicate points that need additional support before the main theorem can be regarded as fully established.","major_comments":[{"comment":"Lemma 11.2 is the only bridge from the affine coefficient inequality to the lower bound, but its proof is a sketch. The step that partitions the sphere into Borel sets and extends sampled signs as step functions is asserted to give ordinary mixed rounding schemes with uniformly convergent kernels, yet the manuscript does not show how the spherical construction of [NR14] yields Gaussian-input correlation functions of the form required by Definition 11.1, nor does it prove the claimed analyticity and coefficientwise convergence of H_k. Because Proposition 10.2 is applied to the limiting functions H_k, this gap is load-bearing: without a complete proof of Lemma 11.2, Theorem 7.1 does not follow from the affine coefficient inequality.","section":"§11, Lemma 11.2"},{"comment":"The fiber inequality V(u) ≤ 3νβ(u) − β(u)^2 is the main quantitative ingredient of the lower bound, but its proof is delegated entirely to interval-arithmetic certificates in Appendix D. The certified margins are very small in places: the splice inequality (S) has margin about 1.9×10^{-6}, and the worst medium-band envelope margin is about 2.3×10^{-5}. A coverage hole or an outward-rounding bug in those regions would invalidate Proposition 10.2 and hence the lower bound. The appendix is a detailed protocol, but it is not an independent verification. I would ask for either a human-verifiable analytic proof of the tightest certified regions, or an independent formal recheck of the certificates, before the lower-bound claim is accepted as fully established.","section":"§9.4 and Appendix D, Theorem 9.3"}],"minor_comments":[{"comment":"Theorems 3.7 and 3.9 state the same finite-dimensional approximation result; one of them should be removed or the second should be explicitly labeled as a strengthened restatement.","section":"§3.3, Theorems 3.7 and 3.9"},{"comment":"In Definition 3.6, the phrase 'where the discontinuity sets have Gaussian measure zero' is grammatically attached to 'odd measurable functions'; it would be clearer to list it as a separate requirement on the pair (f,g).","section":"§3.3, Definition 3.6"},{"comment":"The numerical value of 6π/11 is quoted as 1.7135... in the abstract and 1.7136... in Theorem 7.1; these are truncations of the same number, but the two presentations should be made consistent.","section":"Abstract and Theorem 7.1"},{"comment":"For reproducibility, it would be helpful to state the exact version of python-flint/FLINT and the hash of the pinned environment together with the one-command driver, so that independent reruns can verify that the same ball arithmetic backend is used.","section":"Appendix D, Table 2"}],"recommendation":"major_revision","confidential_remarks":"The two major concerns above are not accusations of error; I found no concrete mathematical mistake in the analytic parts I could check. The upper-bound machinery is especially well structured. The decision should turn on whether the authors can (a) supply a complete proof of Lemma 11.2 and (b) make the Appendix D certificate auditable to an outsider. If both are supplied, the paper would be a strong candidate for acceptance. The AI-collaboration statement is disclosed and does not affect the mathematical assessment."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's the quick take on arXiv:2608.11158. If the certificates are right, this is the first real movement on both sides of K_G in decades: lower bound to 1.7135, upper bound to 1.7819, pinning the tenths digit to 7. The methods are genuinely new: limiting Krivine schemes for the upper bound, and an affine coefficient inequality for the lower bound. The analytic skeleton is coherent and the proof sketches are readable. They also ship deterministic interval-arithmetic certificates and scripts, which is more than most pure math papers do.\n\nThe main caveat, as you'd expect, is the computer-assisted part. The lower bound depends entirely on Theorem 9.3, the fiber inequality, and Appendix D reduces that to interval-arithmetic checks with some very tight margins: the splice margin is about 1.9e-6, and the worst medium-band margin is 2.3e-5. That is not the kind of slack you can ignore. The certificates are well-documented and the scripts exist, but I haven't run them, and a referee cannot verify the claims by reading the text alone. The proof of Lemma 11.2, the reworking of Naor-Regev, is only sketched, but the stress-test note convinced me that it is less load-bearing: the barrier argument could run off the original NR theorem.\n\nThe upper bound is also machine-assisted, but it has more analytic structure (the near-linearity proposition and the D^3H tail bound) and the numerical margins there are more comfortable. Still, it deserves careful checking.\n\nWho's this for? Anyone working on Grothendieck-type inequalities or rounding schemes. The limiting-scheme framework alone is worth a read. I'd send it to referee, but I'd ask for the certificates to be independently run, and I'd want the authors to provide a human-verifiable proof of at least the core fiber inequality or a formalization of the interval arithmetic. The paper would be stronger if the lower bound were reorganized so that the numerical part is isolated and clearly stated as a lemma open to independent verification.\n\nMy recommendation: yes, send it to peer review. It's important, likely correct, and the shipping of code and certificates makes verification possible. But the referee needs to actually run the certificates, and the bar for acceptance should include a clean statement of what is proved by hand versus by machine.","headline":"Big claimed jump on both sides of K_G, but the lower bound rests on tight, unverified interval-arithmetic certificates; still deserves a serious referee.","tokens_in":37094,"tokens_out":2064,"would_cite":false,"duration_ms":19864,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["46B07","90C22","68Q17"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves 6π/11 ≤ K_G ≤ π/(2 log(1+√2)) − 10⁻⁴, fixing the Grothendieck constant's tenths digit at 7 with a cubic–quintic rounding scheme and a universal barrier on Krivine schemes.","keywords":["Grothendieck constant","Krivine rounding scheme","limiting Krivine scheme","affine coefficient inequality","inverse majorant","semidefinite relaxation","interval arithmetic certification"],"falsifier":"Two checks settle the claims. For the upper bound: re-run the published interval-arithmetic certificates (the paper says the suite finishes in under two minutes) and look for any violated enclosure, such as $b_1 \\ge 0.881573822049$ or $\\|D^3H\\|_{L^2(\\mathbb{T})} < 14.443$, or independently invert the cubic–quintic correlation series to high precision at $\\gamma = 0.881545409$ and verify $M(\\gamma) < 1$. For the lower bound: scan pairs of odd sign functions $f,g$ on $\\mathbb{R}^2$ and $\\mathbb{R}^3$ for any instance with $b_3 < 2b_1 - 11/6$, or verify that the limiting construction cited in Section 11 is really approximable by ordinary schemes with uniformly convergent kernels.","tokens_in":36005,"feed_emoji":"📐","tokens_out":16176,"duration_ms":128288,"temperature":0.7,"pith_summary":"This paper establishes new interval bounds for the Grothendieck constant, the best universal factor by which sign arrangements approximate inner products: $\\frac{6\\pi}{11} \\le K_G \\le \\frac{\\pi}{2\\log(1+\\sqrt{2})} - 10^{-4}$, numerically $[1.7135\\ldots, 1.7819\\ldots]$. That fixes the previously unknown tenths digit of this decades-old constant at 7. The upper bound comes from limiting Krivine schemes, asymptotic high-dimensional rounding schemes, and a concrete cubic–quintic example whose certified inverse-majorant series beats Krivine's classical bound by roughly $3.5 \\times 10^{-4}$. The lower bound comes from the opposite direction: instead of constructing hard instances, the paper proves a universal restriction, the affine coefficient inequality $b_3 \\ge 2b_1 - 11/6$, on the Taylor coefficients of every Krivine correlation function, converts that restriction into a cap of $11/12$ on all admissible majorant parameters, and applies the known optimality of Krivine schemes to turn the cap into the lower bound. The computational steps are backed by reproducible interval-arithmetic certificates, and the paper reports the bounds were found by a long-running human–AI collaboration.","feed_headline":"New bounds fix Grothendieck constant's tenths digit at 7","feed_subtitle":"Two new arguments squeeze the constant into [1.7135, 1.7819], settling its first decimal.","key_machinery":"The upper bound is carried by limiting Krivine schemes: pairs of odd sign functions $f,g : \\mathbb{R}^k \\to \\{\\pm 1\\}$ whose coordinate correlations are arbitrary allowable maps $\\rho_i(t) = \\sum_{d\\ \\mathrm{odd}} c_{i,d}\\,t^d$ with $\\sum_d |c_{i,d}| \\le 1$, rather than the fixed correlation $t$ of classical Krivine schemes; a central-limit-theorem argument shows such a scheme is a locally uniform limit of ordinary finite-dimensional Krivine schemes, so an inverse-majorant certificate for the limit is a genuine upper bound on $K_G$. The lower bound is carried by the affine coefficient inequality $b_3 \\ge 2b_1 - 11/6$, proved by decomposing $f$ and $g$ into agreement and disagreement parts $h = (f+g)/2$ and $k = (f-g)/2$ and reducing the needed estimates to one-dimensional inequalities; being affine in $(b_1, b_3)$, the inequality survives mixtures and coefficientwise limits and forces every admissible inverse-majorant parameter to satisfy $\\gamma \\le 11/12$.","core_discovery":"On its own terms, the paper claims that the Grothendieck constant satisfies $\\frac{6\\pi}{11} \\le K_G \\le \\frac{\\pi}{2\\log(1+\\sqrt{2})} - 10^{-4}$. The upper bound is certified by the cubic–quintic limiting scheme: odd sign functions $f(w,x) = \\mathrm{sgn}(w + \\vartheta\\,\\mathrm{He}_3(x))$ and $g(w,x) = \\mathrm{sgn}(w - \\vartheta\\,\\mathrm{He}_3(x))$, whose coordinate correlations are the allowed power series $\\rho(t) = (t - s_3^2 t^3 + s_5^2 t^5)/(1 + s_3^2 + s_5^2)$ in the first coordinate and $t$ in the second; its inverse majorant satisfies $M(\\gamma) < 1$ at $\\gamma = 0.881545409$, and a finite-dimensional approximation theorem transfers this certificate to ordinary rounding schemes, yielding $K_G \\le 1.7818666069360661$. The lower bound is the assertion that no Krivine-style correlation function, mixed or in any dimension, can admit an inverse-majorant parameter above $11/12$; this follows from the affine coefficient inequality $b_3 \\ge 2b_1 - 11/6$, which is preserved under mixtures and coefficientwise limits. Combined with the optimality of Krivine schemes, this barrier forces $K_G \\ge 6\\pi/11$.","pith_inferences":["The agreement–disagreement decomposition is not limited to the first two Taylor coefficients: analogous affine constraints on $b_5$, $b_7$, or mixed coefficients could tighten the $11/12$ barrier further, though the paper only hints at why this would be more involved.","The limiting-scheme framework separates the design of correlation maps from the choice of sign partitions; searching over additional Hermite directions (degrees 7, 9, …) or over allowable-map coefficients is a natural, testable route to a smaller upper bound.","The paper's numerical data suggest the fiber inequality holds with substantial headroom (an apparent true constant of $3 - \\pi/2$ versus the proved value 1); proving that stronger inequality would give the lower-bound argument slack to absorb sharper optimality transfers."],"forward_implications":["The tenths digit of the Grothendieck constant is 7; the constant is now known to lie in [1.7135…, 1.7819…].","The answer to a question posed in the 2011 paper that disproved Krivine's conjecture is yes: asymptotic families of higher-dimensional rounding schemes can improve on one- and two-dimensional schemes, opening a new search space.","A universal upper bound on Krivine-majorant parameters is a working route to lower bounds on K_G; any stronger affine constraint on higher Taylor coefficients would immediately tighten the 11/12 barrier.","The upper bound's numerical claims are tied to downloadable, reproducible interval-arithmetic certificates rather than to heuristic computation."],"supporting_citations":[{"why":"This reference defines the Grothendieck inequality and the constant K_G that the paper bounds.","marker":"[Gro53]"},{"why":"This reference introduces Krivine rounding schemes and the bound K_G ≤ π/(2 log(1+√2)) that the paper's upper bound improves.","marker":"[Kri77a]"},{"why":"This reference proves K_G is strictly below Krivine's bound and poses the question about higher-dimensional schemes that the paper answers.","marker":"[BMMN11]"},{"why":"This reference proves mixed Krivine schemes are optimal; Section 11 reworks its equations (4)–(6) to build the limiting mixed correlation functions behind the lower bound.","marker":"[NR14]"},{"why":"This reference supplies the earlier lower bound K_DR ≈ 1.6769 that the paper's 6π/11 improvement surpasses.","marker":"[Dav84]"},{"why":"This reference independently supplies the same earlier lower bound K_DR ≈ 1.6769, the baseline the new lower bound beats.","marker":"[Ree91]"},{"why":"This reference provides the most recent prior lower bound that the paper's lower bound improves.","marker":"[Hei26a]"},{"why":"This reference supplies the interval-arithmetic library in which all numerical certificates in the appendices are computed.","marker":"[Joh17]"}],"fun_headline_variants":["Grothendieck constant's tenths digit pinned at 7","New bounds squeeze Grothendieck constant to 1.7135–1.7819","AI-human proof tightens Grothendieck constant bounds","Lower and upper bounds improved for Grothendieck constant","First decimal of Grothendieck constant proven to be 7"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The lower bound rests on an approximation step in Section 11 that converts an idealized limiting construction into ordinary rounding schemes; the paper cites its source but leaves the conversion at the level of a sketch, and if that conversion fails the lower bound does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Grothendieck constant's tenths digit pinned at 7","New bounds squeeze Grothendieck constant to 1.7135–1.7819","AI-human proof tightens Grothendieck constant bounds","Lower and upper bounds improved for Grothendieck constant","First decimal of Grothendieck constant proven to be 7"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000679,"raw_usage":{"total_tokens":3120,"prompt_tokens":1012,"completion_tokens":2108,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":628,"completion_tokens_details":{"reasoning_tokens":2015}},"tokens_in":628,"tokens_out":2108,"duration_ms":15710,"temperature":1.0,"reasoning_tokens":2015,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T05:00:22.257516+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Two checks settle the claims. For the upper bound: re-run the published interval-arithmetic certificates (the paper says the suite finishes in under two minutes) and look for any violated enclosure, such as $b_1 \\ge 0.881573822049$ or $\\|D^3H\\|_{L^2(\\mathbb{T})} < 14.443$, or independently invert the cubic–quintic correlation series to high precision at $\\gamma = 0.881545409$ and verify $M(\\gamma) < 1$. For the lower bound: scan pairs of odd sign functions $f,g$ on $\\mathbb{R}^2$ and $\\mathbb{R}^3$ for any instance with $b_3 < 2b_1 - 11/6$, or verify that the limiting construction cited in Section 11 is really approximable by ordinary schemes with uniformly convergent kernels.","supporting_citations":[],"review_version":1}