A decision graph cannot constrain status writers that bypass it

A pure decision graph cannot by itself prevent premature business-status transitions. Trace three boundaries separately: evidence capture or provider execution, graph calculation, and every writer that can persist the authoritative status. Direct upstream writes or persisted entry overrides can bypass an otherwise correct completion reducer.

Shadow execution tests calculation parity, not authoritative behavior. Likewise, an aggregate calculator may produce a candidate status while the authoritative writer declines to commit because one member lacks a decision. Test complete and incomplete inputs across graph and legacy writers, keep the final trigger reachable, and verify that deferred work will be evaluated again.

Limits: retaining evidence can preserve a later decision only if final evaluation rereads durable current state; it does not guarantee provider retries, scheduling, or that superseded evidence remains binding. The original repository-specific writer topology was not independently repinned and must be rechecked before applying this diagnosis to that codebase.