0agent 1.0.2 → 1.0.4

package/packages/core/dist/maintenance/GraphRollback.js

@@ -1,154 +0,0 @@
-export class GraphRollback {
-    graph;
-    adapter;
-    weightLog;
-    checkpointManager;
-    constructor(graph, adapter, weightLog, checkpointManager) {
-        this.graph = graph;
-        this.adapter = adapter;
-        this.weightLog = weightLog;
-        this.checkpointManager = checkpointManager;
-    }
-    /**
-     * Dispatch to the appropriate rollback strategy based on mode.
-     */
-    async rollback(mode) {
-        switch (mode.type) {
-            case 'checkpoint':
-                return this.rollbackToCheckpoint(mode.checkpoint_id);
-            case 'trace':
-                return this.rollbackTrace(mode.trace_id);
-            case 'verifier':
-                return this.rollbackVerifier(mode.verifier_name);
-        }
-    }
-    // ── Mode 1: Checkpoint ──────────────────────────────────────────────
-    //
-    // Reverse all weight_events created after the checkpoint timestamp.
-    // For each event (newest first): restore the edge to event.old_weight.
-    // Re-insert any nodes/edges from the checkpoint snapshot that no longer
-    // exist in the live graph.
-    async rollbackToCheckpoint(checkpointId) {
-        const checkpoint = this.checkpointManager.get(checkpointId);
-        if (!checkpoint) {
-            throw new Error(`Checkpoint not found: ${checkpointId}`);
-        }
-        const snapshot = await this.checkpointManager.getSnapshot(checkpointId);
-        if (!snapshot) {
-            throw new Error(`Checkpoint snapshot could not be loaded: ${checkpointId}`);
-        }
-        const result = {
-            mode: { type: 'checkpoint', checkpoint_id: checkpointId },
-            edges_reverted: 0,
-            nodes_restored: 0,
-            traces_undone: 0,
-            weight_events_reversed: 0,
-        };
-        // Collect all weight events after the checkpoint timestamp by scanning
-        // edges present in the snapshot. We go through each snapshot edge and
-        // check its event history.
-        const eventsAfterCheckpoint = [];
-        const snapshotEdgeIds = new Set(snapshot.edges.map((e) => e.id));
-        // Also check edges that might exist now but not in the snapshot
-        const currentEdges = this.graph.getAllEdges();
-        const allEdgeIds = new Set([
-            ...snapshotEdgeIds,
-            ...currentEdges.map((e) => e.id),
-        ]);
-        for (const edgeId of allEdgeIds) {
-            const events = this.weightLog.getByEdge(edgeId);
-            for (const evt of events) {
-                if (evt.created_at > checkpoint.created_at) {
-                    eventsAfterCheckpoint.push(evt);
-                }
-            }
-        }
-        // Sort newest first and reverse each event
-        eventsAfterCheckpoint.sort((a, b) => b.created_at - a.created_at);
-        for (const evt of eventsAfterCheckpoint) {
-            const edge = this.adapter.getEdge(evt.edge_id);
-            if (edge) {
-                this.adapter.forceUpdateEdgeWeight(evt.edge_id, evt.old_weight);
-                result.edges_reverted++;
-            }
-            result.weight_events_reversed++;
-        }
-        // Re-insert nodes from snapshot that are missing in the live graph
-        for (const snapshotNode of snapshot.nodes) {
-            const existing = this.graph.getNode(snapshotNode.id);
-            if (!existing) {
-                this.graph.addNode(snapshotNode);
-                result.nodes_restored++;
-            }
-        }
-        // Re-insert edges from snapshot that are missing in the live graph
-        for (const snapshotEdge of snapshot.edges) {
-            const existing = this.adapter.getEdge(snapshotEdge.id);
-            if (!existing) {
-                this.graph.addEdge(snapshotEdge);
-                result.edges_reverted++;
-            }
-        }
-        return result;
-    }
-    // ── Mode 2: Trace ──────────────────────────────────────────────────
-    //
-    // Reverse all weight_events associated with this trace_id.
-    // For each (newest first): restore the edge to event.old_weight.
-    async rollbackTrace(traceId) {
-        const events = this.weightLog.getByTrace(traceId);
-        const result = {
-            mode: { type: 'trace', trace_id: traceId },
-            edges_reverted: 0,
-            nodes_restored: 0,
-            traces_undone: 1,
-            weight_events_reversed: 0,
-        };
-        if (events.length === 0) {
-            result.traces_undone = 0;
-            return result;
-        }
-        // Sort newest first to reverse in correct order
-        const sorted = [...events].sort((a, b) => b.created_at - a.created_at);
-        for (const evt of sorted) {
-            const edge = this.adapter.getEdge(evt.edge_id);
-            if (edge) {
-                this.adapter.forceUpdateEdgeWeight(evt.edge_id, evt.old_weight);
-                result.edges_reverted++;
-            }
-            result.weight_events_reversed++;
-        }
-        return result;
-    }
-    // ── Mode 3: Verifier ──────────────────────────────────────────────
-    //
-    // Find all traces whose metadata references this verifier name,
-    // then rollback each trace individually.
-    async rollbackVerifier(verifierName) {
-        const result = {
-            mode: { type: 'verifier', verifier_name: verifierName },
-            edges_reverted: 0,
-            nodes_restored: 0,
-            traces_undone: 0,
-            weight_events_reversed: 0,
-        };
-        // Query all traces (paginated scan) and filter for ones resolved by this verifier.
-        // The verifier name is stored in trace metadata under "verifier" or "verifier_name".
-        const allTraces = this.adapter.queryTraces({ limit: 100_000 });
-        const matchingTraces = allTraces.filter((t) => {
-            const meta = t.metadata;
-            return (meta.verifier === verifierName ||
-                meta.verifier_name === verifierName ||
-                meta.resolved_by === verifierName);
-        });
-        for (const trace of matchingTraces) {
-            const traceResult = await this.rollbackTrace(trace.id);
-            result.edges_reverted += traceResult.edges_reverted;
-            result.nodes_restored += traceResult.nodes_restored;
-            result.traces_undone += traceResult.traces_undone;
-            result.weight_events_reversed += traceResult.weight_events_reversed;
-        }
-        return result;
-    }
-}
-//# sourceMappingURL=GraphRollback.js.map

package/packages/core/dist/maintenance/GraphRollback.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GraphRollback.js","sourceRoot":"","sources":["../../src/maintenance/GraphRollback.ts"],"names":[],"mappings":"AAmBA,MAAM,OAAO,aAAa;IAEd;IACA;IACA;IACA;IAJV,YACU,KAAqB,EACrB,OAAsB,EACtB,SAAyB,EACzB,iBAAyC;QAHzC,UAAK,GAAL,KAAK,CAAgB;QACrB,YAAO,GAAP,OAAO,CAAe;QACtB,cAAS,GAAT,SAAS,CAAgB;QACzB,sBAAiB,GAAjB,iBAAiB,CAAwB;IAChD,CAAC;IAEJ;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,IAAkB;QAC/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,YAAY;gBACf,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACvD,KAAK,OAAO;gBACV,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3C,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,EAAE;IACF,oEAAoE;IACpE,uEAAuE;IACvE,wEAAwE;IACxE,2BAA2B;IAEnB,KAAK,CAAC,oBAAoB,CAAC,YAAoB;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,yBAAyB,YAAY,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,4CAA4C,YAAY,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,MAAM,GAAmB;YAC7B,IAAI,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE;YACzD,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,CAAC;YACjB,aAAa,EAAE,CAAC;YAChB,sBAAsB,EAAE,CAAC;SAC1B,CAAC;QAEF,uEAAuE;QACvE,sEAAsE;QACtE,2BAA2B;QAC3B,MAAM,qBAAqB,GAAkB,EAAE,CAAC;QAEhD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjE,gEAAgE;QAChE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;YACzB,GAAG,eAAe;YAClB,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACjC,CAAC,CAAC;QAEH,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAChD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,IAAI,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC;oBAC3C,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAElE,KAAK,MAAM,GAAG,IAAI,qBAAqB,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;gBAChE,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;YACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;QAClC,CAAC;QAED,mEAAmE;QACnE,KAAK,MAAM,YAAY,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBACjC,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,KAAK,MAAM,YAAY,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YACvD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBACjC,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,sEAAsE;IACtE,EAAE;IACF,2DAA2D;IAC3D,iEAAiE;IAEzD,KAAK,CAAC,aAAa,CAAC,OAAe;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAElD,MAAM,MAAM,GAAmB;YAC7B,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;YAC1C,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,CAAC;YACjB,aAAa,EAAE,CAAC;YAChB,sBAAsB,EAAE,CAAC;SAC1B,CAAC;QAEF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,gDAAgD;QAChD,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAEvE,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;gBAChE,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;YACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;QAClC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qEAAqE;IACrE,EAAE;IACF,gEAAgE;IAChE,yCAAyC;IAEjC,KAAK,CAAC,gBAAgB,CAAC,YAAoB;QACjD,MAAM,MAAM,GAAmB;YAC7B,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAE;YACvD,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,CAAC;YACjB,aAAa,EAAE,CAAC;YAChB,sBAAsB,EAAE,CAAC;SAC1B,CAAC;QAEF,mFAAmF;QACnF,qFAAqF;QACrF,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAE/D,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC5C,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,OAAO,CACL,IAAI,CAAC,QAAQ,KAAK,YAAY;gBAC9B,IAAI,CAAC,aAAa,KAAK,YAAY;gBACnC,IAAI,CAAC,WAAW,KAAK,YAAY,CAClC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvD,MAAM,CAAC,cAAc,IAAI,WAAW,CAAC,cAAc,CAAC;YACpD,MAAM,CAAC,cAAc,IAAI,WAAW,CAAC,cAAc,CAAC;YACpD,MAAM,CAAC,aAAa,IAAI,WAAW,CAAC,aAAa,CAAC;YAClD,MAAM,CAAC,sBAAsB,IAAI,WAAW,CAAC,sBAAsB,CAAC;QACtE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/packages/core/dist/maintenance/NodeDeduplicator.d.ts

@@ -1,26 +0,0 @@
-import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
-export interface DeduplicationConfig {
-    cosine_threshold: number;
-    dry_run: boolean;
-}
-export interface MergeCandidate {
-    node_a_id: string;
-    node_b_id: string;
-    similarity: number;
-    surviving_node_id: string;
-    removed_node_id: string;
-}
-export interface DeduplicationResult {
-    merged_count: number;
-    candidates_found: number;
-    candidates: MergeCandidate[];
-}
-export declare class NodeDeduplicator {
-    private graph;
-    constructor(graph: KnowledgeGraph);
-    run(config?: Partial<DeduplicationConfig>): DeduplicationResult;
-    mergeNodes(candidate: MergeCandidate): void;
-    private cosineSimilarity;
-    private deepMerge;
-}
-//# sourceMappingURL=NodeDeduplicator.d.ts.map

package/packages/core/dist/maintenance/NodeDeduplicator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"NodeDeduplicator.d.ts","sourceRoot":"","sources":["../../src/maintenance/NodeDeduplicator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAIjE,MAAM,WAAW,mBAAmB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,mBAAmB;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B;AAOD,qBAAa,gBAAgB;IACf,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,mBAAmB,CAAC,GAAG,mBAAmB;IAwE/D,UAAU,CAAC,SAAS,EAAE,cAAc,GAAG,IAAI;IA4E3C,OAAO,CAAC,gBAAgB;IAmBxB,OAAO,CAAC,SAAS;CA6BlB"}

package/packages/core/dist/maintenance/NodeDeduplicator.js

@@ -1,171 +0,0 @@
-const DEFAULT_CONFIG = {
-    cosine_threshold: 0.92,
-    dry_run: false,
-};
-export class NodeDeduplicator {
-    graph;
-    constructor(graph) {
-        this.graph = graph;
-    }
-    run(config) {
-        const cfg = { ...DEFAULT_CONFIG, ...config };
-        const result = {
-            merged_count: 0,
-            candidates_found: 0,
-            candidates: [],
-        };
-        // Collect all nodes that have embeddings, grouped by type
-        const allEdges = this.graph.getAllEdges();
-        const nodeIds = new Set();
-        for (const edge of allEdges) {
-            nodeIds.add(edge.from_node);
-            nodeIds.add(edge.to_node);
-        }
-        // Also gather nodes from the graph by resolving each unique id
-        const nodesWithEmbeddings = [];
-        for (const id of nodeIds) {
-            const node = this.graph.getNode(id);
-            if (node && node.embedding) {
-                nodesWithEmbeddings.push(node);
-            }
-        }
-        // Track which nodes have been removed so we don't merge already-removed nodes
-        const removedIds = new Set();
-        // Pairwise cosine similarity (O(n^2) — acceptable for weekly maintenance)
-        for (let i = 0; i < nodesWithEmbeddings.length; i++) {
-            if (removedIds.has(nodesWithEmbeddings[i].id))
-                continue;
-            for (let j = i + 1; j < nodesWithEmbeddings.length; j++) {
-                if (removedIds.has(nodesWithEmbeddings[j].id))
-                    continue;
-                const nodeA = nodesWithEmbeddings[i];
-                const nodeB = nodesWithEmbeddings[j];
-                // Never merge different types
-                if (nodeA.type !== nodeB.type)
-                    continue;
-                const similarity = this.cosineSimilarity(nodeA.embedding, nodeB.embedding);
-                if (similarity < cfg.cosine_threshold)
-                    continue;
-                // Surviving node = higher visit_count
-                const surviving = nodeA.visit_count >= nodeB.visit_count ? nodeA : nodeB;
-                const removed = surviving === nodeA ? nodeB : nodeA;
-                const candidate = {
-                    node_a_id: nodeA.id,
-                    node_b_id: nodeB.id,
-                    similarity,
-                    surviving_node_id: surviving.id,
-                    removed_node_id: removed.id,
-                };
-                result.candidates_found++;
-                result.candidates.push(candidate);
-                if (!cfg.dry_run) {
-                    this.mergeNodes(candidate);
-                    removedIds.add(removed.id);
-                    result.merged_count++;
-                }
-            }
-        }
-        return result;
-    }
-    mergeNodes(candidate) {
-        const surviving = this.graph.getNode(candidate.surviving_node_id);
-        const removed = this.graph.getNode(candidate.removed_node_id);
-        if (!surviving || !removed)
-            return;
-        // Merge visit counts
-        const newVisitCount = surviving.visit_count + removed.visit_count;
-        // Deep merge metadata (surviving wins conflicts)
-        const newMetadata = this.deepMerge(removed.metadata, surviving.metadata);
-        this.graph.updateNode(surviving.id, {
-            metadata: { ...newMetadata, _visit_count_merged: newVisitCount },
-        });
-        // We need to update visit_count — but updateNode only supports label/metadata/embedding fields.
-        // Re-read, delete, and re-insert with correct visit_count via the node itself.
-        const updatedSurviving = this.graph.getNode(surviving.id);
-        if (updatedSurviving) {
-            // Manually fix visit_count through delete/re-add cycle
-            this.graph.deleteNode(surviving.id);
-            updatedSurviving.visit_count = newVisitCount;
-            updatedSurviving.metadata = newMetadata;
-            delete updatedSurviving.metadata._visit_count_merged;
-            this.graph.addNode(updatedSurviving);
-        }
-        // Re-point all edges from removed node → surviving node
-        const removedEdges = this.graph.getEdgesByNode(removed.id, 'both');
-        for (const edge of removedEdges) {
-            const isFrom = edge.from_node === removed.id;
-            const newFrom = isFrom ? surviving.id : edge.from_node;
-            const newTo = isFrom ? edge.to_node : surviving.id;
-            // Skip self-loops that would form
-            if (newFrom === newTo) {
-                this.graph.deleteEdge(edge.id);
-                continue;
-            }
-            // Check if a duplicate edge already exists between these nodes
-            const existingEdges = this.graph.getEdgesBetween(newFrom, newTo);
-            const duplicateEdge = existingEdges.find((e) => e.type === edge.type);
-            if (duplicateEdge) {
-                // Merge weights: take max weight, sum traversal counts
-                const mergedWeight = Math.max(duplicateEdge.weight, edge.weight);
-                const mergedTraversalCount = duplicateEdge.traversal_count + edge.traversal_count;
-                // Delete both and re-create merged edge
-                this.graph.deleteEdge(edge.id);
-                this.graph.deleteEdge(duplicateEdge.id);
-                const mergedEdge = {
-                    ...duplicateEdge,
-                    weight: mergedWeight,
-                    traversal_count: mergedTraversalCount,
-                };
-                this.graph.addEdge(mergedEdge);
-            }
-            else {
-                // Re-point edge
-                this.graph.deleteEdge(edge.id);
-                const repointed = {
-                    ...edge,
-                    from_node: newFrom,
-                    to_node: newTo,
-                };
-                this.graph.addEdge(repointed);
-            }
-        }
-        // Delete the removed node
-        this.graph.deleteNode(removed.id);
-    }
-    cosineSimilarity(a, b) {
-        if (a.length !== b.length)
-            return 0;
-        let dotProduct = 0;
-        let normA = 0;
-        let normB = 0;
-        for (let i = 0; i < a.length; i++) {
-            dotProduct += a[i] * b[i];
-            normA += a[i] * a[i];
-            normB += b[i] * b[i];
-        }
-        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
-        if (denominator === 0)
-            return 0;
-        return dotProduct / denominator;
-    }
-    deepMerge(base, override) {
-        const result = { ...base };
-        for (const key of Object.keys(override)) {
-            const baseVal = base[key];
-            const overrideVal = override[key];
-            if (typeof baseVal === 'object' &&
-                baseVal !== null &&
-                !Array.isArray(baseVal) &&
-                typeof overrideVal === 'object' &&
-                overrideVal !== null &&
-                !Array.isArray(overrideVal)) {
-                result[key] = this.deepMerge(baseVal, overrideVal);
-            }
-            else {
-                result[key] = overrideVal;
-            }
-        }
-        return result;
-    }
-}
-//# sourceMappingURL=NodeDeduplicator.js.map

package/packages/core/dist/maintenance/NodeDeduplicator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"NodeDeduplicator.js","sourceRoot":"","sources":["../../src/maintenance/NodeDeduplicator.ts"],"names":[],"mappings":"AAuBA,MAAM,cAAc,GAAwB;IAC1C,gBAAgB,EAAE,IAAI;IACtB,OAAO,EAAE,KAAK;CACf,CAAC;AAEF,MAAM,OAAO,gBAAgB;IACP;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C,GAAG,CAAC,MAAqC;QACvC,MAAM,GAAG,GAAwB,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;QAElE,MAAM,MAAM,GAAwB;YAClC,YAAY,EAAE,CAAC;YACf,gBAAgB,EAAE,CAAC;YACnB,UAAU,EAAE,EAAE;SACf,CAAC;QAEF,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC;QAED,+DAA+D;QAC/D,MAAM,mBAAmB,GAAgB,EAAE,CAAC;QAC5C,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC3B,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,8EAA8E;QAC9E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,0EAA0E;QAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,IAAI,UAAU,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAExD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,IAAI,UAAU,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAExD,MAAM,KAAK,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,KAAK,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gBAErC,8BAA8B;gBAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;oBAAE,SAAS;gBAExC,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAU,EAAE,KAAK,CAAC,SAAU,CAAC,CAAC;gBAE7E,IAAI,UAAU,GAAG,GAAG,CAAC,gBAAgB;oBAAE,SAAS;gBAEhD,sCAAsC;gBACtC,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACzE,MAAM,OAAO,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBAEpD,MAAM,SAAS,GAAmB;oBAChC,SAAS,EAAE,KAAK,CAAC,EAAE;oBACnB,SAAS,EAAE,KAAK,CAAC,EAAE;oBACnB,UAAU;oBACV,iBAAiB,EAAE,SAAS,CAAC,EAAE;oBAC/B,eAAe,EAAE,OAAO,CAAC,EAAE;iBAC5B,CAAC;gBAEF,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC1B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAElC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;oBACjB,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;oBAC3B,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;oBAC3B,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,UAAU,CAAC,SAAyB;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;QAE9D,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO;YAAE,OAAO;QAEnC,qBAAqB;QACrB,MAAM,aAAa,GAAG,SAAS,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QAElE,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC;QAEzE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,EAAE;YAClC,QAAQ,EAAE,EAAE,GAAG,WAAW,EAAE,mBAAmB,EAAE,aAAa,EAAE;SACjE,CAAC,CAAC;QAEH,gGAAgG;QAChG,+EAA+E;QAC/E,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC1D,IAAI,gBAAgB,EAAE,CAAC;YACrB,uDAAuD;YACvD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACpC,gBAAgB,CAAC,WAAW,GAAG,aAAa,CAAC;YAC7C,gBAAgB,CAAC,QAAQ,GAAG,WAAW,CAAC;YACxC,OAAQ,gBAAgB,CAAC,QAAoC,CAAC,mBAAmB,CAAC;YAClF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QACvC,CAAC;QAED,wDAAwD;QACxD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACnE,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;YACvD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;YAEnD,kCAAkC;YAClC,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,+DAA+D;YAC/D,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACjE,MAAM,aAAa,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YAEtE,IAAI,aAAa,EAAE,CAAC;gBAClB,uDAAuD;gBACvD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjE,MAAM,oBAAoB,GAAG,aAAa,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC;gBAElF,wCAAwC;gBACxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;gBAExC,MAAM,UAAU,GAAc;oBAC5B,GAAG,aAAa;oBAChB,MAAM,EAAE,YAAY;oBACpB,eAAe,EAAE,oBAAoB;iBACtC,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,gBAAgB;gBAChB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,MAAM,SAAS,GAAc;oBAC3B,GAAG,IAAI;oBACP,SAAS,EAAE,OAAO;oBAClB,OAAO,EAAE,KAAK;iBACf,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAEO,gBAAgB,CAAC,CAAe,EAAE,CAAe;QACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC;QAEpC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,WAAW,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEhC,OAAO,UAAU,GAAG,WAAW,CAAC;IAClC,CAAC;IAEO,SAAS,CACf,IAA6B,EAC7B,QAAiC;QAEjC,MAAM,MAAM,GAA4B,EAAE,GAAG,IAAI,EAAE,CAAC;QAEpD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAElC,IACE,OAAO,OAAO,KAAK,QAAQ;gBAC3B,OAAO,KAAK,IAAI;gBAChB,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;gBACvB,OAAO,WAAW,KAAK,QAAQ;gBAC/B,WAAW,KAAK,IAAI;gBACpB,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAC3B,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAC1B,OAAkC,EAClC,WAAsC,CACvC,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/packages/core/dist/maintenance/SubgraphArchiver.d.ts

@@ -1,18 +0,0 @@
-import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
-import type { ObjectStore } from '../storage/ObjectStore.js';
-export interface ArchivalConfig {
-    inactive_days: number;
-    dry_run: boolean;
-}
-export interface ArchivalResult {
-    archived_count: number;
-    archived_subgraph_ids: string[];
-}
-export declare class SubgraphArchiver {
-    private graph;
-    private objectStore;
-    constructor(graph: KnowledgeGraph, objectStore: ObjectStore);
-    archiveCold(config?: Partial<ArchivalConfig>): Promise<ArchivalResult>;
-    restore(entityId: string): Promise<boolean>;
-}
-//# sourceMappingURL=SubgraphArchiver.d.ts.map

package/packages/core/dist/maintenance/SubgraphArchiver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SubgraphArchiver.d.ts","sourceRoot":"","sources":["../../src/maintenance/SubgraphArchiver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAK7D,MAAM,WAAW,cAAc;IAC7B,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC7B,cAAc,EAAE,MAAM,CAAC;IACvB,qBAAqB,EAAE,MAAM,EAAE,CAAC;CACjC;AAcD,qBAAa,gBAAgB;IAEzB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,WAAW;gBADX,KAAK,EAAE,cAAc,EACrB,WAAW,EAAE,WAAW;IAG5B,WAAW,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC;IAyItE,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;CAkDlD"}

package/packages/core/dist/maintenance/SubgraphArchiver.js

@@ -1,180 +0,0 @@
-import { NodeType } from '../graph/GraphNode.js';
-const DEFAULT_CONFIG = {
-    inactive_days: 30,
-    dry_run: false,
-};
-export class SubgraphArchiver {
-    graph;
-    objectStore;
-    constructor(graph, objectStore) {
-        this.graph = graph;
-        this.objectStore = objectStore;
-    }
-    async archiveCold(config) {
-        const cfg = { ...DEFAULT_CONFIG, ...config };
-        const result = {
-            archived_count: 0,
-            archived_subgraph_ids: [],
-        };
-        const inactiveThresholdMs = cfg.inactive_days * 24 * 60 * 60 * 1000;
-        const now = Date.now();
-        // Find entity nodes not accessed in inactive_days
-        const allEdges = this.graph.getAllEdges();
-        const nodeIds = new Set();
-        for (const edge of allEdges) {
-            nodeIds.add(edge.from_node);
-            nodeIds.add(edge.to_node);
-        }
-        const entityNodes = [];
-        for (const id of nodeIds) {
-            const node = this.graph.getNode(id);
-            if (node &&
-                node.type === NodeType.ENTITY &&
-                now - node.last_seen >= inactiveThresholdMs) {
-                entityNodes.push(node);
-            }
-        }
-        for (const entity of entityNodes) {
-            // Get the subgraph rooted at this entity
-            let subgraph;
-            try {
-                subgraph = this.graph.getSubGraph(entity.id, 2);
-            }
-            catch {
-                // Entity may have been removed by a prior archival in this run
-                continue;
-            }
-            const nodes = [];
-            const edges = [];
-            // Collect nodes from the subgraph
-            // SubGraph stores nodes/edges internally; walk via the entity's edges
-            const subgraphEdges = this.graph.getEdgesByNode(entity.id, 'both');
-            const visitedNodes = new Set([entity.id]);
-            const nodeQueue = [entity.id];
-            // BFS to depth 2
-            let depth = 0;
-            while (nodeQueue.length > 0 && depth < 2) {
-                const levelSize = nodeQueue.length;
-                for (let i = 0; i < levelSize; i++) {
-                    const currentId = nodeQueue.shift();
-                    const currentEdges = this.graph.getEdgesByNode(currentId, 'both');
-                    for (const edge of currentEdges) {
-                        if (!edges.find((e) => e.id === edge.id)) {
-                            edges.push(edge);
-                        }
-                        const neighborId = edge.from_node === currentId ? edge.to_node : edge.from_node;
-                        if (!visitedNodes.has(neighborId)) {
-                            visitedNodes.add(neighborId);
-                            const neighborNode = this.graph.getNode(neighborId);
-                            if (neighborNode) {
-                                nodeQueue.push(neighborId);
-                            }
-                        }
-                    }
-                }
-                depth++;
-            }
-            // Gather all visited nodes
-            for (const nodeId of visitedNodes) {
-                const node = this.graph.getNode(nodeId);
-                if (node) {
-                    // Serialize embedding for JSON storage
-                    nodes.push({
-                        ...node,
-                        embedding: node.embedding
-                            ? new Float32Array(node.embedding)
-                            : null,
-                    });
-                }
-            }
-            const archive = {
-                entity_id: entity.id,
-                nodes,
-                edges,
-                archived_at: now,
-            };
-            // Serialize to JSON — convert Float32Array to regular arrays for storage
-            const serialized = JSON.stringify(archive, (_key, value) => {
-                if (value instanceof Float32Array) {
-                    return { __type: 'Float32Array', data: Array.from(value) };
-                }
-                return value;
-            });
-            if (!cfg.dry_run) {
-                // Store in object store
-                await this.objectStore.put(Buffer.from(serialized, 'utf-8'), {
-                    prefix: 'archived-subgraphs',
-                    extension: `.${entity.id}.json`,
-                });
-                // Remove nodes and edges from the live graph
-                for (const edge of edges) {
-                    try {
-                        this.graph.deleteEdge(edge.id);
-                    }
-                    catch {
-                        // Edge may already be deleted
-                    }
-                }
-                for (const node of nodes) {
-                    try {
-                        this.graph.deleteNode(node.id);
-                    }
-                    catch {
-                        // Node may already be deleted
-                    }
-                }
-            }
-            result.archived_count++;
-            result.archived_subgraph_ids.push(entity.id);
-        }
-        return result;
-    }
-    async restore(entityId) {
-        // Attempt to read the archived subgraph from the object store
-        // The reference uses a known prefix pattern
-        let data;
-        try {
-            // We need to find the archive by entity ID — scan known prefix
-            const ref = `archived-subgraphs/${entityId}`;
-            // The object store uses UUID-based names, so we stored with extension containing entity id
-            // Try reading with the entity-based key
-            const exists = await this.objectStore.exists(ref);
-            if (!exists) {
-                return false;
-            }
-            data = await this.objectStore.get(ref);
-        }
-        catch {
-            return false;
-        }
-        const archive = JSON.parse(data.toString('utf-8'), (_key, value) => {
-            if (value && typeof value === 'object' && value.__type === 'Float32Array') {
-                return new Float32Array(value.data);
-            }
-            return value;
-        });
-        // Re-insert nodes into the live graph
-        for (const node of archive.nodes) {
-            const existing = this.graph.getNode(node.id);
-            if (!existing) {
-                this.graph.addNode(node);
-            }
-        }
-        // Re-insert edges into the live graph
-        for (const edge of archive.edges) {
-            const existing = this.graph.getEdge(edge.id);
-            if (!existing) {
-                this.graph.addEdge(edge);
-            }
-        }
-        // Clean up the archived file
-        try {
-            await this.objectStore.delete(`archived-subgraphs/${entityId}`);
-        }
-        catch {
-            // Best effort cleanup
-        }
-        return true;
-    }
-}
-//# sourceMappingURL=SubgraphArchiver.js.map

package/packages/core/dist/maintenance/SubgraphArchiver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SubgraphArchiver.js","sourceRoot":"","sources":["../../src/maintenance/SubgraphArchiver.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAmBjD,MAAM,cAAc,GAAmB;IACrC,aAAa,EAAE,EAAE;IACjB,OAAO,EAAE,KAAK;CACf,CAAC;AAEF,MAAM,OAAO,gBAAgB;IAEjB;IACA;IAFV,YACU,KAAqB,EACrB,WAAwB;QADxB,UAAK,GAAL,KAAK,CAAgB;QACrB,gBAAW,GAAX,WAAW,CAAa;IAC/B,CAAC;IAEJ,KAAK,CAAC,WAAW,CAAC,MAAgC;QAChD,MAAM,GAAG,GAAmB,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;QAE7D,MAAM,MAAM,GAAmB;YAC7B,cAAc,EAAE,CAAC;YACjB,qBAAqB,EAAE,EAAE;SAC1B,CAAC;QAEF,MAAM,mBAAmB,GAAG,GAAG,CAAC,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QACpE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,kDAAkD;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACpC,IACE,IAAI;gBACJ,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM;gBAC7B,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,mBAAmB,EAC3C,CAAC;gBACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,yCAAyC;YACzC,IAAI,QAAQ,CAAC;YACb,IAAI,CAAC;gBACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,+DAA+D;gBAC/D,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAgB,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;YAE9B,kCAAkC;YAClC,sEAAsE;YACtE,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACnE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE9B,iBAAiB;YACjB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACzC,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;gBACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;oBACrC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;oBAElE,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;wBAChC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;4BACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACnB,CAAC;wBAED,MAAM,UAAU,GACd,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;wBAC/D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;4BAClC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;4BAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;4BACpD,IAAI,YAAY,EAAE,CAAC;gCACjB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;4BAC7B,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,KAAK,EAAE,CAAC;YACV,CAAC;YAED,2BAA2B;YAC3B,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACxC,IAAI,IAAI,EAAE,CAAC;oBACT,uCAAuC;oBACvC,KAAK,CAAC,IAAI,CAAC;wBACT,GAAG,IAAI;wBACP,SAAS,EAAE,IAAI,CAAC,SAAS;4BACvB,CAAC,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC;4BAClC,CAAC,CAAC,IAAI;qBACT,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,MAAM,OAAO,GAAqB;gBAChC,SAAS,EAAE,MAAM,CAAC,EAAE;gBACpB,KAAK;gBACL,KAAK;gBACL,WAAW,EAAE,GAAG;aACjB,CAAC;YAEF,yEAAyE;YACzE,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;gBACzD,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;oBAClC,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7D,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC,CAAC;YAEH,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;gBACjB,wBAAwB;gBACxB,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE;oBAC3D,MAAM,EAAE,oBAAoB;oBAC5B,SAAS,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO;iBAChC,CAAC,CAAC;gBAEH,6CAA6C;gBAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,CAAC;wBACH,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjC,CAAC;oBAAC,MAAM,CAAC;wBACP,8BAA8B;oBAChC,CAAC;gBACH,CAAC;gBACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,CAAC;wBACH,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjC,CAAC;oBAAC,MAAM,CAAC;wBACP,8BAA8B;oBAChC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,CAAC,cAAc,EAAE,CAAC;YACxB,MAAM,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,QAAgB;QAC5B,8DAA8D;QAC9D,4CAA4C;QAC5C,IAAI,IAAY,CAAC;QACjB,IAAI,CAAC;YACH,+DAA+D;YAC/D,MAAM,GAAG,GAAG,sBAAsB,QAAQ,EAAE,CAAC;YAC7C,2FAA2F;YAC3F,wCAAwC;YACxC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,OAAO,GAAqB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACnF,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;gBAC1E,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACtC,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,sCAAsC;QACtC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,sBAAsB,QAAQ,EAAE,CAAC,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACP,sBAAsB;QACxB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/packages/core/dist/memory/ArchivalMemory.d.ts

@@ -1,28 +0,0 @@
-/**
- * ArchivalMemory — Long-term compressed summaries for 0agent Phase 4.
- *
- * Stored in ObjectStore. Phase 4 stub: interface defined,
- * full ObjectStore integration deferred to Phase 5.
- */
-export interface ArchivalEntry {
-    id: string;
-    /** Period label, e.g. "2026-03-W12" */
-    period: string;
-    summary: string;
-    entity_ids: string[];
-    /** ObjectStore reference key */
-    object_ref: string;
-    created_at: number;
-}
-export declare class ArchivalMemory {
-    private entries;
-    /** Append an archival entry. */
-    add(entry: ArchivalEntry): void;
-    /** Find an entry by period label. */
-    getByPeriod(period: string): ArchivalEntry | undefined;
-    /** Get the N most recent entries. */
-    getRecent(n: number): ArchivalEntry[];
-    /** Total number of archival entries. */
-    get size(): number;
-}
-//# sourceMappingURL=ArchivalMemory.d.ts.map

package/packages/core/dist/memory/ArchivalMemory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ArchivalMemory.d.ts","sourceRoot":"","sources":["../../src/memory/ArchivalMemory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,uCAAuC;IACvC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,gCAAgC;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,cAAc;IACzB,OAAO,CAAC,OAAO,CAAuB;IAEtC,gCAAgC;IAChC,GAAG,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;IAI/B,qCAAqC;IACrC,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAItD,qCAAqC;IACrC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,EAAE;IAIrC,wCAAwC;IACxC,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF"}

package/packages/core/dist/memory/ArchivalMemory.js

@@ -1,26 +0,0 @@
-/**
- * ArchivalMemory — Long-term compressed summaries for 0agent Phase 4.
- *
- * Stored in ObjectStore. Phase 4 stub: interface defined,
- * full ObjectStore integration deferred to Phase 5.
- */
-export class ArchivalMemory {
-    entries = [];
-    /** Append an archival entry. */
-    add(entry) {
-        this.entries.push(entry);
-    }
-    /** Find an entry by period label. */
-    getByPeriod(period) {
-        return this.entries.find((e) => e.period === period);
-    }
-    /** Get the N most recent entries. */
-    getRecent(n) {
-        return this.entries.slice(-n);
-    }
-    /** Total number of archival entries. */
-    get size() {
-        return this.entries.length;
-    }
-}
-//# sourceMappingURL=ArchivalMemory.js.map

package/packages/core/dist/memory/ArchivalMemory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ArchivalMemory.js","sourceRoot":"","sources":["../../src/memory/ArchivalMemory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAaH,MAAM,OAAO,cAAc;IACjB,OAAO,GAAoB,EAAE,CAAC;IAEtC,gCAAgC;IAChC,GAAG,CAAC,KAAoB;QACtB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,qCAAqC;IACrC,WAAW,CAAC,MAAc;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACvD,CAAC;IAED,qCAAqC;IACrC,SAAS,CAAC,CAAS;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,wCAAwC;IACxC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;CACF"}