@unbrained/pm-cli 2026.8.12 → 2026.8.14

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

@@ -13,11 +13,11 @@
  * agents can plan remediation without re-deriving context.
  */
 import type { RelationshipEdge } from "../relationships.js";
-import type { WorkspaceRelationshipAssembly } from "./assembly.js";
+import type { OrderingStorageContradiction, WorkspaceRelationshipAssembly } from "./assembly.js";
+import { type RelationshipAuditFindingCode } from "./governance-contracts.js";
+export type { RelationshipAuditFindingCode } from "./governance-contracts.js";
 /** Severity ladder shared by every relationship audit finding. */
 export type RelationshipAuditSeverity = "error" | "warning" | "info";
-/** Machine-readable identifier for one relationship audit finding family. */
-export type RelationshipAuditFindingCode = "missing_reference_active" | "missing_reference_terminal" | "legacy_no_blocker_sentinel" | "ordering_cycle" | "legacy_ordering_cycle" | "duplicate_edge" | "legacy_duplicate_edge" | "duplicate_dependency_row" | "legacy_duplicate_dependency_row" | "stale_lifecycle_block" | "isolated_active_node" | "sparse_active_node";
 /** One policy-aware relationship audit finding with bounded evidence. */
 export interface RelationshipAuditFinding {
     /** Machine-readable finding family identifier. */
@@ -32,6 +32,8 @@ export interface RelationshipAuditFinding {
     count: number;
     /** Deterministic bounded sample of affected subjects. */
     sample: string[];
+    /** Optional exact evidence that explains why the sampled subjects were selected. */
+    evidence?: string[];
     /** Whether {@link sample} was truncated by the configured sample bound. */
     sample_truncated: boolean;
     /** Safe machine-actionable next step; audits never invent or auto-apply edges. */
@@ -50,8 +52,16 @@ export interface RelationshipCoverageTypeProfile {
 export interface RelationshipCoverageProfile {
     /** Total indexed nodes including materialized missing placeholders. */
     nodes: number;
+    /** Tracker-recorded nodes, excluding synthesized missing and external placeholders. */
+    recorded_nodes?: number;
     /** Total deduplicated indexed edges. */
     edges: number;
+    /** Edges that remain after excluding redundant and contradictory storage rows. */
+    informative_edges?: number;
+    /** Stored edges implied by a bounded longer path in the same semantic family. */
+    redundant_edges?: number;
+    /** Structured ordering edges that contradict a same-target scalar blocker. */
+    ordering_contradiction_edges?: number;
     /** Counting convention used by edges and edges_by_kind. */
     edge_basis: "deduplicated_directed";
     /** Deterministic per-kind edge counts. */
@@ -72,6 +82,34 @@ export interface RelationshipCoverageProfile {
     degree_leq_one_active_nodes: number;
     /** Deterministic per-type connectivity coverage; untyped nodes bucket under `(untyped)`. */
     coverage_by_type: Record<string, RelationshipCoverageTypeProfile>;
+    /** Undirected cut vertices whose removal increases the component count. */
+    articulation_points: number;
+    /** Undirected cut edges whose removal disconnects their endpoints. */
+    bridge_edges: number;
+    /** Milestone nodes whose title explicitly declares an outcome. */
+    outcome_nodes: number;
+    /** Active non-outcome nodes with a typed hierarchy or implements path to an outcome. */
+    active_outcome_reachable_nodes: number;
+    /** Active non-outcome nodes without a typed hierarchy or implements path to an outcome. */
+    active_outcome_unreachable_nodes: number;
+    /** Active typed-outcome reachability expressed as integer basis points. */
+    active_outcome_reachability_basis_points: number;
+    /** Terminal non-placeholder, non-outcome nodes included in the all-status census. */
+    terminal_nodes: number;
+    /** Terminal non-outcome nodes with a typed hierarchy or implements path to an outcome. */
+    terminal_outcome_reachable_nodes: number;
+    /** Terminal non-outcome nodes without a typed hierarchy or implements path to an outcome. */
+    terminal_outcome_unreachable_nodes: number;
+    /** Terminal typed-outcome reachability expressed as integer basis points. */
+    terminal_outcome_reachability_basis_points: number;
+    /** All active and terminal non-outcome nodes with a typed path to an outcome. */
+    outcome_reachable_nodes: number;
+    /** All active and terminal non-outcome nodes without a typed path to an outcome. */
+    outcome_unreachable_nodes: number;
+    /** All-status typed-outcome reachability expressed as integer basis points. */
+    outcome_reachability_basis_points: number;
+    /** Affected-subject census containing every known finding code, including zero populations. */
+    finding_subjects_by_code: Record<RelationshipAuditFindingCode, number>;
 }
 /** Tuning and policy inputs accepted by the relationship audit. */
 export interface RelationshipAuditOptions {
@@ -106,6 +144,8 @@ export declare function isSemanticContextKind(kind: string): boolean;
  * advisories) share one cycle semantics with the workspace audit.
  */
 export declare function collectOrderingCycles(successors: Map<string, string[]>): string[][];
+/** Format the exact contradictory storage pair that manufactures an ordering cycle. */
+export declare function formatOrderingStorageContradiction(contradiction: Pick<OrderingStorageContradiction, "holder_id" | "target_id" | "dependency_kind">): string;
 /** One duplicate-edge group in semantic orientation with its stored spellings. */
 export interface DuplicateRelationshipEdgeGroup {
     /** Semantic tail node shared by every stored spelling. */
@@ -161,8 +201,16 @@ export interface RelationshipAuditDelta {
     profile: {
         /** Node-count change including missing placeholders. */
         nodes: number;
+        /** Tracker-recorded node-count change excluding synthesized placeholders. */
+        recorded_nodes?: number;
         /** Deduplicated edge-count change. */
         edges: number;
+        /** Informative edge-count change after non-information deductions. */
+        informative_edges?: number;
+        /** Redundant edge-count change. */
+        redundant_edges?: number;
+        /** Ordering contradiction edge-count change. */
+        ordering_contradiction_edges?: number;
         /** Active-node-count change. */
         active_nodes: number;
         /** Missing-placeholder-count change. */

package/dist/sdk/graph/governance.js

@@ -1,8 +1,13 @@
 
-!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]="996cfe8f-1b9b-534e-9e22-ede6f76d7cac")}catch(e){}}();
-import { isTransitiveKind, orientTransitiveEdge, transitiveFamilyKey, } from "./analytics.js";
+!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]="1955b7a4-385d-5a5d-8856-6db9f94814aa")}catch(e){}}();
+import { findRedundantRelationshipEdges, isTransitiveKind, orientTransitiveEdge, transitiveFamilyKey, } from "./analytics.js";
+import { findRelationshipCutStructure } from "./centrality.js";
+import { RELATIONSHIP_AUDIT_FINDING_CODES, } from "./governance-contracts.js";
 /** Default bounded sample size applied to every finding family. */
 const DEFAULT_MAX_SAMPLE_SIZE = 25;
+/** Canonical item type and title marker that identify explicit outcomes. */
+const OUTCOME_MILESTONE_TYPE = "milestone";
+const OUTCOME_MILESTONE_TITLE_PREFIX = "outcome milestone:";
 /** Relationship kinds that preserve why work exists or how evidence supports it. */
 const SEMANTIC_CONTEXT_KINDS = new Set([
     "discovered_from",
@@ -20,8 +25,14 @@ const SEVERITY_RANK = {
     warning: 1,
     info: 2,
 };
+/** Normalize optional exemption identifiers into a case-insensitive lookup set. */
+function normalizeExemptionSet(values) {
+    return new Set((values ?? [])
+        .filter((value) => typeof value === "string")
+        .map((value) => value.trim().toLowerCase()));
+}
 /** Build one finding with deterministic bounded sampling over sorted subjects. */
-function buildFinding(code, severity, policy, describe, subjects, maxSampleSize, remediation) {
+function buildFinding(code, severity, policy, describe, subjects, maxSampleSize, remediation, evidence) {
     const sorted = [...subjects].sort((left, right) => left.localeCompare(right));
     return {
         code,
@@ -32,6 +43,13 @@ function buildFinding(code, severity, policy, describe, subjects, maxSampleSize,
         sample: sorted.slice(0, maxSampleSize),
         sample_truncated: sorted.length > maxSampleSize,
         remediation,
+        ...(evidence === undefined
+            ? {}
+            : {
+                evidence: [...evidence]
+                    .sort((left, right) => left.localeCompare(right))
+                    .slice(0, maxSampleSize),
+            }),
     };
 }
 /** Resolve the ordering-only successor adjacency for cycle analysis. */
@@ -172,6 +190,21 @@ function isActiveAuditMember(member, nodeStates) {
         return true;
     return !state.terminal;
 }
+/** Format the exact contradictory storage pair that manufactures an ordering cycle. */
+export function formatOrderingStorageContradiction(contradiction) {
+    return `${contradiction.holder_id} -> ${contradiction.target_id} (blocked_by scalar + ${contradiction.dependency_kind} dependency)`;
+}
+/** Report active and historical scalar-versus-structured ordering contradictions. */
+function collectOrderingStorageContradictionFindings(assembly, maxSampleSize) {
+    const active = [];
+    const legacy = [];
+    for (const contradiction of assembly.orderingContradictions ?? [])
+        (contradiction.legacy_terminal ? legacy : active).push(formatOrderingStorageContradiction(contradiction));
+    const findings = [];
+    appendFinding(findings, active, maxSampleSize, "ordering_storage_contradiction", "error", "A scalar blocker and same-target structured ordering row must not assert opposite precedence.", (count) => `${count} active scalar-versus-structured ordering contradiction(s)`, "Remove the structured dependency row that points the holder before its scalar blocker, or replace both representations with one unambiguous ordering edge.");
+    appendFinding(findings, legacy, maxSampleSize, "legacy_ordering_storage_contradiction", "info", "Terminal scalar-versus-structured ordering contradictions are exact historical storage defects with no live scheduling effect.", (count) => `${count} terminal scalar-versus-structured ordering contradiction(s)`, "Remove the contradictory blocks dependency row in a dedicated changelog-safe closed-item batch; preserve the scalar blocker as the historical precedence record.");
+    return findings;
+}
 /** Collect ordering-cycle and lifecycle-block governance findings. */
 function collectOrderingFindings(assembly, nodeStates, isBlocked, maxSampleSize) {
     const findings = [];
@@ -181,9 +214,18 @@ function collectOrderingFindings(assembly, nodeStates, isBlocked, maxSampleSize)
         // it cannot make live work unschedulable, and "repairing" it would touch
         // closed items (changelog drag), so it downgrades to informational debt.
         const active = cycle.some((member) => isActiveAuditMember(member, nodeStates));
+        const cycleMembers = new Set(cycle.map((member) => member.toLowerCase()));
+        const contradictionEvidence = (assembly.orderingContradictions ?? [])
+            .filter((row) => cycleMembers.has(row.holder_id.toLowerCase()) &&
+            cycleMembers.has(row.target_id.toLowerCase()))
+            .map(formatOrderingStorageContradiction);
         findings.push(active
-            ? buildFinding("ordering_cycle", "error", "Order-bearing relationship kinds must stay acyclic; a cycle makes every member unschedulable.", (count) => `execution-order cycle across ${count} item(s)`, cycle, maxSampleSize, "Remove or retype one ordering edge inside the cycle, or split the work so precedence is linear.")
-            : buildFinding("legacy_ordering_cycle", "info", "Ordering cycles between exclusively terminal items are historical contradictions with no scheduling effect.", (count) => `terminal-only execution-order cycle across ${count} item(s)`, cycle, maxSampleSize, "Leave as history debt, or clean up in a dedicated changelog-safe closed-item batch; never repair closed items ad hoc."));
+            ? buildFinding("ordering_cycle", "error", "Order-bearing relationship kinds must stay acyclic; a cycle makes every member unschedulable.", (count) => `execution-order cycle across ${count} item(s)`, cycle, maxSampleSize, "Remove or retype one ordering edge inside the cycle, or split the work so precedence is linear.", contradictionEvidence.length === 0
+                ? undefined
+                : contradictionEvidence)
+            : buildFinding("legacy_ordering_cycle", "info", "Ordering cycles between exclusively terminal items are historical contradictions with no scheduling effect.", (count) => `terminal-only execution-order cycle across ${count} item(s)`, cycle, maxSampleSize, "Leave as history debt, or clean up in a dedicated changelog-safe closed-item batch; never repair closed items ad hoc.", contradictionEvidence.length === 0
+                ? undefined
+                : contradictionEvidence));
     }
     const predecessorsByNode = new Map();
     for (const [predecessor, adjacent] of orderingAdjacency)
@@ -290,6 +332,104 @@ function collectDuplicateRowFindings(assembly, maxSampleSize) {
     appendFinding(findings, legacy, maxSampleSize, "legacy_duplicate_dependency_row", "info", "Identical repeated dependency rows on terminal holders are historical storage noise with no scheduling effect.", (count) => `${count} exactly duplicated stored dependency row(s) on terminal holder(s)`, "Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.");
     return findings;
 }
+/** Build the reverse typed paths that can carry context toward an outcome. */
+function buildOutcomeReverseIndex(assembly, signal) {
+    const reverse = new Map();
+    for (const edge of assembly.graph.edges()) {
+        signal?.throwIfAborted();
+        const definition = assembly.graph.registry().require(edge.kind);
+        let oriented;
+        if (definition.hierarchy) {
+            oriented = orientTransitiveEdge(edge, definition);
+        }
+        else if (definition.kind === "implements") {
+            oriented = { from: edge.source, to: edge.target };
+        }
+        if (oriented === undefined)
+            continue;
+        const sources = reverse.get(oriented.to) ?? new Set();
+        sources.add(oriented.from);
+        reverse.set(oriented.to, sources);
+    }
+    return reverse;
+}
+/** Expand outcome nodes through every deterministic reverse typed path. */
+function expandOutcomeReachability(outcomes, reverse, signal) {
+    const reachable = new Set(outcomes);
+    const queue = [...outcomes].sort();
+    for (let index = 0; index < queue.length; index += 1) {
+        signal?.throwIfAborted();
+        for (const source of [...(reverse.get(queue[index]) ?? [])].sort()) {
+            if (reachable.has(source))
+                continue;
+            reachable.add(source);
+            queue.push(source);
+        }
+    }
+    return reachable;
+}
+/** Count active and terminal nodes against the resolved outcome-reachable set. */
+function tallyOutcomeReachability(nodeStates, outcomes, reachable, signal) {
+    let activeReachable = 0;
+    let activeUnreachable = 0;
+    let terminal = 0;
+    let terminalReachable = 0;
+    for (const state of nodeStates.values()) {
+        signal?.throwIfAborted();
+        if (outcomes.has(state.id))
+            continue;
+        if (state.missing || state.status === "external")
+            continue;
+        if (state.terminal) {
+            terminal += 1;
+            if (reachable.has(state.id))
+                terminalReachable += 1;
+            continue;
+        }
+        if (reachable.has(state.id))
+            activeReachable += 1;
+        else
+            activeUnreachable += 1;
+    }
+    const active = activeReachable + activeUnreachable;
+    const terminalUnreachable = terminal - terminalReachable;
+    const outcomeReachable = activeReachable + terminalReachable;
+    const outcomeUnreachable = activeUnreachable + terminalUnreachable;
+    const outcomePopulation = outcomeReachable + outcomeUnreachable;
+    return {
+        active_outcome_reachable_nodes: activeReachable,
+        active_outcome_unreachable_nodes: activeUnreachable,
+        active_outcome_reachability_basis_points: active === 0 ? 0 : Math.floor((activeReachable * 10_000) / active),
+        terminal_nodes: terminal,
+        terminal_outcome_reachable_nodes: terminalReachable,
+        terminal_outcome_unreachable_nodes: terminalUnreachable,
+        terminal_outcome_reachability_basis_points: terminal === 0 ? 0 : Math.floor((terminalReachable * 10_000) / terminal),
+        outcome_reachable_nodes: outcomeReachable,
+        outcome_unreachable_nodes: outcomeUnreachable,
+        outcome_reachability_basis_points: outcomePopulation === 0
+            ? 0
+            : Math.floor((outcomeReachable * 10_000) / outcomePopulation),
+    };
+}
+/**
+ * Count nodes with an explicit typed path to an outcome milestone. Hierarchy
+ * edges flow child to parent and `implements` flows implementation to outcome;
+ * unrelated association edges deliberately contribute no reachability.
+ */
+function profileOutcomeReachability(assembly, nodeStates, signal) {
+    const outcomes = new Set(assembly.details
+        .filter((detail) => detail.type?.toLowerCase() === OUTCOME_MILESTONE_TYPE &&
+        detail.title
+            .trim()
+            .toLowerCase()
+            .startsWith(OUTCOME_MILESTONE_TITLE_PREFIX))
+        .map((detail) => detail.id));
+    const reachable = expandOutcomeReachability(outcomes, buildOutcomeReverseIndex(assembly, signal), signal);
+    return {
+        outcome_nodes: outcomes.size,
+        ...tallyOutcomeReachability(nodeStates, outcomes, reachable, signal),
+    };
+}
 /** Fold one active node's degree into the aggregate and per-type coverage tallies. */
 function tallyActiveCoverageNode(tallies, state, degree, exemptIsolates, isolateExemptTypes) {
     tallies.active += 1;
@@ -316,7 +456,7 @@ function tallyActiveCoverageNode(tallies, state, degree, exemptIsolates, isolate
     else
         tallies.sparse.push(state.id);
 }
-function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExemptTypes, maxSampleSize, edgesByKind) {
+function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExemptTypes, maxSampleSize, edgesByKind, signal) {
     const tallies = {
         active: 0,
         missing: 0,
@@ -327,6 +467,7 @@ function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExem
         byType: new Map(),
     };
     for (const id of assembly.graph.nodes()) {
+        signal?.throwIfAborted();
         const state = nodeStates.get(id);
         /* c8 ignore next -- every graph node originates from assembly details by construction */
         if (!state)
@@ -344,13 +485,27 @@ function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExem
     appendFinding(findings, isolates, maxSampleSize, "isolated_active_node", "warning", "Active work should be reachable from the graph unless explicitly declared a valid isolate.", (count) => `${count} active item(s) with no relationships`, "Link the item to its parent, prerequisite, or origin — or register it as an exempt isolate.");
     appendFinding(findings, sparse, maxSampleSize, "sparse_active_node", "info", "Active items with a single edge often miss an honest semantic partner; sparse is not automatically defective.", (count) => `${count} active item(s) with exactly one relationship`, "Investigate for an honest second edge (story->task, defect family, cross-epic complement); do not fabricate one.");
     const edgeCount = assembly.graph.edges().length;
+    const redundantEdges = findRedundantRelationshipEdges(assembly.graph, {
+        signal,
+    }).value;
+    const nonInformativeEdgeKeys = new Set(redundantEdges.map(({ edge }) => `${edge.source.toLowerCase()}\u0000${edge.target.toLowerCase()}\u0000${edge.kind}`));
+    for (const contradiction of assembly.orderingContradictions ?? [])
+        nonInformativeEdgeKeys.add(`${contradiction.holder_id.toLowerCase()}\u0000${contradiction.target_id.toLowerCase()}\u0000${contradiction.dependency_kind}`);
     const sortedEdgesByKind = Object.fromEntries(Object.entries(edgesByKind).sort(([left], [right]) => left.localeCompare(right)));
     const semanticEdges = Object.entries(sortedEdgesByKind).reduce((count, [kind, value]) => count + (isSemanticContextKind(kind) ? value : 0), 0);
+    const cutStructure = findRelationshipCutStructure(assembly.graph, {
+        signal,
+    }).value;
+    const outcomeReachability = profileOutcomeReachability(assembly, nodeStates, signal);
     return {
         findings,
         profile: {
             nodes: assembly.graph.nodes().length,
+            recorded_nodes: assembly.details.filter((detail) => detail.status !== "missing" && detail.status !== "external").length,
             edges: edgeCount,
+            informative_edges: edgeCount - nonInformativeEdgeKeys.size,
+            redundant_edges: redundantEdges.length,
+            ordering_contradiction_edges: assembly.orderingContradictions?.length ?? 0,
             edge_basis: "deduplicated_directed",
             edges_by_kind: sortedEdgesByKind,
             edge_share_by_kind: Object.fromEntries(Object.entries(sortedEdgesByKind).map(([kind, count]) => [
@@ -364,6 +519,10 @@ function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExem
             isolated_active_nodes: tallies.isolated,
             degree_leq_one_active_nodes: tallies.degreeLeqOne,
             coverage_by_type: Object.fromEntries([...tallies.byType.entries()].sort(([left], [right]) => left < right ? -1 : 1)),
+            articulation_points: cutStructure.articulationPoints.length,
+            bridge_edges: cutStructure.bridges.length,
+            ...outcomeReachability,
+            finding_subjects_by_code: Object.fromEntries(RELATIONSHIP_AUDIT_FINDING_CODES.map((code) => [code, 0])),
         },
     };
 }
@@ -384,12 +543,8 @@ export function auditWorkspaceRelationshipGraph(assembly, options = {}) {
     const maxSampleSize = options.maxSampleSize ?? DEFAULT_MAX_SAMPLE_SIZE;
     if (!Number.isInteger(maxSampleSize) || maxSampleSize < 1)
         throw new TypeError(`Invalid audit sample bound: ${String(options.maxSampleSize)}`);
-    const exemptIsolates = new Set((options.exemptIsolates ?? [])
-        .filter((id) => typeof id === "string")
-        .map((id) => id.trim().toLowerCase()));
-    const isolateExemptTypes = new Set((options.isolateExemptTypes ?? [])
-        .filter((type) => typeof type === "string")
-        .map((type) => type.trim().toLowerCase()));
+    const exemptIsolates = normalizeExemptionSet(options.exemptIsolates);
+    const isolateExemptTypes = normalizeExemptionSet(options.isolateExemptTypes);
     const nodeStates = new Map(assembly.details.map((detail) => [
         detail.id,
         {
@@ -406,18 +561,27 @@ export function auditWorkspaceRelationshipGraph(assembly, options = {}) {
         edgesByKind[edge.kind] = (edgesByKind[edge.kind] ?? 0) + 1;
     const findings = collectIntegrityFindings(assembly, isTerminal, maxSampleSize);
     options.signal?.throwIfAborted();
+    findings.push(...collectOrderingStorageContradictionFindings(assembly, maxSampleSize));
+    options.signal?.throwIfAborted();
     findings.push(...collectOrderingFindings(assembly, nodeStates, isBlocked, maxSampleSize));
     options.signal?.throwIfAborted();
     findings.push(...collectDuplicateEdgeFindings(assembly, nodeStates, maxSampleSize), ...collectDuplicateRowFindings(assembly, maxSampleSize));
     options.signal?.throwIfAborted();
-    const coverage = collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExemptTypes, maxSampleSize, edgesByKind);
+    const coverage = collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExemptTypes, maxSampleSize, edgesByKind, options.signal);
     findings.push(...coverage.findings);
     findings.sort((left, right) => SEVERITY_RANK[left.severity] - SEVERITY_RANK[right.severity] ||
         left.code.localeCompare(right.code) ||
         left.sample[0].localeCompare(right.sample[0]));
+    const findingSubjectsByCode = coverage.profile.finding_subjects_by_code;
+    for (const finding of findings) {
+        findingSubjectsByCode[finding.code] += finding.count;
+    }
     return {
         findings,
-        profile: coverage.profile,
+        profile: {
+            ...coverage.profile,
+            finding_subjects_by_code: findingSubjectsByCode,
+        },
     };
 }
 /** Subtract two count records, keeping only non-zero signed deltas in sorted key order. */
@@ -437,45 +601,62 @@ function diffCountRecords(baseline, current) {
 function readSnapshotCoverageByType(snapshot) {
     return snapshot.profile.coverage_by_type ?? {};
 }
-/**
- * Compare two point-in-time audit snapshots and return the signed change in
- * findings and structural coverage. This is the temporal primitive behind
- * change-since-baseline audit reporting: agents track census drift across
- * sessions without re-deriving or storing full finding collections.
- */
-export function diffRelationshipAuditSnapshots(baseline, current) {
-    const coverageByType = {};
-    // Public SDK callers may compare legacy or JSON-decoded snapshots created
-    // before per-type coverage was added, even though current typed snapshots
-    // always carry this field.
-    const baselineCoverageByType = readSnapshotCoverageByType(baseline);
-    const currentCoverageByType = readSnapshotCoverageByType(current);
-    const typeKeys = [
+/** Diff per-type coverage while omitting unchanged type rows. */
+function diffCoverageByType(baseline, current) {
+    const deltas = {};
+    const baselineCoverage = readSnapshotCoverageByType(baseline);
+    const currentCoverage = readSnapshotCoverageByType(current);
+    const types = [
         ...new Set([
-            ...Object.keys(baselineCoverageByType),
-            ...Object.keys(currentCoverageByType),
+            ...Object.keys(baselineCoverage),
+            ...Object.keys(currentCoverage),
         ]),
     ].sort();
-    for (const type of typeKeys) {
-        const before = Object.assign({ active: 0, isolated: 0, degree_leq_one: 0 }, baselineCoverageByType[type]);
-        const after = Object.assign({ active: 0, isolated: 0, degree_leq_one: 0 }, currentCoverageByType[type]);
+    for (const type of types) {
+        const before = Object.assign({ active: 0, isolated: 0, degree_leq_one: 0 }, baselineCoverage[type]);
+        const after = Object.assign({ active: 0, isolated: 0, degree_leq_one: 0 }, currentCoverage[type]);
         const delta = {
             active: after.active - before.active,
             isolated: after.isolated - before.isolated,
             degree_leq_one: after.degree_leq_one - before.degree_leq_one,
         };
         if (Object.values(delta).some((value) => value !== 0))
-            coverageByType[type] = delta;
+            deltas[type] = delta;
     }
+    return deltas;
+}
+/**
+ * Compare two point-in-time audit snapshots and return the signed change in
+ * findings and structural coverage. This is the temporal primitive behind
+ * change-since-baseline audit reporting: agents track census drift across
+ * sessions without re-deriving or storing full finding collections.
+ */
+export function diffRelationshipAuditSnapshots(baseline, current) {
+    // Public SDK callers may compare legacy or JSON-decoded snapshots created
+    // before per-type coverage was added, even though current typed snapshots
+    // always carry this field.
+    const coverageByType = diffCoverageByType(baseline, current);
     const { edge_share_by_kind: baselineEdgeShareByKind = {}, semantic_edges: baselineSemanticEdges = 0, semantic_edge_share: baselineSemanticEdgeShare = 0, } = baseline.profile;
     const { edge_share_by_kind: currentEdgeShareByKind = {}, semantic_edges: currentSemanticEdges = 0, semantic_edge_share: currentSemanticEdgeShare = 0, } = current.profile;
+    const baselineRecordedNodes = baseline.profile.recorded_nodes ?? baseline.profile.nodes;
+    const currentRecordedNodes = current.profile.recorded_nodes ?? current.profile.nodes;
+    const baselineInformativeEdges = baseline.profile.informative_edges ?? baseline.profile.edges;
+    const currentInformativeEdges = current.profile.informative_edges ?? current.profile.edges;
+    const baselineRedundantEdges = baseline.profile.redundant_edges ?? 0;
+    const currentRedundantEdges = current.profile.redundant_edges ?? 0;
+    const baselineOrderingContradictionEdges = baseline.profile.ordering_contradiction_edges ?? 0;
+    const currentOrderingContradictionEdges = current.profile.ordering_contradiction_edges ?? 0;
     return {
         baseline_saved_at: baseline.saved_at,
         same_snapshot: baseline.fingerprint === current.fingerprint,
         affected_subjects_by_code: diffCountRecords(baseline.affected_subjects_by_code, current.affected_subjects_by_code),
         profile: {
             nodes: current.profile.nodes - baseline.profile.nodes,
+            recorded_nodes: currentRecordedNodes - baselineRecordedNodes,
             edges: current.profile.edges - baseline.profile.edges,
+            informative_edges: currentInformativeEdges - baselineInformativeEdges,
+            redundant_edges: currentRedundantEdges - baselineRedundantEdges,
+            ordering_contradiction_edges: currentOrderingContradictionEdges - baselineOrderingContradictionEdges,
             active_nodes: current.profile.active_nodes - baseline.profile.active_nodes,
             missing_nodes: current.profile.missing_nodes - baseline.profile.missing_nodes,
             isolated_active_nodes: current.profile.isolated_active_nodes -
@@ -491,4 +672,4 @@ export function diffRelationshipAuditSnapshots(baseline, current) {
     };
 }
 //# sourceMappingURL=governance.js.map
-//# debugId=996cfe8f-1b9b-534e-9e22-ede6f76d7cac
+//# debugId=1955b7a4-385d-5a5d-8856-6db9f94814aa

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

@@ -12,8 +12,8 @@ export { computeRelationshipCentrality, findRelationshipCutStructure, type Graph
 export { createRelationshipGraphSnapshot, federateRelationshipGraphSnapshots, loadRelationshipGraphAdapter, MemoryRelationshipGraphAdapter, parseRelationshipGraphSnapshot, RELATIONSHIP_GRAPH_SNAPSHOT_VERSION, syncRelationshipGraphAdapter, type LoadedRelationshipGraphSnapshot, type RelationshipGraphAdapter, type RelationshipGraphAdapterContext, type RelationshipGraphAdapterReplaceContext, type RelationshipGraphAdapterSyncResult, type RelationshipGraphSnapshot, } from "./adapter.js";
 export { assertMemoryRelationshipGraphAdapterConformance, assertRelationshipGraphAdapterConformance, createRelationshipGraphScaleFixture, type RelationshipGraphAdapterConformanceCase, type RelationshipGraphAdapterConformanceReport, type RelationshipGraphScaleFixture, type RelationshipGraphScaleFixtureOptions, type RelationshipGraphScaleTopology, } from "./conformance.js";
 export { analyzeRelationshipSchedule, type GraphScheduleOptions, type RelationshipScheduleAnalysis, type RelationshipScheduleRow, } from "./scheduling.js";
-export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, type DanglingDependencyReference, type DanglingDependencyReferenceSummary, type DependencyReferenceHolder, type DependencyReferenceSource, type DuplicateDependencyRow, type WorkspaceRelationshipAssembly, type WorkspaceRelationshipItem, type WorkspaceRelationshipNodeDetails, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, type DuplicateRelationshipEdgeGroup, type RelationshipAuditDelta, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipAuditSnapshot, type RelationshipCoverageProfile, type RelationshipCoverageTypeProfile, } from "./governance.js";
+export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, type DanglingDependencyReference, type DanglingDependencyReferenceSummary, type DependencyReferenceHolder, type DependencyReferenceSource, type DuplicateDependencyRow, type OrderingStorageContradiction, type WorkspaceRelationshipAssembly, type WorkspaceRelationshipItem, type WorkspaceRelationshipNodeDetails, } from "./assembly.js";
+export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, formatOrderingStorageContradiction, type DuplicateRelationshipEdgeGroup, type RelationshipAuditDelta, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipAuditSnapshot, type RelationshipCoverageProfile, type RelationshipCoverageTypeProfile, } from "./governance.js";
 export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, type DurableGraphCacheEnvelope, type DurableGraphCacheStatus, type DurableGraphCacheView, } from "./durable-cache.js";
 export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, type GraphPathOptions, type GraphTraversalOptions, type RelationshipPath, } from "./traversal.js";
 export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, type GraphCacheMetadata, type WorkspaceGraphCacheLookup, } from "./cache.js";

package/dist/sdk/graph/index.js

@@ -8,14 +8,14 @@
  * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.
  */
 
-!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]="2c3df51e-6b10-5da6-8340-126465d9c434")}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]="b5509c6e-1431-5316-a563-16681ced4f33")}catch(e){}}();
 export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, forEachMatchedRelationshipEdge, } from "./analytics.js";
 export { computeRelationshipCentrality, findRelationshipCutStructure, } from "./centrality.js";
 export { createRelationshipGraphSnapshot, federateRelationshipGraphSnapshots, loadRelationshipGraphAdapter, MemoryRelationshipGraphAdapter, parseRelationshipGraphSnapshot, RELATIONSHIP_GRAPH_SNAPSHOT_VERSION, syncRelationshipGraphAdapter, } from "./adapter.js";
 export { assertMemoryRelationshipGraphAdapterConformance, assertRelationshipGraphAdapterConformance, createRelationshipGraphScaleFixture, } from "./conformance.js";
 export { analyzeRelationshipSchedule, } from "./scheduling.js";
-export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, } from "./governance.js";
+export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
+export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, formatOrderingStorageContradiction, } from "./governance.js";
 export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, } from "./durable-cache.js";
 export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, } from "./traversal.js";
 export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, } from "./cache.js";
@@ -23,4 +23,4 @@ export { planRelationshipRemediation, } from "./remediation.js";
 export { collectNewOrderingCycleWarnings } from "./mutation-advisory.js";
 export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, } from "./run.js";
 //# sourceMappingURL=index.js.map
-//# debugId=2c3df51e-6b10-5da6-8340-126465d9c434
+//# debugId=b5509c6e-1431-5316-a563-16681ced4f33

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

@@ -1,7 +1,7 @@
 
-!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]="4198a3b2-2541-50eb-bec5-93ac58601f40")}catch(e){}}();
-import { normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
-import { collectOrderingCycles } from "./governance.js";
+!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]="94e8b95b-35fa-5fc7-843a-481497e09b54")}catch(e){}}();
+import { collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
+import { collectOrderingCycles, formatOrderingStorageContradiction, } from "./governance.js";
 function cycleKey(component) {
     return [...component].sort().join("\u0000");
 }
@@ -153,9 +153,17 @@ export function collectNewOrderingCycleWarnings(beforeItems, afterItems, changed
     const before = collectScopedCycles(beforeItems, registry, changedItemId);
     const after = collectScopedCycles(afterItems, registry, changedItemId);
     const beforeCycles = new Set(before.cycles.map(cycleKey));
-    return after.cycles
-        .filter((component) => !beforeCycles.has(cycleKey(component)))
-        .map((component) => `ordering_cycle_created:${findCyclePath(after.successors, component, after.canonical).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`);
+    const beforeContradictions = new Set(collectOrderingStorageContradictions(beforeItems, undefined, registry).map((row) => `${row.holder_id.toLowerCase()}\u0000${row.target_id.toLowerCase()}\u0000${row.dependency_kind}`));
+    const contradictionWarnings = collectOrderingStorageContradictions(afterItems, undefined, registry)
+        .filter((row) => row.holder_id.toLowerCase() === changedItemId.trim().toLowerCase() &&
+        !beforeContradictions.has(`${row.holder_id.toLowerCase()}\u0000${row.target_id.toLowerCase()}\u0000${row.dependency_kind}`))
+        .map((row) => `ordering_storage_contradiction_created:${formatOrderingStorageContradiction(row)}:remove_contradicting_dependency_row:run_pm_graph_audit`);
+    return [
+        ...contradictionWarnings,
+        ...after.cycles
+            .filter((component) => !beforeCycles.has(cycleKey(component)))
+            .map((component) => `ordering_cycle_created:${findCyclePath(after.successors, component, after.canonical).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`),
+    ];
 }
 /** White-box graph-path helpers for exhaustive SDK primitive verification. */
 export const mutationAdvisoryTestOnly = {
@@ -166,4 +174,4 @@ export const mutationAdvisoryTestOnly = {
     findPathBackToStart,
 };
 //# sourceMappingURL=mutation-advisory.js.map
-//# debugId=4198a3b2-2541-50eb-bec5-93ac58601f40
+//# debugId=94e8b95b-35fa-5fc7-843a-481497e09b54

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]="9b8e22ad-6268-515d-994e-6b98a062ba93")}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]="1eb0e2cb-084a-5a54-b41c-29dfdd6d2f34")}catch(e){}}();
 import { findRedundantRelationshipEdges } from "./analytics.js";
 import { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, formatDuplicateEdgeGroup, } from "./governance.js";
 /** Per-finding-code operation template applied to every sampled subject. */
@@ -29,6 +29,16 @@ const FINDING_STEP_TEMPLATES = {
         confidence: "high",
         rationale: "Terminal-only ordering cycles have no scheduling effect; repairing them would mutate closed history (changelog drag).",
     },
+    ordering_storage_contradiction: {
+        op: "remove",
+        confidence: "high",
+        rationale: "The structured ordering row asserts the opposite precedence from the same-target scalar blocker; remove that exact dependency row or replace both representations with one unambiguous edge.",
+    },
+    legacy_ordering_storage_contradiction: {
+        op: "remove",
+        confidence: "high",
+        rationale: "The terminal holder contains a proven contradictory structured ordering row; remove it in a dedicated changelog-safe batch while preserving the scalar blocker as history.",
+    },
     // duplicate_edge findings are expanded into per-stored-edge remove steps by
     // the planner itself (see stepsFromDuplicateGroup); this template documents
     // the family for exhaustiveness and backs any future sample-only fallback.
@@ -155,4 +165,4 @@ export function planRelationshipRemediation(assembly, options = {}) {
     };
 }
 //# sourceMappingURL=remediation.js.map
-//# debugId=9b8e22ad-6268-515d-994e-6b98a062ba93
+//# debugId=1eb0e2cb-084a-5a54-b41c-29dfdd6d2f34

package/dist/sdk/guide.js

@@ -4,7 +4,8 @@
  * Implements the pm guide command surface and its agent-facing runtime behavior.
  */
 
-!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]="9376fbdf-c942-5fa6-9252-92125ae44e73")}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]="27be0fa5-1c6a-53de-a0e8-179aab7c795a")}catch(e){}}();
+import { isFileAbsentError } from "../core/fs/fs-utils.js";
 import { readFile } from "node:fs/promises";
 import path from "node:path";
 import { resolveConfiguredPmPackageRoot, EXIT_CODE, PmCliError, } from "./runtime-primitives.js";
@@ -119,8 +120,7 @@ async function renderGuideDocs(topic, depth, packageRoot) {
             }
         }
         catch (error) {
-            const code = error?.code;
-            const missing = code === "ENOENT";
+            const missing = isFileAbsentError(error);
             docs.push({
                 path: doc.path,
                 purpose: doc.purpose,
@@ -277,4 +277,4 @@ export function renderGuideMarkdown(result) {
     return lines.join("\n");
 }
 //# sourceMappingURL=guide.js.map
-//# debugId=9376fbdf-c942-5fa6-9252-92125ae44e73
+//# debugId=27be0fa5-1c6a-53de-a0e8-179aab7c795a