This record publishes a machine-readable proof dependency index, certifying structural properties of closure documents, implying reproducibility in proofs.
This record publishes the machine-readable proof dependency index accompanying Closing Algebra v18. It includes the canonical dependency graph, a deterministic checker, a machine-generated audit, a cyclic negative test, documentation, and a cryptographic manifest binding the publication. The graph records strict prior logical dependencies among the named results of the four closure documents. The checker validates graph consistency, rejects cycles, computes dependency statistics, transitive reduction, support cones, profile equivalence classes, import signatures, and the paper-level quotient, reproducing the published audit deterministically. The artifacts provide a reproducible dependency index for the published proof presentation. They certify structural properties of the declared dependency graph rather than the mathematical correctness of the underlying proofs.
No takes yet. Share an insight, caveat, or question.
Devin Bostick (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: