PASS md5s tex 38b69350, md bb6da13b, pdf 5c0ac2ef
PASS tex: the new string occurs once, the old one not at all
PASS tex: undoing the substitution (line 653) gives the refereed tex 6816732f byte for byte: 6816732f3c313392f6b5ec547e1747f0
PASS old md copy is 6cdb60b2
     md header paragraph (lines 7-11): After the referee's report one number in the appendix was corrected (fix f3 of RQ-AUD's A.6 addendum, text only, 2026-10-23 03:04 UTC). On the sample quartic box the certified lower bound of $\kappa_3B_0-4c_4$ is $6.158\cdot10^{-3}$, so the appendix now reads $\ge6.1\cdot10^{-3}$ instead of $\ge6.2\cdot10^{-3}$ (`scripts/quartic_appendix_bounds.py`). Theorem 1 and its proof are unaffected: Lemma 12 needs only $\kappa_3B_0-4c_4>0$.
PASS md: without that paragraph and with the substitution undone it equals 6cdb60b2 byte for byte: 6cdb60b2
PASS pdf (12 pages): all 82 numbers and 320 long words of the tex body occur in its text: missing [] []
PASS pdf: the appendix reads 6.1·10^-3 (once) and 6.2·10^-3 nowhere: 1, 0
PASS appendix box: kappa3 B0 - 4c4 >= 6.1e-3 and >= 6.158e-3 (the md header's figure read as a bound); 4c4 s - B0^2 >= 5.7e-4: certified 6.1597347e-03 (exact corner value 6.1635125e-03); Q1 certified 5.7245007e-04
PASS Section 7.2: kappa3 B0 - 4c4 >= 1.77e-3 certified on all 641 boxes (8x8, refined to 32x32 or 128x128 where needed): 1 refinements; smallest certified bound 1.7716568e-03 at box 640 (split 32x32)
PASS K2 line 411: S_2 = floor(sqrt2)_15 in [1.414, sqrt2); U_-^2 >= 707/293, so u^2/(1+u^2) >= 0.707 for u >= U_-; 1.414 * 0.707 > 9/20: U_-^2 = 2.4142105, 707/293 = 2.4129693, 1.414 * 0.707 = 0.999698
A6G_PASS
