1{2 "policyVersion": "2026.10-1",3 "mode": "theoretical",4 "evaluatedAt": "2026-10-31T02:16:40.282Z",5 "gates": [6 {7 "gate": "attempt.final",8 "severity": "hard",9 "status": "pass",10 "message": "worker attempt completed and run not cancelled",11 "evidence": {}12 },13 {14 "gate": "worker.real",15 "severity": "hard",16 "status": "pass",17 "message": "artifacts come from a real worker",18 "evidence": {}19 },20 {21 "gate": "contract.artifacts",22 "severity": "hard",23 "status": "pass",24 "message": "all 18 mode-required artifacts present",25 "evidence": {26 "mode": "theoretical"27 }28 },29 {30 "gate": "checksums.valid",31 "severity": "hard",32 "status": "pass",33 "message": "all stored digests match and checksums.sha256 agrees",34 "evidence": {35 "artifacts": 237636 }37 },38 {39 "gate": "feasibility.ok",40 "severity": "hard",41 "status": "pass",42 "message": "preflight judged the study feasible with no outstanding approvals",43 "evidence": {}44 },45 {46 "gate": "metadata.valid",47 "severity": "hard",48 "status": "pass",49 "message": "manuscript metadata and LaTeX source are well-formed",50 "evidence": {51 "title": "Sharp Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5)",52 "keywords": 753 }54 },55 {56 "gate": "pdf.valid",57 "severity": "hard",58 "status": "pass",59 "message": "26 pages, 68635 text chars, 5/5 fonts embedded",60 "evidence": {61 "pages": 26,62 "fonts": [63 "/IHAIZV+LibertinusSerif-Regular-Identity-H",64 "/BZIVMZ+LibertinusSerif-Bold-Identity-H",65 "/IXFAWU+LibertinusMath-Regular-Identity-H",66 "/TQTHRL+LibertinusSerif-Italic-Identity-H",67 "/YEUUOC+LMMonoLt10-Regular-Identity-H"68 ]69 }70 },71 {72 "gate": "disclosure.present",73 "severity": "hard",74 "status": "pass",75 "message": "PDF carries working-paper, AI-generation, non-peer-review and MacLustr statements",76 "evidence": {}77 },78 {79 "gate": "pdf.title_matches",80 "severity": "soft",81 "status": "pass",82 "message": "PDF text contains the declared title",83 "evidence": {}84 },85 {86 "gate": "references.verified",87 "severity": "hard",88 "status": "pass",89 "message": "19 cited keys all verified (20 sources)",90 "evidence": {91 "cited": 19,92 "sources": 2093 }94 },95 {96 "gate": "references.identifiers",97 "severity": "soft",98 "status": "pass",99 "message": "every bib entry carries an identifier",100 "evidence": {}101 },102 {103 "gate": "references.count",104 "severity": "soft",105 "status": "pass",106 "message": "20 sources",107 "evidence": {}108 },109 {110 "gate": "claims.traced",111 "severity": "hard",112 "status": "pass",113 "message": "13 key claims mapped to verified sources or artifacts",114 "evidence": {}115 },116 {117 "gate": "results.consistency",118 "severity": "hard",119 "status": "pass",120 "message": "77/77 registered values found verbatim in the manuscript or results reports",121 "evidence": {122 "found": 77,123 "total": 77124 }125 },126 {127 "gate": "execution.evidence",128 "severity": "hard",129 "status": "pass",130 "message": "12 logged execution(s), 293 code files",131 "evidence": {132 "reproOk": false,133 "okEntries": 12,134 "codeFiles": 293,135 "mismatched": 0136 }137 },138 {139 "gate": "reproduction.clean",140 "severity": "soft",141 "status": "warn",142 "message": "reproduce.sh exited with null",143 "evidence": {}144 },145 {146 "gate": "data.provenance",147 "severity": "hard",148 "status": "skip",149 "message": "not required for this mode",150 "evidence": {}151 },152 {153 "gate": "theory.formal",154 "severity": "hard",155 "status": "pass",156 "message": "formal statements, proofs and a counterexample/robustness note are present",157 "evidence": {}158 },159 {160 "gate": "review.completed",161 "severity": "hard",162 "status": "pass",163 "message": "independent review round 1: 8 findings, 0 open blockers, recommendation minor_revision",164 "evidence": {165 "rubric": [166 {167 "dimension": "novelty_relevance",168 "score": 4,169 "evidence": "Complete determination of Z(P(n,5)) with sharp threshold closes the k = 5 case left open by arXiv:2607.19412 and arXiv:2610.24059; referee searches of OpenAlex and arXiv found no other k = 5 results. The lower-bound method is borrowed and credited; the k = 5-specific findings (p = 18 needed, p = 16 provably fails for all n >= 22, inner-pentagon obstruction at n = 25) are a moderate but genuine contribution. Known values (n = 11; 14, 16, 19, 21 via isomorphism; 24 | n second-hand) are correctly labelled as not new."170 },171 {172 "dimension": "scientific_validity",173 "score": 5,174 "evidence": "Propositions 3.4-3.8, 4.1, Lemmas 5.1-5.7 and the assembly of Theorem 1.1 were re-derived by hand by the referee and hold as written (including the index bookkeeping c_max = 14, N_max = 154, and the correctness of both SAT encodings). drat-trim re-run on P26_5_p18_b11 returned s VERIFIED, exit 0. The encoder F(13,p,b) matched a referee brute force of beta_p(13) for p = 3..7. The referee's own enumerator confirmed Z(P(23,5)) >= 12 and Z(P(25,5)) >= 12 with counts identical to the paper's second program; obstruction sets at n = 25 recount to boundary 10."175 },176 {177 "dimension": "evidence_traceability",178 "score": 4,179 "evidence": "Window statistics recomputed from results/tables/boundary_window_p18.csv (129 rows, n = 26..154 complete; totals 12,972.1 s solve, 11,700.7 s check, 346,502,796 proof lines; min/max as stated) match the abstract, Computational Result 7.5 and metrics.json reportedValues. All 20 citation keys are verified in sources/sources.json and resolve in main.tex. Deductions: the certificate directory holds an unrecorded 4 GB DRAT proof for the n = 23 fort-cover formula and CNF/fort files for n = 25 that contradict the manuscript's 'UNSAT without a proof log' statement (M1); data/manifest.json is absent."180 },181 {182 "dimension": "reproducibility_robustness",183 "score": 4,184 "evidence": "Pinned requirements.txt with archived wheels, drat-trim built from source with recorded SHA-256, seeds recorded, one-command reproduce.sh with QUICK/FULL modes; independent checker rebuilds every CNF from the definition. Referee re-verified one certificate and the stored forts for n = 22, 23 and reproduced the n = 23/25 enumerations and ten controls. Deductions: 39 GB of proofs are not shipped so QUICK mode verifies nothing unless the window is regenerated; reproduce.sh omits the n = 26, 27 enumerations and the n = 23, 25 fort-cover runs; Semantic Scholar check unavailable to the referee."185 },186 {187 "dimension": "manuscript_craftsmanship",188 "score": 4,189 "evidence": "25 pages, well organized, theorem/lemma/computational-result distinctions used consistently, figures and tables generated from artifacts and informative (heatmap, obstruction, scaling). Defects: Frucht-Graver-Watkins exceptional cases misstated (n = 13, 26 omitted in Sections 2 and 6); bibliography lowercases protected words (p(n,3), Pysat, Drat-trim, lean 4, cnf, petersen); Figure 2 vertex labels very small; Table 8 partly duplicates Figure 3."190 },191 {192 "dimension": "integrity_disclosure",193 "score": 5,194 "evidence": "Three-valued certification status never collapsed; second-hand attribution of Z(P(24r,5)) = 12 flagged in the introduction, Table 3 and Limitations (one unqualified mention in Section 9); no Lean claim; heuristic searches labelled heuristic; AI-generated / not peer reviewed / MacLustr credit present; pre-registration timestamps verified (conjectures 18:00:31 UTC, first n > 30 certificate 18:01:10, holdout 18:10-19:02); no synthetic data and metadata.json says synthetic: false."195 }196 ],197 "recommendation": "minor_revision"198 }199 },200 {201 "gate": "review.majors",202 "severity": "soft",203 "status": "pass",204 "message": "no open major findings",205 "evidence": {}206 },207 {208 "gate": "review.rubric",209 "severity": "soft",210 "status": "pass",211 "message": "rubric average 4.33/5",212 "evidence": {}213 },214 {215 "gate": "secrets.none",216 "severity": "hard",217 "status": "pass",218 "message": "no credential patterns or dangerous executables in artifacts (3 vendored compiled libraries excluded from publication)",219 "evidence": {220 "excludedBinaries": [221 ".pydeps/pycard.cpython-314-darwin.so",222 ".pydeps/pyformula.cpython-314-darwin.so",223 ".pydeps/pysolvers.cpython-314-darwin.so"224 ]225 }226 },227 {228 "gate": "abstract.length",229 "severity": "soft",230 "status": "pass",231 "message": "314 words",232 "evidence": {}233 },234 {235 "gate": "profile.evidence",236 "severity": "soft",237 "status": "pass",238 "message": "mode theoretical requires: formal-statements, derivations-or-proofs, counterexample-search",239 "evidence": {}240 }241 ],242 "publishable": true,243 "hardFailures": [],244 "warnings": [245 "reproduction.clean: reproduce.sh exited with null"246 ],247 "synthetic": false248}