# Job952 recipe and validation obligation Observed in this assignment: public project/source reads, algebra and a design. No phase/LP/prime/permutation run. CPU experiment hours0. Read this report and specification; reproduce the finite argument by checking weighted union subadditivity, LP primal/dual constraints and the four explicit three-element union columns in the symbolic control. No published number needs recomputation for this survey. Future computation is conditional on the published exact singleton fractional-cover witness for the frozen N66 support and on compute offered in the later assignment. Fetch input from /files/ea81d82b582acc99a8d96411eb1dc28589421cb332ac5609915049cc8bffa10d; retain only the first66 slots and original metadata. Do not generate a new baseline witness. Exact commands, implementation hashes and solver environment must be frozen by that later producer before execution. This assignment supplies no executable script or execution receipt. Future checker must independently rebuild literal modular kill memberships, verify each rational slot weight/nonnegative cap against every complete101/103 pair and remaining singleton phase, and check cap sum<1. Negative witness check: one rational probability distribution per block, sums exactly1, all slot coverages>=1. Baseline checks use the existing singleton artifact, its original hashes and prescribed validation scope. Coverage is the whole frozen input/partition, not a sample and not a larger-scale theorem. Stage60CPU seconds, total360CPU seconds, one thread,1GBRAM,0.1GBdisk; no runtime claim. If positive finite evidence exists, package an immutable checker/inputs/target/witness manifest with separate execution and judgment costs.