What the equations move—and what they do not select.

The fixed-carrier baseline.

Declare K, signed B, unit metric, initial chain c(0) and the closed generator A. Then c(s) = exp(sA)c(0) is determined and its total support is conserved. The generator acts within one chain space; it does not choose a new complex, trigger a geometry event, or prescribe its state transfer.

A hard gate is a predicate, not an event clock.

Closure and transport-integrity factors determine whether a supplied gate is open. Observing their product generally cannot identify which factor closed it. Under dynamics that depend only on the product, even all pre-event amplitude derivatives can leave the factor states indistinguishable.

Event counts and time.

Scheduling by edge reversal on a bipartite vertex–cell incidence graph is a discrete counting programme. Relative heights and component offsets describe scheduling information. They do not supply a spacetime metric or a clock in seconds.

Likewise, an exact phase period in a matrix flow does not calibrate event duration. The current source catalog includes event-time manuscripts and LC bench/estimator records.

Shape agreement, retention and growth.

Fresh-face attachment proves stacked-ball counts; both chain and star patterns remain possible. A nonregular icosahedral cone is a supplied construction, not evidence that regular tetrahedra universally select that shape.

Refinement has an interface cost.

The October 13 bounded-subdivision candidate transfers part of native support into a residual carrier. Its two-event support ledger is conditional. It does not preserve unit vertex readout or intertwine the unweighted native generators.

The strict interface contract—contraction, unit singleton vertex coefficient, and native-generator intertwining—fails on K₄ → sd K₄ because the incident degree changes from 3 to 7. Changing the readout, weights or event defect creates a new branch.

Record entropy and retained information.

Record entropy depends on declared coarse-graining. Snapshot entropy need not increase; accumulated trajectory information is a different observable. Boundary-memory scaling requires an actual memory carrier and a full account of writing, storage, faults and renewal.

The October 13 receipt apparatus has a 34-slot decomposed write. A 44-slot deadline leaves 10 storage rounds; 32 rounds after writing require 66 total slots. The thermal-gap frontier is a requirement on candidate apparatus, not a native derivation of its gaps or temperature.