The Directed Acyclic Graph Interpretation (DAGI) represents physical processes as a single locally finite directed acyclic graph of informational states, records, and admissible updates. This note refines the meaning of ``branch'' inside that ontology. A branch is not an ontologically duplicated universe, an arbitrary subset of nodes, or a complete microscopic path. It is an \emph{observer-local causal accessibility sector}: the strict quotient of a record-conditioned causal cone by exact indistinguishability over the accessible record algebra of a specified observer or observable class. The local temporal asymmetry of a node is expressed without adding a stochastic primitive to the ontology: the resolved past is the set of persistent accessible records, while the unresolved future is the set of admissible record-candidates that may become persistent records along directed continuations. Interference is described as amplitude-level evaluation over histories that share the same persistent-record trace, where concurrent accessible records are retained as a partial order rather than forced into a linear word. A distinguishing record refines a coherent macro-node into subnodes; erasure coarsens the accessible record trace and can restore conditional interference classes. In strict graph language, nodes are coarse-grained informational states or events, edges are admissible update relations that change downstream reachability or distinguishability, and records are topologically persistent updates whose distinguishing descendants remain accessible beyond the local decorrelation scale. Charge, field, observer, branch, and connection are not additional ontological entities above the graph, but coarse-grained descriptions of stable subgraph structure and reusable edge-update rules. Causal-cone posets provide a natural computational representation of such accessibility sectors, while powerset decompositions remain useful but physically less structured baselines. The resulting branch ontology is concise: the global DAG contains the admissible informational structure; a local observer occupies a record-conditioned accessibility sector; persistent records refine that sector; admissible record-candidates define possible future refinements; erasure coarsens it; macro-nodes quotient inaccessible micro-variation; and physically meaningful posets are those that track causal accessibility rather than arbitrary set membership. Keywords: DAGI, causal cones, observer-local branching, causal accessibility, posets, quantum erasure, higher-order information, emergent spacetime, relational quantum mechanics, macro-nodes, charge-conditioned edge composition
The Directed Acyclic Graph Interpretation (DAGI) represents physical processes as a single locally finite directed acyclic graph of informational states, records, and admissible updates. This note refines the meaning of ``branch'' inside that ontology. A branch is not an ontologically duplicated universe, an arbitrary subset of nodes, or a complete microscopic path. It is an \emph{observer-local causal accessibility sector}: the strict quotient of a record-conditioned causal cone by exact indistinguishability over the accessible record algebra of a specified observer or observable class. The local temporal asymmetry of a node is expressed without adding a stochastic primitive to the ontology: the resolved past is the set of persistent accessible records, while the unresolved future is the set of admissible record-candidates that may become persistent records along directed continuations. Interference is described as amplitude-level evaluation over histories that share the same persistent-record trace, where concurrent accessible records are retained as a partial order rather than forced into a linear word. A distinguishing record refines a coherent macro-node into subnodes; erasure coarsens the accessible record trace and can restore conditional interference classes. In strict graph language, nodes are coarse-grained informational states or events, edges are admissible update relations that change downstream reachability or distinguishability, and records are topologically persistent updates whose distinguishing descendants remain accessible beyond the local decorrelation scale. Charge, field, observer, branch, and connection are not additional ontological entities above the graph, but coarse-grained descriptions of stable subgraph structure and reusable edge-update rules. Causal-cone posets provide a natural computational representation of such accessibility sectors, while powerset decompositions remain useful but physically less structured baselines. The resulting branch ontology is concise: the global DAG contains the admissible informational structure; a local observer occupies a record-conditioned accessibility sector; persistent records refine that sector; admissible record-candidates define possible future refinements; erasure coarsens it; macro-nodes quotient inaccessible micro-variation; and physically meaningful posets are those that track causal accessibility rather than arbitrary set membership. Keywords: DAGI, causal cones, observer-local branching, causal accessibility, posets, quantum erasure, higher-order information, emergent spacetime, relational quantum mechanics, macro-nodes, charge-conditioned edge composition
Context: This manuscript serves as the foundational ontology paper for the Directed Acyclic Graph Interpretation (DAGI) research program at Whytics. Abstract: Quantum mechanics is remarkably successful in predicting experimental outcomes, yet it remains conceptually challenging: the status of the wavefunction, the meaning of "measurement", and the origin of the arrow of time are still debated. We propose an interpretation grounded in information theory and graph theory, representing quantum histories as a single Directed Acyclic Graph (DAG) of informational states. In this model, nodes represent quantum informational states (density operators) and directed edges represent physical interactions that update those states. Branching occurs precisely when an interaction creates a durable, distinguishable record that cannot be coherently erased at the relevant scale; decoherence corresponds to record proliferation into the environment; and quantum erasure corresponds to coherent record removal that can re-enable interference by merging previously distinguishable histories. Furthermore, we prove a Kolmogorov Consistency Theorem for finite-amplitude DAGs, guaranteeing that the framework yields a coherent probability measure on the decohered quotient graph and exactly recovers unitary Schrödinger evolution in the non-branching limit. We show how this ontology resolves standard quantum paradoxes without introducing ambiguous collapse postulates or an ontological multiplication of worlds, and we outline auxiliary operational predictions motivated by the model. In particular, DAGI motivates an "informational time dilation" program: an operational clock's inferred progress decreases with the rate of irreversible record creation under schedule-matched controls, and increases toward baseline when records are coherently erased. We additionally report initial IBM Quantum hardware results from the C1-LC program regarding light-cone transport, motivating a refined conformal hypothesis for how time and causal structure emerge from record density. Key Highlights: Novel Ontology: Replaces the ontological extravagance of the Many-Worlds Interpretation with a single, strictly causal DAG of informational records. Mathematical Rigor: Provides a mathematically rigorous Kolmogorov Consistency Theorem for finite-prefix cylinder sets, resolving standard measure-theoretic pathologies in history-based interpretations. Paradox Resolution: Resolves Wigner's Friend, Delayed Choice, and Schrödinger's Cat paradoxes through an explicit mathematical graph-refinement logic. Hardware Testability: Formulates the theoretical foundation for operational time dilation and causal-cone transport limits actively being benchmarked on IBM superconducting quantum processors.
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.
Context: This manuscript serves as the foundational quantum mechanics capstone for the DAGI (Directed Acyclic Graph Interpretation) research program at Whytics. It provides the computable, hardware-verified kinematic engine required to complete Relational Quantum Mechanics (RQM) and resolve macroscopic measurement paradoxes. Abstract: The tension between unitary evolution and irreversible wavefunction collapse is acutely encapsulated in the Wigner's Friend paradox and extended no-go theorems. While relational frameworks (e.g., Relational Quantum Mechanics) posit that physical states are inherently observer-dependent, they have historically lacked a computable kinematic mechanism to determine exactly \emph{when} and \emph{for whom} a measurement becomes an irreversible fact. Here, we introduce \emph{Observable-Selective Branching} within the Directed Acyclic Graph Interpretation (DAGI). We propose that wavefunction collapse is not a universal foliation of spacetime, but a topological phase transition governed by the mereological complexity of the observer. Using M"obius inversion on Boolean subset lattices, we define an observable's "informational cross-section" by its irreducible synergistic support (interaction order k). A macroscopic record induces irreversible branching relative to an observable if and only if the record intersects that topological support. Crucially, we test this topological stratification experimentally on IBM superconducting processors (\texttt{ibm_fez}, \texttt{ibm_marrakesh}). Under strictly pulse-matched controls, we demonstrate a "split outcome": a spatially separated physical record produces a bounded/null effect on a highly localized k=1 probe (an operational clock), confirming unitary isolation for the simple observer. Simultaneously, the identical record drastically suppresses a distributed k≥3 GHZ-class coherence witness, confirming collapse for the complex observer. Finally, we demonstrate that applying a coherent quantum-eraser control actively un-branches the graph, restoring global coherence. These hardware results provide a physical mechanism for relational quantum mechanics, demonstrating that the objective, universally shared "global stage" of classical reality is simply the thermodynamic limit of observable-selective branching. Key Highlights: Resolution of Wigner's Friend: Replaces the philosophical ambiguity of the measurement problem with a strict, computable topological boundary based on Möbius interaction order (k). Observable-Selective Collapse: Demonstrates mathematically and empirically that wavefunction collapse is not a universal scalar event, but a relational graph-cut bounded by the observer's informational cross-section. Hardware Validation: Translates the Wigner's Friend paradox into a concrete, schedule-matched validation suite on IBM superconducting hardware, proving that low-complexity probes bypass records while high-complexity probes suffer irreversible collapse. Topological Healing: Proves via coherent erasure (ERASE) that measurement backaction is a programmable, informational structure rather than irreversible thermodynamic hardware damage. Bridge to Quantum Darwinism: Explains the emergence of an objective macroscopic reality as the thermodynamic limit of observable-selective branching for dense, macroscopic (k≈1023) entities.
Why do coherent causal alternatives contribute to a sum over histories, and why are detector outcomes described by quadratic measures? This article addresses these questions separately within Recursive Causal Closure (RCC). On finite directed acyclic networks, recorded causal restitution, additive admission and a specified linear local-response rule give an exact nilpotent resolvent. Its finite expansion enumerates all admissible directed routes, without separately postulating a sum over paths. Exact elimination of internal events preserves the boundary response and is associative under successive coarse-grainings. When a persistent phase is supplied by the companion temporal analysis, each coherent route acquires an action-dependent complex factor. A separate positive bilateral detector comparison yields a strongly positive quantum measure with no irreducible third-order interference. As a continuum benchmark, the real causal-set chain construction reproduces the massive retarded Klein–Gordon kernel in 1+1 dimensions in expectation, with a controlled variance. A universal continuum path measure, the microscopic quantum generator, Born normalisation and the identification of the action scale with Planck's constant are not yet derived.
This is Paper 157 in the Anaxiomatic Mechanics / pq-Spacetime stack. It develops a finite structural account of quantum measurement based on boundary-supported record formation, decoherence, and global admissible-history closure. In pq-spacetime, measurement is not a fundamental collapse process. A system, apparatus, environment, and observer become incorporated into an enlarged β-boundary whose dynamics stabilize distinguishable record channels. Environmental coupling suppresses accessible interference between incompatible records, while each observer continuation inherits a definite local outcome through its embedding in one stable β-record ledger. The paper distinguishes this branch-local definiteness from the global structure of the theory. The finite amplitude law and No-Fence Principle do not permit admissible history sectors to be deleted by an additional measurement rule. The global metaobject therefore remains closed over the complete admissible-history structure even though individual observers occupy definite record continuations. Collapse is consequently recovered only as an effective conditional update of local access rather than as an ontological destruction of alternatives. The analysis connects measurement directly to the earlier pq-spacetime treatments of entanglement, decoherence, and black-hole information. In each case, reduced access to part of the admissible-history structure can produce locally mixed or effectively classical descriptions without implying destruction of the globally closed state. Born weights are inherited from the prior no-fence scalarization result rather than introduced as an independent measurement postulate. The Measurement Ledger Theorem summarizes the result: quantum measurement is the formation of stable branch-local β-record ledgers through boundary enlargement; consciousness is not a measurement mechanism; primitive collapse and hidden selectors are unnecessary; pointer states correspond to dynamically stable record channels; and the globally admissible history structure remains closed throughout the measurement process. The resulting picture identifies classicality with persistent, redundant record stability rather than with a separate classical ontology. Definite experimental outcomes and globally closed quantum evolution are therefore treated as complementary aspects of the same finite pq-spacetime dynamics.
The DAGI program uses M\"obius inversion on partially ordered sets to decompose an information observable into irreducible contributions. A central methodological question is whether the Boolean powerset is merely a convenient default, or whether the poset should be engineered to match the physical accessibility structure of the experiment. We report a hardware validation of the latter claim on IBM Quantum hardware (\texttt{ibm\_torino}). In repetition-code memory circuits with mid-circuit measurement and reset, we compare two decompositions computed on exactly the same detector-window data: a truncated subset lattice (all detector subsets with ∣S∣≤3) and a reachability-defined causal-cone poset (truncated past cones with rmax=3). Controlled contexts increase two-qubit exposure using barrier-separated canceling two-qubit operations while preserving the ideal logical circuit. Across a single-patch pilot and two multi-patch extensions (P=4 and P=8 far-separated parallel patches), the detector windows contain measurable context signal. The strongest positive result is not raw classification accuracy but \emph{region stability}: top cone-poset regions selected by M\"obius magnitude are highly patch-invariant, whereas subset-lattice top terms are nearly random-like across patches. For P=4 and P=8, normalized top-region Jaccard stability is $\Jnorm_{\cone}=0.505$ and 0.603, while $\Jnorm_{\sub}=0.008$ and −0.001. Out-of-patch classifiers remain only weakly above chance, but multinomial logistic calibration reduces expected calibration error to 0.035--0.079 and removes a large Naive-Bayes calibration artifact. This weak classification is expected: predicting a global two-qubit-load context from one local 12-detector window is a low-SNR domain-generalization task. The mutual information statistic in this experiment is interpreted as an operational proxy for the context-modulated correlated-error footprint, not as a direct measurement of pure topological synergy. We therefore state a conservative conclusion: causal-cone posets expose reusable, patch-invariant macro-region signatures in this repetition-code hardware setting; they are not yet shown to improve logical decoding or to dominate arbitrary subsets in all predictive tasks. The accompanying dataset bundle contains raw detector windows, QPY circuits, explicit poset definitions, fold outputs, and paper-ready tables.