[Epsirom]

Closes #114. Part of RSI Mode (#118). Builds on #128, where maxRuns replaced edge limits.

What changes

• Validation accepts any cycle. Unconditional, nested, and overlapping cycles, cycles with several entries or exits from any node, and decisions without an exit choice are no longer rejected.
• Closing edges only decide where each round starts. Braid picks them per strongly connected part: it keeps the other edges as ordinary dependencies, and an edge that would complete a cycle closes it instead. Preference for closing: edges into an entry (a node an outside edge enters), then a decision's choice edges, then edges back to nodes listed earlier. Graphs accepted before keep their closing edge, except a rare cycle without an entry where a decision inside it has a choice edge back to an earlier-listed node; its round start can move. That is acceptable because the cycle rules are unreleased since 0.5; docs/compatibility.md notes it. closingEdges(graph) returns them all.
• Exits per round. Edges that leave a cycle wait while any of its nodes reruns. For a cycle closed by a decision's choice edge they still wait for the final round. For an unconditional closing edge they fire in every round: downstream nodes outside the cycle run with each finished round (inactive ones wait for a later round). Round clones are created at the end of the scheduling pass, so exits are admitted before the next round takes the slots; Limit how often a node runs with maxRuns instead of edge limits #128's maxRuns check still applies when a clone is admitted.
• Overlapping cycles that reach a shared node together merge: the first closing edge clones it, the second attaches to the clone as another input.
• Bounds. Cycles are bounded by maxRuns on their nodes (Limit how often a node runs with maxRuns instead of edge limits #128): total runs, never reset per round of an enclosing cycle (tested and documented).
• Cycle notices. Each submission or update that creates cycles emits cycles_created with each new cycle (GraphCycle: nodeIds starting where its rounds start, edges ending with its closing edge, stops = the decision choice edges on it, limitedNodeIds = its nodes with a finite maxRuns; at most 20, with truncated). newCycles(graph, previous?) computes the same list. Pi and DSH braid / braid_update results show it, and flag a cycle with nothing that stops or bounds it, so an accidental test → fix next to fix → test is noticed.
• Pi and DSH tool descriptions, guidance, and READMEs describe the new rules. Pi's display.ts gets only the event-text case the exhaustive switch requires.

Docs

docs/execution-control.md (Cycles, Cycle notices), README graph schema and out-of-scope list, ROADMAP (#114 checked, scope row), and a 0.6 migration subsection in docs/compatibility.md.

Compatibility

Not labelled breaking: existing callers need no changes. TypeScript code with an exhaustive switch over ExecutionEvent needs a case for cycles_created.

Decided: maxRuns never resets

maxRuns is the most runs a lineage can reach, including in a nested cycle across rounds of the enclosing one; it does not reset per round. The owner raises or lowers it by updating the node; since #129, an upsert that only changes maxRuns keeps a started head instead of replacing it.

Tests

New test/cycles.test.ts covers:

• an unconditional cycle with an exit that runs each round, ended at maxRuns
• a nested cycle, and maxRuns counting across outer rounds
• overlapping cycles merging at a shared node
• cycle reports for submissions and updates, and the report cap

Validation and closing-edge tests are updated, and Pi and DSH tests cover the notices. npm run verify passes on main with #128 and #129 (core 309, Pi 195, DSH 69, package smoke).