This dataset contains the machine-readable certificates and verification cells accompanying the manuscript Constrained Null Geometry: Standard Model Closure, Phases 7–12. The files provide reproducibility support for the minimal CNG closure branch. They include numerical certificates, CSV/JSON outputs, and verification code for the gauge closure, electroweak/Higgs scale, fermion bridge spectra, CKM generation-mismatch sector, and minimal neutrino/PMNS leakage sector. The package also contains a geometric admissibility stress-test cell. This cell checks the internal CNG count registry, determinant-factor metadata, order/sign/branch-status rules, formula-level closure, and alternative-branch stress tests. It is intended as a reproducibility and consistency audit. It does not replace the geometric derivations in the manuscript and appendices. The main closure chain verified by the certificates is: Phase 7 gauge closure→Phase 8 electroweak/Higgs closure→Phase 9 fermion bridge spectra→Phase 10 CKM mismatch→Phase 11 minimal neutrino/PMNS closure→Phase 12 master closure. Phase 7 gauge closure Phase 8 electroweak/Higgs closure Phase 9 fermion bridge spectra Phase 10 CKM mismatch Phase 11 minimal neutrino/PMNS closure Phase 12 master closure. Phase 7 gauge closure→Phase 8 electroweak/Higgs closure→Phase 9 fermion bridge spectra→Phase 10 CKM mismatch→Phase 11 minimal neutrino/PMNS closure→Phase 12 master closure. The heavy-quark charm and bottom entries are labelled as QCD/MS-like audit quantities, not as free-particle pole-mass theorems. The neutrino sector corresponds to the minimal normal-ordering positive Takagi branch. Included materials JSON and CSV numerical certificates Master formula-level verification cell Geometric admissibility and stress-test cell SHA-256 manifest README documentation Reproducibility note Running the included verification cells reproduces the formula-level closure and checks the internal admissibility registry used in the manuscript. The cells are designed for direct execution in Python or Google Colab.
Building similarity graph...
Analyzing shared references across papers
Loading...
Luka Gluvić
Building similarity graph...
Analyzing shared references across papers
Loading...
Luka Gluvić (Thu,) studied this question.
synapsesocial.com/papers/69fecf71b9154b0b8287661e — DOI: https://doi.org/10.5281/zenodo.20071883