Manuscript Psy04-B@1 · Psy04-B-v1.tex · section · 62c2b6f0

Causal-access ledger

Causal-access ledger · lines 2501–2585

required at the decoder-relevant cut.
Object	Causal-access question	Capacity or law obligation
Object	Causal-access question	Capacity or law obligation
Carrier	Does its retained state reach $D$ ?	Count its realized classical states or quantum dimension.
Controller registers	Can current-input-dependent controller state affect post-cut operations?	Count it jointly; an operation label is not a hiding place for persistent state.
Pulse and preparation logs	Is there any scheduled route back to decoding?	Count retained input-bearing logs; exported inaccessible archives are a different interface.
Timing and readiness	Can the value or stopping time reveal current input or the query?	Specify the clock law and count any retained information.
Shared randomness	Is it independent of fresh $X, J$ and immutable with respect to current-input storage?	Condition the capacity bound on its realized value; predictable queries invalidate freshness.
Quantum spectator	Can it be accessed jointly with the carrier?	Require product independence if omitted. An input-independent marginal is insufficient.
Storage environment	Can it reconnect or supply later feedback?	Include persistent accessible correlations in the cut or specify an enlarged environmental null.
Noise label	Can decoding use the label to correct storage?	Its marginal independence does not make it free. The unlabelled storage threshold assumes no such access.
Failure and erasure flags	Who generates them, and can they depend on input or outcome?	Neutral scoring always has a declared rule. The multiplicative formula requires the independent-flag law.
Scoring copy of $X$	Is there a feedback path to current decoding?	It is excluded from the capacity object only if that path is absent.
Late query	Is it both causally unavailable to encoding and statistically fresh?	Check both properties; graph order alone is insufficient.
Decoder ancillas	Are they fresh product resources or correlated retained assistance?	Count correlated assistance and separate peak from retained occupancy.
Across-run memory	Can it receive current-input information before the current storage cut?	Reapply the complete bottleneck conditional on every past history.
Archived records	Are they merely scored or reused as device inputs?	Any reuse is a new control route. The complete record is not automatically a decoder resource.

A dependency audit certifies only the declared graph. It cannot discover an omitted physical wire or determine the dimension of an undeclared register.