The assigner reads which edges are left out from the graph, so one place decides the cycle; the whole graph is judged, a module past the graph's cap included, before the first GraphMost are written. Claude-Session: https://claude.ai/code/session_01JG73KG7AfSdh6FP8VrBqCn