Repairs to tempting but invalid shortcuts

High-degree graph versus partition schedule. A high-degree stencil alone does not provide fast transport. Endpoint separation and one junction block eliminate the proposed direction-by-direction service bottleneck.

Hub-only estimates. Metric estimates at hubs alone would not establish C2. Theorem thm:metric controls every intermediate site.

An upper cone versus an attained cone. The physical upper bound is exact at every scale, whereas the lower routing loss tends to zero under the same clock.

Boundary timing. Null connections cannot in general be realized with zero discrete lateness. Finite topological-rank delays make them realizable while their support locations converge.

Separate convergence versus matching. Realization is selected once from the common skeleton. Replacing an instrument does not reselect its remote resources, routes, or schedule.

One terminal law versus completion. The local completion retains complete local channels and labelled intervention slots. Example ex:law prevents a law-only identification.

Classical signalling versus quantum identity. The former uses a known classical bit; the latter transports a quantum tensor factor without destructive readout.

A semantic realization versus compilation. Arbitrary finite complete instruments are admitted as semantic block channels. Exact compilation over a particular gate library is a separate theorem, not a consequence of this construction.

Fixed-scale periodicity versus fixed-model rescaling. Each scale is periodic, but its quotient and stencil grow. The family therefore does not contradict the fixed-periodic polytope obstruction.