swarm-engine 1.3.0 → 1.38.0

package/dist/runtime/graph-discovery.js

@@ -0,0 +1,367 @@
+// ─── Helpers ──────────────────────────────────────────────────────
+const PRIORITY_ORDER = { high: 0, medium: 1, low: 2 };
+function priorityOrder(p) {
+    return PRIORITY_ORDER[p] ?? 3;
+}
+// ─── TaskDiscovery ───────────────────────────────────────────────
+/**
+ * Mines the execution knowledge graph for actionable insights that
+ * suggest new work — high-failure-rate files, recurring errors,
+ * unresolved vulnerabilities, untested co-modification pairs, and
+ * architectural risk from high-centrality low-success files.
+ */
+export class TaskDiscovery {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Mine the graph for all discoverable tasks.
+     * Returns tasks sorted by priority (high first).
+     */
+    discoverTasks() {
+        const tasks = [];
+        tasks.push(...this.findHighFailureRateFiles());
+        tasks.push(...this.findRecurringErrors());
+        tasks.push(...this.findVulnerabilityClusters());
+        tasks.push(...this.findUntestedCoModPairs());
+        tasks.push(...this.findArchitecturalRisks());
+        return tasks.sort((a, b) => priorityOrder(a.priority) - priorityOrder(b.priority));
+    }
+    /**
+     * Get detailed risk profile for a specific file.
+     */
+    getFileRiskProfile(filePath) {
+        const fileId = `file:${filePath}`;
+        const node = this.graph.getNode(fileId);
+        if (!node) {
+            return {
+                file: filePath,
+                failureRate: 0,
+                errorCount: 0,
+                coModifiedWith: [],
+                lastTouched: 'unknown',
+                vulnerabilities: 0,
+                totalTouches: 0,
+            };
+        }
+        // Agents that touched this file (touched_file: agent → file)
+        const touchEdges = this.graph.getEdges(fileId, 'incoming').filter((e) => e.type === 'touched_file');
+        const totalTouches = touchEdges.length;
+        let failCount = 0;
+        for (const edge of touchEdges) {
+            const agentNode = this.graph.getNode(edge.source);
+            if (agentNode && (agentNode.properties.status === 'error' || agentNode.properties.status === 'timeout')) {
+                failCount++;
+            }
+        }
+        const failureRate = totalTouches > 0 ? failCount / totalTouches : 0;
+        // Error nodes linked via caused_by (caused_by: error → file)
+        const causedByEdges = this.graph.getEdges(fileId, 'incoming').filter((e) => e.type === 'caused_by');
+        const errorCount = causedByEdges.length;
+        // Vulnerabilities: P0/P1 severity errors
+        let vulnerabilities = 0;
+        for (const edge of causedByEdges) {
+            const errorNode = this.graph.getNode(edge.source);
+            if (errorNode) {
+                const severity = errorNode.properties.severity;
+                if (severity === 'P0' || severity === 'P1') {
+                    vulnerabilities++;
+                }
+            }
+        }
+        // Co-modified files (co_modified edges are bidirectional)
+        const coModEdges = this.graph.getEdges(fileId, 'both').filter((e) => e.type === 'co_modified');
+        const coModSet = new Set();
+        for (const edge of coModEdges) {
+            const otherId = edge.source === fileId ? edge.target : edge.source;
+            const otherNode = this.graph.getNode(otherId);
+            if (otherNode)
+                coModSet.add(otherNode.label);
+        }
+        // lastTouched: node created_at or 'unknown'
+        const lastTouched = node.created_at || 'unknown';
+        return {
+            file: filePath,
+            failureRate,
+            errorCount,
+            coModifiedWith: [...coModSet],
+            lastTouched,
+            vulnerabilities,
+            totalTouches,
+        };
+    }
+    /**
+     * Generate prioritized backlog from discovered tasks.
+     */
+    generateBacklog(maxItems) {
+        return this.discoverTasks().slice(0, maxItems ?? 20);
+    }
+    // ─── Discovery strategies ───────────────────────────────────────
+    /**
+     * Files where >40% of agents that touched them failed → refactor task.
+     */
+    findHighFailureRateFiles() {
+        const tasks = [];
+        const fileNodes = this.graph.getNodesByType('file');
+        for (const file of fileNodes) {
+            const touchEdges = this.graph.getEdges(file.id, 'incoming').filter((e) => e.type === 'touched_file');
+            if (touchEdges.length < 2)
+                continue; // need minimum sample
+            let failCount = 0;
+            for (const edge of touchEdges) {
+                const agent = this.graph.getNode(edge.source);
+                if (agent && (agent.properties.status === 'error' || agent.properties.status === 'timeout')) {
+                    failCount++;
+                }
+            }
+            const failureRate = failCount / touchEdges.length;
+            if (failureRate > 0.4) {
+                tasks.push({
+                    title: `Refactor high-failure file: ${file.label}`,
+                    description: `${file.label} has a ${Math.round(failureRate * 100)}% failure rate across ${touchEdges.length} agent touches. Refactoring may reduce agent failures.`,
+                    priority: failureRate > 0.7 ? 'high' : 'medium',
+                    recommendedPattern: 'review-cycle',
+                    estimatedCost: this.estimateCost('review-cycle', 1),
+                    evidence: [
+                        `${failCount}/${touchEdges.length} agents failed when touching this file`,
+                        `Failure rate: ${Math.round(failureRate * 100)}%`,
+                    ],
+                    affectedFiles: [file.label],
+                });
+            }
+        }
+        return tasks;
+    }
+    /**
+     * Files with 3+ error nodes → recurring error task.
+     */
+    findRecurringErrors() {
+        const tasks = [];
+        const errorNodes = this.graph.getNodesByType('error');
+        // Group errors by file via caused_by edges
+        const fileErrors = new Map();
+        for (const err of errorNodes) {
+            const causedByEdges = this.graph.getEdges(err.id, 'outgoing').filter((e) => e.type === 'caused_by');
+            for (const edge of causedByEdges) {
+                const fileNode = this.graph.getNode(edge.target);
+                if (fileNode && fileNode.type === 'file') {
+                    const existing = fileErrors.get(fileNode.id) || [];
+                    existing.push(err);
+                    fileErrors.set(fileNode.id, existing);
+                }
+            }
+        }
+        for (const [fileId, errors] of fileErrors) {
+            if (errors.length < 3)
+                continue;
+            const fileNode = this.graph.getNode(fileId);
+            const fileName = fileNode?.label || fileId;
+            tasks.push({
+                title: `Fix recurring errors in: ${fileName}`,
+                description: `${fileName} has ${errors.length} error nodes linked to it. Investigate root cause and apply systematic fix.`,
+                priority: errors.length >= 5 ? 'high' : 'medium',
+                recommendedPattern: 'postmortem',
+                estimatedCost: this.estimateCost('postmortem', 1),
+                evidence: errors.map((e) => `Error: ${e.label}`),
+                affectedFiles: [fileName],
+            });
+        }
+        return tasks;
+    }
+    /**
+     * Error nodes with P0/P1 severity grouped by file.
+     * Clusters of 2+ high-severity errors → urgent task.
+     */
+    findVulnerabilityClusters() {
+        const tasks = [];
+        const errorNodes = this.graph.getNodesByType('error');
+        // Filter to P0/P1 severity and group by file
+        const fileSevereErrors = new Map();
+        for (const err of errorNodes) {
+            const severity = err.properties.severity;
+            if (severity !== 'P0' && severity !== 'P1')
+                continue;
+            const causedByEdges = this.graph.getEdges(err.id, 'outgoing').filter((e) => e.type === 'caused_by');
+            for (const edge of causedByEdges) {
+                const fileNode = this.graph.getNode(edge.target);
+                if (fileNode && fileNode.type === 'file') {
+                    const existing = fileSevereErrors.get(fileNode.id) || [];
+                    existing.push(err);
+                    fileSevereErrors.set(fileNode.id, existing);
+                }
+            }
+        }
+        for (const [fileId, errors] of fileSevereErrors) {
+            if (errors.length < 2)
+                continue;
+            const fileNode = this.graph.getNode(fileId);
+            const fileName = fileNode?.label || fileId;
+            tasks.push({
+                title: `Urgent: vulnerability cluster in ${fileName}`,
+                description: `${fileName} has ${errors.length} high-severity (P0/P1) errors. Requires immediate attention.`,
+                priority: 'high',
+                recommendedPattern: 'red-team',
+                estimatedCost: this.estimateCost('red-team', 1),
+                evidence: errors.map((e) => `${e.properties.severity}: ${e.label}`),
+                affectedFiles: [fileName],
+            });
+        }
+        return tasks;
+    }
+    /**
+     * Co-modified file pairs that never appeared together in a test orchestration.
+     * High co-mod count but no joint testing → integration test task.
+     */
+    findUntestedCoModPairs() {
+        const tasks = [];
+        const fileNodes = this.graph.getNodesByType('file');
+        // Build map: file → set of orchestration IDs
+        const fileToOrchs = new Map();
+        const fileToTestOrchs = new Map();
+        for (const file of fileNodes) {
+            const allOrchs = new Set();
+            const testOrchs = new Set();
+            const touchEdges = this.graph.getEdges(file.id, 'incoming').filter((e) => e.type === 'touched_file');
+            for (const te of touchEdges) {
+                // agent ← phase (spawned)
+                const spawnEdges = this.graph.getEdges(te.source, 'incoming').filter((e) => e.type === 'spawned');
+                for (const se of spawnEdges) {
+                    // phase ← orchestration (contains)
+                    const containEdges = this.graph.getEdges(se.source, 'incoming').filter((e) => e.type === 'contains');
+                    for (const ce of containEdges) {
+                        allOrchs.add(ce.source);
+                        // Check if this orchestration used a test pattern
+                        const orchNode = this.graph.getNode(ce.source);
+                        if (orchNode) {
+                            const pattern = orchNode.properties.pattern;
+                            if (pattern === 'tdd' || pattern === 'test') {
+                                testOrchs.add(ce.source);
+                            }
+                        }
+                    }
+                }
+            }
+            if (allOrchs.size > 0)
+                fileToOrchs.set(file.id, allOrchs);
+            if (testOrchs.size > 0)
+                fileToTestOrchs.set(file.id, testOrchs);
+        }
+        // Find co-modified pairs via co_modified edges
+        const coModEdges = this.graph.getEdgesByType('co_modified');
+        const seen = new Set();
+        for (const edge of coModEdges) {
+            const pairKey = [edge.source, edge.target].sort().join('::');
+            if (seen.has(pairKey))
+                continue;
+            seen.add(pairKey);
+            // Count co-modifications between this pair
+            const coModCount = coModEdges.filter((e) => (e.source === edge.source && e.target === edge.target) ||
+                (e.source === edge.target && e.target === edge.source)).length;
+            if (coModCount < 2)
+                continue;
+            // Check if both files appear in a test orchestration together
+            const testOrchsA = fileToTestOrchs.get(edge.source) || new Set();
+            const testOrchsB = fileToTestOrchs.get(edge.target) || new Set();
+            let testedTogether = false;
+            for (const orchId of testOrchsA) {
+                if (testOrchsB.has(orchId)) {
+                    testedTogether = true;
+                    break;
+                }
+            }
+            if (!testedTogether) {
+                const fileA = this.graph.getNode(edge.source);
+                const fileB = this.graph.getNode(edge.target);
+                const nameA = fileA?.label || edge.source;
+                const nameB = fileB?.label || edge.target;
+                tasks.push({
+                    title: `Add integration test: ${nameA} + ${nameB}`,
+                    description: `${nameA} and ${nameB} are co-modified ${coModCount} times but never tested together.`,
+                    priority: coModCount >= 5 ? 'medium' : 'low',
+                    recommendedPattern: 'tdd',
+                    estimatedCost: this.estimateCost('tdd', 2),
+                    evidence: [
+                        `Co-modified ${coModCount} times across orchestrations`,
+                        `No joint test orchestration found`,
+                    ],
+                    affectedFiles: [nameA, nameB],
+                });
+            }
+        }
+        return tasks;
+    }
+    /**
+     * Files touched by many agents (high degree) but with low success rate.
+     * These represent architectural risk — central files that cause failures.
+     */
+    findArchitecturalRisks() {
+        const tasks = [];
+        const fileNodes = this.graph.getNodesByType('file');
+        for (const file of fileNodes) {
+            const touchEdges = this.graph.getEdges(file.id, 'incoming').filter((e) => e.type === 'touched_file');
+            if (touchEdges.length < 4)
+                continue; // need meaningful centrality
+            let failCount = 0;
+            for (const edge of touchEdges) {
+                const agent = this.graph.getNode(edge.source);
+                if (agent && (agent.properties.status === 'error' || agent.properties.status === 'timeout')) {
+                    failCount++;
+                }
+            }
+            const successRate = 1 - failCount / touchEdges.length;
+            if (successRate < 0.5) {
+                tasks.push({
+                    title: `Architectural risk: ${file.label}`,
+                    description: `${file.label} is touched by ${touchEdges.length} agents but has only a ${Math.round(successRate * 100)}% success rate. This high-centrality, low-success file may need architectural changes.`,
+                    priority: 'high',
+                    recommendedPattern: 'discover',
+                    estimatedCost: this.estimateCost('discover', 1),
+                    evidence: [
+                        `Touched by ${touchEdges.length} agents (high centrality)`,
+                        `Success rate: ${Math.round(successRate * 100)}%`,
+                        `${failCount} agent failures linked to this file`,
+                    ],
+                    affectedFiles: [file.label],
+                });
+            }
+        }
+        return tasks;
+    }
+    // ─── Cost estimation ────────────────────────────────────────────
+    /**
+     * Estimate cost for a task based on historical orchestrations with the same pattern.
+     * Falls back to a heuristic if no historical data.
+     */
+    estimateCost(pattern, fileCount) {
+        const patternId = `pattern:${pattern}`;
+        const patternNode = this.graph.getNode(patternId);
+        if (!patternNode)
+            return 0.05 * fileCount; // fallback: $0.05/file
+        // Get orchestrations that used this pattern
+        const usedPatternEdges = this.graph.getEdges(patternId, 'incoming').filter((e) => e.type === 'used_pattern');
+        const costs = [];
+        const fileCounts = [];
+        for (const edge of usedPatternEdges) {
+            const orchNode = this.graph.getNode(edge.source);
+            if (!orchNode)
+                continue;
+            const usage = orchNode.properties.usage;
+            if (usage?.costUsd && usage.costUsd > 0) {
+                costs.push(usage.costUsd);
+                // Count files in this orchestration via BFS
+                const subgraph = this.graph.bfs(orchNode.id, 3);
+                const orchFiles = subgraph.nodes.filter((n) => n.type === 'file');
+                fileCounts.push(Math.max(orchFiles.length, 1));
+            }
+        }
+        if (costs.length === 0)
+            return 0.05 * fileCount;
+        // Average cost per file, then scale by requested fileCount
+        const totalCost = costs.reduce((a, b) => a + b, 0);
+        const totalFiles = fileCounts.reduce((a, b) => a + b, 0);
+        const costPerFile = totalCost / Math.max(totalFiles, 1);
+        return Math.round(costPerFile * fileCount * 100) / 100;
+    }
+}
+//# sourceMappingURL=graph-discovery.js.map

package/dist/runtime/graph-discovery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-discovery.js","sourceRoot":"","sources":["../../src/runtime/graph-discovery.ts"],"names":[],"mappings":"AAyBA,qEAAqE;AAErE,MAAM,cAAc,GAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAE9E,SAAS,aAAa,CAAC,CAAS;IAC9B,OAAO,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAED,oEAAoE;AAEpE;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IACJ;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;OAGG;IACH,aAAa;QACX,MAAM,KAAK,GAAqB,EAAE,CAAC;QAEnC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC;QAE7C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACrF,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,QAAgB;QACjC,MAAM,MAAM,GAAG,QAAQ,QAAQ,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,CAAC;gBACd,UAAU,EAAE,CAAC;gBACb,cAAc,EAAE,EAAE;gBAClB,WAAW,EAAE,SAAS;gBACtB,eAAe,EAAE,CAAC;gBAClB,YAAY,EAAE,CAAC;aAChB,CAAC;QACJ,CAAC;QAED,6DAA6D;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;QACpG,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC;QAEvC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,SAAS,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO,IAAI,SAAS,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;gBACxG,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpE,6DAA6D;QAC7D,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;QACpG,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC;QAExC,yCAAyC;QACzC,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,QAA8B,CAAC;gBACrE,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;oBAC3C,eAAe,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,0DAA0D;QAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC;QAC/F,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACnE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;QAED,4CAA4C;QAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC;QAEjD,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,WAAW;YACX,UAAU;YACV,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC7B,WAAW;YACX,eAAe;YACf,YAAY;SACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,QAAiB;QAC/B,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,mEAAmE;IAEnE;;OAEG;IACK,wBAAwB;QAC9B,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEpD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YACrG,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS,CAAC,sBAAsB;YAE3D,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9C,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;oBAC5F,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC;YAED,MAAM,WAAW,GAAG,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;YAClD,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC;oBACT,KAAK,EAAE,+BAA+B,IAAI,CAAC,KAAK,EAAE;oBAClD,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,UAAU,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,yBAAyB,UAAU,CAAC,MAAM,wDAAwD;oBACnK,QAAQ,EAAE,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;oBAC/C,kBAAkB,EAAE,cAAc;oBAClC,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,cAAc,EAAE,CAAC,CAAC;oBACnD,QAAQ,EAAE;wBACR,GAAG,SAAS,IAAI,UAAU,CAAC,MAAM,wCAAwC;wBACzE,iBAAiB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG;qBAClD;oBACD,aAAa,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;iBAC5B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,mBAAmB;QACzB,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAEtD,2CAA2C;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;QAClD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;YACpG,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjD,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACzC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACnB,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,QAAQ,GAAG,QAAQ,EAAE,KAAK,IAAI,MAAM,CAAC;YAE3C,KAAK,CAAC,IAAI,CAAC;gBACT,KAAK,EAAE,4BAA4B,QAAQ,EAAE;gBAC7C,WAAW,EAAE,GAAG,QAAQ,QAAQ,MAAM,CAAC,MAAM,6EAA6E;gBAC1H,QAAQ,EAAE,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;gBAChD,kBAAkB,EAAE,YAAY;gBAChC,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,CAAC,CAAC;gBACjD,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,CAAC;gBAChD,aAAa,EAAE,CAAC,QAAQ,CAAC;aAC1B,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,yBAAyB;QAC/B,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAEtD,6CAA6C;QAC7C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAuB,CAAC;QACxD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,QAA8B,CAAC;YAC/D,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBAAE,SAAS;YAErD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;YACpG,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjD,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACzC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;oBACzD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACnB,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;YAChD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,QAAQ,GAAG,QAAQ,EAAE,KAAK,IAAI,MAAM,CAAC;YAE3C,KAAK,CAAC,IAAI,CAAC;gBACT,KAAK,EAAE,oCAAoC,QAAQ,EAAE;gBACrD,WAAW,EAAE,GAAG,QAAQ,QAAQ,MAAM,CAAC,MAAM,8DAA8D;gBAC3G,QAAQ,EAAE,MAAM;gBAChB,kBAAkB,EAAE,UAAU;gBAC9B,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC/C,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,QAAQ,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACnE,aAAa,EAAE,CAAC,QAAQ,CAAC;aAC1B,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,sBAAsB;QAC5B,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEpD,6CAA6C;QAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;QACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEvD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YAEpC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YACrG,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC5B,0BAA0B;gBAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;gBAClG,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC5B,mCAAmC;oBACnC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;oBACrG,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;wBAC9B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;wBAExB,kDAAkD;wBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;wBAC/C,IAAI,QAAQ,EAAE,CAAC;4BACb,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,OAA6B,CAAC;4BAClE,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;gCAC5C,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;4BAC3B,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAC1D,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC;gBAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAClE,CAAC;QAED,+CAA+C;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7D,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAElB,2CAA2C;YAC3C,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;gBACtD,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,CACzD,CAAC,MAAM,CAAC;YAET,IAAI,UAAU,GAAG,CAAC;gBAAE,SAAS;YAE7B,8DAA8D;YAC9D,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YACjE,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YACjE,IAAI,cAAc,GAAG,KAAK,CAAC;YAC3B,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,cAAc,GAAG,IAAI,CAAC;oBACtB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,cAAc,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;gBAE1C,KAAK,CAAC,IAAI,CAAC;oBACT,KAAK,EAAE,yBAAyB,KAAK,MAAM,KAAK,EAAE;oBAClD,WAAW,EAAE,GAAG,KAAK,QAAQ,KAAK,oBAAoB,UAAU,mCAAmC;oBACnG,QAAQ,EAAE,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;oBAC5C,kBAAkB,EAAE,KAAK;oBACzB,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC1C,QAAQ,EAAE;wBACR,eAAe,UAAU,8BAA8B;wBACvD,mCAAmC;qBACpC;oBACD,aAAa,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;iBAC9B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,sBAAsB;QAC5B,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEpD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YACrG,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS,CAAC,6BAA6B;YAElE,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9C,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;oBAC5F,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC;YAED,MAAM,WAAW,GAAG,CAAC,GAAG,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;YACtD,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC;oBACT,KAAK,EAAE,uBAAuB,IAAI,CAAC,KAAK,EAAE;oBAC1C,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,kBAAkB,UAAU,CAAC,MAAM,0BAA0B,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,wFAAwF;oBAC5M,QAAQ,EAAE,MAAM;oBAChB,kBAAkB,EAAE,UAAU;oBAC9B,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC;oBAC/C,QAAQ,EAAE;wBACR,cAAc,UAAU,CAAC,MAAM,2BAA2B;wBAC1D,iBAAiB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG;wBACjD,GAAG,SAAS,qCAAqC;qBAClD;oBACD,aAAa,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;iBAC5B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAEnE;;;OAGG;IACK,YAAY,CAAC,OAAe,EAAE,SAAiB;QACrD,MAAM,SAAS,GAAG,WAAW,OAAO,EAAE,CAAC;QACvC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC,WAAW;YAAE,OAAO,IAAI,GAAG,SAAS,CAAC,CAAC,uBAAuB;QAElE,4CAA4C;QAC5C,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;QAC7G,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,KAAyC,CAAC;YAC5E,IAAI,KAAK,EAAE,OAAO,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;gBACxC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAE1B,4CAA4C;gBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;gBAClE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,GAAG,SAAS,CAAC;QAEhD,2DAA2D;QAC3D,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAExD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACzD,CAAC;CACF"}

package/dist/runtime/graph-dropout.d.ts

@@ -0,0 +1,59 @@
+import type { ExecutionGraph } from './execution-graph.js';
+export interface DropoutModel {
+    weights: number[];
+    bias: number;
+    learnRate: number;
+    lambda: number;
+    positiveCount: number;
+    negativeCount: number;
+}
+export interface DropoutRecommendation {
+    agentId: string;
+    agentType: string;
+    predictedContribution: number;
+    uncertainty: 'boundary' | 'confident';
+    shouldRequestFeedback: boolean;
+    shouldDropOut: boolean;
+}
+export interface ContributionRecord {
+    agentType: string;
+    phaseKind: string;
+    fileCount: number;
+    pattern: string;
+    contributed: boolean;
+}
+export interface ContributionStats {
+    agentType: string;
+    totalRuns: number;
+    contributions: number;
+    contributionRate: number;
+    avgPrediction: number;
+}
+export declare class PredictiveDropout {
+    private graph;
+    private model;
+    private records;
+    constructor(graph: ExecutionGraph);
+    static initModel(): DropoutModel;
+    /**
+     * Encode features: one-hot(agentType, 10) + one-hot(phaseKind, 6) + log(fileCount+1) + one-hot(pattern, 8) = 25
+     * Unknown values → all zeros in that block.
+     */
+    static encodeFeatures(agentType: string, phaseKind: string, fileCount: number, pattern: string): number[];
+    /** Predict contribution probability: σ(w·x + b) */
+    predict(features: number[]): number;
+    /** Train on one observation using class-weighted SGD with L2 regularization. */
+    train(record: ContributionRecord): void;
+    /** Recommend which agents to skip. */
+    predictRedundant(agents: Array<{
+        id: string;
+        agentType: string;
+    }>, phaseKind: string, fileCount: number, pattern: string, dropoutThreshold?: number): DropoutRecommendation[];
+    /** Record human override feedback (active learning signal). */
+    recordFeedback(agentType: string, phaseKind: string, fileCount: number, pattern: string, actuallyContributed: boolean): void;
+    /** Get contribution rates per agent type. */
+    getContributionStats(): ContributionStats[];
+    private saveToGraph;
+    private loadFromGraph;
+}
+//# sourceMappingURL=graph-dropout.d.ts.map

package/dist/runtime/graph-dropout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-dropout.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-dropout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAsB3D,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,WAAW,EAAE,UAAU,GAAG,WAAW,CAAC;IACtC,qBAAqB,EAAE,OAAO,CAAC;IAC/B,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;CACvB;AAoBD,qBAAa,iBAAiB;IAIhB,OAAO,CAAC,KAAK;IAHzB,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,OAAO,CAA4B;gBAEvB,KAAK,EAAE,cAAc;IAKzC,MAAM,CAAC,SAAS,IAAI,YAAY;IAWhC;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE;IAqBzG,mDAAmD;IACnD,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM;IAInC,gFAAgF;IAChF,KAAK,CAAC,MAAM,EAAE,kBAAkB,GAAG,IAAI;IA2BvC,sCAAsC;IACtC,gBAAgB,CACd,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,EAChD,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,gBAAgB,GAAE,MAA0B,GAC3C,qBAAqB,EAAE;IAiB1B,+DAA+D;IAC/D,cAAc,CACZ,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,mBAAmB,EAAE,OAAO,GAC3B,IAAI;IAUP,6CAA6C;IAC7C,oBAAoB,IAAI,iBAAiB,EAAE;IAkC3C,OAAO,CAAC,WAAW;IAyBnB,OAAO,CAAC,aAAa;CAwBtB"}

package/dist/runtime/graph-dropout.js

@@ -0,0 +1,196 @@
+// ─── Constants ────────────────────────────────────────────────────
+const AGENT_TYPES = [
+    'researcher', 'implementer', 'reviewer', 'tester', 'debugger',
+    'documenter', 'planner', 'refactorer', 'integrator', 'devils-advocate',
+];
+const PHASE_KINDS = ['research', 'implement', 'review', 'test', 'reflect', 'integrate'];
+const PATTERNS = ['research', 'tdd', 'red-team', 'review-cycle', 'spike', 'discover', 'dynamic', 'swarm'];
+// Feature dim = 10 + 6 + 1 + 8 = 25
+const FEATURE_DIM = 25;
+const DROPOUT_THRESHOLD = 0.2;
+const BOUNDARY_LOW = 0.3;
+const BOUNDARY_HIGH = 0.7;
+// ─── Helpers ──────────────────────────────────────────────────────
+function sigmoid(x) {
+    const clamped = Math.max(-500, Math.min(500, x));
+    return 1 / (1 + Math.exp(-clamped));
+}
+function dot(a, b) {
+    let sum = 0;
+    const len = Math.min(a.length, b.length);
+    for (let i = 0; i < len; i++) {
+        sum += a[i] * b[i];
+    }
+    return sum;
+}
+// ─── PredictiveDropout ────────────────────────────────────────────
+export class PredictiveDropout {
+    graph;
+    model;
+    records = [];
+    constructor(graph) {
+        this.graph = graph;
+        this.model = PredictiveDropout.initModel();
+        this.loadFromGraph();
+    }
+    static initModel() {
+        return {
+            weights: new Array(FEATURE_DIM).fill(0),
+            bias: 0.5,
+            learnRate: 0.01,
+            lambda: 0.001,
+            positiveCount: 0,
+            negativeCount: 0,
+        };
+    }
+    /**
+     * Encode features: one-hot(agentType, 10) + one-hot(phaseKind, 6) + log(fileCount+1) + one-hot(pattern, 8) = 25
+     * Unknown values → all zeros in that block.
+     */
+    static encodeFeatures(agentType, phaseKind, fileCount, pattern) {
+        const features = new Array(FEATURE_DIM).fill(0);
+        // One-hot agent type (indices 0-9)
+        const agentIdx = AGENT_TYPES.indexOf(agentType);
+        if (agentIdx >= 0)
+            features[agentIdx] = 1;
+        // One-hot phase kind (indices 10-15)
+        const phaseIdx = PHASE_KINDS.indexOf(phaseKind);
+        if (phaseIdx >= 0)
+            features[10 + phaseIdx] = 1;
+        // Log file count (index 16)
+        features[16] = Math.log(fileCount + 1);
+        // One-hot pattern (indices 17-24)
+        const patternIdx = PATTERNS.indexOf(pattern);
+        if (patternIdx >= 0)
+            features[17 + patternIdx] = 1;
+        return features;
+    }
+    /** Predict contribution probability: σ(w·x + b) */
+    predict(features) {
+        return sigmoid(dot(this.model.weights, features) + this.model.bias);
+    }
+    /** Train on one observation using class-weighted SGD with L2 regularization. */
+    train(record) {
+        this.records.push(record);
+        if (this.records.length > 1000)
+            this.records = this.records.slice(-1000);
+        const features = PredictiveDropout.encodeFeatures(record.agentType, record.phaseKind, record.fileCount, record.pattern);
+        const label = record.contributed ? 1 : 0;
+        const classWeight = record.contributed ? 1.0 : 3.0;
+        const prediction = this.predict(features);
+        const error = (prediction - label) * classWeight;
+        const { learnRate, lambda } = this.model;
+        for (let i = 0; i < FEATURE_DIM; i++) {
+            this.model.weights[i] -= learnRate * (error * features[i] + lambda * this.model.weights[i]);
+        }
+        this.model.bias -= learnRate * error;
+        if (record.contributed) {
+            this.model.positiveCount++;
+        }
+        else {
+            this.model.negativeCount++;
+        }
+        this.saveToGraph();
+    }
+    /** Recommend which agents to skip. */
+    predictRedundant(agents, phaseKind, fileCount, pattern, dropoutThreshold = DROPOUT_THRESHOLD) {
+        return agents.map((agent) => {
+            const features = PredictiveDropout.encodeFeatures(agent.agentType, phaseKind, fileCount, pattern);
+            const prediction = this.predict(features);
+            const inBoundary = prediction >= BOUNDARY_LOW && prediction <= BOUNDARY_HIGH;
+            return {
+                agentId: agent.id,
+                agentType: agent.agentType,
+                predictedContribution: prediction,
+                uncertainty: inBoundary ? 'boundary' : 'confident',
+                shouldRequestFeedback: inBoundary,
+                shouldDropOut: prediction < dropoutThreshold,
+            };
+        });
+    }
+    /** Record human override feedback (active learning signal). */
+    recordFeedback(agentType, phaseKind, fileCount, pattern, actuallyContributed) {
+        this.train({
+            agentType,
+            phaseKind,
+            fileCount,
+            pattern,
+            contributed: actuallyContributed,
+        });
+    }
+    /** Get contribution rates per agent type. */
+    getContributionStats() {
+        const groups = new Map();
+        for (const record of this.records) {
+            let entry = groups.get(record.agentType);
+            if (!entry) {
+                entry = { total: 0, contributions: 0, predictionSum: 0 };
+                groups.set(record.agentType, entry);
+            }
+            entry.total++;
+            if (record.contributed)
+                entry.contributions++;
+            const features = PredictiveDropout.encodeFeatures(record.agentType, record.phaseKind, record.fileCount, record.pattern);
+            entry.predictionSum += this.predict(features);
+        }
+        const stats = [];
+        for (const [agentType, entry] of groups) {
+            stats.push({
+                agentType,
+                totalRuns: entry.total,
+                contributions: entry.contributions,
+                contributionRate: entry.total > 0 ? entry.contributions / entry.total : 0,
+                avgPrediction: entry.total > 0 ? entry.predictionSum / entry.total : 0,
+            });
+        }
+        return stats;
+    }
+    // ─── Persistence ────────────────────────────────────────────────
+    saveToGraph() {
+        this.graph.addNode({
+            id: 'dropout:model',
+            type: 'heuristic',
+            label: 'Predictive Dropout Model',
+            properties: {
+                weights: this.model.weights,
+                bias: this.model.bias,
+                learnRate: this.model.learnRate,
+                lambda: this.model.lambda,
+                positiveCount: this.model.positiveCount,
+                negativeCount: this.model.negativeCount,
+            },
+        });
+        this.graph.addNode({
+            id: 'dropout:records',
+            type: 'heuristic',
+            label: 'Predictive Dropout Records',
+            properties: {
+                records: this.records,
+            },
+        });
+    }
+    loadFromGraph() {
+        const modelNode = this.graph.getNode('dropout:model');
+        if (modelNode) {
+            const p = modelNode.properties;
+            const weights = p.weights;
+            if (weights && Array.isArray(weights) && weights.length === FEATURE_DIM) {
+                this.model.weights = weights;
+                this.model.bias = p.bias ?? 0.5;
+                this.model.learnRate = p.learnRate ?? 0.01;
+                this.model.lambda = p.lambda ?? 0.001;
+                this.model.positiveCount = p.positiveCount ?? 0;
+                this.model.negativeCount = p.negativeCount ?? 0;
+            }
+        }
+        const recordsNode = this.graph.getNode('dropout:records');
+        if (recordsNode) {
+            const p = recordsNode.properties;
+            const records = p.records;
+            if (records && Array.isArray(records)) {
+                this.records = records;
+            }
+        }
+    }
+}
+//# sourceMappingURL=graph-dropout.js.map