Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Records, Erasers, and Recovery on Causal Posets: Finite Theorems, Boundary Algebras, and Continuum Assumptions for Decoherence, Horizons, and Islands

Petr Sramek

Published May 26, 2026• 0 citations
Publisher

Abstract

This paper develops a finite-dimensional record-algebraic account of decoherence, erasure, boundary records, threshold recovery, islands, entropy ledgers, and modular flow on causal posets. Record creation correlates histories with marker degrees of freedom, and ignoring those markers implements a completely positive trace-preserving dephasing channel. In a fixed history basis the channel is a Schur product, rho -> G ∘ rho, where G is the Gram matrix of marker overlaps. The paper packages this mechanism in causal-poset language: history bases are defined from chains or admissible paths; observer record algebras define branch quotients; conditional eraser instruments restore off-diagonal terms in selected sectors; and boundary record algebras yield observer-indexed coherence kernels. The manuscript treats horizon, Page-time, island, replica, and modular-flow terminology as a conditional dictionary built on finite theorem statements plus explicit continuum or code-subspace assumptions. It includes a claim-proof ledger, a continuum-assumption register, and toy-model or experiment proposals including a two-history MARK/ERASE circuit, a tunable boundary-kernel model, a three-fragment threshold-recovery ledger, and a modular-covariance recovery test. The paper is part of the DAGI observer-theory/foundations track and is version DAGI-OBS-REC-001 v0.3.

DOI
10.5281/zenodo.20401745

Related papers

Quantum Records, Born Structure, and Projective Relativistic History Measures

Ha Minh Dung

We develop a claim-graded theory of quantum records and history measures from completely positive instruments. Class operators and Hilbert-valued event measures generate strongly positive decoherence functionals and a canonical history Hilbert space. In the declared linear-instrument class, event probabilities are affine in the state and additive in effects, hence have Born trace form; an independent physical exponent coordinate is incompatible with this structure. Outcome probabilities factor through effects, whereas conditional post-record states factor through complete CP operations. A single Stinespring dilation yields both the unconditional channel and the conditional states, so no second collapse map is required. In a gap-protected record parent, the fixed algebra retains outcome and CP-operation data while erasing implementation gauge, and its center supplies objective event propositions; nevertheless, deterministic unconditional CPTP evolution cannot select one pure central branch from a mixed central state while fixing all pure branches. Explicit jump–diffusion record dilations realize the same reduced dephasing semigroup with inequivalent path laws, proving that the reduced channel does not select a unique physical unravelling. Competing admissible information and work utilities likewise select inequivalent readouts. Bounded marked-Poisson parents, compensated interaction-picture measures, modularly damped Wick classes, and Boolean–Möbius/Borel-resummed local nets provide projective strongly positive histories in named finite and quasi-local classes. By contrast, global extensive event counts, positive-Poisson continuum uniformization, raw all-Fock absolute semivariation, and fixed final energy damping obey class-level No-Go theorems. The paper establishes no physical -flow, no unique unravelling, no universal utility, no deterministic collapse theorem, and no completed interacting relativistic QFT history measure.

•Aug 14, 2026•0 citations

Relational Information, Classical Records, and Preparation-Aware Quantum Recovery

Qingchun Zhang

This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.

•Sep 10, 2026•0 citations

Modular Entropy Retrieval in Black-Hole Information Recovery: A Proper-Time Saturation Model

E.H. Cooper

We derive a causal law of observer-indexed entropy retrieval: retrieved reference information grows toward the supply available to a finite observer. A recorded admission-and-readout instrument produces orthogonal operational sectors from arbitrary coherent radiation; exact diary fidelity and decoupling give the flagged family, while branch errors bound its approximate realization. An exact quantum transfer channel yields the remaining-gap law and its continuous Lindblad evolution. The channel has an explicit unitary collision realization: admitted reference information moves from radiation to memory, while the capture record remains diary-blind. Its memory marginal is the Choi state of an erasure channel, giving an intrinsic positive-coherent-information boundary at retrieved fraction r = 1/2. A strip-holomorphic modular speed limit bounds how rapidly the channel can activate, with the hyperbolic tangent selected uniquely at extremality. The integrated retrieval dose is invariant under a change of clock, making the Kerr lapse cancellation one geometric instance of a general result. At fixed supply and kinetic rate under an affine clock, the transfer and activation laws compose into a closed proper-time retrieval trajectory on the equality branch, identify that trajectory as the sharp fastest-retrieval envelope, and fix the earliest admissible retrieval horizon. In the continuum formulation, Araki relative entropy defines retrieval on restricted observable algebras, and a split Type-I factor provides the regulated density-operator representation. The experimental program follows the same causal sequence through retrospective analysis and staged intervention. Tier 0A determines whether archived analog-horizon data retain the shot-level, timing, protocol, and processing information needed to ask the retrieval question. Tier 0B then tests whether qualifying data contain observer-, protocol-, readout-, or analysis-operator-indexed correlation structure that standard pooling or filtering suppresses. A positive Tier 0B result identifies retrieval-relevant structure and motivates Tier 1; it does not by itself confirm the complete law. The prospective Tier 1 BEC program targets the held-out g²(t₁,t₂) surface, bandwidth scaling, and protocol dependence. Independent activation readout tests the modular bound and tanh rigidity. Reference-tagged supply and memory test cumulative dose, composite-hazard recovery, degraded-channel ordering, and two-memory allocation. The v2 verification artifact provides synthetic benchmarks and numerical consistency checks at bond dimensions D = 4 and D = 8 for the transfer law, inverse recovery, finite-resolution robustness, and matched adversarial alternatives. Standard RT/HRT geometry and a separate accessibility functional place the retrieval dynamics within holographic language. The retrieval law closes the observer-local path between global encoding and retained access. Information conservation, radiation encoding, causal collection, finite-observer retrieval, formal reconstruction, and comprehension are distinct physical operations. The black-hole information problem contains a proper-time access dynamics that global entropy accounting alone does not determine. Physical complexity enters through encoding, supply, clock, activation, transfer, retention, and observation. Those layers locate each source of retrieval failure instead of idealizing it away. The theory orders the encoding, supply, and retrieval clocks; distinguishes late supply from early supply through their overlap with future transfer dose; and gives an exact finite-lifetime retrieval criterion. Here rᵢ(τ) is the normalized reference information retained by observer i, eᵢ(τ) is the causally available supply, kᵢ(τ) is the composite access hazard, and τ_char is the characteristic activation scale.

•Jul 21, 2026•0 citations

Relational Quantum Causal Processes: Exact Models, Continuum Limits, and the Boundary of Emergent Gravity

Yipeng Xu

Relational quantum causal processes formulate finite operational contexts as normal positive functionals on local completely positive maps. Response differences generate an influence algebra, and its central projections define jointly readable Boolean events. We develop this starting point through a sequence of exact and controlled models. Fresh-environment unitary collision circuits produce dephasing-exchange kinetics with an exact charge-center fixed algebra, a uniform finite-step limit at fixed response order, and graph-controlled metastable Markov dynamics. An absorbing-state model exhibits a sharp transition between non-Abelian quantum memory and Boolean records. A reversal-covariant defect dynamics generates a locally finite partial order on a restricted graph family without assuming a Lyapunov time. Conditional on a certified order, a positive additive record measure, compactness, and identifiability, we prove subsequential convergence to a Lorentzian metric-measure space, finite reconstruction bounds, and uniqueness of admissible smooth limits. Complementary finite regulators provide controlled tests of modular-to-boost response, null tomography, same-update variational identities, induced quadratic gravity, and compatible common-refinement limits. These results are exact or controlled within their stated models, but they do not yet constitute a single background-independent microscopic law that jointly generates adjacency, time, volume normalization, dimension, signature, nonlinear Einstein constraints, and quantum matter. We therefore present RQCP-QG as a theorem-indexed framework that separates established mechanisms, conditional compositions, and open assumptions.

quant-pharXiv:2607.26672•Jul 30, 2026•0 citations

Record, Erasure, and Distributed Witness Sensitivity on IBM Quantum Hardware: A DAGI Validation Study

Petr Sramek

This manuscript reframes a series of IBM superconducting-qubit experiments as a targeted validation study for the Directed Acyclic Graph Interpretation (DAGI), with emphasis on the operational distinction between \emph{record creation} and \emph{record erasure}, and on how that distinction manifests in different classes of observables. DAGI models quantum processes as a directed acyclic graph of informational events: branching is permitted only when an interaction produces a durable record at the relevant coarse-graining scale, while coherent erasure can restore interference by removing the distinguishing record. We consolidate three falsifier-friendly hypotheses: (H1) remote record activity need not produce a universal ``clock slowdown'' for arbitrary local probes; (H2) remote influence is expected to appear preferentially in observables supported by a relational/entangled substrate; and (H3) the record/eraser distinction should be directly visible in distributed witnesses under strictly pulse-matched controls. Using the C1 ``informational time dilation'' series as the local benchmark, and the T4 remote-closure suite as the nonlocal stress test, we report a split outcome: clock-side remote slowdown remains bounded and proxy-dominated in tested geometries, yet a GHZ-class distributed coherence witness exhibits a large, replicated record-creation (REC) versus reversible sham (SHAM) separation on both ibm_fez and ibm_marrakesh, and is strongly restored by coherent erasure (ERASE). We position this pattern as evidence for observable-selective remote sensitivity that is consistent with DAGI's record/eraser mechanism while remaining conservative about hardware backaction channels.

•Mar 8, 2026•1 citation

Records as Codes: Erasure-Correcting Redundancy, Broadcast Redundancy, and the Architecture of Recoverability

Tomoyuki Uchida

This paper is the seventh 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 objects independently existing within spacetime. Two prior results set up its question. The third paper (Uchida, 2026c) characterized public finality—recoverability of a committed fact by many mutually independent accessors, non-disturbingly and repeatably—as a broadcast redundancy: an effectively classical pointer value proliferated across many disjoint environmental fragments, approximately in the form of spectrum broadcast structure. The fourth paper (Uchida, 2026d) read the evaporating black hole as the regime in which a committed interior record crosses, at the Page time, from hidden to recoverable encoding, reconstructible from the radiation through entanglement-wedge reconstruction; and the parent framework (Uchida, 2026a, §10) had flagged holographic quantum error correction as a place its language of protected, redundantly encoded, locally recoverable records might find content. The present paper makes that content precise as a structure theory of recoverable records, kept separate from any claim of new physics or any suggestion that the framework derives the underlying results. The central claim is conditional and structural. The framework does not claim that every recoverable piece of information is a code, that the universe is literally a quantum error-correcting code, or that AdS/CFT describes our universe. It claims that when information qualifies as an erasure-recoverable record because an encoding preserves a logical degree of freedom—or a logical operator algebra—against a specified family of physical erasures, then that recoverability is formalized as an exact or approximate quantum error-correcting structure, in which each correctable erasure leaves an authorized complementary region supporting a recovery map. That formalization is itself an established mathematical classification; the paper's interpretive contribution is to read the series' recoverable record through it, and to set it against a second, distinct architecture. Broadcast redundancy makes the same effectively classical value legible from many disjoint fragments; erasure-correcting redundancy protects noncommuting logical quantum information by keeping each correctable erased region ignorant of—approximately private with respect to—the protected logical content, while suitable remaining regions recover it. The formal engine of this distinction is the duality between correctability and privacy (the information–disturbance tradeoff), not the no-cloning theorem; no-cloning, with the access structure of quantum secret sharing, survives as the reason independently usable recovery regions for arbitrary unknown logical quantum information must overlap. Three commitments keep the reading honest. First, it separates three senses of "record"—protected logical quantum information, a committed classical record, and a publicly final record—and insists that recovery or decoding restores access to logical quantum information but does not, by itself, commit a classical value; commitment additionally requires measurement, pointer imprinting, decoherence, and stabilization (Uchida, 2026f), and public finality a still later broadcast. Second, holographic quantum error correction is offered as the sharpest worked model of the distinction, with exactly solvable tensor-network toy codes (exact within the model) kept distinct from realistic semiclassical holographic reconstruction beyond those limits (generally treated as approximate), and both from the further question of state-dependence. Third, code-recoverability does not by itself imply public finality: protected quantum information can be recoverable from authorized regions while remaining non-public. The framework relabels code structure as the architecture of recoverability and derives none of it, making no independent empirical prediction. Its disciplined thesis is that codes protect recovery; broadcasts create publicity—different architectures that a single physical history may nonetheless realize in sequence.

•Jun 19, 2026•8 citations
This paper develops a finite-dimensional record-algebraic account of decoherence, erasure, boundary records, threshold recovery, islands, entropy ledgers, and modular flow on causal posets. Record creation correlates histories with marker degrees of freedom, and ignoring those markers implements a completely positive trace-preserving dephasing channel. In a fixed history basis the channel is a Schur product, rho -> G ∘ rho, where G is the Gram matrix of marker overlaps. The paper packages this mechanism in causal-poset language: history bases are defined from chains or admissible paths; observer record algebras define branch quotients; conditional eraser instruments restore off-diagonal terms in selected sectors; and boundary record algebras yield observer-indexed coherence kernels. The manuscript treats horizon, Page-time, island, replica, and modular-flow terminology as a conditional dictionary built on finite theorem statements plus explicit continuum or code-subspace assumptions. It includes a claim-proof ledger, a continuum-assumption register, and toy-model or experiment proposals including a two-history MARK/ERASE circuit, a tunable boundary-kernel model, a three-fragment threshold-recovery ledger, and a modular-covariance recovery test. The paper is part of the DAGI observer-theory/foundations track and is version DAGI-OBS-REC-001 v0.3.
We develop a claim-graded theory of quantum records and history measures from completely positive instruments. Class operators and Hilbert-valued event measures generate strongly positive decoherence functionals and a canonical history Hilbert space. In the declared linear-instrument class, event probabilities are affine in the state and additive in effects, hence have Born trace form; an independent physical exponent coordinate is incompatible with this structure. Outcome probabilities factor through effects, whereas conditional post-record states factor through complete CP operations. A single Stinespring dilation yields both the unconditional channel and the conditional states, so no second collapse map is required. In a gap-protected record parent, the fixed algebra retains outcome and CP-operation data while erasing implementation gauge, and its center supplies objective event propositions; nevertheless, deterministic unconditional CPTP evolution cannot select one pure central branch from a mixed central state while fixing all pure branches. Explicit jump–diffusion record dilations realize the same reduced dephasing semigroup with inequivalent path laws, proving that the reduced channel does not select a unique physical unravelling. Competing admissible information and work utilities likewise select inequivalent readouts. Bounded marked-Poisson parents, compensated interaction-picture measures, modularly damped Wick classes, and Boolean–Möbius/Borel-resummed local nets provide projective strongly positive histories in named finite and quasi-local classes. By contrast, global extensive event counts, positive-Poisson continuum uniformization, raw all-Fock absolute semivariation, and fixed final energy damping obey class-level No-Go theorems. The paper establishes no physical -flow, no unique unravelling, no universal utility, no deterministic collapse theorem, and no completed interacting relativistic QFT history measure.
This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.
We derive a causal law of observer-indexed entropy retrieval: retrieved reference information grows toward the supply available to a finite observer. A recorded admission-and-readout instrument produces orthogonal operational sectors from arbitrary coherent radiation; exact diary fidelity and decoupling give the flagged family, while branch errors bound its approximate realization. An exact quantum transfer channel yields the remaining-gap law and its continuous Lindblad evolution. The channel has an explicit unitary collision realization: admitted reference information moves from radiation to memory, while the capture record remains diary-blind. Its memory marginal is the Choi state of an erasure channel, giving an intrinsic positive-coherent-information boundary at retrieved fraction r = 1/2. A strip-holomorphic modular speed limit bounds how rapidly the channel can activate, with the hyperbolic tangent selected uniquely at extremality. The integrated retrieval dose is invariant under a change of clock, making the Kerr lapse cancellation one geometric instance of a general result. At fixed supply and kinetic rate under an affine clock, the transfer and activation laws compose into a closed proper-time retrieval trajectory on the equality branch, identify that trajectory as the sharp fastest-retrieval envelope, and fix the earliest admissible retrieval horizon. In the continuum formulation, Araki relative entropy defines retrieval on restricted observable algebras, and a split Type-I factor provides the regulated density-operator representation. The experimental program follows the same causal sequence through retrospective analysis and staged intervention. Tier 0A determines whether archived analog-horizon data retain the shot-level, timing, protocol, and processing information needed to ask the retrieval question. Tier 0B then tests whether qualifying data contain observer-, protocol-, readout-, or analysis-operator-indexed correlation structure that standard pooling or filtering suppresses. A positive Tier 0B result identifies retrieval-relevant structure and motivates Tier 1; it does not by itself confirm the complete law. The prospective Tier 1 BEC program targets the held-out g²(t₁,t₂) surface, bandwidth scaling, and protocol dependence. Independent activation readout tests the modular bound and tanh rigidity. Reference-tagged supply and memory test cumulative dose, composite-hazard recovery, degraded-channel ordering, and two-memory allocation. The v2 verification artifact provides synthetic benchmarks and numerical consistency checks at bond dimensions D = 4 and D = 8 for the transfer law, inverse recovery, finite-resolution robustness, and matched adversarial alternatives. Standard RT/HRT geometry and a separate accessibility functional place the retrieval dynamics within holographic language. The retrieval law closes the observer-local path between global encoding and retained access. Information conservation, radiation encoding, causal collection, finite-observer retrieval, formal reconstruction, and comprehension are distinct physical operations. The black-hole information problem contains a proper-time access dynamics that global entropy accounting alone does not determine. Physical complexity enters through encoding, supply, clock, activation, transfer, retention, and observation. Those layers locate each source of retrieval failure instead of idealizing it away. The theory orders the encoding, supply, and retrieval clocks; distinguishes late supply from early supply through their overlap with future transfer dose; and gives an exact finite-lifetime retrieval criterion. Here rᵢ(τ) is the normalized reference information retained by observer i, eᵢ(τ) is the causally available supply, kᵢ(τ) is the composite access hazard, and τ_char is the characteristic activation scale.
Relational quantum causal processes formulate finite operational contexts as normal positive functionals on local completely positive maps. Response differences generate an influence algebra, and its central projections define jointly readable Boolean events. We develop this starting point through a sequence of exact and controlled models. Fresh-environment unitary collision circuits produce dephasing-exchange kinetics with an exact charge-center fixed algebra, a uniform finite-step limit at fixed response order, and graph-controlled metastable Markov dynamics. An absorbing-state model exhibits a sharp transition between non-Abelian quantum memory and Boolean records. A reversal-covariant defect dynamics generates a locally finite partial order on a restricted graph family without assuming a Lyapunov time. Conditional on a certified order, a positive additive record measure, compactness, and identifiability, we prove subsequential convergence to a Lorentzian metric-measure space, finite reconstruction bounds, and uniqueness of admissible smooth limits. Complementary finite regulators provide controlled tests of modular-to-boost response, null tomography, same-update variational identities, induced quadratic gravity, and compatible common-refinement limits. These results are exact or controlled within their stated models, but they do not yet constitute a single background-independent microscopic law that jointly generates adjacency, time, volume normalization, dimension, signature, nonlinear Einstein constraints, and quantum matter. We therefore present RQCP-QG as a theorem-indexed framework that separates established mechanisms, conditional compositions, and open assumptions.
This manuscript reframes a series of IBM superconducting-qubit experiments as a targeted validation study for the Directed Acyclic Graph Interpretation (DAGI), with emphasis on the operational distinction between \emph{record creation} and \emph{record erasure}, and on how that distinction manifests in different classes of observables. DAGI models quantum processes as a directed acyclic graph of informational events: branching is permitted only when an interaction produces a durable record at the relevant coarse-graining scale, while coherent erasure can restore interference by removing the distinguishing record. We consolidate three falsifier-friendly hypotheses: (H1) remote record activity need not produce a universal ``clock slowdown'' for arbitrary local probes; (H2) remote influence is expected to appear preferentially in observables supported by a relational/entangled substrate; and (H3) the record/eraser distinction should be directly visible in distributed witnesses under strictly pulse-matched controls. Using the C1 ``informational time dilation'' series as the local benchmark, and the T4 remote-closure suite as the nonlocal stress test, we report a split outcome: clock-side remote slowdown remains bounded and proxy-dominated in tested geometries, yet a GHZ-class distributed coherence witness exhibits a large, replicated record-creation (REC) versus reversible sham (SHAM) separation on both ibm_fez and ibm_marrakesh, and is strongly restored by coherent erasure (ERASE). We position this pattern as evidence for observable-selective remote sensitivity that is consistent with DAGI's record/eraser mechanism while remaining conservative about hardware backaction channels.
This paper is the seventh 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 objects independently existing within spacetime. Two prior results set up its question. The third paper (Uchida, 2026c) characterized public finality—recoverability of a committed fact by many mutually independent accessors, non-disturbingly and repeatably—as a broadcast redundancy: an effectively classical pointer value proliferated across many disjoint environmental fragments, approximately in the form of spectrum broadcast structure. The fourth paper (Uchida, 2026d) read the evaporating black hole as the regime in which a committed interior record crosses, at the Page time, from hidden to recoverable encoding, reconstructible from the radiation through entanglement-wedge reconstruction; and the parent framework (Uchida, 2026a, §10) had flagged holographic quantum error correction as a place its language of protected, redundantly encoded, locally recoverable records might find content. The present paper makes that content precise as a structure theory of recoverable records, kept separate from any claim of new physics or any suggestion that the framework derives the underlying results. The central claim is conditional and structural. The framework does not claim that every recoverable piece of information is a code, that the universe is literally a quantum error-correcting code, or that AdS/CFT describes our universe. It claims that when information qualifies as an erasure-recoverable record because an encoding preserves a logical degree of freedom—or a logical operator algebra—against a specified family of physical erasures, then that recoverability is formalized as an exact or approximate quantum error-correcting structure, in which each correctable erasure leaves an authorized complementary region supporting a recovery map. That formalization is itself an established mathematical classification; the paper's interpretive contribution is to read the series' recoverable record through it, and to set it against a second, distinct architecture. Broadcast redundancy makes the same effectively classical value legible from many disjoint fragments; erasure-correcting redundancy protects noncommuting logical quantum information by keeping each correctable erased region ignorant of—approximately private with respect to—the protected logical content, while suitable remaining regions recover it. The formal engine of this distinction is the duality between correctability and privacy (the information–disturbance tradeoff), not the no-cloning theorem; no-cloning, with the access structure of quantum secret sharing, survives as the reason independently usable recovery regions for arbitrary unknown logical quantum information must overlap. Three commitments keep the reading honest. First, it separates three senses of "record"—protected logical quantum information, a committed classical record, and a publicly final record—and insists that recovery or decoding restores access to logical quantum information but does not, by itself, commit a classical value; commitment additionally requires measurement, pointer imprinting, decoherence, and stabilization (Uchida, 2026f), and public finality a still later broadcast. Second, holographic quantum error correction is offered as the sharpest worked model of the distinction, with exactly solvable tensor-network toy codes (exact within the model) kept distinct from realistic semiclassical holographic reconstruction beyond those limits (generally treated as approximate), and both from the further question of state-dependence. Third, code-recoverability does not by itself imply public finality: protected quantum information can be recoverable from authorized regions while remaining non-public. The framework relabels code structure as the architecture of recoverability and derives none of it, making no independent empirical prediction. Its disciplined thesis is that codes protect recovery; broadcasts create publicity—different architectures that a single physical history may nonetheless realize in sequence.