Extinction Depth and q-ary Error-Correcting Codes for the Limited Permutation Channel: Reproducibility Package

This record contains the complete reproducibility package accompanying the manuscript “Extinction Depth and q-ary Error-Correcting Codes for the Limited Permutation Channel.” It provides deterministic source-code verifiers, exact finite certificates, canonical inputs and outputs, reproduction instructions, and SHA-256 integrity manifests for the computer-assisted claims in the manuscript. The archived computations cover the ternary extinction depths 24 and 36, directed detecting depth 11, the correction-corridor computation for \(3 \leq K \leq 60\), the five-ary two-stage construction, the short correcting permutation codes used in run-wise lifting, the exact run-wise matrix inequality yielding an asymptotic loss factor below \(1.82560995\), and the finite multiset-cover certificates underlying the general q-ary length-six upper bound. As a separate endpoint refinement, the package also contains a binary length-18 clique-cover certificate with 4092 cliques, which yields a strict improvement over the general bound at \(q=2\). All archived verification decisions are deterministic and use exact combinatorial or integer computations. No random seed, external solver, or proprietary software is required. The mathematical proofs and the derivation of the general q-ary conclusions remain in the associated manuscript.