Work

Probe-Resolved Hidden Histories in Finite Partition Dynamics

Year: 2026
Type: preprint
Abstract: An exactly updated state monitor can omit information needed by another future observation. We exhibit this separation in a deterministic system of role-relative partitions with two operations, Split and Copy. An arbitrary partition of n labelled data roles can be stored on n+2 roles, starting from one role in n+O(log n) actions. All other rows and all own blocks agree between register states; fixing the stored block-size profile also fixes every local size profile. The register attains the exact one-row capacity of that profile. Its hidden partition can nevertheless be recovered from a single scalar observable: the number of pairs within the witness's foreign blocks. The mixed finite differences of this quadratic response are exactly the stored equivalence relation. A three-action test works without resetting, while one additional selector source enables adaptive reconstruction in O(n log n) actions with O(n²) final roles. We also characterize one-copy queries on binary modules and distinguish fixed-script persistence from state-dependent erasure. These results establish explicit connections between observational equivalence, hidden relational memory, active reconstruction, and query complexity. They provide constructive bounds and reproducible finite tests relevant to state aggregation, provenance analysis, and verification of dynamically evolving relational systems. All results refer to the specified deterministic partition grammar and observation interfaces. The paper does not claim experimental validation or a derivation of quantum or other physical dynamics.
Language: English
Open Access status: green
OpenAlex ID: W7228632685
Cites:
Cited by:
Related to: 10