What the table can encode

Use the same finite clock and regular-route pattern as X-B-ST. A finite installed catalogue may contain reports or independently supplied enclosures for

and, when selected, the completed evaluation ${\mathrm{ev}}_{u_i}{\hat{A}}_2[h_i,k_i]$.

Each report records its map identifier, background description, insertion representative, evaluation solution, and normalization convention. The coupling-order label is part of that description; a formal nilpotent coupling is not treated as a nonzero numerical experimental parameter.

These are finite encodings of already defined evaluations. They are not preparation channels from unknown continuum fields. Arbitrary smooth functions and arbitrary real numbers are not assumed to have universal finite exact descriptions.

A nonempty two-map catalogue exists without numerical execution: at $h=k=0$, both evaluations are exactly zero. On the diagnostic subfamily of Proposition prop:conformal, one may choose a post-ramp profile with $\int {\psi }^2\mathrm{d}t=1$, an observation test of integral one later than its support, and $g_0=1$ on that support. Then the second-vertex value is zero and the iteration value is one, while the completed second evaluation is zero. Spatial cutoffs are admissible under the same causal-reserve condition as that diagnostic. This example is a mathematical evaluation, not field acquisition.