@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/graph/remediation.js

@@ -1,198 +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]="7054952e-444a-5be2-b0c1-fcc3b72afde5")}catch(e){}}();
-import { findRedundantRelationshipEdges } from "./analytics.js";
-import { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, formatDuplicateEdgeGroup, } from "./governance.js";
-/** Per-finding-code operation template applied to every sampled subject. */
-const FINDING_STEP_TEMPLATES = {
-    missing_reference_active: {
-        op: "investigate",
-        confidence: "medium",
-        rationale: "Restore or re-create the referenced item, or remove/retype the reference on the active holder; the correct fix depends on why the target is absent.",
-    },
-    missing_reference_terminal: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Terminal-holder reference to an absent item is historical debt; waive it or clean it up only in a dedicated changelog-safe closed-item batch.",
-    },
-    legacy_no_blocker_sentinel: {
-        op: "remove",
-        confidence: "high",
-        rationale: "The pre-structured-dependency no-active-blocker sentinel is retired and carries no information; blocker state derives from blocked_by edges.",
-    },
-    ordering_cycle: {
-        op: "investigate",
-        confidence: "low",
-        rationale: "Every cycle member is unschedulable until one ordering edge is removed or retyped; the planner never chooses which edge to cut.",
-    },
-    legacy_ordering_cycle: {
-        op: "waive",
-        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.",
-    },
-    hierarchy_cycle: {
-        op: "investigate",
-        confidence: "low",
-        rationale: "Cut or retype one exact structural relation in the cycle; the planner preserves every evidence row because intent determines the correct parent.",
-    },
-    legacy_hierarchy_cycle: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Terminal-only hierarchy cycles are historical debt; waive them unless an explicit closed-history repair is approved.",
-    },
-    hierarchy_cardinality_violation: {
-        op: "investigate",
-        confidence: "medium",
-        rationale: "Choose the canonical parent and remove or retype the exact surplus hierarchy rows; the planner cannot infer ownership intent.",
-    },
-    legacy_hierarchy_cardinality_violation: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Multiple parents confined to terminal items are historical debt; waive them unless a dedicated history repair is approved.",
-    },
-    hierarchy_direction_violation: {
-        op: "investigate",
-        confidence: "medium",
-        rationale: "Align the scalar parent and dependency-backed hierarchy rows to the intended canonical parent.",
-    },
-    legacy_hierarchy_direction_violation: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Divergent hierarchy storage confined to terminal items is historical debt; waive it unless a dedicated history repair is approved.",
-    },
-    // 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.
-    duplicate_edge: {
-        op: "remove",
-        confidence: "high",
-        rationale: "Parallel same-family spellings state one relationship twice; remove all but one stored spelling, keeping the holder's canonical direction.",
-    },
-    legacy_duplicate_edge: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Duplicated spellings between terminal items are historical noise; waive or batch changelog-safe cleanup.",
-    },
-    duplicate_dependency_row: {
-        op: "remove",
-        confidence: "high",
-        rationale: "The identical dependency row is stored more than once on the holder; drop the repeats so the row exists exactly once — graph semantics are unchanged.",
-    },
-    legacy_duplicate_dependency_row: {
-        op: "waive",
-        confidence: "high",
-        rationale: "Repeated identical rows on terminal holders are storage noise; waive or clean up only in a changelog-safe closed-item batch.",
-    },
-    stale_lifecycle_block: {
-        op: "investigate",
-        confidence: "medium",
-        rationale: 'Add a local ordering 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; only the holder\'s owner knows which is true.',
-    },
-    isolated_active_node: {
-        op: "investigate",
-        confidence: "medium",
-        rationale: "Link the item to its parent, prerequisite, or origin — or register it as an explicitly exempt isolate; the audit never fabricates an edge.",
-    },
-    sparse_active_node: {
-        op: "investigate",
-        confidence: "low",
-        rationale: "Investigate for an honest second edge (story-to-task, defect family, cross-epic complement); sparse is not automatically defective.",
-    },
-};
-/** Format one stored edge as a concrete removable identity. */
-function formatStoredEdge(edge) {
-    return `${edge.source} -${edge.kind}-> ${edge.target}`;
-}
-/**
- * Expand one active duplicate group into concrete per-stored-edge removals.
- * The deterministic keeper is the group's first sorted edge; every other
- * stored spelling gets its own remove proposal naming the exact edge to drop,
- * so the plan stays machine-executable instead of pointing at a display
- * string that spans several stored rows.
- */
-function stepsFromDuplicateGroup(group) {
-    const [keeper, ...extras] = group.edges;
-    return extras.map((edge) => ({
-        op: "remove",
-        code: "duplicate_edge",
-        subject: formatStoredEdge(edge),
-        rationale: "This stored spelling restates the kept canonical edge of the same semantic family; removing it leaves the relationship stated exactly once.",
-        evidence: [
-            `keep: ${formatStoredEdge(keeper)}`,
-            `group: ${formatDuplicateEdgeGroup(group)}`,
-        ],
-        confidence: "high",
-    }));
-}
-/** Derive one proposal per bounded sample subject of an audit finding. */
-function stepsFromFinding(finding, duplicateGroups) {
-    if (finding.code === "duplicate_edge") {
-        // Sample subjects are the deterministic group format strings, so each one
-        // resolves to its concrete stored-edge group for exact removal targeting.
-        return finding.sample.flatMap((subject) => stepsFromDuplicateGroup(duplicateGroups.get(subject)));
-    }
-    const template = FINDING_STEP_TEMPLATES[finding.code];
-    return finding.sample.map((subject) => ({
-        op: template.op,
-        code: finding.code,
-        subject,
-        rationale: template.rationale,
-        evidence: [finding.policy],
-        confidence: template.confidence,
-    }));
-}
-/**
- * Build one deterministic dry-run remediation plan over an assembled workspace
- * relationship graph. The plan runs the shared governance audit, derives one
- * exact proposal per bounded finding subject, then appends witnessed
- * transitive-shortcut removal proposals from the redundancy scan (medium
- * confidence, because shortcut edges are sometimes deliberate emphasis).
- * `truncated` reports whether sample or scan bounds omitted derivable steps;
- * nothing is ever applied automatically.
- */
-export function planRelationshipRemediation(assembly, options = {}) {
-    const { redundancyLimit, ...auditOptions } = options;
-    const report = auditWorkspaceRelationshipGraph(assembly, auditOptions);
-    const duplicateGroups = new Map(collectDuplicateRelationshipEdgeGroups(assembly).map((group) => [
-        formatDuplicateEdgeGroup(group),
-        group,
-    ]));
-    const steps = report.findings.flatMap((finding) => stepsFromFinding(finding, duplicateGroups));
-    let truncated = report.findings.some((finding) => finding.sample_truncated);
-    options.signal?.throwIfAborted();
-    const redundancy = findRedundantRelationshipEdges(assembly.graph, {
-        limit: redundancyLimit ?? options.maxSampleSize ?? 25,
-        ...(options.signal === undefined ? {} : { signal: options.signal }),
-    });
-    for (const row of redundancy.value) {
-        steps.push({
-            op: "remove",
-            code: "redundant_edge",
-            subject: `${row.edge.source} -> ${row.edge.target} (${row.edge.kind})`,
-            rationale: "The stored edge is implied by a longer same-family witness path; shortcut edges are sometimes deliberate emphasis, so confirm intent before removing.",
-            evidence: [`witness: ${row.witness.join(" -> ")}`],
-            confidence: "medium",
-        });
-    }
-    truncated = truncated || redundancy.meta.truncated;
-    return {
-        steps,
-        report,
-        truncated,
-        cost: {
-            visitedNodes: redundancy.meta.visitedNodes,
-            inspectedEdges: redundancy.meta.inspectedEdges,
-        },
-    };
-}
+!(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]="236ccc7d-6efd-57b1-8cce-6758d537f779")}catch(e2){}})();import{findRedundantRelationshipEdges}from"./analytics.js";import{auditWorkspaceRelationshipGraph,collectDuplicateRelationshipEdgeGroups,formatDuplicateEdgeGroup}from"./governance.js";const FINDING_STEP_TEMPLATES={missing_reference_active:{op:"investigate",confidence:"medium",rationale:"Restore or re-create the referenced item, or remove/retype the reference on the active holder; the correct fix depends on why the target is absent."},missing_reference_terminal:{op:"waive",confidence:"high",rationale:"Terminal-holder reference to an absent item is historical debt; waive it or clean it up only in a dedicated changelog-safe closed-item batch."},legacy_no_blocker_sentinel:{op:"remove",confidence:"high",rationale:"The pre-structured-dependency no-active-blocker sentinel is retired and carries no information; blocker state derives from blocked_by edges."},ordering_cycle:{op:"investigate",confidence:"low",rationale:"Every cycle member is unschedulable until one ordering edge is removed or retyped; the planner never chooses which edge to cut."},legacy_ordering_cycle:{op:"waive",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."},hierarchy_cycle:{op:"investigate",confidence:"low",rationale:"Cut or retype one exact structural relation in the cycle; the planner preserves every evidence row because intent determines the correct parent."},legacy_hierarchy_cycle:{op:"waive",confidence:"high",rationale:"Terminal-only hierarchy cycles are historical debt; waive them unless an explicit closed-history repair is approved."},hierarchy_cardinality_violation:{op:"investigate",confidence:"medium",rationale:"Choose the canonical parent and remove or retype the exact surplus hierarchy rows; the planner cannot infer ownership intent."},legacy_hierarchy_cardinality_violation:{op:"waive",confidence:"high",rationale:"Multiple parents confined to terminal items are historical debt; waive them unless a dedicated history repair is approved."},hierarchy_direction_violation:{op:"investigate",confidence:"medium",rationale:"Align the scalar parent and dependency-backed hierarchy rows to the intended canonical parent."},legacy_hierarchy_direction_violation:{op:"waive",confidence:"high",rationale:"Divergent hierarchy storage confined to terminal items is historical debt; waive it unless a dedicated history repair is approved."},duplicate_edge:{op:"remove",confidence:"high",rationale:"Parallel same-family spellings state one relationship twice; remove all but one stored spelling, keeping the holder's canonical direction."},legacy_duplicate_edge:{op:"waive",confidence:"high",rationale:"Duplicated spellings between terminal items are historical noise; waive or batch changelog-safe cleanup."},duplicate_dependency_row:{op:"remove",confidence:"high",rationale:"The identical dependency row is stored more than once on the holder; drop the repeats so the row exists exactly once \u2014 graph semantics are unchanged."},legacy_duplicate_dependency_row:{op:"waive",confidence:"high",rationale:"Repeated identical rows on terminal holders are storage noise; waive or clean up only in a changelog-safe closed-item batch."},stale_lifecycle_block:{op:"investigate",confidence:"medium",rationale:`Add a local ordering 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; only the holder's owner knows which is true.`},isolated_active_node:{op:"investigate",confidence:"medium",rationale:"Link the item to its parent, prerequisite, or origin \u2014 or register it as an explicitly exempt isolate; the audit never fabricates an edge."},sparse_active_node:{op:"investigate",confidence:"low",rationale:"Investigate for an honest second edge (story-to-task, defect family, cross-epic complement); sparse is not automatically defective."}};function formatStoredEdge(edge){return`${edge.source} -${edge.kind}-> ${edge.target}`}function stepsFromDuplicateGroup(group){const[keeper,...extras]=group.edges;return extras.map(edge=>({op:"remove",code:"duplicate_edge",subject:formatStoredEdge(edge),rationale:"This stored spelling restates the kept canonical edge of the same semantic family; removing it leaves the relationship stated exactly once.",evidence:[`keep: ${formatStoredEdge(keeper)}`,`group: ${formatDuplicateEdgeGroup(group)}`],confidence:"high"}))}function stepsFromFinding(finding,duplicateGroups){if(finding.code==="duplicate_edge"){return finding.sample.flatMap(subject=>stepsFromDuplicateGroup(duplicateGroups.get(subject)))}const template=FINDING_STEP_TEMPLATES[finding.code];return finding.sample.map(subject=>({op:template.op,code:finding.code,subject,rationale:template.rationale,evidence:[finding.policy],confidence:template.confidence}))}function planRelationshipRemediation(assembly,options={}){const{redundancyLimit,...auditOptions}=options;const report=auditWorkspaceRelationshipGraph(assembly,auditOptions);const duplicateGroups=new Map(collectDuplicateRelationshipEdgeGroups(assembly).map(group=>[formatDuplicateEdgeGroup(group),group]));const steps=report.findings.flatMap(finding=>stepsFromFinding(finding,duplicateGroups));let truncated=report.findings.some(finding=>finding.sample_truncated);options.signal?.throwIfAborted();const redundancy=findRedundantRelationshipEdges(assembly.graph,{limit:redundancyLimit??options.maxSampleSize??25,...options.signal===void 0?{}:{signal:options.signal}});for(const row of redundancy.value){steps.push({op:"remove",code:"redundant_edge",subject:`${row.edge.source} -> ${row.edge.target} (${row.edge.kind})`,rationale:"The stored edge is implied by a longer same-family witness path; shortcut edges are sometimes deliberate emphasis, so confirm intent before removing.",evidence:[`witness: ${row.witness.join(" -> ")}`],confidence:"medium"})}truncated=truncated||redundancy.meta.truncated;return{steps,report,truncated,cost:{visitedNodes:redundancy.meta.visitedNodes,inspectedEdges:redundancy.meta.inspectedEdges}}}export{planRelationshipRemediation};
 //# sourceMappingURL=remediation.js.map
-//# debugId=7054952e-444a-5be2-b0c1-fcc3b72afde5

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

@@ -1,6 +1,8 @@
 import type { GlobalOptions } from "../../core/shared/command-types.js";
+import { type DeadlineScheduleResult } from "./deadline-scheduling.js";
 import { type GraphCacheMetadata } from "./cache.js";
 import { type RelationshipAuditDelta, type RelationshipAuditReport } from "./governance.js";
+import type { RelationshipPopulationCoverage } from "./lifecycle-coverage.js";
 import { type RelationshipRemediationStep } from "./remediation.js";
 import { GRAPH_SUBCOMMAND_VALUES, type GraphSubcommand } from "../cli-contracts/enum-contracts.js";
 import { type OutputProjectionDeclaration } from "../output-projection.js";
@@ -358,6 +360,10 @@ export interface GraphScheduleRow {
 }
 /** Result envelope for the critical-path slack subcommand. */
 export interface GraphSlackResult {
+    /** Fresh estimate-based deadline constraints; computed outside topology caches. */
+    deadline_schedule?: {
+        population: "active";
+    } & Omit<DeadlineScheduleResult, "rows" | "residuals" | "overcommitted"> & Partial<Pick<DeadlineScheduleResult, "rows" | "residuals" | "overcommitted">>;
     /** Executed graph subcommand. */
     subcommand: "slack";
     /** Whether the order-bearing graph is acyclic. */
@@ -381,6 +387,14 @@ export interface GraphSlackResult {
     /** Cache observability for this invocation. */
     cache?: GraphCacheMetadata;
 }
+/** Compact lifecycle census returned by audit summary; detailed distributions restore with --full. */
+export interface GraphAuditSummaryResult extends Omit<GraphAuditResult, "profile"> {
+    /** Recorded population totals, structural verdicts, and lifecycle connectivity counts. */
+    profile: Pick<GraphAuditResult["profile"], "nodes" | "recorded_nodes" | "edges" | "active_nodes" | "terminal_nodes" | "missing_nodes" | "ordering_acyclic" | "active_ordering_acyclic"> & {
+        /** Exact lifecycle counts; degree histograms and status/type distributions require full output. */
+        coverage_by_lifecycle: Record<"all" | "active" | "terminal", Omit<RelationshipPopulationCoverage, "degree_histogram">>;
+    };
+}
 /** One node ranked by structural centrality with directed fan-in/fan-out. */
 export interface GraphCentralityRow {
     /** Node id. */
@@ -465,7 +479,7 @@ export interface GraphPlanResult {
 /** Union of every graph subcommand result envelope. */
 export type GraphResult = GraphTraversalResult | GraphPathsResult | GraphImpactResult | GraphAnalyzeResult | GraphAuditResult | GraphCommunitiesResult | GraphRedundancyResult | GraphDominatorsResult | GraphSlackResult | GraphCentralityResult | GraphArticulationResult | GraphPlanResult | GraphIndexResult;
 /** Graph result with an explicit complete-or-summary row declaration. */
-export type ProjectedGraphResult = GraphResult & {
+export type ProjectedGraphResult = (GraphResult | GraphAuditSummaryResult) & {
     /** Self-describing row projection used to derive a bounded omission receipt. */
     projection: OutputProjectionDeclaration;
 };