C.26.2:4.5 - Compound-state decomposition card
When the distributed-state reading is load-bearing, state the decomposition explicitly. Its practical purpose is the canonical EDSE move: ordinary rivals first, carriers second, coordination residue third, admissible use or action invitation fourth.
| Field | Question |
|---|---|
| Whole system | Which collective U.System is being read, and under what boundary? |
| Subsystems | Which locally readable Systems participate as subsystems? Use teams, roles, services, markets, routines, artifacts, or work lanes to locate them while retaining each clue’s own kind. |
| Local state readings | What can be said about each part without inventing a shared inner representation? |
| Correlation or coordination evidence | Which traces, timing, work transfers, commitments, artifact uses, or role-work alignments show coordination? |
| Factorable part | Which part of the behavior is explained by policy, routine, shared stimulus, incentive, dashboard following, or copied artifact? |
| Coordination residue | What remains as a minimal distributed-state reading after the ordinary rival explanations are named? |
| Minimal supported claim | What evidence-bound claim survives for the declared time window and carrier set? |
| Supported action or use | Which planning action, communication action, incident action, routing action, bridge use, evidence use, or decision use may now be taken without exceeding that minimal claim? |