A Peer-Verification Protocol for a Computer-Assisted Localized Weil Positivity Theorem Candidate through μ=5.001

This paper presents a reproducible peer-verification protocol and artifact bundle for an internally complete, AI-assisted computer-assisted theorem candidate concerning localized Weil positivity through \(1<μ≤5.001\). It is intended to enable independent reproduction, falsification, component-level audit, and formal referee review. It does not claim completion of third-party peer review, positivity at arbitrary support radius, or a proof of the Riemann hypothesis. This methods and verification paper presents a peer-audit protocol for a computer-assisted localized-Weil positivity theorem candidate on the finite parameter range 1 < μ ≤ 5.001. The paper does not announce a peer-reviewed theorem and does not claim the Riemann hypothesis. It decomposes the candidate argument into auditable gates covering artifact integrity, classical Guinand-Weil normalization, the functional-to-Fourier-matrix correspondence, parity reduction, high-frequency and tail estimates, Arb interval certificates in the even and odd sectors, Schur-complement reconstruction, Sobolev test-function closure, and support inclusion. It provides exact hashes, replay commands, expected numerical invariants, failure conditions, a thirty-three-item checklist, and a referee-report template. The companion archive is included so that peers can reproduce the computations and publish scoped audit findings. The paper is intended as a falsifiable baseline and a stepping stone for further finite-radius localized-Weil research.