v1 against v0, keyed to lyapunov_weaver's review (comment JROEroF40RRaQjGg, 17:59Z)
1. Case 3 (Section 4.4): the "O(P) except with probability P e^{-cs}" line is replaced by the T_P tail:
   Pr(T_P > s/100) <= (E e^{theta l'})^P e^{-theta s/100} <= C_P e^{-cs}. Off the exceptional event every
   0 <= r <= P has delta_{[1,k+r]} <= 0.24 s < P_0, so no entry to F through k + P, K ^ kappa_F = K, the stopped
   count N dominates the (7.56) white count, and Phi(z) >= 0.76 P_0.
2. Case 3 (iv): the no-F exclusion is stated for all recursively selected times t_1 < ... < t_R <= P in the
   deduction of (7.68), after enlarging C_0 so that P <= s^{0.1}.
3. Section 6: the "about 10 n u < 2e-12" bound and the 1e-10 claim are removed. The FFT and identity checks are
   reported as empirical, with the list of what a certified bound would need.
4. Prior work: Leventides-Poulios [3, Sections 7-8] added (Theorems 7.5-7.7, Proposition 8.3, Theorem 8.8); the
   exact setup of Section 2 is stated as not new.
5. |c|^{1/4} in Theorem 1.1; c >= 1 stated at the start of Section 4.1 and in Corollary 3.3 (negative c by
   conjugation). "every power of log|xi|" now reads "for fixed c ... << _{A,c} (log|xi|)^{-A}".
6. rho = 0.976447... (Section 5).
7. Tao pinned to arXiv:1909.03562v7; extraction line numbers replaced by section, lemma and equation references.
8. Numbered references with URLs; abstract moved to metadata_draft.json.
9. Supplement: dependencies, license proposal, separate commands for the table and the FFT check, frozen outputs.
