work-graph-orchestration

Supervise dependency-aware multi-agent work through one authoritative work graph with explicit gates and evidence-based completion.

Updated Sep 6, 2026
One-click install
npx skills add https://github.com/rickvang/Persona-Library --skill work-graph-orchestration-rickvang
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: work-graph-orchestration
Source: https://github.com/rickvang/Persona-Library/tree/main/.agents/skills/work-graph-orchestration
Command: npx skills add https://github.com/rickvang/Persona-Library --skill work-graph-orchestration-rickvang

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve? Coordinating one substantial outcome across multiple agents, issues, branches, PRs, or execution runtimes often leads to lost state, duplicate dispatches, stale retries, and unverified completion claims. This Skill keeps one authoritative work graph with explicit gates, recoverable dispatches, and evidence-based acceptance so delegated work stays supervised and reconciled. ## Core Features & Use Cases - Minimal Work Graph Model: Define WorkNodes, dependency edges, Gates, and Dispatches with explicit states, evidence contracts, and dispositions instead of a second task database. - Safe Recovery and Retry: Apply read-before-retry recovery that inspects live runtime state, dispositions stale attempts, and preserves one authoritative dispatch per node. - Repository Lane Mapping: Map issues to WorkNodes, branches and PRs to Dispatches, and CI or review events to evidence, with collision review before parallel dispatch. - Use Case: Hand a set of current tasks spanning several branches and agents to the supervisor, which frames the graph, serializes shared-file work, dispatches bounded execution attempts, and reconciles completion against named evidence. ## Quick Start Ask the assistant to plan, route, and supervise your current set of cross-agent tasks as a work graph with explicit dependencies, gates, and evidence requirements.

Frequently Asked Questions about work-graph-orchestration

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I coordinate multiple agents on one software outcome?▼

Frame the outcome as a minimal work graph with WorkNodes, dependency edges, and explicit gates, then create one bounded dispatch per ready node. Supervise by events and evidence rather than polling, and reconcile durable state at lifecycle boundaries.

How to safely retry a failed or stale agent dispatch?▼

Apply read-before-retry recovery: inspect the existing dispatch and live runtime state first, confirm the prior attempt can no longer act, then explicitly disposition it before persisting a new dispatch ID. If authority cannot be confirmed ended, hold the node as blocked or waiting.

When should work run in parallel versus sequentially?▼

Parallelize only nodes that are dependency-independent and pass collision review for files, schemas, architecture, and shared state. Serialize shared-file, shared-schema, or unknown-overlap work by default, since sequential execution is correct when collision risk makes it safer.

Does this orchestration approach require a specific runtime or scheduler?▼

No, runtime capability is discovered at dispatch time through an adapter contract covering create, resume, cancel, and lifecycle state. If a capability is absent, choose a simpler route rather than building a new scheduler, queue, or runtime abstraction.

What are the limitations of work graph orchestration?▼

It supervises execution but does not replace specialist capability for each node, and it grants no mutation, merge, deployment, or access permission. It is not suited for a single bounded task, one-way ownership handoffs, or maintaining a second canonical task database.