This preprint studies the identification problem for a complete finite temporal interface comprising an earlier event, a later intervention, a complete declared earlier transcript, and all remaining declared outcomes, with chronology and transcript immutability supplied by a separate physical passport. It compares the complete all-trial intervention law with a deliberately broad forward-completion class allowing arbitrary finite hidden memory, common causes, stochasticity, and command-dependent later processing, constrained only by independence of the mechanism producing the earlier transcript from the later command. The principal result is an exact, attained max-command total-variation projection onto this broad forward class. The complete-table distance reduces to the minimax total-variation radius of the command-indexed earlier marginals, and every minimizing center lifts to an optimal forward-completable table that preserves the observed later conditional distributions on positive rows. Supporting results characterize the response-kernel completion fiber through finite barycentric measures and use a spectator-extended OCB construction to illustrate the separation between no-backwards-in-time-signaling compatibility and definite causal order. The paper also delineates the independent evidence required before table-level incompatibility can support a physical backward-signaling interpretation, including verified chronology, immutable record commitment, intervention exogeneity, all-trial retention, ancillary and memory closure, ordinary-route closure, and finite-sample robustness. Status: Preprint; not peer reviewed.
This preprint studies the identification problem for a complete finite temporal interface comprising an earlier event, a later intervention, a complete declared earlier transcript, and all remaining declared outcomes, with chronology and transcript immutability supplied by a separate physical passport. It compares the complete all-trial intervention law with a deliberately broad forward-completion class allowing arbitrary finite hidden memory, common causes, stochasticity, and command-dependent later processing, constrained only by independence of the mechanism producing the earlier transcript from the later command. The principal result is an exact, attained max-command total-variation projection onto this broad forward class. The complete-table distance reduces to the minimax total-variation radius of the command-indexed earlier marginals, and every minimizing center lifts to an optimal forward-completable table that preserves the observed later conditional distributions on positive rows. Supporting results characterize the response-kernel completion fiber through finite barycentric measures and use a spectator-extended OCB construction to illustrate the separation between no-backwards-in-time-signaling compatibility and definite causal order. The paper also delineates the independent evidence required before table-level incompatibility can support a physical backward-signaling interpretation, including verified chronology, immutable record commitment, intervention exogeneity, all-trial retention, ancillary and memory closure, ordinary-route closure, and finite-sample robustness. Status: Preprint; not peer reviewed.
This preprint develops a rigorous framework for certifying open-loop backward signaling from an earlier committed record while distinguishing it from ordinary explanations such as postselection, hidden memory, conditioning, fine-tuning, and measurement dependence. For explicitly defined alternative classes, the paper derives exact finite-alphabet bounds on the observable record distributions, characterizes the corresponding feasible region through three operational cuts, and proves constructive converses showing that every point inside the region admits an ordinary-route realization. It also introduces a scaled gauge of class-relative violation, transport-based robustness bounds, and projection-closed e-processes that provide anytime-valid sequential evidence under optional stopping. Worked examples and exact rational checks illustrate how the framework can be applied in finite-data experiments. The resulting certification is deliberately class-relative: rejection of an audited ordinary-route class does not by itself identify a unique physical mechanism or establish retrocausality in an unrestricted open world. Instead, the framework specifies what must be committed, randomized, retained, audited, and statistically demonstrated before backward signaling becomes a defensible interpretation rather than an artifact of selection or hidden dependence.
This preprint examines conditional operational limits on controllable return to an earlier event within the same physical history. A protocol retaining receiver and payload records permits an opposite-payload intervention, yielding an acceptance-weighted incompatibility bound under explicitly stated event-identification and calibration-transfer assumptions. For finite classical product loops, the analysis distinguishes normalization under every allowed controller from normalization of one selected loop. Results include an exact simultaneous repair frontier for the clean derangement family at arbitrary alphabet size, rational optimum certificates for arbitrary three-symbol kernels, and linear-program certificates for the intervention-uniform normalization repair radius. Higher-alphabet examples demonstrate that a selected loop can be normalized while both components remain input dependent. For a specified quantum Bell circuit, finite-strength record instruments yield analytical acceptance and reported-error formulas, distinguishing increased acceptance from faithful record-dependent control. A three-category compatibility test retains rejected trials and is extended to empirical calibrations through simultaneous finite-sample uncertainty bounds under declared sampling assumptions. A self-contained canonical metric–scalar application motivated by SMSR provides a conditional temporal-function certificate and identifies the additional estimate needed to connect geometric perturbations with changes in record distributions. The work does not establish a universal prohibition of time travel, demonstrate a physical return channel, or physically validate SMSR. Invariant historical event attachment and gravitational backreaction remain additional physical requirements. The deposit includes English and Hungarian manuscripts with technical supplements, source files, exact certificates, and executable reproducibility checks.
Quantum records may be well encoded upstream yet fail to support downstream inference when routing, decoder resources, memory, or comparison channels are restricted. We analyze finite routed quantum-record networks using task-specific Bayes risk. Three exact results provide the constructive core. First, a single Bell-coded pair supplied as the same complete input to GLOBAL and finite-round LOCC-late decoders yields the risk gap qμ/2, where q is pair-delivery probability and μ retained coherence; memory policy determines whether this access is preserved. Second, fixing local binary experiments with error rates 0.20 and 0.30, we determine the entire compatible joint-risk interval [0.15, 0.20] and an attaining decoder with minimax risk 0.20 that does not know the coupling. Third, a binary sufficient-statistic delivery law is attained by a three-record majority compression with nonzero raw risk, yielding a tight physical reconstruction defect. A generated-outcome model gives an exact receiver-availability boundary, while four reduced-description witnesses and continuity bounds delineate when source, state/resource, local-coupling, or clock/memory information is insufficient. The results distinguish record formation, receiver use, memory retention, and task-adequate comparison within standard finite quantum processes. Author manuscript, preprint version 1.0. This manuscript is not a peer-reviewed journal publication. A separate technical Supplement provides complete model definitions, proofs, channel specifications and numerical details. Reproducibility materials are available separately as Software release 1.3 on OSF: https://doi.org/10.17605/OSF.IO/5TDRB. The preprint and reproducibility record are separate, linked scholarly outputs.
This conceptual and methodological quantum-foundations paper defines a finite constrained-record model on a causal poset. At a selected comparison event, specified record labels are compatible exactly when they admit an extension over that event's causal past. The paper proves an entailed-literal closure, restriction to earlier comparison events, structural invariance under constrained-system isomorphism, linear-extension independence, and an exact binary cycle-parity and assignment-count criterion. It also gives a terminating audit method for distinguishing compatibility, entailment, uniqueness, persistence, actualization, and the claimed invariance class.The result is deliberately bounded. Comparison-indexed compatibility may be defeated at a later comparison event. The finite construction does not supply outcome selection, probabilities, collapse dynamics, operational record semantics, Lorentz covariance, or a localized AQFT measurement instrument. A detailed non-transfer ledger identifies the additional structures required before finite order-theoretic consistency could support a claim in local quantum field measurement theory.This is a finite conceptual and methodological note, not a new physical theory or empirical prediction.
Overview This work presents a practical framework for testing whether an already recorded earlier binary outcome can show a genuine dependence on a newly generated later intervention. The main aim is to separate a potentially meaningful fresh-later effect from ordinary explanations such as postselection, setting-dependent loss, readout effects, hidden-variable ambiguity, incomplete trial inclusion, feedback, or other conventional causal paths. Main Contributions The paper develops and combines: a baseline-independent binary interaction measure based on the quarter-log odds ratio; an exact complete-nonselection benchmark showing that, under definite causal order and a later trace-preserving operation, an already finalized earlier marginal remains unchanged; an exact decomposition of observed interaction into true interaction and selection-induced interaction; a constructive demonstration that postselection can reproduce any strictly positive binary conditional table; a latent-selector model showing why a marginal interaction alone does not uniquely identify an underlying mechanism; independent-calibration methods that can turn an ambiguous fit into a testable forward prediction; sharp symmetric and asymmetric bounds for selection effects; systematic-aware effect-size and sample-size planning rules; and an eleven-gate eligibility framework covering chronology, fresh later choice, complete inclusion, readout stability, nonselection, conventional-path exclusion, inference, contamination control, and replication. Scientific Scope This paper provides a framework for decisive testing, not a claim that a nonstandard fresh-later physical effect has already been observed. Existing experiments are used as design and methodology benchmarks. The mathematical results do not by themselves establish retrocausality, future-to-past signalling, a universal physical law, or a unique microscopic mechanism. Reproducibility The work is supported by QDL Research Suite. All software versions are represented by the Zenodo Concept DOI: 10.5281/zenodo.22952901 Paper 8 was specifically validated using QDL Research Suite v1.7.0, permanently archived at: 10.5281/zenodo.23112372 Included Files Main manuscript PDF Supporting Information PDF SHA256 checksum file for integrity verification Paper 8 DOI: 10.5281/zenodo.23114300
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.