@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/graph/governance.js

@@ -1,736 +1,2 @@
-
-!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]="27de9c62-434c-566d-a000-54eddb9a16a9")}catch(e){}}();
-import { findRedundantRelationshipEdges, isTransitiveKind, orientTransitiveEdge, transitiveFamilyKey, } from "./analytics.js";
-import { findRelationshipCutStructure } from "./centrality.js";
-import { getWorkspaceHierarchyIntegrity } from "./assembly.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",
-    "incident_from",
-    "recurs_from",
-    "supersedes",
-    "verifies",
-]);
-/** Return whether a relationship kind carries provenance or verification context. */
-export function isSemanticContextKind(kind) {
-    return SEMANTIC_CONTEXT_KINDS.has(kind);
-}
-/** Rank used to order findings by decreasing severity. */
-const SEVERITY_RANK = {
-    error: 0,
-    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, evidence) {
-    const sorted = [...subjects].sort((left, right) => left.localeCompare(right));
-    return {
-        code,
-        severity,
-        policy,
-        message: describe(sorted.length),
-        count: sorted.length,
-        sample: sorted.slice(0, maxSampleSize),
-        sample_truncated: sorted.length > maxSampleSize,
-        remediation,
-        ...(evidence === undefined
-            ? {}
-            : {
-                evidence: [...evidence]
-                    .sort((left, right) => left.localeCompare(right))
-                    .slice(0, maxSampleSize),
-            }),
-    };
-}
-function collectHierarchyCycleFindings(analysis, maxSampleSize) {
-    return analysis.cycles.map((cycle) => buildFinding(cycle.legacy_terminal ? "legacy_hierarchy_cycle" : "hierarchy_cycle", cycle.legacy_terminal ? "info" : "error", "Structural hierarchy must be acyclic across scalar and registered dependency relationships.", (count) => `${count} items participate in one hierarchy cycle.`, cycle.item_ids, maxSampleSize, cycle.legacy_terminal
-        ? "Preserve historical rows unless an explicit legacy repair is approved."
-        : "Remove or retype one exact hierarchy relation before continuing mutation."));
-}
-function collectHierarchyCardinalityFindings(analysis, maxSampleSize, legacyTerminal) {
-    const rows = analysis.cardinality_violations.filter((finding) => finding.legacy_terminal === legacyTerminal);
-    if (rows.length === 0)
-        return [];
-    return [
-        buildFinding(legacyTerminal
-            ? "legacy_hierarchy_cardinality_violation"
-            : "hierarchy_cardinality_violation", legacyTerminal ? "info" : "error", "Every structural child must resolve to at most one logical parent across all hierarchy spellings.", (count) => `${count} child item${count === 1 ? "" : "s"} resolve to multiple hierarchy parents.`, rows.map((finding) => finding.child_id), maxSampleSize, legacyTerminal
-            ? "Preserve historical rows unless an explicit legacy repair is approved."
-            : "Remove the exact surplus hierarchy rows so each child has one parent.", rows.map((finding) => `${finding.child_id} <- ${finding.parent_ids.join(", ")}`)),
-    ];
-}
-function collectHierarchyDirectionFindings(analysis, maxSampleSize, legacyTerminal) {
-    const rows = analysis.divergences.filter((finding) => finding.legacy_terminal === legacyTerminal);
-    if (rows.length === 0)
-        return [];
-    return [
-        buildFinding(legacyTerminal
-            ? "legacy_hierarchy_direction_violation"
-            : "hierarchy_direction_violation", legacyTerminal ? "info" : "error", "Scalar parent metadata and dependency-backed hierarchy rows must resolve to the same logical parent.", (count) => `${count} child item${count === 1 ? "" : "s"} have divergent hierarchy storage surfaces.`, rows.map((finding) => finding.child_id), maxSampleSize, legacyTerminal
-            ? "Preserve historical rows unless an explicit legacy repair is approved."
-            : "Align the scalar parent and exact dependency rows to one canonical parent.", rows.map((finding) => `${finding.child_id}: scalar=${finding.scalar_parent_id} dependencies=${finding.dependency_parent_ids.join(",")}`)),
-    ];
-}
-/** Convert unified hierarchy analysis into lifecycle-aware governance findings. */
-function collectHierarchyIntegrityFindings(assembly, maxSampleSize) {
-    const analysis = getWorkspaceHierarchyIntegrity(assembly);
-    if (!analysis)
-        return [];
-    return [
-        ...collectHierarchyCycleFindings(analysis, maxSampleSize),
-        ...collectHierarchyCardinalityFindings(analysis, maxSampleSize, false),
-        ...collectHierarchyCardinalityFindings(analysis, maxSampleSize, true),
-        ...collectHierarchyDirectionFindings(analysis, maxSampleSize, false),
-        ...collectHierarchyDirectionFindings(analysis, maxSampleSize, true),
-    ];
-}
-/** Resolve the ordering-only successor adjacency for cycle analysis. */
-function buildOrderingAdjacency(assembly) {
-    const registry = assembly.graph.registry();
-    const successors = new Map();
-    for (const edge of assembly.graph.edges()) {
-        const definition = registry.require(edge.kind);
-        if (!definition.ordering)
-            continue;
-        // Orient every ordering edge predecessor -> successor so inverse spellings
-        // (blocked_by/blocks) land in one canonical execution-order digraph.
-        const [predecessor, successor] = (definition.precedence ?? "source_before_target") ===
-            "target_before_source"
-            ? [edge.target, edge.source]
-            : [edge.source, edge.target];
-        const adjacent = successors.get(predecessor);
-        if (adjacent)
-            adjacent.push(successor);
-        else
-            successors.set(predecessor, [successor]);
-    }
-    for (const adjacent of successors.values())
-        adjacent.sort((left, right) => left.localeCompare(right));
-    return successors;
-}
-/** Register one newly discovered Tarjan node. */
-function registerTarjanNode(node, state) {
-    state.indexes.set(node, state.nextIndex);
-    state.lowLinks.set(node, state.nextIndex);
-    state.nextIndex += 1;
-    state.stack.push(node);
-    state.onStack.add(node);
-}
-/** Visit one pending successor, returning whether the frame had work left. */
-function visitNextTarjanNeighbor(frame, frames, successors, state) {
-    const neighbors = successors.get(frame.node) ?? [];
-    if (frame.neighborIndex >= neighbors.length)
-        return false;
-    const neighbor = neighbors[frame.neighborIndex];
-    frame.neighborIndex += 1;
-    if (!state.indexes.has(neighbor)) {
-        registerTarjanNode(neighbor, state);
-        frames.push({ node: neighbor, neighborIndex: 0 });
-    }
-    else if (state.onStack.has(neighbor)) {
-        state.lowLinks.set(frame.node, Math.min(state.lowLinks.get(frame.node), state.indexes.get(neighbor)));
-    }
-    return true;
-}
-/** Complete one Tarjan frame and emit its component when it is a root. */
-function completeTarjanFrame(frame, frames, successors, state) {
-    frames.pop();
-    const parent = frames.at(-1);
-    if (parent)
-        state.lowLinks.set(parent.node, Math.min(state.lowLinks.get(parent.node), state.lowLinks.get(frame.node)));
-    if (state.lowLinks.get(frame.node) !== state.indexes.get(frame.node))
-        return;
-    const component = [];
-    while (true) {
-        const member = state.stack.pop();
-        state.onStack.delete(member);
-        component.push(member);
-        if (member === frame.node)
-            break;
-    }
-    if (component.length > 1 ||
-        (component.length === 1 &&
-            successors.get(component[0])?.includes(component[0])))
-        state.components.push(component.sort((left, right) => left.localeCompare(right)));
-}
-/**
- * Enumerate strongly connected components with more than one member (or a
- * self-loop) over an ordering-only successor digraph using an iterative Tarjan
- * traversal. Only order-bearing kinds should participate: associative kinds
- * such as `related` cannot create execution-order contradictions and stay out
- * of cycle analysis by policy. Exported so incremental consumers (mutation
- * advisories) share one cycle semantics with the workspace audit.
- */
-export function collectOrderingCycles(successors) {
-    const state = {
-        indexes: new Map(),
-        lowLinks: new Map(),
-        onStack: new Set(),
-        stack: [],
-        components: [],
-        nextIndex: 0,
-    };
-    const roots = [...successors.keys()].sort((left, right) => left.localeCompare(right));
-    for (const root of roots) {
-        if (state.indexes.has(root))
-            continue;
-        // Explicit frame stack keeps the traversal safe on deep dependency chains.
-        const frames = [{ node: root, neighborIndex: 0 }];
-        registerTarjanNode(root, state);
-        while (frames.length > 0) {
-            const frame = frames.at(-1);
-            if (visitNextTarjanNeighbor(frame, frames, successors, state))
-                continue;
-            completeTarjanFrame(frame, frames, successors, state);
-        }
-    }
-    return state.components.sort((left, right) => left[0].localeCompare(right[0]));
-}
-/** Format one dangling reference as a compact deterministic evidence string. */
-function formatDanglingReference(reference) {
-    return `${reference.holder_id} -> ${reference.target_id} (${reference.kind})`;
-}
-/** Append one finding only when its subject collection is non-empty. */
-function appendFinding(findings, subjects, maxSampleSize, code, severity, policy, describe, remediation) {
-    if (subjects.length === 0)
-        return;
-    findings.push(buildFinding(code, severity, policy, describe, subjects, maxSampleSize, remediation));
-}
-/** Collect dangling-reference and retired-sentinel governance findings. */
-function collectIntegrityFindings(assembly, isTerminal, maxSampleSize) {
-    const findings = [];
-    const references = [
-        ...assembly.dangling.active,
-        ...assembly.dangling.legacy_terminal,
-    ].filter((reference) => !reference.no_active_blocker_sentinel);
-    appendFinding(findings, references
-        .filter((reference) => !isTerminal(reference.holder_status))
-        .map(formatDanglingReference), maxSampleSize, "missing_reference_active", "error", "Active items must not reference absent targets; missing prerequisites distort scheduling.", (count) => `${count} active dangling reference(s) to absent items`, "Restore or re-create the referenced item, or remove/retype the reference on the holder.");
-    appendFinding(findings, references
-        .filter((reference) => isTerminal(reference.holder_status))
-        .map(formatDanglingReference), maxSampleSize, "missing_reference_terminal", "info", "Terminal items may retain historical references, but absent targets remain unexplainable context.", (count) => `${count} terminal dangling reference(s) to absent items`, "Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.");
-    appendFinding(findings, assembly.dangling.no_active_blocker_sentinels.map(formatDanglingReference), maxSampleSize, "legacy_no_blocker_sentinel", "info", "The pre-structured-dependency no-active-blocker sentinel is retired; real edges carry blocker state.", (count) => `${count} legacy no-active-blocker sentinel reference(s)`, "Delete the sentinel reference; blocker state is derived from blocked_by edges.");
-    return findings;
-}
-/** Decide whether one audited node still participates in active scheduling. */
-function isActiveAuditMember(member, nodeStates) {
-    const state = nodeStates.get(member);
-    // A trimmed or custom assembly may omit a member's details. Treat that
-    // unknown lifecycle conservatively as active so contradictions are never
-    // silently downgraded to legacy history debt.
-    if (!state)
-        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 = [];
-    const orderingAdjacency = buildOrderingAdjacency(assembly);
-    for (const cycle of collectOrderingCycles(orderingAdjacency)) {
-        // A cycle whose members are all terminal is a historical contradiction:
-        // 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.", 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)
-        for (const successor of adjacent) {
-            const predecessors = predecessorsByNode.get(successor);
-            if (predecessors)
-                predecessors.push(predecessor);
-            else
-                predecessorsByNode.set(successor, [predecessor]);
-        }
-    const staleLifecycleBlocks = [...nodeStates.values()]
-        .filter((state) => !state.missing &&
-        !state.terminal &&
-        isBlocked(state.status) &&
-        !(predecessorsByNode.get(state.id) ?? []).some((predecessor) => {
-            const predecessorState = nodeStates.get(predecessor);
-            // A trimmed/custom assembly may omit predecessor details. Treat that
-            // unknown state conservatively as potentially open instead of
-            // falsely declaring the lifecycle block stale.
-            return predecessorState === undefined || !predecessorState.terminal;
-        }))
-        .map((state) => state.id);
-    appendFinding(findings, staleLifecycleBlocks, maxSampleSize, "stale_lifecycle_block", "warning", "A blocked lifecycle status must be backed by at least one open ordering predecessor.", (count) => `${count} status-blocked item(s) with no open blocker edge`, 'Add a local blocker edge, declare an external blocker with --dep "id=<external-ref>,kind=blocked_by,source_kind=external", or move the item back to an active status.');
-    return findings;
-}
-/** Format one duplicate-edge group as a compact deterministic evidence string. */
-export function formatDuplicateEdgeGroup(group) {
-    const kinds = group.edges
-        .map((edge) => edge.kind)
-        .sort((left, right) => left.localeCompare(right));
-    return `${group.from} -> ${group.to} (${kinds.join(" + ")})`;
-}
-/**
- * Collect the groups of parallel same-family stored edges over the directed
- * ordering and hierarchy families. Each family joins a kind with its inverse
- * spelling in semantic orientation, so a reciprocal pair such as
- * `A blocked_by B` plus `B blocks A` collapses onto one oriented endpoint
- * pair. Only groups holding at least two stored spellings are returned, in
- * deterministic orientation order with per-group edges sorted by kind, source,
- * then target — the exact stored identities remediation planning targets.
- */
-export function collectDuplicateRelationshipEdgeGroups(assembly) {
-    const registry = assembly.graph.registry();
-    const groups = new Map();
-    for (const edge of assembly.graph.edges()) {
-        const definition = registry.require(edge.kind);
-        if (!isTransitiveKind(definition))
-            continue;
-        const oriented = orientTransitiveEdge(edge, definition);
-        if (oriented.from === oriented.to)
-            continue;
-        const key = `${transitiveFamilyKey(definition)}::${oriented.from}::${oriented.to}`;
-        const group = groups.get(key);
-        if (group)
-            group.edges.push(edge);
-        else
-            groups.set(key, { ...oriented, edges: [edge] });
-    }
-    const duplicated = [...groups.values()].filter((group) => group.edges.length >= 2);
-    // Within one oriented group every stored spelling has a distinct kind: a
-    // same-kind restatement of the same oriented pair would carry identical
-    // endpoints and is deduplicated by edge identity during graph construction.
-    for (const group of duplicated)
-        group.edges.sort((left, right) => left.kind.localeCompare(right.kind));
-    return duplicated.sort((left, right) => left.from.localeCompare(right.from) || left.to.localeCompare(right.to));
-}
-/**
- * Collect duplicate stored-edge findings from the oriented duplicate groups.
- * Transitive-reduction redundancy analysis deliberately skips the direct edge
- * under test, so these exact parallels are invisible there and this is the
- * only surface that reports them.
- */
-function collectDuplicateEdgeFindings(assembly, nodeStates, maxSampleSize) {
-    const active = [];
-    const legacy = [];
-    for (const group of collectDuplicateRelationshipEdgeGroups(assembly)) {
-        const subjects = isActiveAuditMember(group.from, nodeStates) ||
-            isActiveAuditMember(group.to, nodeStates)
-            ? active
-            : legacy;
-        subjects.push(formatDuplicateEdgeGroup(group));
-    }
-    const findings = [];
-    appendFinding(findings, active, maxSampleSize, "duplicate_edge", "info", "One semantic relationship should be stored once; parallel same-family spellings (reciprocal inverse pairs included) add no information and skew degree metrics.", (count) => `${count} duplicated relationship(s) between active endpoints`, "Remove all but one stored spelling of the relationship; keep the canonical direction the holder declared first.");
-    appendFinding(findings, legacy, maxSampleSize, "legacy_duplicate_edge", "info", "Duplicated spellings between exclusively terminal items are historical noise with no scheduling effect.", (count) => `${count} duplicated relationship(s) between terminal endpoints`, "Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.");
-    return findings;
-}
-/**
- * Collect storage-integrity findings for raw dependency rows whose exact
- * identity is stored more than once on one holder. Graph edge-identity dedup
- * hides these from every assembled-graph surface (duplicate_edge only covers
- * cross-spelling parallels), so the audit reports them from the pre-assembly
- * scan carried on the assembly.
- */
-function collectDuplicateRowFindings(assembly, maxSampleSize) {
-    const active = [];
-    const legacy = [];
-    // Public/JSON-parsed assemblies produced before duplicate-row governance may omit this field.
-    for (const row of assembly.duplicateRows ?? []) {
-        (row.legacy_terminal ? legacy : active).push(`${row.holder_id} -> ${row.target_id} (${row.kind} x${row.occurrences})`);
-    }
-    const findings = [];
-    appendFinding(findings, active, maxSampleSize, "duplicate_dependency_row", "warning", "One dependency row must be stored once per holder; identical repeated rows are a storage-layer defect invisible to the assembled graph.", (count) => `${count} exactly duplicated stored dependency row(s) on active holder(s)`, "Remove the repeated rows so the dependency is stored exactly once; graph semantics are unchanged.");
-    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();
-    const basisKinds = {
-        source_to_target: [],
-        target_to_source: [],
-        both: [],
-    };
-    for (const definition of assembly.graph.registry().list()) {
-        if (definition.outcomeTraversal !== undefined) {
-            basisKinds[definition.outcomeTraversal].push(definition.kind);
-        }
-    }
-    const basis = {
-        source_to_target: basisKinds.source_to_target.join(","),
-        target_to_source: basisKinds.target_to_source.join(","),
-        both: basisKinds.both.join(","),
-    };
-    const append = (from, to) => {
-        const sources = reverse.get(to) ?? new Set();
-        sources.add(from);
-        reverse.set(to, sources);
-    };
-    for (const edge of assembly.graph.edges()) {
-        signal?.throwIfAborted();
-        const definition = assembly.graph.registry().require(edge.kind);
-        if (definition.outcomeTraversal === "source_to_target" ||
-            definition.outcomeTraversal === "both")
-            append(edge.source, edge.target);
-        if (definition.outcomeTraversal === "target_to_source" ||
-            definition.outcomeTraversal === "both")
-            append(edge.target, edge.source);
-    }
-    return { basis, 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 { basis, reverse } = buildOutcomeReverseIndex(assembly, signal);
-    const reachable = expandOutcomeReachability(outcomes, reverse, signal);
-    return {
-        outcome_nodes: outcomes.size,
-        outcome_reachability_basis: basis,
-        ...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;
-    const typeKey = state.type ?? "(untyped)";
-    let typeProfile = tallies.byType.get(typeKey);
-    if (!typeProfile) {
-        typeProfile = { active: 0, isolated: 0, degree_leq_one: 0 };
-        tallies.byType.set(typeKey, typeProfile);
-    }
-    typeProfile.active += 1;
-    if (degree > 1)
-        return;
-    tallies.degreeLeqOne += 1;
-    typeProfile.degree_leq_one += 1;
-    if (degree === 0) {
-        tallies.isolated += 1;
-        typeProfile.isolated += 1;
-    }
-    if (exemptIsolates.has(state.id.toLowerCase()) ||
-        isolateExemptTypes.has(typeKey.toLowerCase()))
-        return;
-    if (degree === 0)
-        tallies.isolates.push(state.id);
-    else
-        tallies.sparse.push(state.id);
-}
-function collectCoverageReport(assembly, nodeStates, exemptIsolates, isolateExemptTypes, maxSampleSize, edgesByKind, signal) {
-    const tallies = {
-        active: 0,
-        missing: 0,
-        isolated: 0,
-        degreeLeqOne: 0,
-        isolates: [],
-        sparse: [],
-        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)
-            continue;
-        if (state.missing) {
-            tallies.missing += 1;
-            continue;
-        }
-        if (state.terminal)
-            continue;
-        tallyActiveCoverageNode(tallies, state, assembly.graph.incidentEdges(id).length, exemptIsolates, isolateExemptTypes);
-    }
-    const { isolates, sparse } = tallies;
-    const findings = [];
-    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]) => [
-                kind,
-                count / edgeCount,
-            ])),
-            semantic_edges: semanticEdges,
-            semantic_edge_share: edgeCount === 0 ? 0 : semanticEdges / edgeCount,
-            active_nodes: tallies.active,
-            missing_nodes: tallies.missing,
-            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])),
-        },
-    };
-}
-/**
- * Audit one assembled workspace relationship graph against the shared
- * governance policy and return deterministic machine-readable findings plus a
- * structural coverage profile.
- *
- * The audit is read-only and never proposes inventing an edge: integrity
- * findings report evidence for investigation, coverage findings honor explicit
- * isolate exemptions, and cycle findings enumerate the strongly connected
- * members so callers can decide which edge to retype, remove, or waive.
- */
-export function auditWorkspaceRelationshipGraph(assembly, options = {}) {
-    const isTerminal = options.isTerminal ??
-        ((status) => status === "closed" || status === "canceled");
-    const isBlocked = options.isBlocked ?? ((status) => status === "blocked");
-    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 = normalizeExemptionSet(options.exemptIsolates);
-    const isolateExemptTypes = normalizeExemptionSet(options.isolateExemptTypes);
-    const nodeStates = new Map(assembly.details.map((detail) => [
-        detail.id,
-        {
-            id: detail.id,
-            status: detail.status,
-            missing: assembly.missingIdSet.has(detail.id.toLowerCase()),
-            terminal: isTerminal(detail.status),
-            ...(detail.type === undefined ? {} : { type: detail.type }),
-        },
-    ]));
-    options.signal?.throwIfAborted();
-    const edgesByKind = {};
-    for (const edge of assembly.graph.edges())
-        edgesByKind[edge.kind] = (edgesByKind[edge.kind] ?? 0) + 1;
-    const findings = collectIntegrityFindings(assembly, isTerminal, maxSampleSize);
-    findings.push(...collectHierarchyIntegrityFindings(assembly, 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, 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,
-            finding_subjects_by_code: findingSubjectsByCode,
-        },
-    };
-}
-/** Subtract two count records, keeping only non-zero signed deltas in sorted key order. */
-function diffCountRecords(baseline, current) {
-    const keys = [
-        ...new Set([...Object.keys(baseline), ...Object.keys(current)]),
-    ].sort();
-    const deltas = {};
-    for (const key of keys) {
-        const delta = (current[key] ?? 0) - (baseline[key] ?? 0);
-        if (delta !== 0)
-            deltas[key] = delta;
-    }
-    return deltas;
-}
-/** Read per-type coverage defensively from current or legacy runtime snapshots. */
-function readSnapshotCoverageByType(snapshot) {
-    return snapshot.profile.coverage_by_type ?? {};
-}
-/** 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(baselineCoverage),
-            ...Object.keys(currentCoverage),
-        ]),
-    ].sort();
-    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))
-            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 -
-                baseline.profile.isolated_active_nodes,
-            degree_leq_one_active_nodes: current.profile.degree_leq_one_active_nodes -
-                baseline.profile.degree_leq_one_active_nodes,
-            edges_by_kind: diffCountRecords(baseline.profile.edges_by_kind, current.profile.edges_by_kind),
-            edge_share_by_kind: diffCountRecords(baselineEdgeShareByKind, currentEdgeShareByKind),
-            semantic_edges: currentSemanticEdges - baselineSemanticEdges,
-            semantic_edge_share: currentSemanticEdgeShare - baselineSemanticEdgeShare,
-            coverage_by_type: coverageByType,
-        },
-    };
-}
+!(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]="1335acb2-0730-5934-89a4-14fe4a160288")}catch(e2){}})();import{findRedundantRelationshipEdges,isTransitiveKind,orientTransitiveEdge,transitiveFamilyKey}from"./analytics.js";import{findRelationshipCutStructure}from"./centrality.js";import{getWorkspaceHierarchyIntegrity}from"./assembly.js";import{profileRelationshipLifecycles,diffLifecycleCoverage}from"./lifecycle-coverage.js";import{RELATIONSHIP_AUDIT_FINDING_CODES}from"./governance-contracts.js";const DEFAULT_MAX_SAMPLE_SIZE=25;const OUTCOME_MILESTONE_TYPE="milestone";const OUTCOME_MILESTONE_TITLE_PREFIX="outcome milestone:";const SEMANTIC_CONTEXT_KINDS=new Set(["discovered_from","incident_from","recurs_from","supersedes","verifies"]);function isSemanticContextKind(kind){return SEMANTIC_CONTEXT_KINDS.has(kind)}const SEVERITY_RANK={error:0,warning:1,info:2};function normalizeExemptionSet(values){return new Set((values??[]).filter(value=>typeof value==="string").map(value=>value.trim().toLowerCase()))}function buildFinding(code,severity,policy,describe,subjects,maxSampleSize,remediation,evidence){const sorted=[...subjects].sort((left,right)=>left.localeCompare(right));return{code,severity,policy,message:describe(sorted.length),count:sorted.length,sample:sorted.slice(0,maxSampleSize),sample_truncated:sorted.length>maxSampleSize,remediation,...evidence===void 0?{}:{evidence:[...evidence].sort((left,right)=>left.localeCompare(right)).slice(0,maxSampleSize)}}}function collectHierarchyCycleFindings(analysis,maxSampleSize){return analysis.cycles.map(cycle=>buildFinding(cycle.legacy_terminal?"legacy_hierarchy_cycle":"hierarchy_cycle",cycle.legacy_terminal?"info":"error","Structural hierarchy must be acyclic across scalar and registered dependency relationships.",count=>`${count} items participate in one hierarchy cycle.`,cycle.item_ids,maxSampleSize,cycle.legacy_terminal?"Preserve historical rows unless an explicit legacy repair is approved.":"Remove or retype one exact hierarchy relation before continuing mutation."))}function collectHierarchyCardinalityFindings(analysis,maxSampleSize,legacyTerminal){const rows=analysis.cardinality_violations.filter(finding=>finding.legacy_terminal===legacyTerminal);if(rows.length===0)return[];return[buildFinding(legacyTerminal?"legacy_hierarchy_cardinality_violation":"hierarchy_cardinality_violation",legacyTerminal?"info":"error","Every structural child must resolve to at most one logical parent across all hierarchy spellings.",count=>`${count} child item${count===1?"":"s"} resolve to multiple hierarchy parents.`,rows.map(finding=>finding.child_id),maxSampleSize,legacyTerminal?"Preserve historical rows unless an explicit legacy repair is approved.":"Remove the exact surplus hierarchy rows so each child has one parent.",rows.map(finding=>`${finding.child_id} <- ${finding.parent_ids.join(", ")}`))]}function collectHierarchyDirectionFindings(analysis,maxSampleSize,legacyTerminal){const rows=analysis.divergences.filter(finding=>finding.legacy_terminal===legacyTerminal);if(rows.length===0)return[];return[buildFinding(legacyTerminal?"legacy_hierarchy_direction_violation":"hierarchy_direction_violation",legacyTerminal?"info":"error","Scalar parent metadata and dependency-backed hierarchy rows must resolve to the same logical parent.",count=>`${count} child item${count===1?"":"s"} have divergent hierarchy storage surfaces.`,rows.map(finding=>finding.child_id),maxSampleSize,legacyTerminal?"Preserve historical rows unless an explicit legacy repair is approved.":"Align the scalar parent and exact dependency rows to one canonical parent.",rows.map(finding=>`${finding.child_id}: scalar=${finding.scalar_parent_id} dependencies=${finding.dependency_parent_ids.join(",")}`))]}function collectHierarchyIntegrityFindings(assembly,maxSampleSize){const analysis=getWorkspaceHierarchyIntegrity(assembly);if(!analysis)return[];return[...collectHierarchyCycleFindings(analysis,maxSampleSize),...collectHierarchyCardinalityFindings(analysis,maxSampleSize,false),...collectHierarchyCardinalityFindings(analysis,maxSampleSize,true),...collectHierarchyDirectionFindings(analysis,maxSampleSize,false),...collectHierarchyDirectionFindings(analysis,maxSampleSize,true)]}function buildOrderingAdjacency(assembly){const registry=assembly.graph.registry();const successors=new Map;for(const edge of assembly.graph.edges()){const definition=registry.require(edge.kind);if(!definition.ordering)continue;const[predecessor,successor]=(definition.precedence??"source_before_target")==="target_before_source"?[edge.target,edge.source]:[edge.source,edge.target];const adjacent=successors.get(predecessor);if(adjacent)adjacent.push(successor);else successors.set(predecessor,[successor])}for(const adjacent of successors.values())adjacent.sort((left,right)=>left.localeCompare(right));return successors}function registerTarjanNode(node,state){state.indexes.set(node,state.nextIndex);state.lowLinks.set(node,state.nextIndex);state.nextIndex+=1;state.stack.push(node);state.onStack.add(node)}function visitNextTarjanNeighbor(frame,frames,successors,state){const neighbors=successors.get(frame.node)??[];if(frame.neighborIndex>=neighbors.length)return false;const neighbor=neighbors[frame.neighborIndex];frame.neighborIndex+=1;if(!state.indexes.has(neighbor)){registerTarjanNode(neighbor,state);frames.push({node:neighbor,neighborIndex:0})}else if(state.onStack.has(neighbor)){state.lowLinks.set(frame.node,Math.min(state.lowLinks.get(frame.node),state.indexes.get(neighbor)))}return true}function completeTarjanFrame(frame,frames,successors,state){frames.pop();const parent=frames.at(-1);if(parent)state.lowLinks.set(parent.node,Math.min(state.lowLinks.get(parent.node),state.lowLinks.get(frame.node)));if(state.lowLinks.get(frame.node)!==state.indexes.get(frame.node))return;const component=[];while(true){const member=state.stack.pop();state.onStack.delete(member);component.push(member);if(member===frame.node)break}if(component.length>1||component.length===1&&successors.get(component[0])?.includes(component[0]))state.components.push(component.sort((left,right)=>left.localeCompare(right)))}function collectOrderingCycles(successors){const state={indexes:new Map,lowLinks:new Map,onStack:new Set,stack:[],components:[],nextIndex:0};const roots=[...successors.keys()].sort((left,right)=>left.localeCompare(right));for(const root of roots){if(state.indexes.has(root))continue;const frames=[{node:root,neighborIndex:0}];registerTarjanNode(root,state);while(frames.length>0){const frame=frames.at(-1);if(visitNextTarjanNeighbor(frame,frames,successors,state))continue;completeTarjanFrame(frame,frames,successors,state)}}return state.components.sort((left,right)=>left[0].localeCompare(right[0]))}function formatDanglingReference(reference){return`${reference.holder_id} -> ${reference.target_id} (${reference.kind})`}function appendFinding(findings,subjects,maxSampleSize,code,severity,policy,describe,remediation){if(subjects.length===0)return;findings.push(buildFinding(code,severity,policy,describe,subjects,maxSampleSize,remediation))}function collectIntegrityFindings(assembly,isTerminal,maxSampleSize){const findings=[];const references=[...assembly.dangling.active,...assembly.dangling.legacy_terminal].filter(reference=>!reference.no_active_blocker_sentinel);appendFinding(findings,references.filter(reference=>!isTerminal(reference.holder_status)).map(formatDanglingReference),maxSampleSize,"missing_reference_active","error","Active items must not reference absent targets; missing prerequisites distort scheduling.",count=>`${count} active dangling reference(s) to absent items`,"Restore or re-create the referenced item, or remove/retype the reference on the holder.");appendFinding(findings,references.filter(reference=>isTerminal(reference.holder_status)).map(formatDanglingReference),maxSampleSize,"missing_reference_terminal","info","Terminal items may retain historical references, but absent targets remain unexplainable context.",count=>`${count} terminal dangling reference(s) to absent items`,"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.");appendFinding(findings,assembly.dangling.no_active_blocker_sentinels.map(formatDanglingReference),maxSampleSize,"legacy_no_blocker_sentinel","info","The pre-structured-dependency no-active-blocker sentinel is retired; real edges carry blocker state.",count=>`${count} legacy no-active-blocker sentinel reference(s)`,"Delete the sentinel reference; blocker state is derived from blocked_by edges.");return findings}function isActiveAuditMember(member,nodeStates){const state=nodeStates.get(member);if(!state)return true;return!state.terminal}function formatOrderingStorageContradiction(contradiction){return`${contradiction.holder_id} -> ${contradiction.target_id} (blocked_by scalar + ${contradiction.dependency_kind} dependency)`}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}function collectOrderingFindings(assembly,nodeStates,isBlocked,maxSampleSize){const findings=[];const orderingAdjacency=buildOrderingAdjacency(assembly);for(const cycle of collectOrderingCycles(orderingAdjacency)){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.",contradictionEvidence.length===0?void 0: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?void 0:contradictionEvidence))}const predecessorsByNode=new Map;for(const[predecessor,adjacent]of orderingAdjacency)for(const successor of adjacent){const predecessors=predecessorsByNode.get(successor);if(predecessors)predecessors.push(predecessor);else predecessorsByNode.set(successor,[predecessor])}const staleLifecycleBlocks=[...nodeStates.values()].filter(state=>!state.missing&&!state.terminal&&isBlocked(state.status)&&!(predecessorsByNode.get(state.id)??[]).some(predecessor=>{const predecessorState=nodeStates.get(predecessor);return predecessorState===void 0||!predecessorState.terminal})).map(state=>state.id);appendFinding(findings,staleLifecycleBlocks,maxSampleSize,"stale_lifecycle_block","warning","A blocked lifecycle status must be backed by at least one open ordering predecessor.",count=>`${count} status-blocked item(s) with no open blocker edge`,'Add a local blocker edge, declare an external blocker with --dep "id=<external-ref>,kind=blocked_by,source_kind=external", or move the item back to an active status.');return findings}function formatDuplicateEdgeGroup(group){const kinds=group.edges.map(edge=>edge.kind).sort((left,right)=>left.localeCompare(right));return`${group.from} -> ${group.to} (${kinds.join(" + ")})`}function collectDuplicateRelationshipEdgeGroups(assembly){const registry=assembly.graph.registry();const groups=new Map;for(const edge of assembly.graph.edges()){const definition=registry.require(edge.kind);if(!isTransitiveKind(definition))continue;const oriented=orientTransitiveEdge(edge,definition);if(oriented.from===oriented.to)continue;const key=`${transitiveFamilyKey(definition)}::${oriented.from}::${oriented.to}`;const group=groups.get(key);if(group)group.edges.push(edge);else groups.set(key,{...oriented,edges:[edge]})}const duplicated=[...groups.values()].filter(group=>group.edges.length>=2);for(const group of duplicated)group.edges.sort((left,right)=>left.kind.localeCompare(right.kind));return duplicated.sort((left,right)=>left.from.localeCompare(right.from)||left.to.localeCompare(right.to))}function collectDuplicateEdgeFindings(assembly,nodeStates,maxSampleSize){const active=[];const legacy=[];for(const group of collectDuplicateRelationshipEdgeGroups(assembly)){const subjects=isActiveAuditMember(group.from,nodeStates)||isActiveAuditMember(group.to,nodeStates)?active:legacy;subjects.push(formatDuplicateEdgeGroup(group))}const findings=[];appendFinding(findings,active,maxSampleSize,"duplicate_edge","info","One semantic relationship should be stored once; parallel same-family spellings (reciprocal inverse pairs included) add no information and skew degree metrics.",count=>`${count} duplicated relationship(s) between active endpoints`,"Remove all but one stored spelling of the relationship; keep the canonical direction the holder declared first.");appendFinding(findings,legacy,maxSampleSize,"legacy_duplicate_edge","info","Duplicated spellings between exclusively terminal items are historical noise with no scheduling effect.",count=>`${count} duplicated relationship(s) between terminal endpoints`,"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.");return findings}function collectDuplicateRowFindings(assembly,maxSampleSize){const active=[];const legacy=[];for(const row of assembly.duplicateRows??[]){(row.legacy_terminal?legacy:active).push(`${row.holder_id} -> ${row.target_id} (${row.kind} x${row.occurrences})`)}const findings=[];appendFinding(findings,active,maxSampleSize,"duplicate_dependency_row","warning","One dependency row must be stored once per holder; identical repeated rows are a storage-layer defect invisible to the assembled graph.",count=>`${count} exactly duplicated stored dependency row(s) on active holder(s)`,"Remove the repeated rows so the dependency is stored exactly once; graph semantics are unchanged.");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}function buildOutcomeReverseIndex(assembly,signal){const reverse=new Map;const basisKinds={source_to_target:[],target_to_source:[],both:[]};for(const definition of assembly.graph.registry().list()){if(definition.outcomeTraversal!==void 0){basisKinds[definition.outcomeTraversal].push(definition.kind)}}const basis={source_to_target:basisKinds.source_to_target.join(","),target_to_source:basisKinds.target_to_source.join(","),both:basisKinds.both.join(",")};const append=(from,to)=>{const sources=reverse.get(to)??new Set;sources.add(from);reverse.set(to,sources)};for(const edge of assembly.graph.edges()){signal?.throwIfAborted();const definition=assembly.graph.registry().require(edge.kind);if(definition.outcomeTraversal==="source_to_target"||definition.outcomeTraversal==="both")append(edge.source,edge.target);if(definition.outcomeTraversal==="target_to_source"||definition.outcomeTraversal==="both")append(edge.target,edge.source)}return{basis,reverse}}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}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*1e4/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*1e4/terminal),outcome_reachable_nodes:outcomeReachable,outcome_unreachable_nodes:outcomeUnreachable,outcome_reachability_basis_points:outcomePopulation===0?0:Math.floor(outcomeReachable*1e4/outcomePopulation)}}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{basis,reverse}=buildOutcomeReverseIndex(assembly,signal);const reachable=expandOutcomeReachability(outcomes,reverse,signal);return{outcome_nodes:outcomes.size,outcome_reachability_basis:basis,...tallyOutcomeReachability(nodeStates,outcomes,reachable,signal)}}function tallyActiveCoverageNode(tallies,state,degree,exemptIsolates,isolateExemptTypes){tallies.active+=1;const typeKey=state.type??"(untyped)";let typeProfile=tallies.byType.get(typeKey);if(!typeProfile){typeProfile={active:0,isolated:0,degree_leq_one:0};tallies.byType.set(typeKey,typeProfile)}typeProfile.active+=1;if(degree>1)return;tallies.degreeLeqOne+=1;typeProfile.degree_leq_one+=1;if(degree===0){tallies.isolated+=1;typeProfile.isolated+=1}if(exemptIsolates.has(state.id.toLowerCase())||isolateExemptTypes.has(typeKey.toLowerCase()))return;if(degree===0)tallies.isolates.push(state.id);else tallies.sparse.push(state.id)}function collectCoverageReport(assembly,nodeStates,exemptIsolates,isolateExemptTypes,maxSampleSize,edgesByKind,signal){const tallies={active:0,missing:0,isolated:0,degreeLeqOne:0,isolates:[],sparse:[],byType:new Map};for(const id of assembly.graph.nodes()){signal?.throwIfAborted();const state=nodeStates.get(id);if(!state)continue;if(state.missing){tallies.missing+=1;continue}if(state.terminal)continue;tallyActiveCoverageNode(tallies,state,assembly.graph.incidentEdges(id).length,exemptIsolates,isolateExemptTypes)}const{isolates,sparse}=tallies;const findings=[];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 \u2014 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()}\0${edge.target.toLowerCase()}\0${edge.kind}`));for(const contradiction of assembly.orderingContradictions??[])nonInformativeEdgeKeys.add(`${contradiction.holder_id.toLowerCase()}\0${contradiction.target_id.toLowerCase()}\0${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])=>[kind,count/edgeCount])),semantic_edges:semanticEdges,semantic_edge_share:edgeCount===0?0:semanticEdges/edgeCount,active_nodes:tallies.active,missing_nodes:tallies.missing,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]))}}}function auditWorkspaceRelationshipGraph(assembly,options={}){const isTerminal=options.isTerminal??(status=>status==="closed"||status==="canceled");const isBlocked=options.isBlocked??(status=>status==="blocked");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=normalizeExemptionSet(options.exemptIsolates);const isolateExemptTypes=normalizeExemptionSet(options.isolateExemptTypes);const nodeStates=new Map(assembly.details.map(detail=>[detail.id,{id:detail.id,status:detail.status,missing:assembly.missingIdSet.has(detail.id.toLowerCase()),terminal:isTerminal(detail.status),...detail.type===void 0?{}:{type:detail.type}}]));options.signal?.throwIfAborted();const edgesByKind={};for(const edge of assembly.graph.edges())edgesByKind[edge.kind]=(edgesByKind[edge.kind]??0)+1;const findings=collectIntegrityFindings(assembly,isTerminal,maxSampleSize);findings.push(...collectHierarchyIntegrityFindings(assembly,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,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,...profileRelationshipLifecycles(assembly,isTerminal,isSemanticContextKind,options.signal),ordering_acyclic:!findings.some(finding=>finding.code==="ordering_cycle"||finding.code==="legacy_ordering_cycle"),active_ordering_acyclic:!findings.some(finding=>finding.code==="ordering_cycle"),finding_subjects_by_code:findingSubjectsByCode}}}function diffCountRecords(baseline,current){const keys=[...new Set([...Object.keys(baseline),...Object.keys(current)])].sort();const deltas={};for(const key of keys){const delta=(current[key]??0)-(baseline[key]??0);if(delta!==0)deltas[key]=delta}return deltas}function readSnapshotCoverageByType(snapshot){return snapshot.profile.coverage_by_type??{}}function diffCoverageByType(baseline,current){const deltas={};const baselineCoverage=readSnapshotCoverageByType(baseline);const currentCoverage=readSnapshotCoverageByType(current);const types=[...new Set([...Object.keys(baselineCoverage),...Object.keys(currentCoverage)])].sort();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))deltas[type]=delta}return deltas}function diffRelationshipAuditSnapshots(baseline,current){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-baseline.profile.isolated_active_nodes,degree_leq_one_active_nodes:current.profile.degree_leq_one_active_nodes-baseline.profile.degree_leq_one_active_nodes,edges_by_kind:diffCountRecords(baseline.profile.edges_by_kind,current.profile.edges_by_kind),edge_share_by_kind:diffCountRecords(baselineEdgeShareByKind,currentEdgeShareByKind),semantic_edges:currentSemanticEdges-baselineSemanticEdges,semantic_edge_share:currentSemanticEdgeShare-baselineSemanticEdgeShare,coverage_by_type:coverageByType,...diffLifecycleCoverage(baseline.profile,current.profile)}}}export{auditWorkspaceRelationshipGraph,collectDuplicateRelationshipEdgeGroups,collectOrderingCycles,diffRelationshipAuditSnapshots,formatDuplicateEdgeGroup,formatOrderingStorageContradiction,isSemanticContextKind};
 //# sourceMappingURL=governance.js.map
-//# debugId=27de9c62-434c-566d-a000-54eddb9a16a9