| Local improvement shifts the residual elsewhere | Record the scope and selected structure that improved, the scope and selected structure that worsened, and the new burden created. |
| Universal optimizer is assumed | Treat optimization as bounded residual reduction over declared holon-level refs or declared scope refs, with comparison inputs, pattern for the next question, and stop condition. |
| Proxy result substitutes for comparison or choice claim | When a score, vector, graph partition, front, DSM, or C.29 lens output is used to prefer a candidate, name the selected structures, preserved structure, lost structure, architecture characteristic, and pattern for the next question. |
| Level or scale word is not typed | Recover level, layer, tier, scope, and scale wording through E.10.ARCH, C.30.STRAT, and C.16.P as applicable; recover BOSC, MHT, MET, MFT, and emergence-family wording through E.10 and B.2.P before declaring holon-level refs, scope refs, scale windows, B.2 whole reidentification, or C.32.MLAO residual claims. |
| Software-source overfit | Treat software examples as domain lineage; admit other holons only after selected structures and affected scopes are recoverable. |
| Lossless repair is assumed | Inspect possible new burdens in the affected scopes. Name any expected burden or loss; if none is identified, state the inspected structures, criteria, and evolution window without claiming universal losslessness. |
| Front member is treated as durable optimum | A front member has archive or front membership under an evolution window; membership does not establish a durable architecture optimum. |
| Stepping stone is erased too early | Keep retained stepping stones visible through C.18 or C.19 when they preserve future residual-reduction reach. |
| Architecture-influence residual is hidden | A residual between one typed influence-side architecture source and transformed-side architecture content must open C.32.CONWAY; keep the changed referent and any actual transformation separate, and prepare influence-source-side, transformed-side, joint, and bounded-mismatch candidates as comparison inputs or downstream candidate alternatives. |
| Ideality is used as optimum | Treat ideality as direction for candidate generation, not as an adequacy claim that a bearer may be removed. |
| Universal bearer is admitted without scale window | A general bearer still needs declared criteria rows, scale window, safety and admissibility boundaries, and an eval result when the claim depends on a reading. |
| Functional graph has no feasible bearer | A functional architecture that lacks feasible bearers is an unfit candidate, not an optimized architecture. |