Construct and traverse a local work graph

In the adopted App and Piping loop, chirality-root:bundled:workflow:construct-local-work-graph turns an intended outcome and route through the established project DAG into executable contributions. Keep one graph for the undertaking across sessions. It can contain design, inquiry, implementation, verification, independent review, integration, and reconciliation. It is an executable plan, not a replacement scope register or another lifecycle authority. Construct a local work graph · App loop · Piping loop

Start by recovering intent. Identify the wanted result, priorities, approach, exclusions, completion conditions, and their sources in steering or decisions. Interpret clear direction without requiring the human to supply node IDs or a finished specification. Clarify only gaps that materially change scope, ordering, effort, or completion. Preserve a pause. If the same undertaking continues, revise its useful graph instead of creating another because the conversation is new. Construct a local work graph §1

Select the smallest coherent route. Locate the deliverables serving the outcome, follow upstream to required inputs, and follow downstream far enough to understand affected consumers. Read current contracts, dependencies, memory source pointers, relevant decisions, implementation, tests, consequential unmerged changes, and legacy Remaining where the accepted basis still requires it. A desired result without a sound deliverable mapping needs an explicit mapping investigation or scope decision; forcing it into a convenient folder conceals the problem. Construct a local work graph §§2–3

The graph owns selected execution against obligations established from steering, the Scope of Work, dependencies and actual work/evidence. It carries assignments, states and closure conditions; memory adds no independent future-work list. New graph-led work needs no Remaining entry. Earlier pinned programs retain their own source populations and execution conventions until an authorized transition. A node can expose a gap or scope question; it cannot create new production scope. Historical plans remain context. Construct a local work graph §2 · Concordance §§2, 6 · App F-APP-5

Give every executable node a meaningful result, stable ID, deliverable mapping, required inputs, write boundary, completion check, current state, and evidence or blocker. Dependencies name the particular condition a node needs: an adopted interface, a checked artifact, a human decision, a review, or an updated record. Keep ownership and informational links distinguishable from prerequisites. “Work on Package 4” does not define a return the parent can assess. Construct a local work graph §§3–4

An illustrative route for a save-recovery undertaking using the revised development arrangement is:

Clarify recovery contract
          |
          v
Implement bounded recovery --> independent review --> repair/backcheck
          |                                         |
          v                                         v
Exercise connected native journey -------------> integrate/check
                                                    |
                                                    v
                              One documentation/governance closeout
                                                    |
                                                    v
                              Terse run entries; final PR review/merge

The diagram describes the revised graph method, subject to the adoption boundary. Its exact ordering, authority, and checks come from the real brief and project. Documents needed as implementation inputs or outputs are produced with that work. An unavailable required native witness keeps its examination open while an independently useful contribution proceeds; it cannot be relabeled complete to finish the diagram. Human manual §§4.2, 4.11 · App checks

Plan substantive PRs around coherent results and include the documentation, reconciliation, and conditional Task Management consequences needed by their slices. After the intended implementation/evidence integration, normally the penultimate merge, place one planned documentation/governance closeout before the final PR. Divide its affected deliverables into bounded comparisons within that stage. Formal closeout does not recur after each ordinary node or PR. Keep decisions, evidence, and required production documents accurate as work proceeds. Human manual §§4.2, 4.11, 5.8

Implementation and record comparison have separate completion conditions. Missing required work returns to the graph and receives an affected backcheck before closeout completes. An intermediate merge or Task Management transfer cannot discharge it. Construct a local work graph §3 · Bounded reconciliation

The revised method requires the adopting App/Piping current graph at exactly execution/_Coordination/WorkGraphs/<undertaking>/WORK_GRAPH.md, relative to the project, included early in the PR sequence and kept current. LOOP_INIT.md points to that actual path. Historical graphs remain in place; a still-pinned undertaking moves only through its owning explicit adoption. Carry current scope and state into the adopted graph, with detailed AgentRuns evidence linking to it instead of maintaining a second current copy. Human manual §§4.1–4.2

Retain the stable run identity connecting graph, central evidence, PRs and affected memory rows. An authorized recorder makes pointer updates outside the coordinator's write ceiling. One maintainer integrates returns against the latest graph. A pointer edit grants no scope or adoption. Construct a local work graph §4 · Root entry

The template's states are PLANNED, READY, ACTIVE, BLOCKED, UNCERTAIN, and COMPLETE. Retain any existing adopted schema and explain what its states mean. A status label needs grounds: the input satisfying readiness, the operation currently active, the exact blocked act, or the evidence meeting completion. Keep source revision, uncommitted/unmerged work, active workers, resource ownership, holds, and next safe actions in recovery information. Graph template

Walk the route before dispatch. Check executable cycles, omitted verification, shared assumptions, interface ownership, and integration capacity. Then advance ready authorized work without requesting approval for every routine node. Bring consequential choices through their owning process. A completed graph remains selected and visible; it does not start another phase, release a product, or issue a deliverable. App loop · Piping loop