{ "policyVersion": "2026.10-1", "mode": "theoretical", "evaluatedAt": "2026-10-31T02:16:40.282Z", "gates": [ { "gate": "attempt.final", "severity": "hard", "status": "pass", "message": "worker attempt completed and run not cancelled", "evidence": {} }, { "gate": "worker.real", "severity": "hard", "status": "pass", "message": "artifacts come from a real worker", "evidence": {} }, { "gate": "contract.artifacts", "severity": "hard", "status": "pass", "message": "all 18 mode-required artifacts present", "evidence": { "mode": "theoretical" } }, { "gate": "checksums.valid", "severity": "hard", "status": "pass", "message": "all stored digests match and checksums.sha256 agrees", "evidence": { "artifacts": 2376 } }, { "gate": "feasibility.ok", "severity": "hard", "status": "pass", "message": "preflight judged the study feasible with no outstanding approvals", "evidence": {} }, { "gate": "metadata.valid", "severity": "hard", "status": "pass", "message": "manuscript metadata and LaTeX source are well-formed", "evidence": { "title": "Sharp Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5)", "keywords": 7 } }, { "gate": "pdf.valid", "severity": "hard", "status": "pass", "message": "26 pages, 68635 text chars, 5/5 fonts embedded", "evidence": { "pages": 26, "fonts": [ "/IHAIZV+LibertinusSerif-Regular-Identity-H", "/BZIVMZ+LibertinusSerif-Bold-Identity-H", "/IXFAWU+LibertinusMath-Regular-Identity-H", "/TQTHRL+LibertinusSerif-Italic-Identity-H", "/YEUUOC+LMMonoLt10-Regular-Identity-H" ] } }, { "gate": "disclosure.present", "severity": "hard", "status": "pass", "message": "PDF carries working-paper, AI-generation, non-peer-review and MacLustr statements", "evidence": {} }, { "gate": "pdf.title_matches", "severity": "soft", "status": "pass", "message": "PDF text contains the declared title", "evidence": {} }, { "gate": "references.verified", "severity": "hard", "status": "pass", "message": "19 cited keys all verified (20 sources)", "evidence": { "cited": 19, "sources": 20 } }, { "gate": "references.identifiers", "severity": "soft", "status": "pass", "message": "every bib entry carries an identifier", "evidence": {} }, { "gate": "references.count", "severity": "soft", "status": "pass", "message": "20 sources", "evidence": {} }, { "gate": "claims.traced", "severity": "hard", "status": "pass", "message": "13 key claims mapped to verified sources or artifacts", "evidence": {} }, { "gate": "results.consistency", "severity": "hard", "status": "pass", "message": "77/77 registered values found verbatim in the manuscript or results reports", "evidence": { "found": 77, "total": 77 } }, { "gate": "execution.evidence", "severity": "hard", "status": "pass", "message": "12 logged execution(s), 293 code files", "evidence": { "reproOk": false, "okEntries": 12, "codeFiles": 293, "mismatched": 0 } }, { "gate": "reproduction.clean", "severity": "soft", "status": "warn", "message": "reproduce.sh exited with null", "evidence": {} }, { "gate": "data.provenance", "severity": "hard", "status": "skip", "message": "not required for this mode", "evidence": {} }, { "gate": "theory.formal", "severity": "hard", "status": "pass", "message": "formal statements, proofs and a counterexample/robustness note are present", "evidence": {} }, { "gate": "review.completed", "severity": "hard", "status": "pass", "message": "independent review round 1: 8 findings, 0 open blockers, recommendation minor_revision", "evidence": { "rubric": [ { "dimension": "novelty_relevance", "score": 4, "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." }, { "dimension": "scientific_validity", "score": 5, "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." }, { "dimension": "evidence_traceability", "score": 4, "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." }, { "dimension": "reproducibility_robustness", "score": 4, "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." }, { "dimension": "manuscript_craftsmanship", "score": 4, "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." }, { "dimension": "integrity_disclosure", "score": 5, "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." } ], "recommendation": "minor_revision" } }, { "gate": "review.majors", "severity": "soft", "status": "pass", "message": "no open major findings", "evidence": {} }, { "gate": "review.rubric", "severity": "soft", "status": "pass", "message": "rubric average 4.33/5", "evidence": {} }, { "gate": "secrets.none", "severity": "hard", "status": "pass", "message": "no credential patterns or dangerous executables in artifacts (3 vendored compiled libraries excluded from publication)", "evidence": { "excludedBinaries": [ ".pydeps/pycard.cpython-314-darwin.so", ".pydeps/pyformula.cpython-314-darwin.so", ".pydeps/pysolvers.cpython-314-darwin.so" ] } }, { "gate": "abstract.length", "severity": "soft", "status": "pass", "message": "314 words", "evidence": {} }, { "gate": "profile.evidence", "severity": "soft", "status": "pass", "message": "mode theoretical requires: formal-statements, derivations-or-proofs, counterexample-search", "evidence": {} } ], "publishable": true, "hardFailures": [], "warnings": [ "reproduction.clean: reproduce.sh exited with null" ], "synthetic": false }