0agent 1.0.2 → 1.0.3

package/packages/core/dist/embedding/adapters/OllamaAdapter.d.ts

@@ -1,19 +0,0 @@
-export interface EmbeddingAdapter {
-    embed(text: string): Promise<Float32Array>;
-    embedBatch(texts: string[]): Promise<Float32Array[]>;
-    readonly dimensions: number;
-    readonly modelName: string;
-}
-export declare class OllamaAdapter implements EmbeddingAdapter {
-    readonly dimensions: number;
-    readonly modelName: string;
-    private baseUrl;
-    constructor(opts: {
-        model: string;
-        dimensions: number;
-        baseUrl?: string;
-    });
-    embed(text: string): Promise<Float32Array>;
-    embedBatch(texts: string[]): Promise<Float32Array[]>;
-}
-//# sourceMappingURL=OllamaAdapter.d.ts.map

package/packages/core/dist/embedding/adapters/OllamaAdapter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"OllamaAdapter.d.ts","sourceRoot":"","sources":["../../../src/embedding/adapters/OllamaAdapter.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,gBAAgB;IAC/B,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;IAC3C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IACrD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,qBAAa,aAAc,YAAW,gBAAgB;IACpD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,OAAO,CAAS;gBAEZ,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE;IAMnE,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAa1C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;CAI3D"}

package/packages/core/dist/embedding/adapters/OllamaAdapter.js

@@ -1,27 +0,0 @@
-export class OllamaAdapter {
-    dimensions;
-    modelName;
-    baseUrl;
-    constructor(opts) {
-        this.modelName = opts.model;
-        this.dimensions = opts.dimensions;
-        this.baseUrl = opts.baseUrl ?? 'http://localhost:11434';
-    }
-    async embed(text) {
-        const resp = await fetch(`${this.baseUrl}/api/embeddings`, {
-            method: 'POST',
-            headers: { 'Content-Type': 'application/json' },
-            body: JSON.stringify({ model: this.modelName, prompt: text }),
-        });
-        if (!resp.ok) {
-            throw new Error(`Ollama embedding failed: ${resp.status} ${await resp.text()}`);
-        }
-        const data = (await resp.json());
-        return new Float32Array(data.embedding);
-    }
-    async embedBatch(texts) {
-        // Ollama doesn't have a batch endpoint — run sequentially
-        return Promise.all(texts.map((t) => this.embed(t)));
-    }
-}
-//# sourceMappingURL=OllamaAdapter.js.map

package/packages/core/dist/embedding/adapters/OllamaAdapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OllamaAdapter.js","sourceRoot":"","sources":["../../../src/embedding/adapters/OllamaAdapter.ts"],"names":[],"mappings":"AAOA,MAAM,OAAO,aAAa;IACf,UAAU,CAAS;IACnB,SAAS,CAAS;IACnB,OAAO,CAAS;IAExB,YAAY,IAA6D;QACvE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,wBAAwB,CAAC;IAC1D,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,iBAAiB,EAAE;YACzD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;SAC9D,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAA4B,CAAC;QAC5D,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,0DAA0D;QAC1D,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;CACF"}

package/packages/core/dist/embedding/adapters/OpenAIAdapter.d.ts

@@ -1,14 +0,0 @@
-import type { EmbeddingAdapter } from './OllamaAdapter.js';
-export declare class OpenAIAdapter implements EmbeddingAdapter {
-    readonly dimensions = 1536;
-    readonly modelName = "text-embedding-3-small";
-    private apiKey;
-    private baseUrl;
-    constructor(opts: {
-        apiKey: string;
-        baseUrl?: string;
-    });
-    embed(text: string): Promise<Float32Array>;
-    embedBatch(texts: string[]): Promise<Float32Array[]>;
-}
-//# sourceMappingURL=OpenAIAdapter.d.ts.map

package/packages/core/dist/embedding/adapters/OpenAIAdapter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"OpenAIAdapter.d.ts","sourceRoot":"","sources":["../../../src/embedding/adapters/OpenAIAdapter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,qBAAa,aAAc,YAAW,gBAAgB;IACpD,QAAQ,CAAC,UAAU,QAAQ;IAC3B,QAAQ,CAAC,SAAS,4BAA4B;IAC9C,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,OAAO,CAAS;gBAEZ,IAAI,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE;IAKhD,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAmB1C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;CAmB3D"}

package/packages/core/dist/embedding/adapters/OpenAIAdapter.js

@@ -1,48 +0,0 @@
-export class OpenAIAdapter {
-    dimensions = 1536;
-    modelName = 'text-embedding-3-small';
-    apiKey;
-    baseUrl;
-    constructor(opts) {
-        this.apiKey = opts.apiKey;
-        this.baseUrl = opts.baseUrl ?? 'https://api.openai.com/v1';
-    }
-    async embed(text) {
-        const resp = await fetch(`${this.baseUrl}/embeddings`, {
-            method: 'POST',
-            headers: {
-                'Content-Type': 'application/json',
-                'Authorization': `Bearer ${this.apiKey}`,
-            },
-            body: JSON.stringify({
-                model: this.modelName,
-                input: text,
-            }),
-        });
-        if (!resp.ok) {
-            throw new Error(`OpenAI embedding failed: ${resp.status}`);
-        }
-        const data = (await resp.json());
-        return new Float32Array(data.data[0].embedding);
-    }
-    async embedBatch(texts) {
-        // OpenAI supports batch in a single request
-        const resp = await fetch(`${this.baseUrl}/embeddings`, {
-            method: 'POST',
-            headers: {
-                'Content-Type': 'application/json',
-                'Authorization': `Bearer ${this.apiKey}`,
-            },
-            body: JSON.stringify({
-                model: this.modelName,
-                input: texts,
-            }),
-        });
-        if (!resp.ok) {
-            throw new Error(`OpenAI embedding batch failed: ${resp.status}`);
-        }
-        const data = (await resp.json());
-        return data.data.map((d) => new Float32Array(d.embedding));
-    }
-}
-//# sourceMappingURL=OpenAIAdapter.js.map

package/packages/core/dist/embedding/adapters/OpenAIAdapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OpenAIAdapter.js","sourceRoot":"","sources":["../../../src/embedding/adapters/OpenAIAdapter.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,aAAa;IACf,UAAU,GAAG,IAAI,CAAC;IAClB,SAAS,GAAG,wBAAwB,CAAC;IACtC,MAAM,CAAS;IACf,OAAO,CAAS;IAExB,YAAY,IAA0C;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,2BAA2B,CAAC;IAC7D,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,aAAa,EAAE;YACrD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;aACzC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,SAAS;gBACrB,KAAK,EAAE,IAAI;aACZ,CAAC;SACH,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAA6C,CAAC;QAC7E,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClD,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,4CAA4C;QAC5C,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,aAAa,EAAE;YACrD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;aACzC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,SAAS;gBACrB,KAAK,EAAE,KAAK;aACb,CAAC;SACH,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAA6C,CAAC;QAC7E,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC7D,CAAC;CACF"}

package/packages/core/dist/engine/CreditAttribution.d.ts

@@ -1,47 +0,0 @@
-/**
- * CreditAttribution — 3-layer credit attribution with DAG for 0agent Phase 4.
- *
- * Layer 1: Tier separation (attribution_grade vs scan_only)
- * Layer 2: Per-edge credit computation via WeightPropagation
- * Layer 3: DAG backward pass with competing-edge penalty
- */
-import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
-import type { WeightPropagation, OutcomeSignal } from './WeightPropagation.js';
-import type { TraversalLedger } from '../trace/TraversalLedger.js';
-import type { AttributionResult } from '../trace/OutcomeTrace.js';
-export interface DAGNode {
-    edge_id: string;
-    parents: string[];
-    children: string[];
-    base_credit: number;
-    final_credit: number;
-}
-export interface AttributionConfig {
-    /** Penalty applied when competing edges exist at the same source node */
-    competing_edge_penalty: number;
-    /** Credit split factor when multiple ambiguous paths lead to same outcome */
-    ambiguity_split: number;
-    /** Minimum weight margin to qualify for attribution_grade tier */
-    min_attribution_grade_delta: number;
-}
-export declare class CreditAttribution {
-    private propagation;
-    private config;
-    constructor(propagation: WeightPropagation, config?: Partial<AttributionConfig>);
-    /**
-     * Attribute credit for a completed trace across all traversed edges.
-     */
-    attribute(ledger: TraversalLedger, outcome: OutcomeSignal, graph: KnowledgeGraph): Promise<AttributionResult[]>;
-    private computeEntryCredit;
-    /**
-     * Build a DAG from attribution_grade entries based on step ordering
-     * and edge connectivity in the graph.
-     */
-    private buildDAG;
-    /**
-     * Backward pass through DAG: adjust credit for ambiguous paths
-     * and apply competing edge penalty.
-     */
-    private backwardPass;
-}
-//# sourceMappingURL=CreditAttribution.d.ts.map

package/packages/core/dist/engine/CreditAttribution.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CreditAttribution.d.ts","sourceRoot":"","sources":["../../src/engine/CreditAttribution.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,iBAAiB,EAAE,aAAa,EAAc,MAAM,wBAAwB,CAAC;AAC3F,OAAO,KAAK,EAAE,eAAe,EAAkB,MAAM,6BAA6B,CAAC;AACnF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAIlE,MAAM,WAAW,OAAO;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC,yEAAyE;IACzE,sBAAsB,EAAE,MAAM,CAAC;IAC/B,6EAA6E;IAC7E,eAAe,EAAE,MAAM,CAAC;IACxB,kEAAkE;IAClE,2BAA2B,EAAE,MAAM,CAAC;CACrC;AAUD,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,MAAM,CAAoB;gBAGhC,WAAW,EAAE,iBAAiB,EAC9B,MAAM,CAAC,EAAE,OAAO,CAAC,iBAAiB,CAAC;IAMrC;;OAEG;IACG,SAAS,CACb,MAAM,EAAE,eAAe,EACvB,OAAO,EAAE,aAAa,EACtB,KAAK,EAAE,cAAc,GACpB,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAwC/B,OAAO,CAAC,kBAAkB;IAuC1B;;;OAGG;IACH,OAAO,CAAC,QAAQ;IAsDhB;;;OAGG;IACH,OAAO,CAAC,YAAY;CA4ErB"}

package/packages/core/dist/engine/CreditAttribution.js

@@ -1,196 +0,0 @@
-/**
- * CreditAttribution — 3-layer credit attribution with DAG for 0agent Phase 4.
- *
- * Layer 1: Tier separation (attribution_grade vs scan_only)
- * Layer 2: Per-edge credit computation via WeightPropagation
- * Layer 3: DAG backward pass with competing-edge penalty
- */
-const DEFAULT_CONFIG = {
-    competing_edge_penalty: -0.3,
-    ambiguity_split: 0.5,
-    min_attribution_grade_delta: 0.1,
-};
-// ─── Class ─────────────────────────────────────────────────
-export class CreditAttribution {
-    propagation;
-    config;
-    constructor(propagation, config) {
-        this.propagation = propagation;
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    /**
-     * Attribute credit for a completed trace across all traversed edges.
-     */
-    async attribute(ledger, outcome, graph) {
-        const allEntries = ledger.getAll();
-        if (allEntries.length === 0)
-            return [];
-        // ── Layer 1: Tier separation ───────────────────────────
-        const attributionGrade = allEntries.filter((e) => e.tier === 'attribution_grade');
-        const scanOnly = allEntries.filter((e) => e.tier === 'scan_only');
-        // ── Layer 2: Per-edge credit computation ───────────────
-        const results = [];
-        for (const entry of attributionGrade) {
-            const result = this.computeEntryCredit(entry, outcome, graph);
-            if (result)
-                results.push(result);
-        }
-        // scan_only entries get zero credit but are still recorded
-        for (const entry of scanOnly) {
-            results.push({
-                edge_id: entry.edge_id,
-                tier: 'scan_only',
-                credit: 0,
-                influence: 0,
-                discount: 0,
-                old_weight: entry.weight_at_traversal,
-                new_weight: entry.weight_at_traversal,
-            });
-        }
-        // ── Layer 3: DAG backward pass ─────────────────────────
-        const dagNodes = this.buildDAG(attributionGrade, graph);
-        this.backwardPass(dagNodes, results);
-        return results;
-    }
-    // ─── Private helpers ─────────────────────────────────────
-    computeEntryCredit(entry, outcome, graph) {
-        const edge = graph.getEdge(entry.edge_id);
-        if (!edge)
-            return null;
-        // Get competing edges (siblings from same source node)
-        const siblings = graph.getEdgesFrom(edge.from_node);
-        const competing = siblings.filter((e) => e.id !== edge.id);
-        const influence = this.propagation.computeInfluence(edge, competing);
-        const stepLedger = {
-            edge_id: entry.edge_id,
-            step_index: entry.step_index,
-            has_sub_outcome: entry.has_sub_outcome,
-            weight_at_traversal: entry.weight_at_traversal,
-        };
-        const discount = this.propagation.computeDiscount(stepLedger);
-        const credit = this.propagation.computeCredit(outcome.value, influence, discount);
-        return {
-            edge_id: entry.edge_id,
-            tier: 'attribution_grade',
-            credit,
-            influence,
-            discount,
-            old_weight: edge.weight,
-            new_weight: edge.weight, // actual weight update happens in propagation
-        };
-    }
-    /**
-     * Build a DAG from attribution_grade entries based on step ordering
-     * and edge connectivity in the graph.
-     */
-    buildDAG(entries, graph) {
-        const dagNodes = new Map();
-        // Sort by step_index to establish ordering
-        const sorted = [...entries].sort((a, b) => a.step_index - b.step_index);
-        // Create DAG nodes
-        for (const entry of sorted) {
-            dagNodes.set(entry.edge_id, {
-                edge_id: entry.edge_id,
-                parents: [],
-                children: [],
-                base_credit: 0,
-                final_credit: 0,
-            });
-        }
-        // Establish parent-child relationships based on graph connectivity
-        const edgeIds = new Set(sorted.map((e) => e.edge_id));
-        for (const entry of sorted) {
-            const edge = graph.getEdge(entry.edge_id);
-            if (!edge)
-                continue;
-            // Find edges in our set that feed into this edge's source node
-            for (const otherEntry of sorted) {
-                if (otherEntry.edge_id === entry.edge_id)
-                    continue;
-                if (otherEntry.step_index >= entry.step_index)
-                    continue;
-                const otherEdge = graph.getEdge(otherEntry.edge_id);
-                if (!otherEdge)
-                    continue;
-                // otherEdge leads to the source of this edge
-                if (otherEdge.to_node === edge.from_node) {
-                    const dagNode = dagNodes.get(entry.edge_id);
-                    const parentNode = dagNodes.get(otherEntry.edge_id);
-                    if (!dagNode.parents.includes(otherEntry.edge_id)) {
-                        dagNode.parents.push(otherEntry.edge_id);
-                    }
-                    if (!parentNode.children.includes(entry.edge_id)) {
-                        parentNode.children.push(entry.edge_id);
-                    }
-                }
-            }
-        }
-        return dagNodes;
-    }
-    /**
-     * Backward pass through DAG: adjust credit for ambiguous paths
-     * and apply competing edge penalty.
-     */
-    backwardPass(dagNodes, results) {
-        // Map results by edge_id for lookup
-        const resultMap = new Map();
-        for (const r of results) {
-            resultMap.set(r.edge_id, r);
-        }
-        // Set base credits from computed results
-        for (const [edgeId, dagNode] of dagNodes) {
-            const result = resultMap.get(edgeId);
-            if (result) {
-                dagNode.base_credit = result.credit;
-                dagNode.final_credit = result.credit;
-            }
-        }
-        // Backward pass: process nodes from leaves to roots
-        const processed = new Set();
-        const toProcess = [...dagNodes.keys()];
-        // Process leaf nodes first (no children), then work backward
-        while (toProcess.length > 0) {
-            const nextBatch = [];
-            for (const edgeId of toProcess) {
-                const dagNode = dagNodes.get(edgeId);
-                // Can process if all children are already processed
-                const allChildrenDone = dagNode.children.every((c) => processed.has(c));
-                if (allChildrenDone) {
-                    // Apply ambiguity split: if multiple parents feed into the same
-                    // child, split the child's credit among parents
-                    for (const childId of dagNode.children) {
-                        const childDag = dagNodes.get(childId);
-                        if (childDag && childDag.parents.length > 1) {
-                            // Multiple parents — apply ambiguity split
-                            dagNode.final_credit *= this.config.ambiguity_split;
-                        }
-                    }
-                    // Apply competing edge penalty if this node has siblings in the DAG
-                    // that share the same parent
-                    for (const parentId of dagNode.parents) {
-                        const parentDag = dagNodes.get(parentId);
-                        if (parentDag && parentDag.children.length > 1) {
-                            dagNode.final_credit += this.config.competing_edge_penalty;
-                        }
-                    }
-                    // Update the result
-                    const result = resultMap.get(edgeId);
-                    if (result) {
-                        result.credit = dagNode.final_credit;
-                    }
-                    processed.add(edgeId);
-                }
-                else {
-                    nextBatch.push(edgeId);
-                }
-            }
-            // Safety: if no progress, break to avoid infinite loop
-            if (nextBatch.length === toProcess.length) {
-                break;
-            }
-            toProcess.length = 0;
-            toProcess.push(...nextBatch);
-        }
-    }
-}
-//# sourceMappingURL=CreditAttribution.js.map

package/packages/core/dist/engine/CreditAttribution.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CreditAttribution.js","sourceRoot":"","sources":["../../src/engine/CreditAttribution.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AA0BH,MAAM,cAAc,GAAsB;IACxC,sBAAsB,EAAE,CAAC,GAAG;IAC5B,eAAe,EAAE,GAAG;IACpB,2BAA2B,EAAE,GAAG;CACjC,CAAC;AAEF,8DAA8D;AAE9D,MAAM,OAAO,iBAAiB;IACpB,WAAW,CAAoB;IAC/B,MAAM,CAAoB;IAElC,YACE,WAA8B,EAC9B,MAAmC;QAEnC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CACb,MAAuB,EACvB,OAAsB,EACtB,KAAqB;QAErB,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvC,0DAA0D;QAC1D,MAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,mBAAmB,CACtC,CAAC;QACF,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;QAElE,0DAA0D;QAC1D,MAAM,OAAO,GAAwB,EAAE,CAAC;QAExC,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAC9D,IAAI,MAAM;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAED,2DAA2D;QAC3D,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC;gBACX,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,IAAI,EAAE,WAAW;gBACjB,MAAM,EAAE,CAAC;gBACT,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,KAAK,CAAC,mBAAmB;gBACrC,UAAU,EAAE,KAAK,CAAC,mBAAmB;aACtC,CAAC,CAAC;QACL,CAAC;QAED,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAErC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4DAA4D;IAEpD,kBAAkB,CACxB,KAAqB,EACrB,OAAsB,EACtB,KAAqB;QAErB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAEvB,uDAAuD;QACvD,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;QAE3D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAErE,MAAM,UAAU,GAAe;YAC7B,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;SAC/C,CAAC;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAE9D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAC3C,OAAO,CAAC,KAAK,EACb,SAAS,EACT,QAAQ,CACT,CAAC;QAEF,OAAO;YACL,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,IAAI,EAAE,mBAAmB;YACzB,MAAM;YACN,SAAS;YACT,QAAQ;YACR,UAAU,EAAE,IAAI,CAAC,MAAM;YACvB,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,8CAA8C;SACxE,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,QAAQ,CACd,OAAyB,EACzB,KAAqB;QAErB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAE5C,2CAA2C;QAC3C,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CACtC,CAAC;QAEF,mBAAmB;QACnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE;gBAC1B,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,OAAO,EAAE,EAAE;gBACX,QAAQ,EAAE,EAAE;gBACZ,WAAW,EAAE,CAAC;gBACd,YAAY,EAAE,CAAC;aAChB,CAAC,CAAC;QACL,CAAC;QAED,mEAAmE;QACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAEtD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,+DAA+D;YAC/D,KAAK,MAAM,UAAU,IAAI,MAAM,EAAE,CAAC;gBAChC,IAAI,UAAU,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO;oBAAE,SAAS;gBACnD,IAAI,UAAU,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU;oBAAE,SAAS;gBAExD,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACpD,IAAI,CAAC,SAAS;oBAAE,SAAS;gBAEzB,6CAA6C;gBAC7C,IAAI,SAAS,CAAC,OAAO,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;oBACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC;oBAC7C,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAE,CAAC;oBACrD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;wBAClD,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;oBAC3C,CAAC;oBACD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;wBACjD,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;oBAC1C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,YAAY,CAClB,QAA8B,EAC9B,OAA4B;QAE5B,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA6B,CAAC;QACvD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;QAED,yCAAyC;QACzC,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;gBACpC,OAAO,CAAC,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC;YACvC,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QAEvC,6DAA6D;QAC7D,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAa,EAAE,CAAC;YAE/B,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBAEtC,oDAAoD;gBACpD,MAAM,eAAe,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CACnD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CACjB,CAAC;gBAEF,IAAI,eAAe,EAAE,CAAC;oBACpB,gEAAgE;oBAChE,gDAAgD;oBAChD,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;wBACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBACvC,IAAI,QAAQ,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC5C,2CAA2C;4BAC3C,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;wBACtD,CAAC;oBACH,CAAC;oBAED,oEAAoE;oBACpE,6BAA6B;oBAC7B,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;wBACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACzC,IAAI,SAAS,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC/C,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,sBAAsB,CAAC;wBAC7D,CAAC;oBACH,CAAC;oBAED,oBAAoB;oBACpB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACrC,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,CAAC;oBAED,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YAED,uDAAuD;YACvD,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;gBAC1C,MAAM;YACR,CAAC;YAED,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;YACrB,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;CACF"}

package/packages/core/dist/engine/DecayScheduler.d.ts

@@ -1,45 +0,0 @@
-import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
-import type { GraphEdge } from '../graph/GraphEdge.js';
-import type { EdgeWeightUpdater } from '../concurrency/EdgeWeightUpdater.js';
-export interface DecayConfig {
-    interval_ms: number;
-    max_deferral_ms: number;
-    grace_period_ms: number;
-    max_delta_per_cycle: number;
-}
-export interface DecayReport {
-    edges_processed: number;
-    edges_decayed: number;
-    edges_skipped_locked: number;
-    edges_skipped_grace: number;
-    edges_skipped_neutral: number;
-}
-export declare class DecayScheduler {
-    private graph;
-    private updater;
-    private config;
-    private lastRun;
-    private deferredSince;
-    constructor(graph: KnowledgeGraph, updater: EdgeWeightUpdater, config?: Partial<DecayConfig>);
-    /**
-     * Compute decay for a single edge.
-     * Returns new weight or null if no decay needed.
-     *
-     * Rules:
-     * - Locked edges: skip (return null)
-     * - Weight exactly 0.5: skip (already neutral)
-     * - Within grace period (48h since last_traversed): skip
-     * - Delta = min(decay_rate * |weight - 0.5| * hours_elapsed, max_delta)
-     * - Direction: toward 0.5 (positive if below, negative if above)
-     * - NEVER cross 0.5 in a single step (clamp)
-     */
-    decayEdge(edge: GraphEdge, now: number): number | null;
-    /**
-     * Run a full decay cycle over all edges.
-     * Can be deferred if active sessions exist, but max 24h deferral.
-     */
-    runCycle(now?: number, canDefer?: boolean): Promise<DecayReport>;
-    shouldRun(now?: number): boolean;
-    getLastRun(): number;
-}
-//# sourceMappingURL=DecayScheduler.d.ts.map

package/packages/core/dist/engine/DecayScheduler.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"DecayScheduler.d.ts","sourceRoot":"","sources":["../../src/engine/DecayScheduler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAC;AAE7E,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,WAAW;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,qBAAa,cAAc;IAMvB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,OAAO;IANjB,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,aAAa,CAAuB;gBAGlC,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE,iBAAiB,EAClC,MAAM,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC;IAU/B;;;;;;;;;;;OAWG;IACH,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAwBtD;;;OAGG;IACG,QAAQ,CAAC,GAAG,GAAE,MAAmB,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,CAAC,WAAW,CAAC;IA6DzF,SAAS,CAAC,GAAG,GAAE,MAAmB,GAAG,OAAO;IAI5C,UAAU,IAAI,MAAM;CAGrB"}

package/packages/core/dist/engine/DecayScheduler.js

@@ -1,115 +0,0 @@
-export class DecayScheduler {
-    graph;
-    updater;
-    config;
-    lastRun = 0;
-    deferredSince = null;
-    constructor(graph, updater, config) {
-        this.graph = graph;
-        this.updater = updater;
-        this.config = {
-            interval_ms: config?.interval_ms ?? 6 * 60 * 60 * 1000,
-            max_deferral_ms: config?.max_deferral_ms ?? 24 * 60 * 60 * 1000,
-            grace_period_ms: config?.grace_period_ms ?? 48 * 60 * 60 * 1000,
-            max_delta_per_cycle: config?.max_delta_per_cycle ?? 0.05,
-        };
-    }
-    /**
-     * Compute decay for a single edge.
-     * Returns new weight or null if no decay needed.
-     *
-     * Rules:
-     * - Locked edges: skip (return null)
-     * - Weight exactly 0.5: skip (already neutral)
-     * - Within grace period (48h since last_traversed): skip
-     * - Delta = min(decay_rate * |weight - 0.5| * hours_elapsed, max_delta)
-     * - Direction: toward 0.5 (positive if below, negative if above)
-     * - NEVER cross 0.5 in a single step (clamp)
-     */
-    decayEdge(edge, now) {
-        if (edge.locked)
-            return null;
-        if (edge.weight === 0.5)
-            return null;
-        const lastTraversed = edge.last_traversed ?? edge.created_at;
-        const age = now - lastTraversed;
-        if (age < this.config.grace_period_ms)
-            return null;
-        const hoursElapsed = age / (60 * 60 * 1000);
-        const distanceFromNeutral = Math.abs(edge.weight - 0.5);
-        const rawDelta = edge.decay_rate * distanceFromNeutral * hoursElapsed;
-        const cappedDelta = Math.min(rawDelta, this.config.max_delta_per_cycle);
-        const direction = edge.weight > 0.5 ? -1 : 1;
-        const newWeight = edge.weight + direction * cappedDelta;
-        // Clamp: never cross 0.5
-        if (direction > 0) {
-            return Math.min(newWeight, 0.5);
-        }
-        else {
-            return Math.max(newWeight, 0.5);
-        }
-    }
-    /**
-     * Run a full decay cycle over all edges.
-     * Can be deferred if active sessions exist, but max 24h deferral.
-     */
-    async runCycle(now = Date.now(), canDefer = false) {
-        const emptyReport = {
-            edges_processed: 0,
-            edges_decayed: 0,
-            edges_skipped_locked: 0,
-            edges_skipped_grace: 0,
-            edges_skipped_neutral: 0,
-        };
-        // Check if we should defer
-        if (canDefer && this.deferredSince === null) {
-            this.deferredSince = now;
-            return emptyReport;
-        }
-        // Force run if deferred too long
-        if (this.deferredSince && (now - this.deferredSince) > this.config.max_deferral_ms) {
-            canDefer = false;
-        }
-        if (canDefer) {
-            return emptyReport;
-        }
-        const report = {
-            edges_processed: 0,
-            edges_decayed: 0,
-            edges_skipped_locked: 0,
-            edges_skipped_grace: 0,
-            edges_skipped_neutral: 0,
-        };
-        const edges = this.graph.getAllEdges();
-        for (const edge of edges) {
-            report.edges_processed++;
-            if (edge.locked) {
-                report.edges_skipped_locked++;
-                continue;
-            }
-            if (edge.weight === 0.5) {
-                report.edges_skipped_neutral++;
-                continue;
-            }
-            const newWeight = this.decayEdge(edge, now);
-            if (newWeight === null) {
-                report.edges_skipped_grace++;
-                continue;
-            }
-            if (newWeight !== edge.weight) {
-                await this.updater.update(edge.id, edge.weight, newWeight, 'time_decay');
-                report.edges_decayed++;
-            }
-        }
-        this.lastRun = now;
-        this.deferredSince = null;
-        return report;
-    }
-    shouldRun(now = Date.now()) {
-        return (now - this.lastRun) >= this.config.interval_ms;
-    }
-    getLastRun() {
-        return this.lastRun;
-    }
-}
-//# sourceMappingURL=DecayScheduler.js.map

package/packages/core/dist/engine/DecayScheduler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"DecayScheduler.js","sourceRoot":"","sources":["../../src/engine/DecayScheduler.ts"],"names":[],"mappings":"AAmBA,MAAM,OAAO,cAAc;IAMf;IACA;IANF,MAAM,CAAc;IACpB,OAAO,GAAW,CAAC,CAAC;IACpB,aAAa,GAAkB,IAAI,CAAC;IAE5C,YACU,KAAqB,EACrB,OAA0B,EAClC,MAA6B;QAFrB,UAAK,GAAL,KAAK,CAAgB;QACrB,YAAO,GAAP,OAAO,CAAmB;QAGlC,IAAI,CAAC,MAAM,GAAG;YACZ,WAAW,EAAE,MAAM,EAAE,WAAW,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;YACtD,eAAe,EAAE,MAAM,EAAE,eAAe,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;YAC/D,eAAe,EAAE,MAAM,EAAE,eAAe,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;YAC/D,mBAAmB,EAAE,MAAM,EAAE,mBAAmB,IAAI,IAAI;SACzD,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,SAAS,CAAC,IAAe,EAAE,GAAW;QACpC,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAErC,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,UAAU,CAAC;QAC7D,MAAM,GAAG,GAAG,GAAG,GAAG,aAAa,CAAC;QAChC,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC;QAEnD,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;QAC5C,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,mBAAmB,GAAG,YAAY,CAAC;QACtE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAExE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;QAExD,yBAAyB;QACzB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,QAAQ,CAAC,MAAc,IAAI,CAAC,GAAG,EAAE,EAAE,WAAoB,KAAK;QAChE,MAAM,WAAW,GAAgB;YAC/B,eAAe,EAAE,CAAC;YAClB,aAAa,EAAE,CAAC;YAChB,oBAAoB,EAAE,CAAC;YACvB,mBAAmB,EAAE,CAAC;YACtB,qBAAqB,EAAE,CAAC;SACzB,CAAC;QAEF,2BAA2B;QAC3B,IAAI,QAAQ,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;YAC5C,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;YACzB,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,iCAAiC;QACjC,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YACnF,QAAQ,GAAG,KAAK,CAAC;QACnB,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,MAAM,MAAM,GAAgB;YAC1B,eAAe,EAAE,CAAC;YAClB,aAAa,EAAE,CAAC;YAChB,oBAAoB,EAAE,CAAC;YACvB,mBAAmB,EAAE,CAAC;YACtB,qBAAqB,EAAE,CAAC;SACzB,CAAC;QAEF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,eAAe,EAAE,CAAC;YAEzB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,CAAC,oBAAoB,EAAE,CAAC;gBAC9B,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;gBACxB,MAAM,CAAC,qBAAqB,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC5C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;gBACzE,MAAM,CAAC,aAAa,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACnB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC1B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,CAAC,MAAc,IAAI,CAAC,GAAG,EAAE;QAChC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;IACzD,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF"}

package/packages/core/dist/engine/InferenceEngine.d.ts

@@ -1,95 +0,0 @@
-/**
- * InferenceEngine — Phase 4 full inference pipeline.
- *
- * Replaces the Phase 2 stub with:
- *   - Full entity resolution (pipeline or fallback)
- *   - Graph traversal with TraversalLedger recording
- *   - SelectionPolicy-based plan selection
- *   - Credit attribution and weight propagation on outcome
- *   - Skill metadata decoration
- *
- * The Phase 2 resolve() method is preserved for backward compatibility.
- */
-import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
-import type { NodeResolutionService } from '../entity/NodeResolutionService.js';
-import type { SelectionPolicy } from './SelectionPolicy.js';
-import type { TraversalLedger } from '../trace/TraversalLedger.js';
-import type { AttributionResult } from '../trace/OutcomeTrace.js';
-import type { WeightPropagation } from './WeightPropagation.js';
-import type { EdgeWeightUpdater } from '../concurrency/EdgeWeightUpdater.js';
-export interface IInferenceEngine {
-    resolve(task: string, context?: Record<string, unknown>): Promise<InferencePlan>;
-}
-export interface InferencePlan {
-    task: string;
-    resolved_entities: ResolvedEntity[];
-    selected_edge: SelectedEdge | null;
-    skill: string | null;
-    confidence: number;
-    reasoning: string;
-}
-export interface ResolvedEntity {
-    mention: string;
-    node_id: string;
-    confidence: number;
-    match_type: 'exact' | 'alias' | 'fuzzy' | 'created';
-}
-export interface SelectedEdge {
-    edge_id: string;
-    from_label: string;
-    to_label: string;
-    weight: number;
-    mode: 'exploit' | 'explore';
-}
-export interface InferenceRequest {
-    input: string;
-    session_id: string;
-    context?: Record<string, unknown>;
-    timeout_ms?: number;
-}
-export interface InferenceResult {
-    output: string;
-    trace_id: string;
-    entities_resolved: string[];
-    plan_selected: string[];
-    subagent_result?: unknown;
-    outcome_signal?: number;
-    deferred: boolean;
-}
-/**
- * EntityResolutionPipeline contract — optional advanced pipeline.
- * When not provided, the engine falls back to NodeResolutionService.
- */
-export interface EntityResolutionPipeline {
-    extractAndResolve(input: string, context?: Record<string, unknown>): Promise<ResolvedEntity[]>;
-}
-/**
- * CreditAttribution contract — optional attribution engine.
- * When not provided, weight updates are skipped.
- */
-export interface CreditAttribution {
-    attribute(ledger: TraversalLedger, outcomeSignal: number, traceId: string): Promise<AttributionResult[]>;
-}
-export declare class InferenceEngine implements IInferenceEngine {
-    private graph;
-    private resolver;
-    private policy;
-    private resolutionPipeline?;
-    private attribution?;
-    private propagation?;
-    private updater?;
-    constructor(graph: KnowledgeGraph, resolver: NodeResolutionService, policy: SelectionPolicy, resolutionPipeline?: EntityResolutionPipeline | undefined, attribution?: CreditAttribution | undefined, propagation?: WeightPropagation | undefined, updater?: EdgeWeightUpdater | undefined);
-    resolve(task: string, _context?: Record<string, unknown>): Promise<InferencePlan>;
-    infer(req: InferenceRequest): Promise<InferenceResult>;
-    /**
-     * Fallback entity resolution using the simple NodeResolutionService.
-     * Used when no EntityResolutionPipeline is provided.
-     */
-    private resolveEntitiesFallback;
-    /**
-     * Simple mention extraction: split task into potential entity names.
-     * Phase 4 EntityResolutionPipeline provides LLM-based NER as upgrade.
-     */
-    private extractMentions;
-}
-//# sourceMappingURL=InferenceEngine.d.ts.map