swarm-engine 1.3.0 → 1.38.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-dropout.js","sourceRoot":"","sources":["../../src/runtime/graph-dropout.ts"],"names":[],"mappings":"AAEA,qEAAqE;AAErE,MAAM,WAAW,GAAG;IAClB,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU;IAC7D,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,iBAAiB;CAC9D,CAAC;AAEX,MAAM,WAAW,GAAG,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,CAAU,CAAC;AAEjG,MAAM,QAAQ,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,CAAU,CAAC;AAEnH,oCAAoC;AACpC,MAAM,WAAW,GAAG,EAAE,CAAC;AAEvB,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,YAAY,GAAG,GAAG,CAAC;AACzB,MAAM,aAAa,GAAG,GAAG,CAAC;AAsC1B,qEAAqE;AAErE,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjD,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,GAAG,CAAC,CAAW,EAAE,CAAW;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qEAAqE;AAErE,MAAM,OAAO,iBAAiB;IAIR;IAHZ,KAAK,CAAe;IACpB,OAAO,GAAyB,EAAE,CAAC;IAE3C,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;QACvC,IAAI,CAAC,KAAK,GAAG,iBAAiB,CAAC,SAAS,EAAE,CAAC;QAC3C,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,SAAS;QACd,OAAO;YACL,OAAO,EAAE,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,IAAI,EAAE,GAAG;YACT,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,KAAK;YACb,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,SAAiB,EAAE,SAAiB,EAAE,SAAiB,EAAE,OAAe;QAC5F,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEhD,mCAAmC;QACnC,MAAM,QAAQ,GAAI,WAAiC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACvE,IAAI,QAAQ,IAAI,CAAC;YAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE1C,qCAAqC;QACrC,MAAM,QAAQ,GAAI,WAAiC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACvE,IAAI,QAAQ,IAAI,CAAC;YAAE,QAAQ,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE/C,4BAA4B;QAC5B,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEvC,kCAAkC;QAClC,MAAM,UAAU,GAAI,QAA8B,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACpE,IAAI,UAAU,IAAI,CAAC;YAAE,QAAQ,CAAC,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAEnD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,mDAAmD;IACnD,OAAO,CAAC,QAAkB;QACxB,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC;IAED,gFAAgF;IAChF,KAAK,CAAC,MAA0B;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI;YAAE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC;QAEzE,MAAM,QAAQ,GAAG,iBAAiB,CAAC,cAAc,CAC/C,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CACrE,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,GAAG,WAAW,CAAC;QAEjD,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,SAAS,GAAG,KAAK,CAAC;QAErC,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC7B,CAAC;QAED,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;IAED,sCAAsC;IACtC,gBAAgB,CACd,MAAgD,EAChD,SAAiB,EACjB,SAAiB,EACjB,OAAe,EACf,mBAA2B,iBAAiB;QAE5C,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAClG,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,UAAU,IAAI,YAAY,IAAI,UAAU,IAAI,aAAa,CAAC;YAE7E,OAAO;gBACL,OAAO,EAAE,KAAK,CAAC,EAAE;gBACjB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,qBAAqB,EAAE,UAAU;gBACjC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,UAAmB,CAAC,CAAC,CAAC,WAAoB;gBACpE,qBAAqB,EAAE,UAAU;gBACjC,aAAa,EAAE,UAAU,GAAG,gBAAgB;aAC7C,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,+DAA+D;IAC/D,cAAc,CACZ,SAAiB,EACjB,SAAiB,EACjB,SAAiB,EACjB,OAAe,EACf,mBAA4B;QAE5B,IAAI,CAAC,KAAK,CAAC;YACT,SAAS;YACT,SAAS;YACT,SAAS;YACT,OAAO;YACP,WAAW,EAAE,mBAAmB;SACjC,CAAC,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,oBAAoB;QAClB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2E,CAAC;QAElG,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC;gBACzD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,CAAC;YACD,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,MAAM,CAAC,WAAW;gBAAE,KAAK,CAAC,aAAa,EAAE,CAAC;YAE9C,MAAM,QAAQ,GAAG,iBAAiB,CAAC,cAAc,CAC/C,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CACrE,CAAC;YACF,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,KAAK,GAAwB,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC;gBACT,SAAS;gBACT,SAAS,EAAE,KAAK,CAAC,KAAK;gBACtB,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,gBAAgB,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzE,aAAa,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aACvE,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAE3D,WAAW;QACjB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,eAAe;YACnB,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,0BAA0B;YACjC,UAAU,EAAE;gBACV,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO;gBAC3B,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;gBACrB,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS;gBAC/B,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;gBACzB,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;gBACvC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;aACxC;SACF,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,iBAAiB;YACrB,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,4BAA4B;YACnC,UAAU,EAAE;gBACV,OAAO,EAAE,IAAI,CAAC,OAAO;aACtB;SACF,CAAC,CAAC;IACL,CAAC;IAEO,aAAa;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACtD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,SAAS,CAAC,UAAqC,CAAC;YAC1D,MAAM,OAAO,GAAG,CAAC,CAAC,OAA+B,CAAC;YAClD,IAAI,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBACxE,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAI,CAAC,CAAC,IAAe,IAAI,GAAG,CAAC;gBAC5C,IAAI,CAAC,KAAK,CAAC,SAAS,GAAI,CAAC,CAAC,SAAoB,IAAI,IAAI,CAAC;gBACvD,IAAI,CAAC,KAAK,CAAC,MAAM,GAAI,CAAC,CAAC,MAAiB,IAAI,KAAK,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,aAAa,GAAI,CAAC,CAAC,aAAwB,IAAI,CAAC,CAAC;gBAC5D,IAAI,CAAC,KAAK,CAAC,aAAa,GAAI,CAAC,CAAC,aAAwB,IAAI,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;QAC1D,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,WAAW,CAAC,UAAqC,CAAC;YAC5D,MAAM,OAAO,GAAG,CAAC,CAAC,OAA2C,CAAC;YAC9D,IAAI,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

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

@@ -0,0 +1,58 @@
+import type { ExecutionGraph } from './execution-graph.js';
+export interface SimilarOrchestration {
+    orchestrationId: string;
+    similarity: number;
+    pattern: string;
+    outcome: string;
+}
+export interface TransferRecommendation {
+    pattern: string;
+    confidence: number;
+    reasoning: string;
+    sourceOrchestrationId: string;
+    sourceOutcome: string;
+}
+/**
+ * Creates dense embedding vectors from orchestration topology (via GNN)
+ * and task descriptions (via TF-IDF), enabling similarity search and
+ * cross-run transfer learning.
+ */
+export declare class OrchestrationEmbedder {
+    private graph;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Create embedding from orchestration topology.
+     * Returns 8-dim structural embedding (fallback) or 16-dim GNN embedding.
+     */
+    embedOrchestration(orchestrationId: string): number[] | null;
+    /**
+     * Create embedding from task description + file patterns.
+     * Uses TF-IDF projected to 16 dims via Johnson-Lindenstrauss random projection.
+     */
+    embedTask(taskDescription: string, filePatterns?: string[]): number[];
+    /**
+     * Find similar orchestrations by embedding distance.
+     * Loads all stored embeddings from graph (heuristic nodes with id prefix 'embedding:').
+     */
+    findSimilarOrchestrations(embedding: number[], topK?: number): SimilarOrchestration[];
+    /**
+     * Recommend strategy transfer from a successful orchestration to a new task.
+     * Returns null if source failed or similarity is too low.
+     */
+    transferStrategy(sourceOrchId: string, targetTaskDescription: string): TransferRecommendation | null;
+    /**
+     * Store an orchestration's embedding for future search.
+     * Creates a heuristic node with id prefix 'embedding:'.
+     */
+    storeEmbedding(orchestrationId: string): void;
+    /**
+     * Cosine similarity between two vectors.
+     * Returns 0 if either vector has zero magnitude.
+     */
+    static cosineSimilarity(a: number[], b: number[]): number;
+    /** Simple string hash (DJB2). */
+    private hashString;
+    /** Gather task descriptions from stored orchestration nodes. */
+    private getStoredTaskDescriptions;
+}
+//# sourceMappingURL=graph-embeddings.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-embeddings.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-embeddings.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AA4C3D,MAAM,WAAW,oBAAoB;IACnC,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,aAAa,EAAE,MAAM,CAAC;CACvB;AAID;;;;GAIG;AACH,qBAAa,qBAAqB;IACpB,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;OAGG;IACH,kBAAkB,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI;IAsF5D;;;OAGG;IACH,SAAS,CAAC,eAAe,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IA2DrE;;;OAGG;IACH,yBAAyB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,IAAI,SAAI,GAAG,oBAAoB,EAAE;IAwBhF;;;OAGG;IACH,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,qBAAqB,EAAE,MAAM,GAAG,sBAAsB,GAAG,IAAI;IA6BpG;;;OAGG;IACH,cAAc,CAAC,eAAe,EAAE,MAAM,GAAG,IAAI;IAoB7C;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM;IAezD,iCAAiC;IACjC,OAAO,CAAC,UAAU;IAQlB,gEAAgE;IAChE,OAAO,CAAC,yBAAyB;CAMlC"}

package/dist/runtime/graph-embeddings.js

@@ -0,0 +1,301 @@
+import { Matrix } from './graph-gnn.js';
+import { MetaPatternSelector } from './graph-meta.js';
+// ─── Seeded PRNG ────────────────────────────────────────────────────
+/**
+ * Mulberry32: deterministic 32-bit PRNG seeded from an integer.
+ * Used for reproducible GNN weight init and random projection matrices.
+ */
+function mulberry32(seed) {
+    let s = seed | 0;
+    return () => {
+        s = (s + 0x6d2b79f5) | 0;
+        let t = Math.imul(s ^ (s >>> 15), 1 | s);
+        t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+/**
+ * Box-Muller transform using a seeded RNG.
+ * Returns a standard normal sample.
+ */
+function seededNormal(rng) {
+    const u1 = Math.max(rng(), 1e-10);
+    const u2 = rng();
+    return Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+}
+// ─── Node type → feature index (mirrored from graph-gnn.ts) ────────
+const NODE_TYPE_INDEX = {
+    orchestration: 0,
+    phase: 1,
+    agent: 2,
+    file: 3,
+    pattern: 4,
+    error: 5,
+    heuristic: 6,
+};
+// ─── OrchestrationEmbedder ──────────────────────────────────────────
+/**
+ * Creates dense embedding vectors from orchestration topology (via GNN)
+ * and task descriptions (via TF-IDF), enabling similarity search and
+ * cross-run transfer learning.
+ */
+export class OrchestrationEmbedder {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Create embedding from orchestration topology.
+     * Returns 8-dim structural embedding (fallback) or 16-dim GNN embedding.
+     */
+    embedOrchestration(orchestrationId) {
+        // 1. Get orchestration subgraph via BFS depth 3
+        const { nodes, edges } = this.graph.bfs(orchestrationId, 3);
+        if (nodes.length === 0)
+            return null;
+        const orchNode = nodes.find((n) => n.id === orchestrationId);
+        if (!orchNode)
+            return null;
+        // 2. Extract node features (same logic as FailurePropagationPredictor.extractFeatures)
+        const nodeIds = nodes.map((n) => n.id);
+        const nodeIndex = new Map(nodeIds.map((id, i) => [id, i]));
+        const featureData = [];
+        for (const node of nodes) {
+            const row = new Array(8).fill(0);
+            const typeIdx = NODE_TYPE_INDEX[node.type] ?? 0;
+            row[typeIdx] = 1;
+            let successRate = 0.5;
+            const status = node.properties?.status;
+            if (status === 'completed' || status === 'idle')
+                successRate = 1.0;
+            else if (status === 'failed' || status === 'error' || status === 'timeout')
+                successRate = 0.0;
+            row[7] = successRate;
+            featureData.push(row);
+        }
+        // 3. Build adjacency map from edges
+        const adjacency = new Map();
+        for (let i = 0; i < nodeIds.length; i++) {
+            const outEdges = this.graph.getEdges(nodeIds[i], 'outgoing');
+            const neighbors = [];
+            for (const edge of outEdges) {
+                const targetIdx = nodeIndex.get(edge.target);
+                if (targetIdx !== undefined)
+                    neighbors.push(targetIdx);
+            }
+            adjacency.set(i, neighbors);
+        }
+        // 4. Try GNN embedding first — check for stored weights
+        const weightsNode = this.graph.getNode('gnn:weights');
+        if (weightsNode && weightsNode.properties.W) {
+            try {
+                const { FailurePropagationPredictor } = require('./graph-gnn.js');
+                const predictor = new FailurePropagationPredictor(this.graph);
+                const weights = FailurePropagationPredictor.weightsFromJSON(weightsNode.properties);
+                const features = Matrix.fromArray(featureData);
+                const { pooled } = predictor.forward(features, adjacency, weights);
+                return pooled.data[0]; // 16-dim
+            }
+            catch {
+                // Fall through to structural embedding
+            }
+        }
+        // 5. Structural embedding fallback (8-dim)
+        const phaseNodes = nodes.filter((n) => n.type === 'phase');
+        const agentNodes = nodes.filter((n) => n.type === 'agent');
+        const fileNodes = nodes.filter((n) => n.type === 'file');
+        let totalSuccess = 0;
+        let statusCount = 0;
+        for (const node of nodes) {
+            const status = node.properties?.status;
+            if (status === 'completed' || status === 'idle') {
+                totalSuccess++;
+                statusCount++;
+            }
+            else if (status === 'failed' || status === 'error' || status === 'timeout') {
+                statusCount++;
+            }
+        }
+        const successRate = statusCount > 0 ? totalSuccess / statusCount : 0.5;
+        const durationMs = orchNode.properties?.durationMs ?? 0;
+        const avgDuration = durationMs > 0 ? Math.log(durationMs + 1) / 15 : 0; // normalized
+        const patternStr = orchNode.properties?.pattern ?? 'unknown';
+        const patternHash = this.hashString(patternStr) / 4294967296; // [0,1]
+        return [
+            nodes.length / 100, // nodeCount (normalized)
+            edges.length / 100, // edgeCount (normalized)
+            phaseNodes.length / 10,
+            agentNodes.length / 10,
+            fileNodes.length / 50,
+            successRate,
+            avgDuration,
+            patternHash,
+        ];
+    }
+    /**
+     * Create embedding from task description + file patterns.
+     * Uses TF-IDF projected to 16 dims via Johnson-Lindenstrauss random projection.
+     */
+    embedTask(taskDescription, filePatterns) {
+        // 1. Build TF-IDF vector from task description
+        //    Use stored descriptions as corpus (consistent across calls for same graph state).
+        //    Include the input to ensure its tokens appear in vocabulary.
+        const storedDocs = this.getStoredTaskDescriptions();
+        const allDocs = storedDocs.length > 0 ? storedDocs : [taskDescription];
+        const tfidfModel = MetaPatternSelector.buildTfIdfModel(allDocs);
+        const tfidfVec = MetaPatternSelector.vectorize(tfidfModel, taskDescription);
+        // 2. Structural features from file patterns
+        const files = filePatterns ?? [];
+        const logFileCount = Math.log(files.length + 1);
+        const hasTestFiles = files.some((f) => f.includes('test') || f.includes('spec')) ? 1 : 0;
+        const hasSrcFiles = files.some((f) => f.includes('src/') || f.includes('lib/')) ? 1 : 0;
+        const avgPathDepth = files.length > 0
+            ? files.reduce((sum, f) => sum + f.split('/').length, 0) / files.length / 10
+            : 0;
+        // 3. Concatenate TF-IDF + structural features
+        const fullVec = [...tfidfVec, logFileCount, hasTestFiles, hasSrcFiles, avgPathDepth];
+        // 4. Project to 16 dims via random projection (Johnson-Lindenstrauss)
+        //    Generate a fixed-size R matrix (maxDim × 16) so projections are consistent
+        //    regardless of input vector length.
+        const targetDim = 16;
+        const maxDim = 504; // 500 (max vocab) + 4 structural features
+        const rng = mulberry32(42); // deterministic seed
+        // Pre-generate full R matrix so all calls draw the same random values
+        const R = [];
+        for (let i = 0; i < maxDim; i++) {
+            const row = [];
+            for (let j = 0; j < targetDim; j++) {
+                row.push(seededNormal(rng));
+            }
+            R.push(row);
+        }
+        const scale = 1 / Math.sqrt(targetDim);
+        const projected = new Array(targetDim).fill(0);
+        for (let j = 0; j < targetDim; j++) {
+            let sum = 0;
+            for (let i = 0; i < fullVec.length && i < maxDim; i++) {
+                sum += fullVec[i] * R[i][j];
+            }
+            projected[j] = sum * scale;
+        }
+        // 5. L2-normalize
+        const magnitude = Math.sqrt(projected.reduce((sum, v) => sum + v * v, 0));
+        if (magnitude > 0) {
+            for (let i = 0; i < projected.length; i++) {
+                projected[i] /= magnitude;
+            }
+        }
+        return projected;
+    }
+    /**
+     * Find similar orchestrations by embedding distance.
+     * Loads all stored embeddings from graph (heuristic nodes with id prefix 'embedding:').
+     */
+    findSimilarOrchestrations(embedding, topK = 5) {
+        const heuristicNodes = this.graph.getNodesByType('heuristic');
+        const embeddingNodes = heuristicNodes.filter((n) => n.id.startsWith('embedding:'));
+        if (embeddingNodes.length === 0)
+            return [];
+        const results = [];
+        for (const node of embeddingNodes) {
+            const vector = node.properties.vector;
+            if (!vector || vector.length === 0)
+                continue;
+            const similarity = OrchestrationEmbedder.cosineSimilarity(embedding, vector);
+            results.push({
+                orchestrationId: node.properties.orchestrationId,
+                similarity,
+                pattern: node.properties.pattern ?? 'unknown',
+                outcome: node.properties.status ?? 'unknown',
+            });
+        }
+        results.sort((a, b) => b.similarity - a.similarity);
+        return results.slice(0, topK);
+    }
+    /**
+     * Recommend strategy transfer from a successful orchestration to a new task.
+     * Returns null if source failed or similarity is too low.
+     */
+    transferStrategy(sourceOrchId, targetTaskDescription) {
+        // 1. Get source orchestration's pattern and outcome from graph
+        const orchNode = this.graph.getNode(sourceOrchId);
+        if (!orchNode)
+            return null;
+        const sourceStatus = orchNode.properties?.status ?? 'unknown';
+        const sourcePattern = orchNode.properties?.pattern ?? 'unknown';
+        // 2. Don't transfer failure strategies
+        if (sourceStatus === 'failed' || sourceStatus === 'error')
+            return null;
+        // 3. Compute task similarity
+        const sourceTaskDesc = orchNode.properties?.taskDescription || orchNode.label;
+        const sourceEmbed = this.embedTask(sourceTaskDesc);
+        const targetEmbed = this.embedTask(targetTaskDescription);
+        const similarity = OrchestrationEmbedder.cosineSimilarity(sourceEmbed, targetEmbed);
+        // 4. Only recommend if similarity > 0.3
+        if (similarity <= 0.3)
+            return null;
+        return {
+            pattern: sourcePattern,
+            confidence: similarity,
+            reasoning: `Task similarity ${similarity.toFixed(3)} with source orchestration "${orchNode.label}" (${sourceStatus}). Recommending same pattern "${sourcePattern}".`,
+            sourceOrchestrationId: sourceOrchId,
+            sourceOutcome: sourceStatus,
+        };
+    }
+    /**
+     * Store an orchestration's embedding for future search.
+     * Creates a heuristic node with id prefix 'embedding:'.
+     */
+    storeEmbedding(orchestrationId) {
+        const embedding = this.embedOrchestration(orchestrationId);
+        if (!embedding)
+            return;
+        const orchNode = this.graph.getNode(orchestrationId);
+        if (!orchNode)
+            return;
+        this.graph.addNode({
+            id: `embedding:${orchestrationId}`,
+            type: 'heuristic',
+            label: 'OrchestrationEmbedding',
+            properties: {
+                orchestrationId,
+                vector: embedding,
+                pattern: orchNode.properties?.pattern ?? 'unknown',
+                status: orchNode.properties?.status ?? 'unknown',
+            },
+        });
+    }
+    /**
+     * Cosine similarity between two vectors.
+     * Returns 0 if either vector has zero magnitude.
+     */
+    static cosineSimilarity(a, b) {
+        let dot = 0;
+        let na = 0;
+        let nb = 0;
+        const len = Math.min(a.length, b.length);
+        for (let i = 0; i < len; i++) {
+            dot += a[i] * b[i];
+            na += a[i] * a[i];
+            nb += b[i] * b[i];
+        }
+        return na === 0 || nb === 0 ? 0 : dot / (Math.sqrt(na) * Math.sqrt(nb));
+    }
+    // ─── Helpers ──────────────────────────────────────────────────────
+    /** Simple string hash (DJB2). */
+    hashString(s) {
+        let hash = 5381;
+        for (let i = 0; i < s.length; i++) {
+            hash = ((hash << 5) + hash + s.charCodeAt(i)) | 0;
+        }
+        return hash >>> 0; // unsigned
+    }
+    /** Gather task descriptions from stored orchestration nodes. */
+    getStoredTaskDescriptions() {
+        const orchNodes = this.graph.getNodesByType('orchestration');
+        return orchNodes
+            .map((n) => n.properties.taskDescription || n.label)
+            .filter((desc) => desc && desc.length > 0);
+    }
+}
+//# sourceMappingURL=graph-embeddings.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-embeddings.js","sourceRoot":"","sources":["../../src/runtime/graph-embeddings.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAEtD,uEAAuE;AAEvE;;;GAGG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,GAAiB;IACrC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;IACjB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AACnE,CAAC;AAED,sEAAsE;AAEtE,MAAM,eAAe,GAA2B;IAC9C,aAAa,EAAE,CAAC;IAChB,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;IACP,OAAO,EAAE,CAAC;IACV,KAAK,EAAE,CAAC;IACR,SAAS,EAAE,CAAC;CACb,CAAC;AAmBF,uEAAuE;AAEvE;;;;GAIG;AACH,MAAM,OAAO,qBAAqB;IACZ;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;OAGG;IACH,kBAAkB,CAAC,eAAuB;QACxC,gDAAgD;QAChD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEpC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,CAAC;QAC7D,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,uFAAuF;QACvF,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3D,MAAM,WAAW,GAAe,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEjB,IAAI,WAAW,GAAG,GAAG,CAAC;YACtB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,MAA4B,CAAC;YAC7D,IAAI,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,MAAM;gBAAE,WAAW,GAAG,GAAG,CAAC;iBAC9D,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,SAAS;gBAAE,WAAW,GAAG,GAAG,CAAC;YAC9F,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAErB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QAED,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC7D,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7C,IAAI,SAAS,KAAK,SAAS;oBAAE,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzD,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC9B,CAAC;QAED,wDAAwD;QACxD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QACtD,IAAI,WAAW,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC;gBACH,MAAM,EAAE,2BAA2B,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;gBAClE,MAAM,SAAS,GAAG,IAAI,2BAA2B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9D,MAAM,OAAO,GAAG,2BAA2B,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBACpF,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;gBAC/C,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;gBACnE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;YAClC,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;YACzC,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QAEzD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,MAA4B,CAAC;YAC7D,IAAI,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;gBAAC,YAAY,EAAE,CAAC;gBAAC,WAAW,EAAE,CAAC;YAAC,CAAC;iBAC9E,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBAAC,WAAW,EAAE,CAAC;YAAC,CAAC;QAChG,CAAC;QACD,MAAM,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;QAEvE,MAAM,UAAU,GAAI,QAAQ,CAAC,UAAU,EAAE,UAAqB,IAAI,CAAC,CAAC;QACpE,MAAM,WAAW,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;QAErF,MAAM,UAAU,GAAI,QAAQ,CAAC,UAAU,EAAE,OAAkB,IAAI,SAAS,CAAC;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,QAAQ;QAEtE,OAAO;YACL,KAAK,CAAC,MAAM,GAAG,GAAG,EAAI,yBAAyB;YAC/C,KAAK,CAAC,MAAM,GAAG,GAAG,EAAI,yBAAyB;YAC/C,UAAU,CAAC,MAAM,GAAG,EAAE;YACtB,UAAU,CAAC,MAAM,GAAG,EAAE;YACtB,SAAS,CAAC,MAAM,GAAG,EAAE;YACrB,WAAW;YACX,WAAW;YACX,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,eAAuB,EAAE,YAAuB;QACxD,+CAA+C;QAC/C,uFAAuF;QACvF,kEAAkE;QAClE,MAAM,UAAU,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACpD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,mBAAmB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,SAAS,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;QAE5E,4CAA4C;QAC5C,MAAM,KAAK,GAAG,YAAY,IAAI,EAAE,CAAC;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;YACnC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE;YAC5E,CAAC,CAAC,CAAC,CAAC;QAEN,8CAA8C;QAC9C,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;QAErF,sEAAsE;QACtE,gFAAgF;QAChF,wCAAwC;QACxC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,0CAA0C;QAC9D,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,qBAAqB;QAEjD,sEAAsE;QACtE,MAAM,CAAC,GAAe,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,CAAC;YACD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtD,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC;QAC7B,CAAC;QAED,kBAAkB;QAClB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,yBAAyB,CAAC,SAAmB,EAAE,IAAI,GAAG,CAAC;QACrD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;QAEnF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE3C,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAA8B,CAAC;YAC9D,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE7C,MAAM,UAAU,GAAG,qBAAqB,CAAC,gBAAgB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7E,OAAO,CAAC,IAAI,CAAC;gBACX,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,eAAyB;gBAC1D,UAAU;gBACV,OAAO,EAAG,IAAI,CAAC,UAAU,CAAC,OAAkB,IAAI,SAAS;gBACzD,OAAO,EAAG,IAAI,CAAC,UAAU,CAAC,MAAiB,IAAI,SAAS;aACzD,CAAC,CAAC;QACL,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,YAAoB,EAAE,qBAA6B;QAClE,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,MAAM,YAAY,GAAI,QAAQ,CAAC,UAAU,EAAE,MAAiB,IAAI,SAAS,CAAC;QAC1E,MAAM,aAAa,GAAI,QAAQ,CAAC,UAAU,EAAE,OAAkB,IAAI,SAAS,CAAC;QAE5E,uCAAuC;QACvC,IAAI,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,OAAO;YAAE,OAAO,IAAI,CAAC;QAEvE,6BAA6B;QAC7B,MAAM,cAAc,GAAI,QAAQ,CAAC,UAAU,EAAE,eAA0B,IAAI,QAAQ,CAAC,KAAK,CAAC;QAC1F,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,qBAAqB,CAAC,gBAAgB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEpF,wCAAwC;QACxC,IAAI,UAAU,IAAI,GAAG;YAAE,OAAO,IAAI,CAAC;QAEnC,OAAO;YACL,OAAO,EAAE,aAAa;YACtB,UAAU,EAAE,UAAU;YACtB,SAAS,EAAE,mBAAmB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,+BAA+B,QAAQ,CAAC,KAAK,MAAM,YAAY,iCAAiC,aAAa,IAAI;YACpK,qBAAqB,EAAE,YAAY;YACnC,aAAa,EAAE,YAAY;SAC5B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,eAAuB;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;QAC3D,IAAI,CAAC,SAAS;YAAE,OAAO;QAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,aAAa,eAAe,EAAE;YAClC,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,wBAAwB;YAC/B,UAAU,EAAE;gBACV,eAAe;gBACf,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,QAAQ,CAAC,UAAU,EAAE,OAAO,IAAI,SAAS;gBAClD,MAAM,EAAE,QAAQ,CAAC,UAAU,EAAE,MAAM,IAAI,SAAS;aACjD;SACF,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC9C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,qEAAqE;IAErE,iCAAiC;IACzB,UAAU,CAAC,CAAS;QAC1B,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,WAAW;IAChC,CAAC;IAED,gEAAgE;IACxD,yBAAyB;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAC7D,OAAO,SAAS;aACb,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,UAAU,CAAC,eAA0B,IAAI,CAAC,CAAC,KAAK,CAAC;aAC/D,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;CACF"}

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

@@ -0,0 +1,30 @@
+import type { ExecutionGraph } from './execution-graph.js';
+import { type ReviewFinding } from './review-schema.js';
+/**
+ * Records review findings back into the execution knowledge graph as error
+ * nodes and caused_by edges, enabling cross-run learning from review outcomes.
+ *
+ * Also adjusts context routing weights: weakens edges that led to bad outcomes
+ * so future agents get less of the context that produced errors.
+ */
+export declare class ReviewFeedbackRecorder {
+    private graph;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Parse agent review output and record structured findings as graph nodes/edges.
+     * Creates an error node per finding and a caused_by edge to the file.
+     */
+    recordFindings(orchestrationId: string, phaseId: string, agentOutput: string, reviewerName: string): {
+        recorded: number;
+        errors: number;
+    };
+    /**
+     * Weaken edges that led to bad outcomes, strengthening the signal for
+     * future context routing to avoid the same patterns.
+     *
+     * For each finding with a file, finds agents that touched it and reduces
+     * the weight of their produced/consumed edges.
+     */
+    adjustContextWeights(orchestrationId: string, findings: ReviewFinding[]): void;
+}
+//# sourceMappingURL=graph-feedback.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-feedback.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-feedback.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAqB,KAAK,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAE3E;;;;;;GAMG;AACH,qBAAa,sBAAsB;IACrB,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;OAGG;IACH,cAAc,CACZ,eAAe,EAAE,MAAM,EACvB,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,GACnB;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAyCvC;;;;;;OAMG;IACH,oBAAoB,CAAC,eAAe,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,IAAI;CAwB/E"}

package/dist/runtime/graph-feedback.js

@@ -0,0 +1,82 @@
+import { parseReviewOutput } from './review-schema.js';
+/**
+ * Records review findings back into the execution knowledge graph as error
+ * nodes and caused_by edges, enabling cross-run learning from review outcomes.
+ *
+ * Also adjusts context routing weights: weakens edges that led to bad outcomes
+ * so future agents get less of the context that produced errors.
+ */
+export class ReviewFeedbackRecorder {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Parse agent review output and record structured findings as graph nodes/edges.
+     * Creates an error node per finding and a caused_by edge to the file.
+     */
+    recordFindings(orchestrationId, phaseId, agentOutput, reviewerName) {
+        const findings = parseReviewOutput(agentOutput, reviewerName);
+        let recorded = 0;
+        let errors = 0;
+        for (const finding of findings) {
+            if (!finding.file) {
+                errors++;
+                continue;
+            }
+            const errorId = `error:${orchestrationId}:${finding.file}:${finding.id}`;
+            this.graph.addNode({
+                id: errorId,
+                type: 'error',
+                label: finding.title,
+                properties: {
+                    severity: finding.severity,
+                    confidence: finding.confidence,
+                    category: finding.category,
+                    reviewer: finding.reviewer,
+                    orchestrationId,
+                    phaseId,
+                },
+            });
+            const fileId = `file:${finding.file}`;
+            this.graph.upsertEdge({
+                source: errorId,
+                target: fileId,
+                type: 'caused_by',
+                confidence: 'INFERRED',
+                properties: { severity: finding.severity, findingId: finding.id },
+            });
+            recorded++;
+        }
+        return { recorded, errors };
+    }
+    /**
+     * Weaken edges that led to bad outcomes, strengthening the signal for
+     * future context routing to avoid the same patterns.
+     *
+     * For each finding with a file, finds agents that touched it and reduces
+     * the weight of their produced/consumed edges.
+     */
+    adjustContextWeights(orchestrationId, findings) {
+        for (const finding of findings) {
+            if (!finding.file || finding.severity === 'P3')
+                continue;
+            const fileId = `file:${finding.file}`;
+            // Find agents that touched this file
+            const touchEdges = this.graph
+                .getEdges(fileId, 'incoming')
+                .filter((e) => e.type === 'touched_file');
+            for (const edge of touchEdges) {
+                // Reduce weight on the produced/consumed edges for this agent
+                const agentEdges = this.graph
+                    .getEdges(edge.source, 'outgoing')
+                    .filter((e) => e.type === 'produced' || e.type === 'consumed');
+                for (const ae of agentEdges) {
+                    const delta = finding.severity === 'P0' ? -0.3 : finding.severity === 'P1' ? -0.2 : -0.1;
+                    this.graph.updateEdgeWeight(ae.source, ae.target, ae.type, delta);
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=graph-feedback.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-feedback.js","sourceRoot":"","sources":["../../src/runtime/graph-feedback.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAsB,MAAM,oBAAoB,CAAC;AAE3E;;;;;;GAMG;AACH,MAAM,OAAO,sBAAsB;IACb;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;OAGG;IACH,cAAc,CACZ,eAAuB,EACvB,OAAe,EACf,WAAmB,EACnB,YAAoB;QAEpB,MAAM,QAAQ,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAC9D,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAClB,MAAM,EAAE,CAAC;gBACT,SAAS;YACX,CAAC;YAED,MAAM,OAAO,GAAG,SAAS,eAAe,IAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;YACzE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,OAAO;gBACX,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,UAAU,EAAE;oBACV,QAAQ,EAAE,OAAO,CAAC,QAAQ;oBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;oBAC9B,QAAQ,EAAE,OAAO,CAAC,QAAQ;oBAC1B,QAAQ,EAAE,OAAO,CAAC,QAAQ;oBAC1B,eAAe;oBACf,OAAO;iBACR;aACF,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;gBACpB,MAAM,EAAE,OAAO;gBACf,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,WAAW;gBACjB,UAAU,EAAE,UAAU;gBACtB,UAAU,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE;aAClE,CAAC,CAAC;YAEH,QAAQ,EAAE,CAAC;QACb,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,oBAAoB,CAAC,eAAuB,EAAE,QAAyB;QACrE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI;gBAAE,SAAS;YAEzD,MAAM,MAAM,GAAG,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACtC,qCAAqC;YACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK;iBAC1B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;iBAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YAE5C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,8DAA8D;gBAC9D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK;qBAC1B,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;qBACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;gBAEjE,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC5B,MAAM,KAAK,GACT,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;oBAC7E,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

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

@@ -0,0 +1,120 @@
+import type { ExecutionGraph } from './execution-graph.js';
+/**
+ * Pure TypeScript 2D matrix operations for the GNN predictor.
+ * No external dependencies — uses Box-Muller for random normal init.
+ */
+export declare class Matrix {
+    rows: number;
+    cols: number;
+    data: number[][];
+    constructor(rows: number, cols: number, data: number[][]);
+    static zeros(r: number, c: number): Matrix;
+    static fromArray(data: number[][]): Matrix;
+    /** Xavier normal via Box-Muller transform. */
+    static random(r: number, c: number, scale: number): Matrix;
+    /** (r×k) @ (k×c) → (r×c) */
+    multiply(other: Matrix): Matrix;
+    /** Element-wise add with (1,c) → (r,c) broadcast support. */
+    add(other: Matrix): Matrix;
+    subtract(other: Matrix): Matrix;
+    /** Scalar multiply. */
+    scale(s: number): Matrix;
+    /** Element-wise multiply. */
+    hadamard(other: Matrix): Matrix;
+    transpose(): Matrix;
+    /** max(0, x) */
+    relu(): Matrix;
+    /** 1/(1+exp(-clamp(x))) with clamp [-500, 500] */
+    sigmoid(): Matrix;
+    /** 1 if x>0, else 0 */
+    reluGrad(): Matrix;
+    /** (r,c) → (1,c) mean across rows */
+    meanRows(): Matrix;
+    /** (r,c) → (1,c) sum across rows */
+    sumRows(): Matrix;
+    getRow(i: number): number[];
+    setRow(i: number, v: number[]): void;
+    addToRow(i: number, v: number[]): void;
+    toJSON(): number[][];
+    static fromJSON(d: number[][]): Matrix;
+}
+export interface GNNWeights {
+    W: Matrix[];
+    Bself: Matrix[];
+    bias: Matrix[];
+    Wout: Matrix;
+    bout: number;
+}
+export interface PropagationRisk {
+    nodeId: string;
+    nodeType: string;
+    riskScore: number;
+    affectedDownstream: string[];
+}
+export interface CircuitBreaker {
+    afterNodeId: string;
+    riskReduction: number;
+    reason: string;
+}
+/**
+ * 3-layer message-passing GNN for predicting orchestration pass/fail
+ * from graph topology. Uses the ExecutionGraph for feature extraction
+ * and adjacency construction.
+ */
+export declare class FailurePropagationPredictor {
+    private graph;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Extract node features from an orchestration subgraph.
+     * Features: 7 one-hot type + 1 success rate = 8 dimensions.
+     */
+    private extractFeatures;
+    /** Initialize weights with Xavier normal scaling. */
+    initWeights(F?: number, H?: number): GNNWeights;
+    /**
+     * Forward pass: 3-layer message passing → global mean pool → sigmoid.
+     *
+     * Per layer: agg_v = mean(H[u] for u in neighbors(v)) [self if isolated]
+     *            pre_v = agg_v @ W[k] + H[v] @ Bself[k] + bias[k]
+     *            H_v   = ReLU(pre_v)
+     * Output:    pooled = mean(H_final), logit = pooled @ Wout + bout, pred = sigmoid(logit)
+     */
+    forward(features: Matrix, adjacency: Map<number, number[]>, weights: GNNWeights): {
+        prediction: number;
+        layerOutputs: Matrix[];
+        aggregated: Matrix[];
+        preActivation: Matrix[];
+        pooled: Matrix;
+    };
+    /**
+     * Train on one example via backprop through all 3 message-passing layers.
+     * Updates weights in-place. Returns binary cross-entropy loss.
+     */
+    trainStep(features: Matrix, adjacency: Map<number, number[]>, label: 0 | 1, weights: GNNWeights, lr?: number): number;
+    /** Train on all historical orchestrations. Label: 1=completed, 0=failed. */
+    train(weights: GNNWeights, epochs?: number, lr?: number): {
+        finalLoss: number;
+        epochs: number;
+    };
+    /**
+     * Predict failure risk per node. Per-node risk is derived from
+     * the node's final hidden representation projected through Wout:
+     * risk = 1 - sigmoid(H_v @ Wout + bout).
+     */
+    predict(orchestrationId: string, weights: GNNWeights): PropagationRisk[];
+    /**
+     * Find optimal circuit breaker placement by simulating node removal.
+     * For each node, zero its features and re-run forward. Nodes whose
+     * removal most increases the success prediction are candidates.
+     */
+    findCircuitBreakers(orchestrationId: string, weights: GNNWeights): CircuitBreaker[];
+    /**
+     * Compute the GNN pooled embedding for an orchestration.
+     * Returns the 16-dim mean-pooled hidden state, or null if no nodes found.
+     * Used by OrchestrationEmbedder for similarity search.
+     */
+    embed(orchestrationId: string, weights: GNNWeights): number[] | null;
+    static weightsToJSON(w: GNNWeights): object;
+    static weightsFromJSON(d: any): GNNWeights;
+}
+//# sourceMappingURL=graph-gnn.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-gnn.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-gnn.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAI3D;;;GAGG;AACH,qBAAa,MAAM;IAER,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,MAAM,EAAE,EAAE;gBAFhB,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EAAE,EAAE;IAGzB,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAI1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM;IAM1C,8CAA8C;IAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAe1D,4BAA4B;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAgB/B,6DAA6D;IAC7D,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAsB1B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAsB/B,uBAAuB;IACvB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAUxB,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAa/B,SAAS,IAAI,MAAM;IAUnB,gBAAgB;IAChB,IAAI,IAAI,MAAM;IAUd,kDAAkD;IAClD,OAAO,IAAI,MAAM;IAWjB,uBAAuB;IACvB,QAAQ,IAAI,MAAM;IAUlB,qCAAqC;IACrC,QAAQ,IAAI,MAAM;IAWlB,oCAAoC;IACpC,OAAO,IAAI,MAAM;IAUjB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAI3B,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI;IAIpC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI;IAMtC,MAAM,IAAI,MAAM,EAAE,EAAE;IAIpB,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM;CAGvC;AAID,MAAM,WAAW,UAAU;IACzB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB;AAgBD;;;;GAIG;AACH,qBAAa,2BAA2B;IAC1B,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;OAGG;IACH,OAAO,CAAC,eAAe;IA4CvB,qDAAqD;IACrD,WAAW,CAAC,CAAC,SAAI,EAAE,CAAC,SAAK,GAAG,UAAU;IAkBtC;;;;;;;OAOG;IACH,OAAO,CACL,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAChC,OAAO,EAAE,UAAU,GAClB;QACD,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,aAAa,EAAE,MAAM,EAAE,CAAC;QACxB,MAAM,EAAE,MAAM,CAAC;KAChB;IA0DD;;;OAGG;IACH,SAAS,CACP,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAChC,KAAK,EAAE,CAAC,GAAG,CAAC,EACZ,OAAO,EAAE,UAAU,EACnB,EAAE,SAAO,GACR,MAAM;IA+ET,4EAA4E;IAC5E,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,SAAK,EAAE,EAAE,SAAO,GAAG;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IA2BzF;;;;OAIG;IACH,OAAO,CAAC,eAAe,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,GAAG,eAAe,EAAE;IA+BxE;;;;OAIG;IACH,mBAAmB,CAAC,eAAe,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,GAAG,cAAc,EAAE;IA8BnF;;;;OAIG;IACH,KAAK,CAAC,eAAe,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,GAAG,MAAM,EAAE,GAAG,IAAI;IAOpE,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM;IAU3C,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,GAAG,UAAU;CAS3C"}