{"id":"6ce5b0eb-715e-409a-923e-76b2d46bba50","arxiv_id":"2607.13401","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"From a coordinate start, Kac's walk on the n-sphere has total-variation cutoff at C n log n with C≈3.8916, refuting the conjectured 2 n log n.","lead":"Kac's walk — repeatedly rotating a random pair of coordinates on a high-dimensional sphere — is shown to reach its uniform steady state in a sharp window at about 3.89 times n log n, not the earlier conjectured 2 n log n. A smart generalist reading: this settles a quantitative prediction in a classic kinetic-theory model and shows rare large remnants of the starting point control total variation mixing.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.6 rests on an unshipped numerical certification script; without reproducible enclosures, the upper-bound threshold c > C_BRW is not fully proved.","rationale":"I read the manuscript in good faith. The lower bound uses Biggins's theorem and a block construction; the approximation of the discrete splitting process by the branching random walk before the K-th split is carefully argued, and the uniform-integrability bounds are plausible. The upper bound's drift estimate, fourth-moment recursion, and chi-square coupling via the permutation estimate are detailed and internally consistent. The only place where the proof is not self-contained is Appendix C: Lemma 4.6, which is essential for Proposition 4.1, is proved by a named but absent numerical script. The reader's weakest assumption identifies exactly this gap. I do not see an alternative load-bearing concern: the analytic inequalities, once the numerical enclosures are granted, do appear to go through, and the constant C_BRW is defined analytically even though its numerical location is used. The appropriate disposition is therefore the same as the reader's: CONDITIONAL, pending release of the certification script or in-text rigorous enclosures. I would not escalate to REJECT because the numerical claims are narrow, explicitly stated, and likely reproducible, but as submitted the proof is incomplete at that step.","tokens_in":28010,"tokens_out":9324,"duration_ms":91950,"concrete_test":"Make numerics.py available with a pinned Arb environment and rerun it to independently reproduce the three enclosures in Appendix C (C.1)–(C.2), e.g., at 256-bit precision. If the script is not supplied, recompute the same bounds with a second independent interval-arithmetic implementation; failure of any enclosure would invalidate Lemma 4.6 and hence the upper-bound proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The upper bound in Theorem 1.1 depends on Proposition 4.1, whose proof invokes Lemma 4.6 to choose p ∈ (2,4) satisfying c > p/(2(1−m(p))), c > (1+p/2)/σ_p, and 2(1−m(p)) > σ_p. Appendix C reduces Lemma 4.6 to three interval enclosures: C_BRW ∈ [3.89160134,3.89160138], sup_{p∈I}(1+p/2)/σ_p < 3.779154, and inf_{p∈I}(2(1−m(p))−σ_p) > 0.03613. The text says 'The script numerics.py certifies the interval estimates below', but that script is not shipped and the appendix does not state the number of partial-sum terms, the precision, or the exact Arb routines used. The analytic part — monotonicity of H and uniqueness of the minimizer — is sound, but the sign-change certification H(2.41258)<0<H(2.41259) is outsourced to absent code. If the script has a bug or the enclosures are wrong, the proof of Proposition 4.1 fails for c just above C_BRW, and (1.2) is unsupported in that regime. This is a verification gap, not an internal contradiction: the surrounding argument is coherent, but the numerical input is load-bearing and not reproducible from the preprint alone.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the discrete-time Kac walk on S^{n-1} started from the coordinate vector e_1. The main result (Theorem 1.1) asserts total-variation cutoff at time C_BRW n log n, with C_BRW ≈ 3.8916, and thus disproves the Pillai–Smith conjecture of cutoff at 2n log n. The proof has two parts. For the lower bound, the squared-coordinate process is compared block-wise to a continuous-time branching random walk; the speed of the leftmost particle in that BRW, computed via Biggins's theorem, yields C_BRW. For the upper bound, the law of the squared-coordinate chain is represented as a mixture of normalized gamma laws F_{A_t} with a random scale vector; the authors prove a drift estimate for Φ_p(ξ_t) (Proposition 4.3), an ℓ∞ estimate for the normalized scale vector (Proposition 4.1, using Lemma 4.6), and then a χ² bound with a permutation argument (Proposition 5.3, Lemmas 5.1 and 5.2). The main analytic estimates are given in detail, with exact recursions in Appendices A and B and a numerical certification in Appendix C.","tokens_in":28359,"tokens_out":30306,"duration_ms":284266,"significance":"If the theorem is correct, it is a substantial advance: it gives the first exact cutoff constant for the Kac walk from a coordinate start, ties the constant to the leftmost-particle speed of a branching random walk, and refutes the previously conjectured 2n log n location. The paper is largely self-contained and carefully structured; the exact beta-gamma identities, the exact fourth-moment recursion, and the reduction of both bounds to the same function m(p) are notable strengths. The decisive obstruction to accepting the arguments as they stand is the reproducibility of the numerical input in Lemma 4.6/Appendix C. This is a verification gap rather than an apparent mathematical contradiction, but it is load-bearing for the upper bound.","major_comments":[{"comment":"The proof of the upper bound (1.2) relies on Proposition 4.1, whose proof invokes Lemma 4.6 to select p∈(2,4) satisfying c>p/(2(1−m(p))), c>(1+p/2)/σ_p, and 2(1−m(p))>σ_p. Appendix C reduces Lemma 4.6 to three interval enclosures (C.1)–(C.2) and the sign change H(2.41258)<0<H(2.41259). The text says 'The script numerics.py certifies the interval estimates below', but the script is not shipped, and the appendix does not state the number N of partial-sum terms, the working precision, the Arb version, or the exact interval-evaluation method. The analytic part — monotonicity of H and uniqueness of the minimizer — is sound, but the numerical enclosures are load-bearing: if any of them is false, the choice of p in Proposition 4.1 can fail for c just above C_BRW and (1.2) is unsupported in that regime. This is a verification gap, not an internal inconsistency, but it must be closed before the p","section":"Appendix C / Lemma 4.6"}],"minor_comments":[{"comment":"In the reversibility paragraph, the display has a typo: '(B(Yi +Y j)B,(1−B)(Y i +Y j))' should read '(B(Yi +Y j),(1−B)(Yi +Y j))'.","section":"Section 2.1"},{"comment":"The proof of B_{n,T}⇒B_T is somewhat compressed. A formal statement of the joint convergence of (2W_{n,k}/n, R_{n,k}, U_{n,k}) and the continuous-mapping justification would make this key coupling step easier to verify.","section":"Section 3 / Lemma 3.3"},{"comment":"The assertion m(λ)<1 on (1,∞) is used before being proved (it is justified in Appendix C via the digamma monotonicity). A one-line proof or forward reference would improve the exposition.","section":"Section 1.1"},{"comment":"Even after supplying numerics.py, the text should state the number of partial-sum terms and the precision used for the interval enclosures, so that the claims in (C.1)–(C.2) can be checked independently.","section":"Appendix C"}],"recommendation":"major_revision","confidential_remarks":"The missing numerics.py is the only significant obstacle I see. If the authors supply the script together with exact algorithmic parameters, I expect the paper could become acceptable. There is no evidence of circularity or data fitting: the same function m(p) arises independently in the branching-random-walk speed and in the drift estimate, and the lower and upper thresholds reduce to the same variational quantity."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The thing you should know: this is the first proof of total-variation cutoff for Kac's walk from a coordinate start, the cutoff is at C_BRW n log n with C_BRW ≈ 3.8916, and it refutes the Pillai–Smith conjecture of 2n log n. If the proof holds, it is a major result.\n\nWhat's genuinely new is the branching-random-walk constant and the mechanism behind it. The lower bound is governed by the largest descendant of the initial coordinate, not the repeated-averages constant, and the upper bound uses a scale-vector representation, a drift estimate for Φ_p, and a permutation estimate to control cross-overlap. The exact reductions (energy chain, gamma mixtures, Biggins's theorem) are clean, and the recursions in Appendix A are spelled out in detail. The paper is honest about its use of ChatGPT, which is fine.\n\nThe soft spot is Lemma 4.6, which is load-bearing: it certifies the interval enclosures that let the upper bound cover all c > C_BRW. The proof in Appendix C says \"the script numerics.py certifies the interval estimates below,\" but the script is not shipped and the appendix gives no number of partial-sum terms, precision, or exact Arb routines. So the c > C_BRW threshold is conditional on an unverifiable numerical computation. That is a genuine gap, though not a contradiction. Everything around it is consistent; the numerical inputs appear plausible (C_BRW in a tight interval, strict inequalities with margin), and the analytic monotonicity of H is proved in text. I would want the code or the full interval-arithmetic details before signaling the theorem is fully proved.\n\nThe rest of the proof seems careful. I did not find a red flag in the main estimates. It is a long paper; a single bug could still be somewhere, but the structure is sound.\n\nWho this is for: anyone working on mixing times or mean-field cutoff phenomena. It deserves a serious referee.\n\nRecommendation: send to peer review, with a request that the authors deposit numerics.py plus a reproducible environment, or replace the script with fully in-text interval enclosures. As submitted, the acceptance should be conditional on that.","headline":"Sharp TV cutoff for Kac's walk from a coordinate start at an explicit branching-random-walk constant, refuting the Pillai–Smith conjecture; the main proof is strong, but the upper-bound threshold leans on an unshipped numerical certification script.","tokens_in":28833,"tokens_out":1910,"would_cite":true,"duration_ms":34376,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J10","60J80","60B10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that the discrete-time Kac walk on the sphere, started from a coordinate vector, exhibits total-variation cutoff at time C_BRW n log n, with C_BRW ≈ 3.8916, refuting the conjectured 2 n log n location.","keywords":["total variation cutoff","Kac walk","sphere","mixing time","branching random walk","Beta distribution","energy chain","scale vector"],"falsifier":"Re-run the certified interval computation for the digamma difference D(p) and the gamma ratio m(p) to higher precision, or check the sign of H(p) = 1 - m(p) - p m(p) D(p) at the interval endpoints 2.41258 and 2.41259; a failure of H(2.41258) < 0 < H(2.41259) would break Lemma 4.6. A Monte Carlo simulation of the Kac walk at times near 3.89 n log n versus 2 n log n would also test the claimed cutoff location.","tokens_in":27870,"feed_emoji":"🎲","tokens_out":3349,"duration_ms":30513,"temperature":0.7,"pith_summary":"The paper establishes an exact total-variation cutoff for the discrete-time Kac walk on the n-dimensional sphere when started from a coordinate vector. The cutoff time is C_BRW n log n, where C_BRW ≈ 3.8916 is an explicit constant arising from the speed of the leftmost particle in a binary branching random walk with Beta(1/2,1/2) splits. This disproves the previously conjectured cutoff at 2 n log n. The result matters because it identifies the precise extremal obstruction to mixing: a descendant of the initial coordinate can remain atypically large, and that obstruction is exactly quantified by the branching-random-walk constant.","feed_headline":"Mixing time for Kac walk pinned at 3.8916 n log n","feed_subtitle":"A branching-random-walk constant replaces the conjectured 2 n log n cutoff location for coordinate starts.","key_machinery":"The central object is the continuous-time binary branching random walk in which a particle at position x branches at rate 1 into two children at x - log U and x - log(1-U), with U ~ Beta(1/2,1/2). Its leftmost-particle speed γ_BRW determines the cutoff constant via C_BRW = 1/(2 γ_BRW). In the upper bound, the same constant emerges through the p-th moment retention factor m(p) = E[U^p + (1-U)^p] in a one-step drift inequality for Φ_p(ξ_t) = Σ|ξ_{t,i}|^p, where ξ_t is the centered scale vector. This drift inequality, combined with a fourth-moment control and a permutation-based overlap estimate, yields the total-variation convergence.","core_discovery":"Theorem 1.1: for every fixed c > 0, d_n^(1)(⌈c n log n⌉) → 1 when c < C_BRW and d_n^(1)(⌈c n log n⌉) → 0 when c > C_BRW. Thus the Kac walk from a coordinate start exhibits total-variation cutoff at time C_BRW n log n. The constant is C_BRW = inf_{p>1} p/[2(1-m(p))] = 1/(2 γ_BRW), where γ_BRW = sup_{λ>0}(1-m(λ))/λ and m(λ) = E[U^λ + (1-U)^λ] for U ~ Beta(1/2,1/2). The upper bound uses a representation of the squared-coordinate chain as a mixture of Dirichlet laws and a drift estimate for Φ_p(x) = Σ|x_i|^p, while the lower bound builds a persistence event showing a coordinate retains energy at scale n^{-β} before the cutoff.","pith_inferences":["The same branching-random-walk constant may govern total-variation mixing in other beta-redistribution models where a single initial mass is split; the threshold depends only on the moment function m(p).","A direct numerical test: simulating Kac's walk for moderate n should show the total-variation distance dropping near 3.89 n log n, not 2 n log n.","The upper bound relies crucially on the coordinate start through permutation symmetry of coordinates 2, ..., n; extending to arbitrary starts would likely require a different treatment of the cross-overlap term.","The certified interval computation in Appendix C is not shipped with the preprint; reproducing those enclosures (or running the script when it becomes available) is a direct way to confirm the constant."],"forward_implications":["The Kac walk from a coordinate start has a sharp total-variation cutoff at C_BRW n log n, with an explicit constant ≈ 3.8916.","The previously conjectured cutoff location of 2 n log n is false for coordinate starts; the correct constant is larger.","Before the cutoff, the largest squared coordinate remains at scale n^{-β} with high probability, providing a concrete description of the pre-cutoff state.","At the cutoff time, total variation tends to 0, and the proof gives a window of order s n beyond the cutoff for convergence.","The paper conjectures (but does not prove) that the upper bound extends to arbitrary deterministic starts."],"fun_headline_variants":["Kac walk cutoff: constant 3.8916, not 2n log n","Branching random walk sets Kac mixing at 3.8916 n log n","Total variation cutoff for Kac walk at 3.8916 n log n","Conjecture false: Kac walk cutoff time is 3.8916 n log n","Kac on sphere: cutoff constant ~3.8916, not 2"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole threshold rests on the numerical enclosures in Appendix C — specifically the certified bounds C_BRW ∈ [3.89160134, 3.89160138], sup_p (1+p/2)/σ_p < 3.779154, and 2(1-m(p)) - σ_p > 0.03613 — coming from a script that is not included in the preprint; if any of these enclosures is wrong, the choice of p and the threshold c > C_BRW lose their proof.","fun_headline_variants_meta":{"raw":{"variants":["Kac walk cutoff: constant 3.8916, not 2n log n","Branching random walk sets Kac mixing at 3.8916 n log n","Total variation cutoff for Kac walk at 3.8916 n log n","Conjecture false: Kac walk cutoff time is 3.8916 n log n","Kac on sphere: cutoff constant ~3.8916, not 2"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001194,"raw_usage":{"total_tokens":4733,"prompt_tokens":684,"completion_tokens":4049,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":428,"completion_tokens_details":{"reasoning_tokens":3937}},"tokens_in":428,"tokens_out":4049,"duration_ms":32330,"temperature":1.0,"reasoning_tokens":3937,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T05:17:12.487951+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Re-run the certified interval computation for the digamma difference D(p) and the gamma ratio m(p) to higher precision, or check the sign of H(p) = 1 - m(p) - p m(p) D(p) at the interval endpoints 2.41258 and 2.41259; a failure of H(2.41258) < 0 < H(2.41259) would break Lemma 4.6. A Monte Carlo simulation of the Kac walk at times near 3.89 n log n versus 2 n log n would also test the claimed cutoff location.","supporting_citations":[],"review_version":1}