@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/sdk/graph/mutation-advisory.js.map

@@ -1 +1 @@
-{"version":3,"file":"mutation-advisory.js","sources":["sdk/graph/mutation-advisory.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/mutation-advisory\n *\n * Detects newly introduced execution-order cycles across immutable workspace\n * snapshots so mutation clients can warn without rejecting legacy graph debt.\n */\nimport type { ItemMetadata } from \"../../types/index.js\";\nimport { analyzeRelationshipExecution } from \"../relationship-analytics.js\";\nimport type { RelationshipGraph } from \"../relationships.js\";\nimport { assembleWorkspaceRelationshipGraph } from \"./assembly.js\";\n\nfunction cycleKey(component: readonly string[]): string {\n  return [...component]\n    .sort((left, right) => left.localeCompare(right))\n    .join(\"\\u0000\");\n}\n\nfunction buildOrderingAdjacency(graph: RelationshipGraph): Map<string, string[]> {\n  const adjacency = new Map(graph.nodes().map((node) => [node, [] as string[]]));\n  for (const edge of graph.edges()) {\n    const definition = graph.registry().require(edge.kind);\n    if (!definition.ordering) continue;\n    const sourceFirst =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"source_before_target\";\n    adjacency\n      .get(sourceFirst ? edge.source : edge.target)\n      ?.push(sourceFirst ? edge.target : edge.source);\n  }\n  for (const neighbors of adjacency.values()) {\n    neighbors.sort((left, right) => left.localeCompare(right));\n  }\n  return adjacency;\n}\n\nfunction findCyclePath(\n  graph: RelationshipGraph,\n  component: readonly string[],\n  changedItemId: string,\n): string[] {\n  const members = new Set(component);\n  const start = members.has(changedItemId) ? changedItemId : component[0]!;\n  const adjacency = buildOrderingAdjacency(graph);\n  if (adjacency.get(start)?.includes(start)) return [start, start];\n  for (const first of adjacency.get(start) ?? []) {\n    if (!members.has(first)) continue;\n    const path = findPathBackToStart(adjacency, members, start, first);\n    if (path) return path;\n  }\n  return [...component, component[0]!];\n}\n\nfunction findPathBackToStart(\n  adjacency: ReadonlyMap<string, readonly string[]>,\n  members: ReadonlySet<string>,\n  start: string,\n  first: string,\n): string[] | undefined {\n  const queue = [[first]];\n  const visited = new Set([start, first]);\n  while (queue.length > 0) {\n    const path = queue.shift()!;\n    const tail = path.at(-1)!;\n    for (const next of adjacency.get(tail) ?? []) {\n      if (next === start) return [start, ...path, start];\n      if (!members.has(next) || visited.has(next)) continue;\n      visited.add(next);\n      queue.push([...path, next]);\n    }\n  }\n  return undefined;\n}\n\n/** Return actionable warnings only for ordering cycles created by the later snapshot and containing the changed item. */\nexport function collectNewOrderingCycleWarnings(\n  beforeItems: readonly ItemMetadata[],\n  afterItems: readonly ItemMetadata[],\n  changedItemId: string,\n): string[] {\n  const beforeGraph = assembleWorkspaceRelationshipGraph(beforeItems).graph;\n  const afterGraph = assembleWorkspaceRelationshipGraph(afterItems).graph;\n  const beforeCycles = new Set(\n    analyzeRelationshipExecution(beforeGraph, {\n      registry: beforeGraph.registry(),\n    }).cycles.map(cycleKey),\n  );\n  return analyzeRelationshipExecution(afterGraph, {\n    registry: afterGraph.registry(),\n  }).cycles\n    .filter(\n      (component) =>\n        component.includes(changedItemId) &&\n        !beforeCycles.has(cycleKey(component)),\n    )\n    .map(\n      (component) =>\n        `ordering_cycle_created:${findCyclePath(afterGraph, component, changedItemId).join(\" -> \")}:items_will_not_be_ready:run_pm_graph_audit`,\n    );\n}\n\n/** White-box graph-path helpers for exhaustive SDK primitive verification. */\nexport const mutationAdvisoryTestOnly = {\n  buildOrderingAdjacency,\n  findCyclePath,\n  findPathBackToStart,\n};\n"],"names":[],"mappings":";;AAOA,OAAO,EAAE,4BAA4B,EAAE,MAAM,8BAA8B,CAAC;AAE5E,OAAO,EAAE,kCAAkC,EAAE,MAAM,eAAe,CAAC;AAEnE,SAAS,QAAQ,CAAC,SAA4B;IAC5C,OAAO,CAAC,GAAG,SAAS,CAAC;SAClB,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAChD,IAAI,CAAC,QAAQ,CAAC,CAAC;AACpB,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAwB;IACtD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAc,CAAC,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,CAAC,UAAU,CAAC,QAAQ;YAAE,SAAS;QACnC,MAAM,WAAW,GACf,CAAC,UAAU,CAAC,UAAU,IAAI,sBAAsB,CAAC;YACjD,sBAAsB,CAAC;QACzB,SAAS;aACN,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAC7C,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,aAAa,CACpB,KAAwB,EACxB,SAA4B,EAC5B,aAAqB;IAErB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC;IACzE,MAAM,SAAS,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,IAAI,GAAG,mBAAmB,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACnE,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,SAAS,EAAE,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,mBAAmB,CAC1B,SAAiD,EACjD,OAA4B,EAC5B,KAAa,EACb,KAAa;IAEb,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,KAAK,KAAK;gBAAE,OAAO,CAAC,KAAK,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACtD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,yHAAyH;AACzH,MAAM,UAAU,+BAA+B,CAC7C,WAAoC,EACpC,UAAmC,EACnC,aAAqB;IAErB,MAAM,WAAW,GAAG,kCAAkC,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC;IAC1E,MAAM,UAAU,GAAG,kCAAkC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC;IACxE,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,4BAA4B,CAAC,WAAW,EAAE;QACxC,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE;KACjC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CACxB,CAAC;IACF,OAAO,4BAA4B,CAAC,UAAU,EAAE;QAC9C,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE;KAChC,CAAC,CAAC,MAAM;SACN,MAAM,CACL,CAAC,SAAS,EAAE,EAAE,CACZ,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC;QACjC,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CACzC;SACA,GAAG,CACF,CAAC,SAAS,EAAE,EAAE,CACZ,0BAA0B,aAAa,CAAC,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,6CAA6C,CAC1I,CAAC;AACN,CAAC;AAED,8EAA8E;AAC9E,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACtC,sBAAsB;IACtB,aAAa;IACb,mBAAmB;CACpB,CAAC","debugId":"b116c910-3783-5ebc-8b6a-e9a64573107e"}
+{"version":3,"file":"mutation-advisory.js","sources":["sdk/graph/mutation-advisory.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/mutation-advisory\n *\n * Detects newly introduced execution-order cycles across immutable workspace\n * snapshots so mutation clients can warn without rejecting legacy graph debt.\n * Detection is incremental: instead of assembling the full workspace\n * relationship graph and running whole-graph cycle analysis twice per\n * mutation, both snapshots build only a lightweight ordering digraph and scope\n * cycle enumeration to the changed item's weakly connected ordering component\n * — a cycle containing the changed item can never span nodes outside it.\n */\nimport type { ItemMetadata } from \"../../types/index.js\";\nimport type { RelationshipKindRegistry } from \"../relationships.js\";\nimport {\n  normalizeDependencyGraphTarget,\n  resolveWorkspaceRelationshipKindRegistry,\n} from \"./assembly.js\";\nimport { collectOrderingCycles } from \"./governance.js\";\n\n/** Lightweight ordering digraph over one immutable item snapshot. */\ninterface OrderingDigraph {\n  /** Sorted successor adjacency oriented predecessor -> successor. */\n  successors: Map<string, string[]>;\n  /** Sorted predecessor adjacency, the reverse orientation of successors. */\n  predecessors: Map<string, string[]>;\n  /** Canonical original-case ids keyed by their lowercase spelling. */\n  canonicalIds: Map<string, string>;\n}\n\nfunction cycleKey(component: readonly string[]): string {\n  return [...component].sort().join(\"\\u0000\");\n}\n\n/** Append one oriented ordering edge to both adjacency orientations. */\nfunction addOrderingEdge(\n  digraph: OrderingDigraph,\n  predecessor: string,\n  successor: string,\n): void {\n  const forward = digraph.successors.get(predecessor);\n  if (forward) forward.push(successor);\n  else digraph.successors.set(predecessor, [successor]);\n  const backward = digraph.predecessors.get(successor);\n  if (backward) backward.push(predecessor);\n  else digraph.predecessors.set(successor, [predecessor]);\n}\n\n/**\n * Orient one candidate reference into the digraph when its kind is a\n * registry-known order-bearing kind and its target resolves to a real item.\n * Associative kinds, unknown kinds, retired sentinels, and references to\n * absent items are skipped because none of them can create an\n * execution-order cycle — a referenced-but-absent item has no stored\n * out-edges.\n */\nfunction orientOrderingEdge(\n  digraph: OrderingDigraph,\n  registry: RelationshipKindRegistry,\n  source: string,\n  target: unknown,\n  kind: string,\n): void {\n  const definition = registry.resolve(kind);\n  if (definition?.ordering !== true) return;\n  const normalized = normalizeDependencyGraphTarget(target);\n  const canonicalTarget =\n    normalized === undefined\n      ? undefined\n      : digraph.canonicalIds.get(normalized.toLowerCase());\n  if (canonicalTarget === undefined) return;\n  const sourceFirst =\n    (definition.precedence ?? \"source_before_target\") ===\n    \"source_before_target\";\n  addOrderingEdge(\n    digraph,\n    sourceFirst ? source : canonicalTarget,\n    sourceFirst ? canonicalTarget : source,\n  );\n}\n\n/**\n * Build the ordering-only digraph for one item snapshot without assembling a\n * full relationship graph: one linear pass over the legacy scalar blocker and\n * structured dependency rows of every item.\n */\nfunction buildOrderingDigraph(\n  items: readonly ItemMetadata[],\n  registry: RelationshipKindRegistry,\n): OrderingDigraph {\n  const digraph: OrderingDigraph = {\n    successors: new Map(),\n    predecessors: new Map(),\n    canonicalIds: new Map(),\n  };\n  const safeItems = items.filter(\n    (item) => typeof item?.id === \"string\" && item.id.trim().length > 0,\n  );\n  for (const item of safeItems) {\n    const id = item.id.trim();\n    digraph.canonicalIds.set(id.toLowerCase(), id);\n  }\n  for (const item of safeItems) {\n    const id = item.id.trim();\n    orientOrderingEdge(digraph, registry, id, item.blocked_by, \"blocked_by\");\n    for (const dependency of item.dependencies ?? []) {\n      if (typeof dependency !== \"object\" || dependency === null) continue;\n      orientOrderingEdge(\n        digraph,\n        registry,\n        id,\n        dependency.id,\n        typeof dependency.kind === \"string\" ? dependency.kind : \"related\",\n      );\n    }\n  }\n  for (const adjacency of [digraph.successors, digraph.predecessors])\n    for (const neighbors of adjacency.values()) neighbors.sort();\n  return digraph;\n}\n\n/**\n * Collect the changed item's weakly connected ordering component: every node\n * reachable through ordering edges in either orientation. Cycle enumeration\n * restricted to this member set is exact for cycles containing the changed\n * item, because a strongly connected component is always contained in a\n * weakly connected one.\n */\nfunction collectWeakComponent(\n  digraph: OrderingDigraph,\n  start: string,\n): Set<string> {\n  const members = new Set([start]);\n  const queue = [start];\n  while (queue.length > 0) {\n    const node = queue.pop()!;\n    for (const adjacency of [digraph.successors, digraph.predecessors]) {\n      for (const neighbor of adjacency.get(node) ?? []) {\n        if (members.has(neighbor)) continue;\n        members.add(neighbor);\n        queue.push(neighbor);\n      }\n    }\n  }\n  return members;\n}\n\n/** Restrict a successor adjacency to edges whose endpoints are both members. */\nfunction induceSuccessors(\n  digraph: OrderingDigraph,\n  members: ReadonlySet<string>,\n): Map<string, string[]> {\n  const induced = new Map<string, string[]>();\n  for (const member of members) {\n    const neighbors = (digraph.successors.get(member) ?? []).filter((node) =>\n      members.has(node),\n    );\n    if (neighbors.length > 0) induced.set(member, neighbors);\n  }\n  return induced;\n}\n\n/** Enumerate component-scoped ordering cycles around one canonical item id. */\nfunction collectScopedCycles(\n  items: readonly ItemMetadata[],\n  registry: RelationshipKindRegistry,\n  changedItemId: string,\n): {\n  cycles: string[][];\n  successors: Map<string, string[]>;\n  canonical: string;\n} {\n  const digraph = buildOrderingDigraph(items, registry);\n  const canonical = digraph.canonicalIds.get(\n    changedItemId.trim().toLowerCase(),\n  );\n  if (canonical === undefined)\n    return { cycles: [], successors: new Map(), canonical: changedItemId };\n  const successors = induceSuccessors(\n    digraph,\n    collectWeakComponent(digraph, canonical),\n  );\n  return {\n    cycles: collectOrderingCycles(successors).filter((component) =>\n      component.includes(canonical),\n    ),\n    successors,\n    canonical,\n  };\n}\n\nfunction findCyclePath(\n  adjacency: ReadonlyMap<string, readonly string[]>,\n  component: readonly string[],\n  changedItemId: string,\n): string[] {\n  const members = new Set(component);\n  const start = members.has(changedItemId) ? changedItemId : component[0]!;\n  if (adjacency.get(start)?.includes(start)) return [start, start];\n  for (const first of adjacency.get(start) ?? []) {\n    if (!members.has(first)) continue;\n    const path = findPathBackToStart(adjacency, members, start, first);\n    if (path) return path;\n  }\n  return [...component, component[0]!];\n}\n\nfunction findPathBackToStart(\n  adjacency: ReadonlyMap<string, readonly string[]>,\n  members: ReadonlySet<string>,\n  start: string,\n  first: string,\n): string[] | undefined {\n  const queue = [[first]];\n  const visited = new Set([start, first]);\n  while (queue.length > 0) {\n    const path = queue.shift()!;\n    const tail = path.at(-1)!;\n    for (const next of adjacency.get(tail) ?? []) {\n      if (next === start) return [start, ...path, start];\n      if (!members.has(next) || visited.has(next)) continue;\n      visited.add(next);\n      queue.push([...path, next]);\n    }\n  }\n  return undefined;\n}\n\n/** Return actionable warnings only for ordering cycles created by the later snapshot and containing the changed item. */\nexport function collectNewOrderingCycleWarnings(\n  beforeItems: readonly ItemMetadata[],\n  afterItems: readonly ItemMetadata[],\n  changedItemId: string,\n): string[] {\n  const registry = resolveWorkspaceRelationshipKindRegistry();\n  const before = collectScopedCycles(beforeItems, registry, changedItemId);\n  const after = collectScopedCycles(afterItems, registry, changedItemId);\n  const beforeCycles = new Set(before.cycles.map(cycleKey));\n  return after.cycles\n    .filter((component) => !beforeCycles.has(cycleKey(component)))\n    .map(\n      (component) =>\n        `ordering_cycle_created:${findCyclePath(after.successors, component, after.canonical).join(\" -> \")}:items_will_not_be_ready:run_pm_graph_audit`,\n    );\n}\n\n/** White-box graph-path helpers for exhaustive SDK primitive verification. */\nexport const mutationAdvisoryTestOnly = {\n  buildOrderingDigraph,\n  collectWeakComponent,\n  induceSuccessors,\n  findCyclePath,\n  findPathBackToStart,\n};\n"],"names":[],"mappings":";;AAaA,OAAO,EACL,8BAA8B,EAC9B,wCAAwC,GACzC,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAYxD,SAAS,QAAQ,CAAC,SAA4B;IAC5C,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC9C,CAAC;AAED,wEAAwE;AACxE,SAAS,eAAe,CACtB,OAAwB,EACxB,WAAmB,EACnB,SAAiB;IAEjB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACpD,IAAI,OAAO;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;QAChC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACrD,IAAI,QAAQ;QAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;QACpC,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,kBAAkB,CACzB,OAAwB,EACxB,QAAkC,EAClC,MAAc,EACd,MAAe,EACf,IAAY;IAEZ,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1C,IAAI,UAAU,EAAE,QAAQ,KAAK,IAAI;QAAE,OAAO;IAC1C,MAAM,UAAU,GAAG,8BAA8B,CAAC,MAAM,CAAC,CAAC;IAC1D,MAAM,eAAe,GACnB,UAAU,KAAK,SAAS;QACtB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;IACzD,IAAI,eAAe,KAAK,SAAS;QAAE,OAAO;IAC1C,MAAM,WAAW,GACf,CAAC,UAAU,CAAC,UAAU,IAAI,sBAAsB,CAAC;QACjD,sBAAsB,CAAC;IACzB,eAAe,CACb,OAAO,EACP,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,EACtC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CACvC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,KAA8B,EAC9B,QAAkC;IAElC,MAAM,OAAO,GAAoB;QAC/B,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,YAAY,EAAE,IAAI,GAAG,EAAE;QACvB,YAAY,EAAE,IAAI,GAAG,EAAE;KACxB,CAAC;IACF,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,EAAE,EAAE,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CACpE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1B,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1B,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YACjD,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,IAAI;gBAAE,SAAS;YACpE,kBAAkB,CAChB,OAAO,EACP,QAAQ,EACR,EAAE,EACF,UAAU,CAAC,EAAE,EACb,OAAO,UAAU,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAClE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC;QAChE,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE;YAAE,SAAS,CAAC,IAAI,EAAE,CAAC;IAC/D,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAC3B,OAAwB,EACxB,KAAa;IAEb,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,KAAK,MAAM,SAAS,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjD,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gFAAgF;AAChF,SAAS,gBAAgB,CACvB,OAAwB,EACxB,OAA4B;IAE5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACvE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAClB,CAAC;QACF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,SAAS,mBAAmB,CAC1B,KAA8B,EAC9B,QAAkC,EAClC,aAAqB;IAMrB,MAAM,OAAO,GAAG,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CACxC,aAAa,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CACnC,CAAC;IACF,IAAI,SAAS,KAAK,SAAS;QACzB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC;IACzE,MAAM,UAAU,GAAG,gBAAgB,CACjC,OAAO,EACP,oBAAoB,CAAC,OAAO,EAAE,SAAS,CAAC,CACzC,CAAC;IACF,OAAO;QACL,MAAM,EAAE,qBAAqB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAC7D,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAC9B;QACD,UAAU;QACV,SAAS;KACV,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,SAAiD,EACjD,SAA4B,EAC5B,aAAqB;IAErB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC;IACzE,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,IAAI,GAAG,mBAAmB,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACnE,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,SAAS,EAAE,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,mBAAmB,CAC1B,SAAiD,EACjD,OAA4B,EAC5B,KAAa,EACb,KAAa;IAEb,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,KAAK,KAAK;gBAAE,OAAO,CAAC,KAAK,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACtD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,yHAAyH;AACzH,MAAM,UAAU,+BAA+B,CAC7C,WAAoC,EACpC,UAAmC,EACnC,aAAqB;IAErB,MAAM,QAAQ,GAAG,wCAAwC,EAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,mBAAmB,CAAC,UAAU,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IACvE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC1D,OAAO,KAAK,CAAC,MAAM;SAChB,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;SAC7D,GAAG,CACF,CAAC,SAAS,EAAE,EAAE,CACZ,0BAA0B,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,6CAA6C,CAClJ,CAAC;AACN,CAAC;AAED,8EAA8E;AAC9E,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACtC,oBAAoB;IACpB,oBAAoB;IACpB,gBAAgB;IAChB,aAAa;IACb,mBAAmB;CACpB,CAAC","debugId":"9dcd2523-3a8a-5667-bd6b-d51c385be111"}

package/dist/sdk/graph/remediation.js

@@ -1,5 +1,5 @@
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="662a9796-dbb3-5fd5-bc23-22dba9adde9e")}catch(e){}}();
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="ebb01d6f-d876-5196-9937-24528a66b160")}catch(e){}}();
 import { findRedundantRelationshipEdges } from "./analytics.js";
 import { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, formatDuplicateEdgeGroup, } from "./governance.js";
 /** Per-finding-code operation template applied to every sampled subject. */
@@ -42,6 +42,16 @@ const FINDING_STEP_TEMPLATES = {
         confidence: "high",
         rationale: "Duplicated spellings between terminal items are historical noise; waive or batch changelog-safe cleanup.",
     },
+    duplicate_dependency_row: {
+        op: "remove",
+        confidence: "high",
+        rationale: "The identical dependency row is stored more than once on the holder; drop the repeats so the row exists exactly once — graph semantics are unchanged.",
+    },
+    legacy_duplicate_dependency_row: {
+        op: "waive",
+        confidence: "high",
+        rationale: "Repeated identical rows on terminal holders are storage noise; waive or clean up only in a changelog-safe closed-item batch.",
+    },
     stale_lifecycle_block: {
         op: "investigate",
         confidence: "medium",
@@ -145,4 +155,4 @@ export function planRelationshipRemediation(assembly, options = {}) {
     };
 }
 //# sourceMappingURL=remediation.js.map
-//# debugId=662a9796-dbb3-5fd5-bc23-22dba9adde9e
+//# debugId=ebb01d6f-d876-5196-9937-24528a66b160

package/dist/sdk/graph/remediation.js.map

@@ -1 +1 @@
-{"version":3,"file":"remediation.js","sources":["sdk/graph/remediation.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/remediation\n *\n * Dry-run remediation planning over the relationship governance audit. The\n * planner turns bounded audit findings and transitive-redundancy evidence into\n * exact, machine-readable proposed operations — remove, retype, supersede,\n * waive, or investigate — each carrying its policy code, evidence, confidence,\n * and rationale. Planning never mutates the workspace and never invents an\n * edge: proposals with structural proof (duplicates, retired sentinels,\n * witnessed shortcuts) get actionable operations, while judgment calls stay\n * explicit `investigate` steps for a human or agent to resolve.\n */\nimport type { RelationshipEdge } from \"../relationships.js\";\nimport { findRedundantRelationshipEdges } from \"./analytics.js\";\nimport type { WorkspaceRelationshipAssembly } from \"./assembly.js\";\nimport {\n  auditWorkspaceRelationshipGraph,\n  collectDuplicateRelationshipEdgeGroups,\n  formatDuplicateEdgeGroup,\n  type DuplicateRelationshipEdgeGroup,\n  type RelationshipAuditFinding,\n  type RelationshipAuditFindingCode,\n  type RelationshipAuditOptions,\n  type RelationshipAuditReport,\n} from \"./governance.js\";\n\n/** Exact operation family a remediation step proposes; audits never auto-apply. */\nexport type RelationshipRemediationOperation =\n  | \"add\"\n  | \"remove\"\n  | \"retype\"\n  | \"supersede\"\n  | \"waive\"\n  | \"investigate\";\n\n/** Planner confidence that applying the proposed operation is safe and correct. */\nexport type RelationshipRemediationConfidence = \"high\" | \"medium\" | \"low\";\n\n/** Policy source a remediation step was derived from. */\nexport type RelationshipRemediationCode =\n  | RelationshipAuditFindingCode\n  | \"redundant_edge\";\n\n/** One exact dry-run remediation proposal with evidence and confidence. */\nexport interface RelationshipRemediationStep {\n  /** Proposed operation family. */\n  op: RelationshipRemediationOperation;\n  /** Audit finding code or `redundant_edge` for witnessed transitive shortcuts. */\n  code: RelationshipRemediationCode;\n  /** Compact deterministic subject — the edge, reference, or node to act on. */\n  subject: string;\n  /** Why this operation is proposed and what applying it means. */\n  rationale: string;\n  /** Deterministic evidence strings backing the proposal. */\n  evidence: string[];\n  /** Planner confidence in the proposal. */\n  confidence: RelationshipRemediationConfidence;\n}\n\n/** Tuning inputs accepted by dry-run remediation planning. */\nexport interface RelationshipRemediationPlanOptions\n  extends RelationshipAuditOptions {\n  /** Maximum witnessed redundant edges scanned into proposals; defaults to the audit sample bound. */\n  redundancyLimit?: number;\n}\n\n/** Complete deterministic result of one dry-run remediation planning pass. */\nexport interface RelationshipRemediationPlan {\n  /** Proposed steps in audit severity order, redundancy proposals last. */\n  steps: RelationshipRemediationStep[];\n  /** The governance-audit report the plan was derived from. */\n  report: RelationshipAuditReport;\n  /** Whether bounded samples or scan limits omitted derivable proposals. */\n  truncated: boolean;\n  /** Nodes visited and edges inspected by the redundancy witness scan. */\n  cost: { visitedNodes: number; inspectedEdges: number };\n}\n\n/** Per-finding-code operation template applied to every sampled subject. */\nconst FINDING_STEP_TEMPLATES: Record<\n  RelationshipAuditFindingCode,\n  {\n    op: RelationshipRemediationOperation;\n    confidence: RelationshipRemediationConfidence;\n    rationale: string;\n  }\n> = {\n  missing_reference_active: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Restore or re-create the referenced item, or remove/retype the reference on the active holder; the correct fix depends on why the target is absent.\",\n  },\n  missing_reference_terminal: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Terminal-holder reference to an absent item is historical debt; waive it or clean it up only in a dedicated changelog-safe closed-item batch.\",\n  },\n  legacy_no_blocker_sentinel: {\n    op: \"remove\",\n    confidence: \"high\",\n    rationale:\n      \"The pre-structured-dependency no-active-blocker sentinel is retired and carries no information; blocker state derives from blocked_by edges.\",\n  },\n  ordering_cycle: {\n    op: \"investigate\",\n    confidence: \"low\",\n    rationale:\n      \"Every cycle member is unschedulable until one ordering edge is removed or retyped; the planner never chooses which edge to cut.\",\n  },\n  legacy_ordering_cycle: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Terminal-only ordering cycles have no scheduling effect; repairing them would mutate closed history (changelog drag).\",\n  },\n  // duplicate_edge findings are expanded into per-stored-edge remove steps by\n  // the planner itself (see stepsFromDuplicateGroup); this template documents\n  // the family for exhaustiveness and backs any future sample-only fallback.\n  duplicate_edge: {\n    op: \"remove\",\n    confidence: \"high\",\n    rationale:\n      \"Parallel same-family spellings state one relationship twice; remove all but one stored spelling, keeping the holder's canonical direction.\",\n  },\n  legacy_duplicate_edge: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Duplicated spellings between terminal items are historical noise; waive or batch changelog-safe cleanup.\",\n  },\n  stale_lifecycle_block: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Re-open the missing prerequisite as an ordering edge, or move the item back to an active status; only the holder's owner knows which is true.\",\n  },\n  isolated_active_node: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Link the item to its parent, prerequisite, or origin — or register it as an explicitly exempt isolate; the audit never fabricates an edge.\",\n  },\n  sparse_active_node: {\n    op: \"investigate\",\n    confidence: \"low\",\n    rationale:\n      \"Investigate for an honest second edge (story-to-task, defect family, cross-epic complement); sparse is not automatically defective.\",\n  },\n};\n\n/** Format one stored edge as a concrete removable identity. */\nfunction formatStoredEdge(edge: RelationshipEdge): string {\n  return `${edge.source} -${edge.kind}-> ${edge.target}`;\n}\n\n/**\n * Expand one active duplicate group into concrete per-stored-edge removals.\n * The deterministic keeper is the group's first sorted edge; every other\n * stored spelling gets its own remove proposal naming the exact edge to drop,\n * so the plan stays machine-executable instead of pointing at a display\n * string that spans several stored rows.\n */\nfunction stepsFromDuplicateGroup(\n  group: DuplicateRelationshipEdgeGroup,\n): RelationshipRemediationStep[] {\n  const [keeper, ...extras] = group.edges;\n  return extras.map((edge) => ({\n    op: \"remove\" as const,\n    code: \"duplicate_edge\" as const,\n    subject: formatStoredEdge(edge),\n    rationale:\n      \"This stored spelling restates the kept canonical edge of the same semantic family; removing it leaves the relationship stated exactly once.\",\n    evidence: [\n      `keep: ${formatStoredEdge(keeper!)}`,\n      `group: ${formatDuplicateEdgeGroup(group)}`,\n    ],\n    confidence: \"high\" as const,\n  }));\n}\n\n/** Derive one proposal per bounded sample subject of an audit finding. */\nfunction stepsFromFinding(\n  finding: RelationshipAuditFinding,\n  duplicateGroups: Map<string, DuplicateRelationshipEdgeGroup>,\n): RelationshipRemediationStep[] {\n  if (finding.code === \"duplicate_edge\") {\n    // Sample subjects are the deterministic group format strings, so each one\n    // resolves to its concrete stored-edge group for exact removal targeting.\n    return finding.sample.flatMap((subject) =>\n      stepsFromDuplicateGroup(duplicateGroups.get(subject)!),\n    );\n  }\n  const template = FINDING_STEP_TEMPLATES[finding.code];\n  return finding.sample.map((subject) => ({\n    op: template.op,\n    code: finding.code,\n    subject,\n    rationale: template.rationale,\n    evidence: [finding.policy],\n    confidence: template.confidence,\n  }));\n}\n\n/**\n * Build one deterministic dry-run remediation plan over an assembled workspace\n * relationship graph. The plan runs the shared governance audit, derives one\n * exact proposal per bounded finding subject, then appends witnessed\n * transitive-shortcut removal proposals from the redundancy scan (medium\n * confidence, because shortcut edges are sometimes deliberate emphasis).\n * `truncated` reports whether sample or scan bounds omitted derivable steps;\n * nothing is ever applied automatically.\n */\nexport function planRelationshipRemediation(\n  assembly: WorkspaceRelationshipAssembly,\n  options: RelationshipRemediationPlanOptions = {},\n): RelationshipRemediationPlan {\n  const { redundancyLimit, ...auditOptions } = options;\n  const report = auditWorkspaceRelationshipGraph(assembly, auditOptions);\n  const duplicateGroups = new Map(\n    collectDuplicateRelationshipEdgeGroups(assembly).map((group) => [\n      formatDuplicateEdgeGroup(group),\n      group,\n    ]),\n  );\n  const steps = report.findings.flatMap((finding) =>\n    stepsFromFinding(finding, duplicateGroups),\n  );\n  let truncated = report.findings.some((finding) => finding.sample_truncated);\n  options.signal?.throwIfAborted();\n  const redundancy = findRedundantRelationshipEdges(assembly.graph, {\n    limit: redundancyLimit ?? options.maxSampleSize ?? 25,\n    ...(options.signal === undefined ? {} : { signal: options.signal }),\n  });\n  for (const row of redundancy.value) {\n    steps.push({\n      op: \"remove\",\n      code: \"redundant_edge\",\n      subject: `${row.edge.source} -> ${row.edge.target} (${row.edge.kind})`,\n      rationale:\n        \"The stored edge is implied by a longer same-family witness path; shortcut edges are sometimes deliberate emphasis, so confirm intent before removing.\",\n      evidence: [`witness: ${row.witness.join(\" -> \")}`],\n      confidence: \"medium\",\n    });\n  }\n  truncated = truncated || redundancy.meta.truncated;\n  return {\n    steps,\n    report,\n    truncated,\n    cost: {\n      visitedNodes: redundancy.meta.visitedNodes,\n      inspectedEdges: redundancy.meta.inspectedEdges,\n    },\n  };\n}\n"],"names":[],"mappings":";;AAaA,OAAO,EAAE,8BAA8B,EAAE,MAAM,gBAAgB,CAAC;AAEhE,OAAO,EACL,+BAA+B,EAC/B,sCAAsC,EACtC,wBAAwB,GAMzB,MAAM,iBAAiB,CAAC;AAsDzB,4EAA4E;AAC5E,MAAM,sBAAsB,GAOxB;IACF,wBAAwB,EAAE;QACxB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,qJAAqJ;KACxJ;IACD,0BAA0B,EAAE;QAC1B,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,+IAA+I;KAClJ;IACD,0BAA0B,EAAE;QAC1B,EAAE,EAAE,QAAQ;QACZ,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,8IAA8I;KACjJ;IACD,cAAc,EAAE;QACd,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,KAAK;QACjB,SAAS,EACP,iIAAiI;KACpI;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,uHAAuH;KAC1H;IACD,4EAA4E;IAC5E,4EAA4E;IAC5E,2EAA2E;IAC3E,cAAc,EAAE;QACd,EAAE,EAAE,QAAQ;QACZ,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,4IAA4I;KAC/I;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,0GAA0G;KAC7G;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,+IAA+I;KAClJ;IACD,oBAAoB,EAAE;QACpB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,4IAA4I;KAC/I;IACD,kBAAkB,EAAE;QAClB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,KAAK;QACjB,SAAS,EACP,qIAAqI;KACxI;CACF,CAAC;AAEF,+DAA+D;AAC/D,SAAS,gBAAgB,CAAC,IAAsB;IAC9C,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,uBAAuB,CAC9B,KAAqC;IAErC,MAAM,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACxC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3B,EAAE,EAAE,QAAiB;QACrB,IAAI,EAAE,gBAAyB;QAC/B,OAAO,EAAE,gBAAgB,CAAC,IAAI,CAAC;QAC/B,SAAS,EACP,6IAA6I;QAC/I,QAAQ,EAAE;YACR,SAAS,gBAAgB,CAAC,MAAO,CAAC,EAAE;YACpC,UAAU,wBAAwB,CAAC,KAAK,CAAC,EAAE;SAC5C;QACD,UAAU,EAAE,MAAe;KAC5B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,0EAA0E;AAC1E,SAAS,gBAAgB,CACvB,OAAiC,EACjC,eAA4D;IAE5D,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACtC,0EAA0E;QAC1E,0EAA0E;QAC1E,OAAO,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CACxC,uBAAuB,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,CACvD,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,sBAAsB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtD,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtC,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,OAAO;QACP,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;QAC1B,UAAU,EAAE,QAAQ,CAAC,UAAU;KAChC,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAuC,EACvC,UAA8C,EAAE;IAEhD,MAAM,EAAE,eAAe,EAAE,GAAG,YAAY,EAAE,GAAG,OAAO,CAAC;IACrD,MAAM,MAAM,GAAG,+BAA+B,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACvE,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,sCAAsC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9D,wBAAwB,CAAC,KAAK,CAAC;QAC/B,KAAK;KACN,CAAC,CACH,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAChD,gBAAgB,CAAC,OAAO,EAAE,eAAe,CAAC,CAC3C,CAAC;IACF,IAAI,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAC5E,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,UAAU,GAAG,8BAA8B,CAAC,QAAQ,CAAC,KAAK,EAAE;QAChE,KAAK,EAAE,eAAe,IAAI,OAAO,CAAC,aAAa,IAAI,EAAE;QACrD,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;KACpE,CAAC,CAAC;IACH,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,QAAQ;YACZ,IAAI,EAAE,gBAAgB;YACtB,OAAO,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG;YACtE,SAAS,EACP,uJAAuJ;YACzJ,QAAQ,EAAE,CAAC,YAAY,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAClD,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;IACL,CAAC;IACD,SAAS,GAAG,SAAS,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;IACnD,OAAO;QACL,KAAK;QACL,MAAM;QACN,SAAS;QACT,IAAI,EAAE;YACJ,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,YAAY;YAC1C,cAAc,EAAE,UAAU,CAAC,IAAI,CAAC,cAAc;SAC/C;KACF,CAAC;AACJ,CAAC","debugId":"662a9796-dbb3-5fd5-bc23-22dba9adde9e"}
+{"version":3,"file":"remediation.js","sources":["sdk/graph/remediation.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/remediation\n *\n * Dry-run remediation planning over the relationship governance audit. The\n * planner turns bounded audit findings and transitive-redundancy evidence into\n * exact, machine-readable proposed operations — remove, retype, supersede,\n * waive, or investigate — each carrying its policy code, evidence, confidence,\n * and rationale. Planning never mutates the workspace and never invents an\n * edge: proposals with structural proof (duplicates, retired sentinels,\n * witnessed shortcuts) get actionable operations, while judgment calls stay\n * explicit `investigate` steps for a human or agent to resolve.\n */\nimport type { RelationshipEdge } from \"../relationships.js\";\nimport { findRedundantRelationshipEdges } from \"./analytics.js\";\nimport type { WorkspaceRelationshipAssembly } from \"./assembly.js\";\nimport {\n  auditWorkspaceRelationshipGraph,\n  collectDuplicateRelationshipEdgeGroups,\n  formatDuplicateEdgeGroup,\n  type DuplicateRelationshipEdgeGroup,\n  type RelationshipAuditFinding,\n  type RelationshipAuditFindingCode,\n  type RelationshipAuditOptions,\n  type RelationshipAuditReport,\n} from \"./governance.js\";\n\n/** Exact operation family a remediation step proposes; audits never auto-apply. */\nexport type RelationshipRemediationOperation =\n  | \"add\"\n  | \"remove\"\n  | \"retype\"\n  | \"supersede\"\n  | \"waive\"\n  | \"investigate\";\n\n/** Planner confidence that applying the proposed operation is safe and correct. */\nexport type RelationshipRemediationConfidence = \"high\" | \"medium\" | \"low\";\n\n/** Policy source a remediation step was derived from. */\nexport type RelationshipRemediationCode =\n  | RelationshipAuditFindingCode\n  | \"redundant_edge\";\n\n/** One exact dry-run remediation proposal with evidence and confidence. */\nexport interface RelationshipRemediationStep {\n  /** Proposed operation family. */\n  op: RelationshipRemediationOperation;\n  /** Audit finding code or `redundant_edge` for witnessed transitive shortcuts. */\n  code: RelationshipRemediationCode;\n  /** Compact deterministic subject — the edge, reference, or node to act on. */\n  subject: string;\n  /** Why this operation is proposed and what applying it means. */\n  rationale: string;\n  /** Deterministic evidence strings backing the proposal. */\n  evidence: string[];\n  /** Planner confidence in the proposal. */\n  confidence: RelationshipRemediationConfidence;\n}\n\n/** Tuning inputs accepted by dry-run remediation planning. */\nexport interface RelationshipRemediationPlanOptions\n  extends RelationshipAuditOptions {\n  /** Maximum witnessed redundant edges scanned into proposals; defaults to the audit sample bound. */\n  redundancyLimit?: number;\n}\n\n/** Complete deterministic result of one dry-run remediation planning pass. */\nexport interface RelationshipRemediationPlan {\n  /** Proposed steps in audit severity order, redundancy proposals last. */\n  steps: RelationshipRemediationStep[];\n  /** The governance-audit report the plan was derived from. */\n  report: RelationshipAuditReport;\n  /** Whether bounded samples or scan limits omitted derivable proposals. */\n  truncated: boolean;\n  /** Nodes visited and edges inspected by the redundancy witness scan. */\n  cost: { visitedNodes: number; inspectedEdges: number };\n}\n\n/** Per-finding-code operation template applied to every sampled subject. */\nconst FINDING_STEP_TEMPLATES: Record<\n  RelationshipAuditFindingCode,\n  {\n    op: RelationshipRemediationOperation;\n    confidence: RelationshipRemediationConfidence;\n    rationale: string;\n  }\n> = {\n  missing_reference_active: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Restore or re-create the referenced item, or remove/retype the reference on the active holder; the correct fix depends on why the target is absent.\",\n  },\n  missing_reference_terminal: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Terminal-holder reference to an absent item is historical debt; waive it or clean it up only in a dedicated changelog-safe closed-item batch.\",\n  },\n  legacy_no_blocker_sentinel: {\n    op: \"remove\",\n    confidence: \"high\",\n    rationale:\n      \"The pre-structured-dependency no-active-blocker sentinel is retired and carries no information; blocker state derives from blocked_by edges.\",\n  },\n  ordering_cycle: {\n    op: \"investigate\",\n    confidence: \"low\",\n    rationale:\n      \"Every cycle member is unschedulable until one ordering edge is removed or retyped; the planner never chooses which edge to cut.\",\n  },\n  legacy_ordering_cycle: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Terminal-only ordering cycles have no scheduling effect; repairing them would mutate closed history (changelog drag).\",\n  },\n  // duplicate_edge findings are expanded into per-stored-edge remove steps by\n  // the planner itself (see stepsFromDuplicateGroup); this template documents\n  // the family for exhaustiveness and backs any future sample-only fallback.\n  duplicate_edge: {\n    op: \"remove\",\n    confidence: \"high\",\n    rationale:\n      \"Parallel same-family spellings state one relationship twice; remove all but one stored spelling, keeping the holder's canonical direction.\",\n  },\n  legacy_duplicate_edge: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Duplicated spellings between terminal items are historical noise; waive or batch changelog-safe cleanup.\",\n  },\n  duplicate_dependency_row: {\n    op: \"remove\",\n    confidence: \"high\",\n    rationale:\n      \"The identical dependency row is stored more than once on the holder; drop the repeats so the row exists exactly once — graph semantics are unchanged.\",\n  },\n  legacy_duplicate_dependency_row: {\n    op: \"waive\",\n    confidence: \"high\",\n    rationale:\n      \"Repeated identical rows on terminal holders are storage noise; waive or clean up only in a changelog-safe closed-item batch.\",\n  },\n  stale_lifecycle_block: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Re-open the missing prerequisite as an ordering edge, or move the item back to an active status; only the holder's owner knows which is true.\",\n  },\n  isolated_active_node: {\n    op: \"investigate\",\n    confidence: \"medium\",\n    rationale:\n      \"Link the item to its parent, prerequisite, or origin — or register it as an explicitly exempt isolate; the audit never fabricates an edge.\",\n  },\n  sparse_active_node: {\n    op: \"investigate\",\n    confidence: \"low\",\n    rationale:\n      \"Investigate for an honest second edge (story-to-task, defect family, cross-epic complement); sparse is not automatically defective.\",\n  },\n};\n\n/** Format one stored edge as a concrete removable identity. */\nfunction formatStoredEdge(edge: RelationshipEdge): string {\n  return `${edge.source} -${edge.kind}-> ${edge.target}`;\n}\n\n/**\n * Expand one active duplicate group into concrete per-stored-edge removals.\n * The deterministic keeper is the group's first sorted edge; every other\n * stored spelling gets its own remove proposal naming the exact edge to drop,\n * so the plan stays machine-executable instead of pointing at a display\n * string that spans several stored rows.\n */\nfunction stepsFromDuplicateGroup(\n  group: DuplicateRelationshipEdgeGroup,\n): RelationshipRemediationStep[] {\n  const [keeper, ...extras] = group.edges;\n  return extras.map((edge) => ({\n    op: \"remove\" as const,\n    code: \"duplicate_edge\" as const,\n    subject: formatStoredEdge(edge),\n    rationale:\n      \"This stored spelling restates the kept canonical edge of the same semantic family; removing it leaves the relationship stated exactly once.\",\n    evidence: [\n      `keep: ${formatStoredEdge(keeper!)}`,\n      `group: ${formatDuplicateEdgeGroup(group)}`,\n    ],\n    confidence: \"high\" as const,\n  }));\n}\n\n/** Derive one proposal per bounded sample subject of an audit finding. */\nfunction stepsFromFinding(\n  finding: RelationshipAuditFinding,\n  duplicateGroups: Map<string, DuplicateRelationshipEdgeGroup>,\n): RelationshipRemediationStep[] {\n  if (finding.code === \"duplicate_edge\") {\n    // Sample subjects are the deterministic group format strings, so each one\n    // resolves to its concrete stored-edge group for exact removal targeting.\n    return finding.sample.flatMap((subject) =>\n      stepsFromDuplicateGroup(duplicateGroups.get(subject)!),\n    );\n  }\n  const template = FINDING_STEP_TEMPLATES[finding.code];\n  return finding.sample.map((subject) => ({\n    op: template.op,\n    code: finding.code,\n    subject,\n    rationale: template.rationale,\n    evidence: [finding.policy],\n    confidence: template.confidence,\n  }));\n}\n\n/**\n * Build one deterministic dry-run remediation plan over an assembled workspace\n * relationship graph. The plan runs the shared governance audit, derives one\n * exact proposal per bounded finding subject, then appends witnessed\n * transitive-shortcut removal proposals from the redundancy scan (medium\n * confidence, because shortcut edges are sometimes deliberate emphasis).\n * `truncated` reports whether sample or scan bounds omitted derivable steps;\n * nothing is ever applied automatically.\n */\nexport function planRelationshipRemediation(\n  assembly: WorkspaceRelationshipAssembly,\n  options: RelationshipRemediationPlanOptions = {},\n): RelationshipRemediationPlan {\n  const { redundancyLimit, ...auditOptions } = options;\n  const report = auditWorkspaceRelationshipGraph(assembly, auditOptions);\n  const duplicateGroups = new Map(\n    collectDuplicateRelationshipEdgeGroups(assembly).map((group) => [\n      formatDuplicateEdgeGroup(group),\n      group,\n    ]),\n  );\n  const steps = report.findings.flatMap((finding) =>\n    stepsFromFinding(finding, duplicateGroups),\n  );\n  let truncated = report.findings.some((finding) => finding.sample_truncated);\n  options.signal?.throwIfAborted();\n  const redundancy = findRedundantRelationshipEdges(assembly.graph, {\n    limit: redundancyLimit ?? options.maxSampleSize ?? 25,\n    ...(options.signal === undefined ? {} : { signal: options.signal }),\n  });\n  for (const row of redundancy.value) {\n    steps.push({\n      op: \"remove\",\n      code: \"redundant_edge\",\n      subject: `${row.edge.source} -> ${row.edge.target} (${row.edge.kind})`,\n      rationale:\n        \"The stored edge is implied by a longer same-family witness path; shortcut edges are sometimes deliberate emphasis, so confirm intent before removing.\",\n      evidence: [`witness: ${row.witness.join(\" -> \")}`],\n      confidence: \"medium\",\n    });\n  }\n  truncated = truncated || redundancy.meta.truncated;\n  return {\n    steps,\n    report,\n    truncated,\n    cost: {\n      visitedNodes: redundancy.meta.visitedNodes,\n      inspectedEdges: redundancy.meta.inspectedEdges,\n    },\n  };\n}\n"],"names":[],"mappings":";;AAaA,OAAO,EAAE,8BAA8B,EAAE,MAAM,gBAAgB,CAAC;AAEhE,OAAO,EACL,+BAA+B,EAC/B,sCAAsC,EACtC,wBAAwB,GAMzB,MAAM,iBAAiB,CAAC;AAsDzB,4EAA4E;AAC5E,MAAM,sBAAsB,GAOxB;IACF,wBAAwB,EAAE;QACxB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,qJAAqJ;KACxJ;IACD,0BAA0B,EAAE;QAC1B,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,+IAA+I;KAClJ;IACD,0BAA0B,EAAE;QAC1B,EAAE,EAAE,QAAQ;QACZ,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,8IAA8I;KACjJ;IACD,cAAc,EAAE;QACd,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,KAAK;QACjB,SAAS,EACP,iIAAiI;KACpI;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,uHAAuH;KAC1H;IACD,4EAA4E;IAC5E,4EAA4E;IAC5E,2EAA2E;IAC3E,cAAc,EAAE;QACd,EAAE,EAAE,QAAQ;QACZ,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,4IAA4I;KAC/I;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,0GAA0G;KAC7G;IACD,wBAAwB,EAAE;QACxB,EAAE,EAAE,QAAQ;QACZ,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,uJAAuJ;KAC1J;IACD,+BAA+B,EAAE;QAC/B,EAAE,EAAE,OAAO;QACX,UAAU,EAAE,MAAM;QAClB,SAAS,EACP,8HAA8H;KACjI;IACD,qBAAqB,EAAE;QACrB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,+IAA+I;KAClJ;IACD,oBAAoB,EAAE;QACpB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,QAAQ;QACpB,SAAS,EACP,4IAA4I;KAC/I;IACD,kBAAkB,EAAE;QAClB,EAAE,EAAE,aAAa;QACjB,UAAU,EAAE,KAAK;QACjB,SAAS,EACP,qIAAqI;KACxI;CACF,CAAC;AAEF,+DAA+D;AAC/D,SAAS,gBAAgB,CAAC,IAAsB;IAC9C,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,uBAAuB,CAC9B,KAAqC;IAErC,MAAM,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACxC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3B,EAAE,EAAE,QAAiB;QACrB,IAAI,EAAE,gBAAyB;QAC/B,OAAO,EAAE,gBAAgB,CAAC,IAAI,CAAC;QAC/B,SAAS,EACP,6IAA6I;QAC/I,QAAQ,EAAE;YACR,SAAS,gBAAgB,CAAC,MAAO,CAAC,EAAE;YACpC,UAAU,wBAAwB,CAAC,KAAK,CAAC,EAAE;SAC5C;QACD,UAAU,EAAE,MAAe;KAC5B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,0EAA0E;AAC1E,SAAS,gBAAgB,CACvB,OAAiC,EACjC,eAA4D;IAE5D,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACtC,0EAA0E;QAC1E,0EAA0E;QAC1E,OAAO,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CACxC,uBAAuB,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,CACvD,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,sBAAsB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtD,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtC,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,OAAO;QACP,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;QAC1B,UAAU,EAAE,QAAQ,CAAC,UAAU;KAChC,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAuC,EACvC,UAA8C,EAAE;IAEhD,MAAM,EAAE,eAAe,EAAE,GAAG,YAAY,EAAE,GAAG,OAAO,CAAC;IACrD,MAAM,MAAM,GAAG,+BAA+B,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACvE,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,sCAAsC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9D,wBAAwB,CAAC,KAAK,CAAC;QAC/B,KAAK;KACN,CAAC,CACH,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAChD,gBAAgB,CAAC,OAAO,EAAE,eAAe,CAAC,CAC3C,CAAC;IACF,IAAI,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAC5E,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,UAAU,GAAG,8BAA8B,CAAC,QAAQ,CAAC,KAAK,EAAE;QAChE,KAAK,EAAE,eAAe,IAAI,OAAO,CAAC,aAAa,IAAI,EAAE;QACrD,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;KACpE,CAAC,CAAC;IACH,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,QAAQ;YACZ,IAAI,EAAE,gBAAgB;YACtB,OAAO,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG;YACtE,SAAS,EACP,uJAAuJ;YACzJ,QAAQ,EAAE,CAAC,YAAY,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAClD,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;IACL,CAAC;IACD,SAAS,GAAG,SAAS,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;IACnD,OAAO;QACL,KAAK;QACL,MAAM;QACN,SAAS;QACT,IAAI,EAAE;YACJ,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,YAAY;YAC1C,cAAc,EAAE,UAAU,CAAC,IAAI,CAAC,cAAc;SAC/C;KACF,CAAC;AACJ,CAAC","debugId":"ebb01d6f-d876-5196-9937-24528a66b160"}

package/dist/sdk/graph/run.d.ts

@@ -1,6 +1,6 @@
 import type { GlobalOptions } from "../../core/shared/command-types.js";
 import { type GraphCacheMetadata } from "./cache.js";
-import { type RelationshipAuditReport } from "./governance.js";
+import { type RelationshipAuditDelta, type RelationshipAuditReport } from "./governance.js";
 import { type RelationshipRemediationStep } from "./remediation.js";
 import { GRAPH_SUBCOMMAND_VALUES, type GraphSubcommand } from "../cli-contracts/enum-contracts.js";
 export { GRAPH_SUBCOMMAND_VALUES, type GraphSubcommand };
@@ -22,6 +22,14 @@ export interface GraphCommandOptions {
     sample?: string | number;
     /** Item ids treated as explicitly valid isolates by the audit. */
     exemptIsolate?: string | string[];
+    /** Item types whose active nodes are policy-valid isolates for the audit (repeatable or comma-separated). */
+    exemptIsolateType?: string | string[];
+    /** Persist the audit census as the change-since-baseline comparison point (audit only). */
+    saveBaseline?: boolean;
+    /** Rebuild and warm the durable graph index (index only). */
+    rebuild?: boolean;
+    /** Delete the durable graph index (index only). */
+    clear?: boolean;
     /** Return counts-first envelopes without row collections. */
     summary?: boolean;
 }
@@ -181,9 +189,36 @@ export interface GraphAuditResult {
     profile: RelationshipAuditReport["profile"];
     /** Ordered findings with bounded evidence samples; absent with summary. */
     findings?: RelationshipAuditReport["findings"];
+    /** Signed change since the persisted census baseline; absent when no baseline exists. */
+    baseline?: RelationshipAuditDelta;
     /** Cache observability for this invocation. */
     cache?: GraphCacheMetadata;
 }
+/** Result envelope for the durable-index maintenance subcommand. */
+export interface GraphIndexResult {
+    /** Executed graph subcommand. */
+    subcommand: "index";
+    /** Maintenance action performed by this invocation. */
+    action: "status" | "rebuilt" | "cleared";
+    /** Durable index disposition against the current workspace snapshot. */
+    state: "fresh" | "stale" | "absent";
+    /** Persisted deterministic query results in the envelope. */
+    entry_count: number;
+    /** Items in the current workspace snapshot. */
+    item_count: number;
+    /** Item threshold above which implicit persistence activates. */
+    min_items_threshold: number;
+    /** Whether queries on this workspace will persist results right now. */
+    persist_enabled: boolean;
+    /** Truncated fingerprint of the current workspace snapshot. */
+    current_fingerprint: string;
+    /** ISO timestamp of the last persisted write, absent without an envelope. */
+    saved_at?: string;
+    /** Envelope size in bytes, absent without an envelope. */
+    bytes?: number;
+    /** Cache observability; maintenance invocations never populate it. */
+    cache?: GraphCacheMetadata;
+}
 /** One bounded community row projected by the communities subcommand. */
 export interface GraphCommunityRow {
     /** Lexicographically smallest member id, naming the community. */
@@ -270,6 +305,102 @@ export interface GraphDominatorsResult {
     /** Cache observability for this invocation. */
     cache?: GraphCacheMetadata;
 }
+/** One scheduled task row projected by the slack subcommand. */
+export interface GraphScheduleRow {
+    /** Scheduled task id. */
+    id: string;
+    /** Earliest start (longest prerequisite distance). */
+    earliest_start: number;
+    /** Latest start preserving the makespan. */
+    latest_start: number;
+    /** Total float: latest start minus earliest start. */
+    slack: number;
+    /** Whether the task lies on a critical path. */
+    critical: boolean;
+}
+/** Result envelope for the critical-path slack subcommand. */
+export interface GraphSlackResult {
+    /** Executed graph subcommand. */
+    subcommand: "slack";
+    /** Whether the order-bearing graph is acyclic. */
+    acyclic: boolean;
+    /** Total makespan in unit task durations. */
+    makespan: number;
+    /** Tasks participating in the order-bearing DAG. */
+    scheduled_count: number;
+    /** Tasks with zero slack. */
+    critical_count: number;
+    /** Edge count of the longest execution path. */
+    critical_path_length: number;
+    /** Genuine ordering cycles excluded from scheduling. */
+    cycle_count: number;
+    /** Whether the row limit omitted scheduled tasks. */
+    truncated: boolean;
+    /** Longest deterministic execution path; absent with summary. */
+    critical_path?: string[];
+    /** Bounded scheduled rows, lowest slack first; absent with summary. */
+    rows?: GraphScheduleRow[];
+    /** Cache observability for this invocation. */
+    cache?: GraphCacheMetadata;
+}
+/** One node ranked by structural centrality with directed fan-in/fan-out. */
+export interface GraphCentralityRow {
+    /** Node id. */
+    id: string;
+    /** Undirected unique-neighbor degree. */
+    degree: number;
+    /** Distinct ordering predecessors that gate this node (dependency fan-in). */
+    in_degree: number;
+    /** Distinct ordering successors this node gates (dependency fan-out). */
+    out_degree: number;
+    /** Shortest-path betweenness centrality. */
+    betweenness: number;
+    /** Wasserman–Faust closeness centrality. */
+    closeness: number;
+}
+/** Result envelope for the centrality subcommand. */
+export interface GraphCentralityResult {
+    /** Executed graph subcommand. */
+    subcommand: "centrality";
+    /** Total indexed graph nodes. */
+    node_count: number;
+    /** Simple undirected edge count over selected kinds. */
+    edge_count: number;
+    /** Whether the row limit omitted ranked nodes. */
+    truncated: boolean;
+    /** Query cost metadata. */
+    cost: GraphQueryCost;
+    /** Bounded ranked node rows, highest betweenness first; absent with summary. */
+    rows?: GraphCentralityRow[];
+    /** Cache observability for this invocation. */
+    cache?: GraphCacheMetadata;
+}
+/** One bridge edge projected by the articulation subcommand. */
+export interface GraphBridgeRow {
+    /** Lexicographically smaller endpoint. */
+    source: string;
+    /** Lexicographically larger endpoint. */
+    target: string;
+}
+/** Result envelope for the articulation subcommand. */
+export interface GraphArticulationResult {
+    /** Executed graph subcommand. */
+    subcommand: "articulation";
+    /** Total articulation points (cut vertices). */
+    articulation_count: number;
+    /** Total bridge edges (cut edges). */
+    bridge_count: number;
+    /** Whether the row limit omitted articulation points or bridges. */
+    truncated: boolean;
+    /** Query cost metadata. */
+    cost: GraphQueryCost;
+    /** Bounded sorted articulation-point ids; absent with summary. */
+    articulation_points?: string[];
+    /** Bounded sorted bridge edges; absent with summary. */
+    bridges?: GraphBridgeRow[];
+    /** Cache observability for this invocation. */
+    cache?: GraphCacheMetadata;
+}
 /** Result envelope for the dry-run remediation planning subcommand. */
 export interface GraphPlanResult {
     /** Executed graph subcommand. */
@@ -292,7 +423,7 @@ export interface GraphPlanResult {
     cache?: GraphCacheMetadata;
 }
 /** Union of every graph subcommand result envelope. */
-export type GraphResult = GraphTraversalResult | GraphPathsResult | GraphImpactResult | GraphAnalyzeResult | GraphAuditResult | GraphCommunitiesResult | GraphRedundancyResult | GraphDominatorsResult | GraphPlanResult;
+export type GraphResult = GraphTraversalResult | GraphPathsResult | GraphImpactResult | GraphAnalyzeResult | GraphAuditResult | GraphCommunitiesResult | GraphRedundancyResult | GraphDominatorsResult | GraphSlackResult | GraphCentralityResult | GraphArticulationResult | GraphPlanResult | GraphIndexResult;
 /** Validate the graph subcommand and its positional-id requirements. */
 export declare function parseGraphSubcommand(raw: string, id: string | undefined, target: string | undefined): GraphSubcommand;
 /** Implements run graph for the public runtime surface of this module. */

package/dist/sdk/graph/run.js

@@ -11,7 +11,7 @@
  * queries in long-lived hosts are answered from the memoized snapshot.
  */
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="f43d15d0-c4a0-533a-b125-4333554e4ea0")}catch(e){}}();
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="7f767038-30c6-555b-b9ac-adaf98b154e2")}catch(e){}}();
 import { getActiveExtensionRegistrations } from "../../core/extensions/index.js";
 import { pathExists } from "../../core/fs/fs-utils.js";
 import { isTerminalStatus } from "../../core/item/status.js";
@@ -25,9 +25,12 @@ import { readSettings } from "../../core/store/settings.js";
 import { parseDirection, parseKinds, parseMaxDepth, parsePositiveInteger, } from "../dependencies.js";
 import { analyzeGraphImpact, analyzeKnowledgeGraph, analyzeRelationshipExecution, } from "../relationship-analytics.js";
 import { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, } from "./analytics.js";
-import { assembleWorkspaceRelationshipGraph, } from "./assembly.js";
+import { computeRelationshipCentrality, findRelationshipCutStructure, } from "./centrality.js";
+import { analyzeRelationshipSchedule } from "./scheduling.js";
+import { assembleWorkspaceRelationshipGraph, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
 import { computeWorkspaceGraphFingerprint, workspaceGraphCache, } from "./cache.js";
-import { auditWorkspaceRelationshipGraph, } from "./governance.js";
+import { clearDurableGraphCache, durableGraphCacheStatus, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, GRAPH_DURABLE_CACHE_MIN_ITEMS, } from "./durable-cache.js";
+import { auditWorkspaceRelationshipGraph, diffRelationshipAuditSnapshots, } from "./governance.js";
 import { planRelationshipRemediation, } from "./remediation.js";
 import { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, } from "./traversal.js";
 import { GRAPH_SUBCOMMAND_VALUES, } from "../cli-contracts/enum-contracts.js";
@@ -237,6 +240,9 @@ function runGraphAudit(invocation, isTerminal) {
         ...(invocation.exemptIsolates.length === 0
             ? {}
             : { exemptIsolates: invocation.exemptIsolates }),
+        ...(invocation.exemptIsolateTypes.length === 0
+            ? {}
+            : { isolateExemptTypes: invocation.exemptIsolateTypes }),
     });
     const bySeverity = {};
     const byCode = {};
@@ -356,6 +362,90 @@ function runGraphDominators(root, invocation) {
             }),
     };
 }
+/** Execute the critical-path slack (float) analysis subcommand. */
+function runGraphSlack(invocation) {
+    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
+    // Scheduling spans every ordering kind; --kind is rejected upstream by
+    // assertGraphFlagScope, so no kind filter reaches the analysis here.
+    const analysis = analyzeRelationshipSchedule(invocation.assembly.graph);
+    const criticalCount = analysis.rows.filter((row) => row.critical).length;
+    return {
+        subcommand: "slack",
+        acyclic: analysis.acyclic,
+        makespan: analysis.makespan,
+        scheduled_count: analysis.scheduledCount,
+        critical_count: criticalCount,
+        critical_path_length: analysis.criticalPathLength,
+        cycle_count: analysis.cycles.length,
+        truncated: analysis.rows.length > limit,
+        ...(invocation.summary
+            ? {}
+            : {
+                critical_path: analysis.criticalPath,
+                rows: analysis.rows.slice(0, limit).map((row) => ({
+                    id: row.id,
+                    earliest_start: row.earliestStart,
+                    latest_start: row.latestStart,
+                    slack: row.slack,
+                    critical: row.critical,
+                })),
+            }),
+    };
+}
+/** Execute the structural-centrality ranking subcommand. */
+function runGraphCentrality(invocation) {
+    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
+    const result = computeRelationshipCentrality(invocation.assembly.graph, {
+        ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
+    });
+    const analysis = result.value;
+    return {
+        subcommand: "centrality",
+        node_count: analysis.nodeCount,
+        edge_count: analysis.edgeCount,
+        truncated: analysis.rows.length > limit,
+        cost: {
+            visited_nodes: result.meta.visitedNodes,
+            inspected_edges: result.meta.inspectedEdges,
+        },
+        ...(invocation.summary
+            ? {}
+            : {
+                rows: analysis.rows.slice(0, limit).map((row) => ({
+                    id: row.id,
+                    degree: row.degree,
+                    in_degree: row.inDegree,
+                    out_degree: row.outDegree,
+                    betweenness: row.betweenness,
+                    closeness: row.closeness,
+                })),
+            }),
+    };
+}
+/** Execute the articulation-point and bridge (cut-structure) subcommand. */
+function runGraphArticulation(invocation) {
+    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
+    const result = findRelationshipCutStructure(invocation.assembly.graph, {
+        ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
+    });
+    const { articulationPoints, bridges } = result.value;
+    return {
+        subcommand: "articulation",
+        articulation_count: articulationPoints.length,
+        bridge_count: bridges.length,
+        truncated: articulationPoints.length > limit || bridges.length > limit,
+        cost: {
+            visited_nodes: result.meta.visitedNodes,
+            inspected_edges: result.meta.inspectedEdges,
+        },
+        ...(invocation.summary
+            ? {}
+            : {
+                articulation_points: articulationPoints.slice(0, limit),
+                bridges: bridges.slice(0, limit),
+            }),
+    };
+}
 /** Execute the dry-run remediation planning subcommand. */
 function runGraphPlan(invocation, isTerminal) {
     const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
@@ -368,6 +458,9 @@ function runGraphPlan(invocation, isTerminal) {
         ...(invocation.exemptIsolates.length === 0
             ? {}
             : { exemptIsolates: invocation.exemptIsolates }),
+        ...(invocation.exemptIsolateTypes.length === 0
+            ? {}
+            : { isolateExemptTypes: invocation.exemptIsolateTypes }),
     });
     const byOp = {};
     const byCode = {};
@@ -407,6 +500,9 @@ function buildGraphQueryKey(subcommand, root, pathsTarget, invocation) {
         exemptIsolates: [
             ...new Set(invocation.exemptIsolates.map((id) => id.toLowerCase())),
         ].sort(),
+        exemptIsolateTypes: [
+            ...new Set(invocation.exemptIsolateTypes.map((type) => type.toLowerCase())),
+        ].sort(),
         summary: invocation.summary,
     });
 }
@@ -424,12 +520,105 @@ function executeGraphSubcommand(subcommand, root, pathsTarget, invocation, isTer
         return runGraphRedundancy(invocation);
     if (subcommand === "dominators")
         return runGraphDominators(root, invocation);
+    if (subcommand === "slack")
+        return runGraphSlack(invocation);
+    if (subcommand === "centrality")
+        return runGraphCentrality(invocation);
+    if (subcommand === "articulation")
+        return runGraphArticulation(invocation);
     if (subcommand === "paths")
         return runGraphPaths(root, pathsTarget, invocation);
     if (subcommand === "impact")
         return runGraphImpact(root, invocation);
     return runGraphTraversal(subcommand, root, invocation);
 }
+/** Reject maintenance or baseline flags outside their owning subcommand. */
+function assertGraphFlagScope(subcommand, options) {
+    if (subcommand !== "index" &&
+        (options.rebuild === true || options.clear === true))
+        throw new PmCliError("--rebuild and --clear apply only to graph index.", EXIT_CODE.USAGE);
+    if (subcommand !== "audit" && options.saveBaseline === true)
+        throw new PmCliError("--save-baseline applies only to graph audit.", EXIT_CODE.USAGE);
+    // Slack schedules the whole ordering DAG (reusing the exact execution
+    // analysis, which has no kind filter), so reject --kind instead of silently
+    // ignoring it and letting the cache key diverge on an inert option.
+    if (subcommand === "slack" && options.kind !== undefined)
+        throw new PmCliError("graph slack analyzes every ordering kind; --kind is not supported.", EXIT_CODE.USAGE);
+    if (options.rebuild === true && options.clear === true)
+        throw new PmCliError("graph index accepts either --rebuild or --clear, not both.", EXIT_CODE.USAGE);
+}
+/**
+ * Execute the durable-index maintenance subcommand: report status, delete the
+ * envelope, or rebuild it and warm the counts-first analyze and audit census
+ * queries so follow-up summary invocations answer from the persisted index.
+ * A rebuild is also the explicit opt-in that enables persistence on
+ * workspaces below the implicit item threshold.
+ */
+async function runGraphIndex(pmRoot, fingerprint, invocation, itemCount, isTerminal, options) {
+    let action = "status";
+    if (options.clear === true) {
+        await clearDurableGraphCache(pmRoot);
+        action = "cleared";
+    }
+    if (options.rebuild === true) {
+        await clearDurableGraphCache(pmRoot);
+        const view = await openDurableGraphCache(pmRoot, fingerprint);
+        const warmInvocation = {
+            assembly: invocation.assembly,
+            direction: "both",
+            exemptIsolates: [],
+            exemptIsolateTypes: [],
+            saveBaseline: false,
+            summary: true,
+        };
+        for (const warm of ["analyze", "audit"]) {
+            await persistDurableGraphResult(pmRoot, fingerprint, view, buildGraphQueryKey(warm, undefined, undefined, warmInvocation), executeGraphSubcommand(warm, undefined, undefined, warmInvocation, isTerminal));
+        }
+        action = "rebuilt";
+    }
+    const status = await durableGraphCacheStatus(pmRoot, fingerprint);
+    return {
+        subcommand: "index",
+        action,
+        state: status.exists ? (status.fresh ? "fresh" : "stale") : "absent",
+        entry_count: status.entry_count,
+        item_count: itemCount,
+        min_items_threshold: GRAPH_DURABLE_CACHE_MIN_ITEMS,
+        persist_enabled: shouldPersistDurableGraphCache(itemCount, status.exists),
+        current_fingerprint: fingerprint.slice(0, 12),
+        ...(status.saved_at === undefined ? {} : { saved_at: status.saved_at }),
+        ...(status.bytes === undefined ? {} : { bytes: status.bytes }),
+    };
+}
+/**
+ * Attach the change-since-baseline census delta to one audit envelope and
+ * persist the current census when the caller requested a new baseline. The
+ * delta always compares against the baseline as it existed before this
+ * invocation, so `--save-baseline` reports drift once and then resets it.
+ */
+async function applyAuditBaseline(pmRoot, fingerprint, audit, saveBaseline) {
+    const current = {
+        saved_at: new Date().toISOString(),
+        fingerprint,
+        affected_subjects_by_code: audit.affected_subjects_by_code,
+        profile: audit.profile,
+    };
+    const stored = await loadGraphAuditBaseline(pmRoot);
+    if (saveBaseline)
+        await saveGraphAuditBaseline(pmRoot, current);
+    return stored === undefined
+        ? audit
+        : { ...audit, baseline: diffRelationshipAuditSnapshots(stored, current) };
+}
+/** Persist a rebuildable query result without allowing storage failure to reject the query. */
+async function persistDurableGraphResultBestEffort(pmRoot, fingerprint, view, queryKey, result) {
+    try {
+        await persistDurableGraphResult(pmRoot, fingerprint, view, queryKey, result);
+    }
+    catch {
+        // The in-memory result remains authoritative; the next invocation can rebuild the cache.
+    }
+}
 /** Implements run graph for the public runtime surface of this module. */
 export async function runGraph(subcommandRaw, id, target, options, global) {
     const subcommand = parseGraphSubcommand(subcommandRaw, id, target);
@@ -442,8 +631,10 @@ export async function runGraph(subcommandRaw, id, target, options, global) {
     const items = await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);
     const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);
     const isTerminal = (status) => isTerminalStatus(status, statusRegistry);
-    const kinds = parseKinds(options.kind);
-    const lookup = workspaceGraphCache().lookup(pmRoot, computeWorkspaceGraphFingerprint(items, isTerminal), () => assembleWorkspaceRelationshipGraph(items, isTerminal));
+    assertGraphFlagScope(subcommand, options);
+    const relationshipRegistry = resolveWorkspaceRelationshipKindRegistry();
+    const kinds = parseKinds(options.kind, relationshipRegistry);
+    const lookup = workspaceGraphCache().lookup(pmRoot, computeWorkspaceGraphFingerprint(items, isTerminal, relationshipRegistry), () => assembleWorkspaceRelationshipGraph(items, isTerminal, relationshipRegistry));
     const invocation = {
         assembly: lookup.assembly,
         ...(kinds === undefined ? {} : { kinds }),
@@ -454,23 +645,41 @@ export async function runGraph(subcommandRaw, id, target, options, global) {
         maxPaths: parsePositiveInteger(options.maxPaths, "max-paths"),
         sample: parsePositiveInteger(options.sample, "sample"),
         exemptIsolates: normalizeIdList(options.exemptIsolate),
+        exemptIsolateTypes: normalizeIdList(options.exemptIsolateType),
+        saveBaseline: options.saveBaseline === true,
         summary: options.summary === true,
     };
+    if (subcommand === "index") {
+        return runGraphIndex(pmRoot, lookup.fingerprint, invocation, items.length, isTerminal, options);
+    }
     const root = ROOTED_SUBCOMMANDS.has(subcommand)
         ? canonicalizeGraphId(invocation.assembly, id)
         : undefined;
     const pathsTarget = subcommand === "paths"
         ? canonicalizeGraphId(invocation.assembly, target)
         : undefined;
-    const memo = lookup.memoize(buildGraphQueryKey(subcommand, root, pathsTarget, invocation), () => executeGraphSubcommand(subcommand, root, pathsTarget, invocation, isTerminal));
+    const queryKey = buildGraphQueryKey(subcommand, root, pathsTarget, invocation);
+    const durableView = await openDurableGraphCache(pmRoot, lookup.fingerprint);
+    const durableValue = durableView.results[queryKey];
+    const memo = lookup.memoize(queryKey, () => durableValue !== undefined
+        ? structuredClone(durableValue)
+        : executeGraphSubcommand(subcommand, root, pathsTarget, invocation, isTerminal));
+    const persistEnabled = shouldPersistDurableGraphCache(items.length, durableView.exists);
+    if (!memo.reused && durableValue === undefined && persistEnabled) {
+        await persistDurableGraphResultBestEffort(pmRoot, lookup.fingerprint, durableView, queryKey, memo.value);
+    }
+    const value = memo.value.subcommand === "audit"
+        ? await applyAuditBaseline(pmRoot, lookup.fingerprint, memo.value, invocation.saveBaseline)
+        : memo.value;
     return {
-        ...memo.value,
+        ...value,
         cache: {
             fingerprint: lookup.fingerprint.slice(0, 12),
             assembly: lookup.assemblyReused ? "hit" : "miss",
             result: memo.reused ? "hit" : "miss",
+            durable: durableValue !== undefined ? "hit" : persistEnabled ? "miss" : "off",
         },
     };
 }
 //# sourceMappingURL=run.js.map
-//# debugId=f43d15d0-c4a0-533a-b125-4333554e4ea0
+//# debugId=7f767038-30c6-555b-b9ac-adaf98b154e2