This paper provides the first complete, self-contained trace of a single measurement through all twelve stops of the GCD/UMCP validation spine. The worked example uses three identical voltage readings—the simplest possible input—to demonstrate the full protocol: declaring the axiom, freezing the contract, embedding raw data into bounded trace vectors, computing the six kernel invariants (F, ω, S, C, κ, IC), reconciling the integrity ledger via seam budget closure, classifying the regime through four conjunctive frozen gates, and deriving a three-valued CONFORMANT / NONCONFORMANT / NON_EVALUABLE verdict. The twelve stops are organized into the five stages of the fixed discourse spine: Contract (axiom + frozen parameters), Canon (channel choice + embedding + kernel), Closures (ledger debits and credits), Integrity Ledger (seam residual + regime classification), and Stance (verdict derivation + casepack packaging + operational execution via CLI, Python API, and REST endpoint). Two appendices contrast the homogeneous trace with heterogeneous counterexamples. The geometric slaughter appendix demonstrates how a single near-zero channel destroys the composite integrity IC (geometric mean) while leaving fidelity F (arithmetic mean) apparently healthy—revealing the heterogeneity gap Δ = F − IC as a structural diagnostic. The degenerate-limits appendix establishes the precise arrow of derivation from GCD kernel identities to classical results (AM-GM inequality, Shannon entropy, unitarity, exponential map), showing that each classical formula is what remains when degrees of freedom are removed. All numbers are reproducible from the open-source reference implementation at https://github.com/calebpruett927/GENERATIVE-COLLAPSE-DYNAMICS. The paper serves as the canonical entrance to the GCD formalism.
This paper provides the first complete, self-contained trace of a single measurement through all twelve stops of the GCD/UMCP validation spine. The worked example uses three identical voltage readings—the simplest possible input—to demonstrate the full protocol: declaring the axiom, freezing the contract, embedding raw data into bounded trace vectors, computing the six kernel invariants (F, ω, S, C, κ, IC), reconciling the integrity ledger via seam budget closure, classifying the regime through four conjunctive frozen gates, and deriving a three-valued CONFORMANT / NONCONFORMANT / NON_EVALUABLE verdict. The twelve stops are organized into the five stages of the fixed discourse spine: Contract (axiom + frozen parameters), Canon (channel choice + embedding + kernel), Closures (ledger debits and credits), Integrity Ledger (seam residual + regime classification), and Stance (verdict derivation + casepack packaging + operational execution via CLI, Python API, and REST endpoint). Two appendices contrast the homogeneous trace with heterogeneous counterexamples. The geometric slaughter appendix demonstrates how a single near-zero channel destroys the composite integrity IC (geometric mean) while leaving fidelity F (arithmetic mean) apparently healthy—revealing the heterogeneity gap Δ = F − IC as a structural diagnostic. The degenerate-limits appendix establishes the precise arrow of derivation from GCD kernel identities to classical results (AM-GM inequality, Shannon entropy, unitarity, exponential map), showing that each classical formula is what remains when degrees of freedom are removed. All numbers are reproducible from the open-source reference implementation at https://github.com/calebpruett927/GENERATIVE-COLLAPSE-DYNAMICS. The paper serves as the canonical entrance to the GCD formalism.
This paper provides the first complete, self-contained trace of a single measurement through all twelve stops of the GCD/UMCP validation spine. The worked example uses three identical voltage readings—the simplest possible input—to demonstrate the full protocol: declaring the axiom, freezing the contract, embedding raw data into bounded trace vectors, computing the six kernel invariants (F, ω, S, C, κ, IC), reconciling the integrity ledger via seam budget closure, classifying the regime through four conjunctive frozen gates, and deriving a three-valued CONFORMANT / NONCONFORMANT / NON_EVALUABLE verdict. The twelve stops are organized into the five stages of the fixed discourse spine: Contract (axiom + frozen parameters), Canon (channel choice + embedding + kernel), Closures (ledger debits and credits), Integrity Ledger (seam residual + regime classification), and Stance (verdict derivation + casepack packaging + operational execution via CLI, Python API, and REST endpoint). Two appendices contrast the homogeneous trace with heterogeneous counterexamples. The geometric slaughter appendix demonstrates how a single near-zero channel destroys the composite integrity IC (geometric mean) while leaving fidelity F (arithmetic mean) apparently healthy—revealing the heterogeneity gap Δ = F − IC as a structural diagnostic. The degenerate-limits appendix establishes the precise arrow of derivation from GCD kernel identities to classical results (AM-GM inequality, Shannon entropy, unitarity, exponential map), showing that each classical formula is what remains when degrees of freedom are removed. All numbers are reproducible from the open-source reference implementation at https://github.com/calebpruett927/GENERATIVE-COLLAPSE-DYNAMICS. The paper serves as the canonical entrance to the GCD formalism.
Paper 44 of this sequence closed its U3 construction program at readiness: two budgeted experimental designs — a photonic tapped-switch probe and a circuit-QED recorded-versus-unrecorded differential — and an execution map, a pre-registered decision tree assigning every future measured outcome its pre-committed consequence, with scoring left "by whoever holds the data." Paper 47 then closed the theory-side debt ledger, leaving the executed-measurement route as the corpus's only live route to a framework-forced world-side shift. What 44 did not freeze is the layer between data-in-hand and leaf-adjudicated: shot schemas, exclusion policy, blinding order, stopping rule, claim authority. That unfrozen layer is where a post-data analysis authority could still sit — the researcher degrees of freedom and forking paths of the methodological literature, answered in precision physics by blind analysis and pre-registration. This paper — the forty-eighth in the sequence, opening panel of its Execution Program (Papers 48-50) — freezes exactly that layer, before any laboratory exists, as the template of a handover package executable and adjudicable by strangers: every analysis decision the package will ever need is either frozen here or typed as a named pre-data slot behind a failable acceptance gate, so that once a design-specific instance is accepted, no one — including the author, who operates no laboratory and has made that fact load-bearing — retains a seat from which a future outcome could be re-interpreted. Four document-level layers are delivered. Record layer: field-level shot schemas for both designs, with every field and every raw source typed into an audit or scoring partition; an add-only extension rule; ledger, provenance, and dataset-role conventions; and an exclusion grammar under which every excluded run is a first-class recorded event and every exclusion predicate is outcome-unread by construction. Statistics layer: the estimators, the null-carving formula, a leaf-decision normal form (frozen statistics, thresholds, tie rules per leaf), and the stopping rule, inherited verbatim from Papers 43/44 with the arithmetic re-checked; and a four-stage blinding architecture ending in a scoring stage at which everything is readable and nothing is choosable. Authority layer: a claim-authority table over the map's seven leaves and four post-data speaking roles — the data holder scores; the series designer holds no scoring cell; the decisive leaf is licensed only to the data holder's own successor paper — plus the handover normal form H with a seven-condition acceptance gate, a data-existence certificate with a public deposit obligation, a mock-data challenge typed as non-evidence, and pre-committed unlock conditions for the reserved data papers 49-D/50-D. Verdict layer: a six-check closure audit (leaf coverage; arithmetic consistency; partition admissibility; blinding soundness; exclusion soundness; authority totality), each check mechanical against the delivered artifacts, with the pre-committed either-way verdict ProtocolStatus in {closed, gapped} scoring template closure — an executable package exists per design only as an accepted H-instance. The audit is run and every check passes: closed at the template layer, quarantine register empty. Papers 49 (tap-channel exclusion protocol) and 50 (recorded-unrecorded differential protocol) are unlocked to instantiate H per design; only the unlock-conditioned data papers 49-D/50-D will ever score a datum. The retired authority is the Global Statistician — post-data analytic discretion personified: its authority reading is retired by construction (no analysis decision has a post-data seat left to occupy, the per-design property conferred by each accepted H-instance), its innocence reading by the imported methodological record, and its substantive face — one uniquely correct inference framework — is declined, not refuted. Nothing world-side moves: no datum is scored, no band or floor shifts, the feasibility verdicts stay 44's, U3Status is restated not re-scored; if no laboratory ever executes, the program rests where 44 left it — undecided, with an implementable and now administrable discriminant — a complete record, not a failure.
CT 4.0.2 is the foundational bundle for Complementarity Theory (CT): physical updating modeled as finite committed record crossing an interface aperture under a least-incoherence selection rule, with mathematical setting in synthetic differential geometry (SDG). The paper presents five contributions: (1) A conditional derivation of the local Minkowski interval at a stable aperture in the first-order single-aperture regime, from CT primitives together with named structural inputs (a smooth aperture model, an adapted-frame choice, a posited seam-budget axiom, and a saturating-history existence hypothesis). Every non-theorem input is stated where it enters. (2) A complex-amplitude structure for the soft-commit regime: composition and superposition as operational axioms; the Born probability map definitional, with a named, independently testable interference-order axiom (after Sorkin) as the stated route to its quadratic form; a finite-dimensional Hilbert structure following from the axioms. (3) A multi-subject geometric proposal: intersection-network gluing with subjects anchored at the primitive substrate. The transported Lorentz triangle product is classified as connection loop holonomy — identity marks a flat face — distinct from Čech patch consistency; the U(1) face holonomy is conditionally realized as the normalized third-order Bargmann invariant. (4) A research program for deriving the residue role H from τ₀-substrate structure in complexified SDG, with the Residue-to-Phase problem restated precisely (the in-paper result is narrowed to a valid minimal-compact-factor theorem) and a conjectural horizon-phase quantization ansatz. (5) A conditional phase-to-spin and two-spinor bridge: three orthogonal noncommuting phase flows on a distinguished C² amplitude sector generate SU(2) ≅ Spin(3), with the exact 3-2-3 correspondence and the standard Penrose two-spinor route to Lorentzian geometry — established mathematics whose CT premises are recorded as named open problems. Version note: 4.0.2 is a status-correction erratum revision of the 15 May 2026 deposit (that record carries the Zenodo version label v4.0.1; there is no intermediate content revision). Claims are re-labeled to match what is proved, in nearly every case restoring the labels the supporting notes themselves use. A new supporting note, Identity as History, proves the record/history recurrence dichotomy behind the paper's arrow-of-time remark; the P-bound diagnostic is added with a reflexive audit caveat. The full changelog is Appendix A of the paper. The bundle contains the paper, twelve supporting notes (LaTeX and PDF), two H-program notes, the standalone SDG note, the Malus note, and a navigation README. An AI-assistance disclosure is included in the paper's acknowledgments.
This document is a proof ledger, not a narrative essay. Its purpose is to present the OPR-QM.A derivation chain in a line-by-line audit format, with every major block stated together with its inputs, domain, boundary conditions, regime conditions, derivation steps, outputs, epistemic status, and failure modes. A result is not counted as part of the completed chain unless these items are made explicit. The ledger therefore serves as a forensic derivation spine for the EDC programme on quantum-mechanical appearance from geometry, rather than as a source of new theory claims or upgraded epistemic tags. The core result of the ledger is a precise closure boundary. It shows that the currently available chain does establish an observer-side ratio / asymmetry pathway: the observed ratio |c'_{+1}|/|c'_{-1}| = |P_+(\vartheta)|/|P_-(\vartheta)| is determined by tilt angle and arm geometry and is independent of the unresolved common magnitude |c|. At the same time, the ledger makes equally explicit that the magnitude pathway remains blocked at blocker B1, because the order-parameter field \Phi : M^5 \to S^1 \times S^2 is not dynamical in the declared SEDC action and therefore no Euler–Lagrange equation for \Phi is available. As a consequence, intrinsic coefficient magnitudes, full \alpha,\beta, and general Born probabilities are not derived here. Full OPR-QM.A closure is therefore not achieved. Within that boundary, the ledger records the strongest currently explicit blocks of the chain: the variable inventory of the declared action, the negative well-posedness verdict for \delta S_{\mathrm{EDC}}/\delta\Phi, the conditional Maxwell/KK foothold in the source-free exterior, the failure of the naïve dipole model for co-located Y/\bar Y, the excised annulus boundary-value problem, the arm-resolved C_3 \times Z_2 boundary data and resulting mode-selection rule m \equiv 3 \pmod 6, the partial structural bridge into the \xi-Fourier language via KK Aharonov–Bohm transport, the intrinsic C=T equipartition lemma at \vartheta=0, and the tilt-induced projection-weight asymmetry in the observer-side readout. It also records where later steps depend on external identifications, including the neutron-point interpretation imported from Papers 28–31. The document is intended as an audit-grade reference for readers who want the chain in explicit, checkable form rather than in compressed narrative prose. It is especially useful for distinguishing what is currently [Der], what is [Dc], what is only [I], what remains [Open], and exactly which assumptions are load-bearing at each stage.
After an experiment runs, exactly two decisions could still be made by a person: does this outcome exclude the theory's declared region, or did an auxiliary — source, tap, detector, calibration — fail, voiding the run instead; and who is licensed to say so. Any protocol that leaves either decision open after data exist has left a seat for a post-hoc refutation authority — the Global Falsifier, the imagined adjudicator who owns the modus tollens. Paper 44 of this sequence closed its photonic tapped-switch probe F_A at pre-registration-grade design ("the IV gate itself remains future laboratory work"); Paper 48 froze the shared adjudication layer as a handover template, typing everything design-specific as named pre-data slots behind a failable acceptance gate. What stands between that design and a laboratory's first shot is a single object: a completed, gate-passing handover instance. This paper — the forty-ninth in the sequence, centre panel of its Execution Program (Papers 48-50) — builds that object, the reference instance H_A, at the executable level the template promised. Delivered: the delta specification from the cited apparatus class (the Goswami-type photonic quantum switch) to 44's tapped configuration, component by component against the frozen budget rows; the schema completion with field-level primitives for every field, extensions add-only and partition-admissible; the frozen analysis pipeline in algorithmic normal form — IV gate, measured-calibration transfer, estimators, and the leaf router implementing 48's tap rows verbatim, under a language-independent rounding convention so floating-point artifacts cannot flip a frozen boundary direction — with the reference implementation shipped as a hash-anchored code appendix (deposited companion file) behind a declared production-scoring boundary; the concrete exclusion rule list with its veto-impact report and a frozen post-exclusion N rule disposing shortfall, surplus, and stopping at once; the S1-S4 blinding runbook; and the mock-data challenge, executed in three parts — a deterministic core exhaustive over every router branch and both tie directions, an adversarial set generated through a recorded, deposited exchange by a party in the auditor role that did not implement the scoring code, and a public-beacon-seeded bulk for totality and determinism. All three parts pass; the routing tables are generated by executing the shipped implementation and are typed non-evidence in the sentence that reports them. The acceptance gate is then run condition by condition on the deposited pair. One finding is published along the way: 48's coverage condition, read literally, would force every per-design instance to claim all seven leaves; the pre-committed completion evaluates coverage over the design's assigned leaf subset plus the shared non-execution leaf — an annotation to 48, never a retro-edit. The verdict is InstanceStatus_A = reference-complete, with an empty instance gap register: every gate condition passes, and what remains is ownership — acceptance transfers when a laboratory signs, auditor-reproducibly, over the instance plus its re-gated extensions; reference-complete never shortens to accepted, and an immutable core guarantees that no admissible extension can change what a null excludes, who may say so, or how boundary cases route. Displayed at the close is the channel's frozen exclusion content — the carve a future null already names, [1.7e-1, 2.1] at the conservative corner — beside the pre-priced Duhem escape map. Nothing is carved, scored, or measured; no band or feasibility verdict moves; the data paper 49-D stays reserved behind its unlock conditions. What retires is the interpretive seat: refutation content as a public, frozen, executable object — falsifiability without a Falsifier.
This paper is the forty-second in a sequence developing an interpretive framework that redescribes physical reality as a causally consistent history of information updates rather than as a collection of independently existing objects. It is the recovery panel of the twelfth grouping — the U3 construction program — and it adopts nothing new. Paper 41 adopted, at the claim level L3-A defined there, the common record-history kernel P_ker (one classical-quantum GKSL-type generator whose fixed Lindblad operators are export-event operators driven by a classical, adapted record-export intensity), computed a nonempty admissible coefficient space, and left four obligations to this paper: the recovery conditions RC1/RC2a/RC2b and the single calibration RC3, under a binding ledger (one calibration, spent on lambda_dec only; lambda_diff carried as a gate-bounded prediction band; thresholds never re-tuned). This paper executes them. RC1 is proved as a theorem: in any sector containing no certified export channels, the kernel's matter/order dynamics is exactly unitary — a sector statement, not a coefficient limit, and not a claim that unexported mass ceases to gravitate. RC2a is proved as a bounded-residual theorem: the Newtonian baseline drift is fixed by definition to the imported Newtonian classical-quantum mean dynamics, the export correction is shown to be cell-mean-zero by the decomposition bookkeeping (with the adopted sourcing law's first moment checked — a real failure mode, not realized), and the residual mean-source shift is dipole-suppressed below every declared class tolerance delta_g(class); the honest status row records that no current class co-locates audited export density with a Newtonian-verification measurement, so the world-side probe is today bounded, not probed. RC2b is split in advance: an executed compatibility check — the Jacobson-route hypotheses of Paper 36 reduced row by row to declared criteria with declared tolerances, of which the normalization row is satisfied (G an input, never an output), the entropy-monotonicity row is satisfied under a displayed record-basis pinching condition, and the local-equilibrium and Clausius-defect rows are fixed as criteria whose concrete exhibition and evaluation are assigned to Paper 43's audit program (no row failed; the which-entropy circularity imported as a live defect) — and a typed covariant debt (relativistic microcausality, dressed sources, species), named and not discharged. RC3 is spent exactly once, on the single calibration benchmark declared before any dephasing datum was consumed: the measured measurement-induced dephasing of a dispersively read superconducting qubit (Schuster et al. 2005; channel model Gambetta et al. 2006). The audit is non-vacuous by construction: certified exports are the output-port photons insofar as their field modes are amplified into the retained quadrature record at the declared grain — the certified intensity is nu_eff = eta_cert kappa nbar with eta_cert = eta_ext eta_rec, the output coupling times the record-chain efficiency, both declared as intervals — and the per-event pointer-overlap deficit is computed from the device's spectroscopic parameters (2 chi / kappa = 1.0, so the which-state information is fully exported per photon). The declared linear fit proves mathematically inapplicable at this device's measurement strength, so the extraction is executed as a documented protocol-deviation conservative bound — a declared-tolerance ceiling read against the source's own validated line-shape model, from text-stated quantities only, with a full sensitivity table — and the source's data show no excess dephasing beyond that model: the calibration returns not a point but the pre-declared gate-truncated band Lambda_cal = [5e-5, 2.1], computed at the conservative corner of the declared inputs (including the record-chain efficiency) so the dominant systematics sit inside the band; the two bookkeepings of standard budget and kernel excess are ledger-distinct while the physical carriers may overlap. The band is nonempty, so the normalization survives: lambda_dec is bounded above, for the first time, by a declared-tolerance reading of laboratory line-shape data (a factor of five below Paper 41's illustrative interferometric ceiling at the most conservative record-chain reading, tightening to a factor of fifty under the architecture-level reading), lambda_dec = 0 is never carried (the trade-off floor truncates from below), and the normalized kernel — the lambda_dec band, the lambda_diff prediction band, the computed order coefficient, the unchanged thresholds — is handed to Paper 43. The retired authority is the Global Reducer: the demand that an adopted dynamics earn its standing only by a globally certified exact reduction of the established theories. Its methodological face falls to the construction — exact-but-sector-relative unitarity, on-average Newtonian sourcing over declared classes, imported-route compatibility at declared order, and declared-calibration normalization are how correspondence is legitimately held; its substantive face (one true global reduction) is declined, not refuted. Every result is conditional on P_ker; the calibration datum is spent, never scored; no gate is crossed and no U3 is claimed.