Topology (13 nodes, the loop)

The executor's runtime graph:

text

1
2
3

read_plan -> ingest_plan -> honor_gates -> build_context ->
schedule_steps -> execute_step -> precommit_gate -> verify_dod ->
post_step_review -> checkpoint_route -> coverage_and_report -> closure_gate

With a per-step loop back-edge: checkpoint_route -> schedule_steps (capped at 200 retries).

Node	Type	Purpose
`read_plan`	deterministic	Read the plan file (fs.read_text)
`ingest_plan`	deterministic	Normalize and validate the plan (plan.normalize_md)
`honor_gates`	reasoning	Check plan-declared gates and defects
`build_context`	reasoning	Build execution context for the current step
`schedule_steps`	reasoning	Select the next ready step(s)
`execute_step`	reasoning (HITL)	Execute the current step (exit-11 pause)
`precommit_gate`	reasoning	Classify effects, gate irreversible actions
`verify_dod`	reasoning (HITL)	Independent DoD verification (exit-11 pause)
`post_step_review`	reasoning	Review step results, update state
`checkpoint_route`	reasoning	Decide: advance to next step or halt
`coverage_and_report`	reasoning	Check overall coverage, generate report
`closure_gate`	deterministic	Final wiring-check + coverage closure (code)
`human_gate`	HITL	Block on uncertain outcomes