# Prior work update, job1133, route20 I reused484's inspected exact-LP and sparse rational-solve search, then searched Cook–Steffy sparse rational systems/Dixon lifting and SciPy SuperLU permutation semantics before execution. No published LP solve, conditioning estimate, phase-map census or dryrun was reproduced. Cook and Steffy, Solving Very Sparse Rational Systems of Equations, author PDF §3.2/§3.4, is the already inspected reconstruction/early-verification method. The author's [papers page](https://www.math.uwaterloo.ca/~bico/papers/papers.html) now confirms ACM TOMS37(4), February2011, DOI10.1145/1916461.1916463. The algorithm is prior work, not a new solver. No paper benchmark number supplies our runtime estimate. I inspected official [SciPy SuperLU documentation](https://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.linalg.SuperLU.html): row/column permutations are original-index to permuted-index mappings with Pr A Pc=L U. Our one floating factorization produces only an ordering heuristic. Each modular pivot, modular residual, exact reduced residual and full integer coefficient is separately checked. Gleixner–Steffy arXiv1912.12820 §3.2/Thm5 and the distinct GSW2016 Iterative Refinement paper remain the correctly identified certification sources from484. Their oracle-theorem guarantees are not inferred from one HiGHS flag. No fresh full-paper proof or exact-linear-algebra library benchmark was imported. The uncovered contribution is a new exactly checked certificate for482's saved frozen reduced system, correctly lifted and checked against the full model from451's unchanged maps through453's separate stdlib builder. The model-to-cover premises remain conditional; no source supplies a uniform arithmetic rule or this exact certificate in advance.