0agent 1.0.0

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

@@ -0,0 +1,101 @@
+export class WeightPropagation {
+    graph;
+    updater;
+    config;
+    constructor(graph, updater, config) {
+        this.graph = graph;
+        this.updater = updater;
+        this.config = {
+            learning_rate: config?.learning_rate ?? 0.1,
+            cross_graph_attenuation: config?.cross_graph_attenuation ?? 0.3,
+            enable_cross_graph: config?.enable_cross_graph ?? false,
+        };
+    }
+    /**
+     * MARGIN-BASED influence scoring.
+     * Prevents rich-get-richer premature convergence.
+     * NO selection_bonus multiplier.
+     *
+     * If there are no competing edges, influence is 1.0.
+     * Otherwise:
+     *   margin = edge.weight - max(competitor weights)
+     *   rawInfluence = max(0.1, margin / edge.weight)
+     *   minInfluence = 1 / (numCompetitors + 1)
+     *   influence = max(minInfluence, rawInfluence)
+     */
+    computeInfluence(edge, competing) {
+        if (competing.length === 0)
+            return 1.0;
+        const maxCompetitor = Math.max(...competing.map(e => e.weight));
+        const margin = edge.weight - maxCompetitor;
+        const rawInfluence = Math.max(0.1, margin / edge.weight);
+        const minInfluence = 1.0 / (competing.length + 1);
+        return Math.max(minInfluence, rawInfluence);
+    }
+    /**
+     * Adaptive step discount.
+     * Base MUST be 0.85, NOT 0.6.
+     * Sub-outcomes get halved (already learned from own signal).
+     *
+     * discount = 0.85 ^ step_index
+     * if has_sub_outcome: discount *= 0.5
+     */
+    computeDiscount(step) {
+        const baseDiscount = Math.pow(0.85, step.step_index);
+        if (step.has_sub_outcome)
+            return baseDiscount * 0.5;
+        return baseDiscount;
+    }
+    /**
+     * Credit = outcome_signal * influence * discount
+     */
+    computeCredit(outcomeSignal, influence, discount) {
+        return outcomeSignal * influence * discount;
+    }
+    /**
+     * Apply credit to weight: newWeight = clamp(currentWeight + credit * learning_rate, 0, 1)
+     */
+    applyCredit(currentWeight, credit) {
+        const newWeight = currentWeight + credit * this.config.learning_rate;
+        return Math.max(0.0, Math.min(1.0, newWeight));
+    }
+    /**
+     * Full propagation for a completed trace.
+     * For each step in the ledger:
+     * 1. Get the edge
+     * 2. Skip if locked
+     * 3. Get competing edges (siblings from same source node)
+     * 4. Compute influence, discount, credit
+     * 5. Apply credit to get new weight
+     * 6. Update via OCC updater
+     */
+    async propagate(steps, outcome) {
+        const results = [];
+        for (let i = 0; i < steps.length; i++) {
+            const step = steps[i];
+            const edge = this.graph.getEdge(step.edge_id);
+            if (!edge || edge.locked)
+                continue;
+            const siblingEdges = this.graph.getEdgesFrom(edge.from_node);
+            const competing = siblingEdges.filter(e => e.id !== edge.id);
+            const influence = this.computeInfluence(edge, competing);
+            const discount = this.computeDiscount(step);
+            const credit = this.computeCredit(outcome.value, influence, discount);
+            const newWeight = this.applyCredit(edge.weight, credit);
+            if (newWeight !== edge.weight) {
+                await this.updater.update(edge.id, edge.weight, newWeight, outcome.value > 0 ? 'outcome_positive' : 'outcome_negative', outcome.trace_id);
+            }
+            results.push({
+                edge_id: edge.id,
+                old_weight: edge.weight,
+                new_weight: newWeight,
+                delta: newWeight - edge.weight,
+                credit,
+                influence,
+                discount,
+            });
+        }
+        return results;
+    }
+}
+//# sourceMappingURL=WeightPropagation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"WeightPropagation.js","sourceRoot":"","sources":["../../src/engine/WeightPropagation.ts"],"names":[],"mappings":"AAkCA,MAAM,OAAO,iBAAiB;IAIlB;IACA;IAJF,MAAM,CAAoB;IAElC,YACU,KAAqB,EACrB,OAA0B,EAClC,MAAmC;QAF3B,UAAK,GAAL,KAAK,CAAgB;QACrB,YAAO,GAAP,OAAO,CAAmB;QAGlC,IAAI,CAAC,MAAM,GAAG;YACZ,aAAa,EAAE,MAAM,EAAE,aAAa,IAAI,GAAG;YAC3C,uBAAuB,EAAE,MAAM,EAAE,uBAAuB,IAAI,GAAG;YAC/D,kBAAkB,EAAE,MAAM,EAAE,kBAAkB,IAAI,KAAK;SACxD,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,gBAAgB,CAAC,IAAe,EAAE,SAAsB;QACtD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACvC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,IAAgB;QAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,eAAe;YAAE,OAAO,YAAY,GAAG,GAAG,CAAC;QACpD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,aAAqB,EAAE,SAAiB,EAAE,QAAgB;QACtE,OAAO,aAAa,GAAG,SAAS,GAAG,QAAQ,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,aAAqB,EAAE,MAAc;QAC/C,MAAM,SAAS,GAAG,aAAa,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QACrE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,SAAS,CACb,KAAmB,EACnB,OAAsB;QAEtB,MAAM,OAAO,GAAwB,EAAE,CAAC;QAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEnC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7D,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YAE7D,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACtE,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAExD,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CACvB,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,MAAM,EACX,SAAS,EACT,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,EAC3D,OAAO,CAAC,QAAQ,CACjB,CAAC;YACJ,CAAC;YAED,OAAO,CAAC,IAAI,CAAC;gBACX,OAAO,EAAE,IAAI,CAAC,EAAE;gBAChB,UAAU,EAAE,IAAI,CAAC,MAAM;gBACvB,UAAU,EAAE,SAAS;gBACrB,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC,MAAM;gBAC9B,MAAM;gBACN,SAAS;gBACT,QAAQ;aACT,CAAC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

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

@@ -0,0 +1,26 @@
+/**
+ * WorkflowSuggestionEngine — Recommends the next skill based on
+ * workflow graph weights.
+ *
+ * Traverses from a skill node to its outgoing edges targeting other
+ * skill nodes, returning the highest-weight successor or ranked options.
+ */
+import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
+export declare class WorkflowSuggestionEngine {
+    private graph;
+    constructor(graph: KnowledgeGraph);
+    /**
+     * Suggest the next skill to run based on the current graph state.
+     * Finds the skill node, gets outgoing edges to other skill nodes,
+     * returns the highest-weight successor.
+     */
+    suggest(lastSkillName: string): string | null;
+    /**
+     * Get all possible next skills with their weights, sorted descending.
+     */
+    getNextOptions(lastSkillName: string): Array<{
+        skill: string;
+        weight: number;
+    }>;
+}
+//# sourceMappingURL=WorkflowSuggestionEngine.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"WorkflowSuggestionEngine.d.ts","sourceRoot":"","sources":["../../src/engine/WorkflowSuggestionEngine.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE,qBAAa,wBAAwB;IACvB,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;;OAIG;IACH,OAAO,CAAC,aAAa,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAsB7C;;OAEG;IACH,cAAc,CAAC,aAAa,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAmBhF"}

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

@@ -0,0 +1,54 @@
+/**
+ * WorkflowSuggestionEngine — Recommends the next skill based on
+ * workflow graph weights.
+ *
+ * Traverses from a skill node to its outgoing edges targeting other
+ * skill nodes, returning the highest-weight successor or ranked options.
+ */
+export class WorkflowSuggestionEngine {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Suggest the next skill to run based on the current graph state.
+     * Finds the skill node, gets outgoing edges to other skill nodes,
+     * returns the highest-weight successor.
+     */
+    suggest(lastSkillName) {
+        const results = this.graph.queryStructural({ limit: 100 });
+        const skillNode = results.find((r) => r.node.label === lastSkillName && r.node.metadata?.is_skill);
+        if (!skillNode)
+            return null;
+        const edges = this.graph.getEdgesFrom(skillNode.node.id);
+        let bestLabel = null;
+        let bestWeight = -1;
+        for (const edge of edges) {
+            const target = this.graph.getNode(edge.to_node);
+            if (target?.metadata?.is_skill && edge.weight > bestWeight) {
+                bestWeight = edge.weight;
+                bestLabel = target.label;
+            }
+        }
+        return bestLabel;
+    }
+    /**
+     * Get all possible next skills with their weights, sorted descending.
+     */
+    getNextOptions(lastSkillName) {
+        const results = this.graph.queryStructural({ limit: 100 });
+        const skillNode = results.find((r) => r.node.label === lastSkillName && r.node.metadata?.is_skill);
+        if (!skillNode)
+            return [];
+        const edges = this.graph.getEdgesFrom(skillNode.node.id);
+        const options = [];
+        for (const edge of edges) {
+            const target = this.graph.getNode(edge.to_node);
+            if (target?.metadata?.is_skill) {
+                options.push({ skill: target.label, weight: edge.weight });
+            }
+        }
+        return options.sort((a, b) => b.weight - a.weight);
+    }
+}
+//# sourceMappingURL=WorkflowSuggestionEngine.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"WorkflowSuggestionEngine.js","sourceRoot":"","sources":["../../src/engine/WorkflowSuggestionEngine.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,OAAO,wBAAwB;IACf;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;;OAIG;IACH,OAAO,CAAC,aAAqB;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,aAAa,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CACnE,CAAC;QACF,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAE5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzD,IAAI,SAAS,GAAkB,IAAI,CAAC;QACpC,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,MAAM,EAAE,QAAQ,EAAE,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;gBAC3D,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;gBACzB,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,aAAqB;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,aAAa,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CACnE,CAAC;QACF,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,OAAO,GAA6C,EAAE,CAAC;QAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;CACF"}

package/packages/core/dist/entity/AliasIndex.d.ts

@@ -0,0 +1,39 @@
+import type { SQLiteAdapter, AliasRecord } from '../storage/adapters/SQLiteAdapter.js';
+export declare class AliasIndex {
+    private adapter;
+    constructor(adapter: SQLiteAdapter);
+    /**
+     * Register an alias for a node.
+     * Normalizes alias to lowercase.
+     */
+    add(alias: string, nodeId: string, confidence?: number): void;
+    /**
+     * Remove an alias.
+     */
+    remove(alias: string, nodeId: string): void;
+    /**
+     * Find nodes by exact alias match.
+     */
+    findExact(alias: string): AliasRecord[];
+    /**
+     * Get all aliases for a node.
+     */
+    getAliases(nodeId: string): AliasRecord[];
+    /**
+     * Generate common abbreviations for a label.
+     * "Acme Corp" -> ["acme corp", "acme", "ac"]
+     * "John Smith" -> ["john smith", "john", "js"]
+     */
+    generateAbbreviations(label: string): string[];
+    /**
+     * Register a node with its label and auto-generated abbreviations.
+     */
+    registerNode(nodeId: string, label: string): void;
+    /**
+     * Fuzzy scan: find aliases that contain the query string.
+     * Returns matches sorted by confidence desc.
+     */
+    fuzzyFind(query: string): AliasRecord[];
+    private normalize;
+}
+//# sourceMappingURL=AliasIndex.d.ts.map

package/packages/core/dist/entity/AliasIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AliasIndex.d.ts","sourceRoot":"","sources":["../../src/entity/AliasIndex.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,sCAAsC,CAAC;AAEvF,qBAAa,UAAU;IACT,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,aAAa;IAE1C;;;OAGG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAE,MAAY,GAAG,IAAI;IAIlE;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAI3C;;OAEG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE;IAIvC;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAIzC;;;;OAIG;IACH,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE;IAkB9C;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAOjD;;;OAGG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE;IAcvC,OAAO,CAAC,SAAS;CAGlB"}

package/packages/core/dist/entity/AliasIndex.js

@@ -0,0 +1,81 @@
+export class AliasIndex {
+    adapter;
+    constructor(adapter) {
+        this.adapter = adapter;
+    }
+    /**
+     * Register an alias for a node.
+     * Normalizes alias to lowercase.
+     */
+    add(alias, nodeId, confidence = 1.0) {
+        this.adapter.insertAlias(this.normalize(alias), nodeId, confidence);
+    }
+    /**
+     * Remove an alias.
+     */
+    remove(alias, nodeId) {
+        this.adapter.deleteAlias(this.normalize(alias), nodeId);
+    }
+    /**
+     * Find nodes by exact alias match.
+     */
+    findExact(alias) {
+        return this.adapter.findByAlias(this.normalize(alias));
+    }
+    /**
+     * Get all aliases for a node.
+     */
+    getAliases(nodeId) {
+        return this.adapter.getAliases(nodeId);
+    }
+    /**
+     * Generate common abbreviations for a label.
+     * "Acme Corp" -> ["acme corp", "acme", "ac"]
+     * "John Smith" -> ["john smith", "john", "js"]
+     */
+    generateAbbreviations(label) {
+        const normalized = this.normalize(label);
+        const words = normalized.split(/\s+/).filter(Boolean);
+        const results = [normalized];
+        if (words.length > 1) {
+            // First word only
+            results.push(words[0]);
+            // Initials
+            const initials = words.map((w) => w[0]).join('');
+            if (initials.length >= 2) {
+                results.push(initials);
+            }
+        }
+        return [...new Set(results)];
+    }
+    /**
+     * Register a node with its label and auto-generated abbreviations.
+     */
+    registerNode(nodeId, label) {
+        const abbreviations = this.generateAbbreviations(label);
+        for (const abbr of abbreviations) {
+            this.add(abbr, nodeId, abbr === this.normalize(label) ? 1.0 : 0.9);
+        }
+    }
+    /**
+     * Fuzzy scan: find aliases that contain the query string.
+     * Returns matches sorted by confidence desc.
+     */
+    fuzzyFind(query) {
+        // This does a full scan via SQL LIKE — fine for reasonable alias counts
+        const normalized = this.normalize(query);
+        // We'll use the adapter to get ALL aliases and filter.
+        // For Phase 1 this is acceptable; can be optimized with FTS later.
+        const allForQuery = this.adapter.findByAlias(normalized);
+        if (allForQuery.length > 0)
+            return allForQuery;
+        // No exact match — try prefix/contains via a scan
+        // This requires a new adapter method or manual scan
+        // For now, return empty — fuzzy matching will be done via embeddings in NodeResolutionService
+        return [];
+    }
+    normalize(s) {
+        return s.toLowerCase().trim();
+    }
+}
+//# sourceMappingURL=AliasIndex.js.map

package/packages/core/dist/entity/AliasIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AliasIndex.js","sourceRoot":"","sources":["../../src/entity/AliasIndex.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,UAAU;IACD;IAApB,YAAoB,OAAsB;QAAtB,YAAO,GAAP,OAAO,CAAe;IAAG,CAAC;IAE9C;;;OAGG;IACH,GAAG,CAAC,KAAa,EAAE,MAAc,EAAE,aAAqB,GAAG;QACzD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAa,EAAE,MAAc;QAClC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,KAAa;QACrB,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,KAAa;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtD,MAAM,OAAO,GAAa,CAAC,UAAU,CAAC,CAAC;QAEvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,kBAAkB;YAClB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,WAAW;YACX,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjD,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc,EAAE,KAAa;QACxC,MAAM,aAAa,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,KAAa;QACrB,wEAAwE;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACzC,uDAAuD;QACvD,mEAAmE;QACnE,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,WAAW,CAAC;QAE/C,kDAAkD;QAClD,oDAAoD;QACpD,8FAA8F;QAC9F,OAAO,EAAE,CAAC;IACZ,CAAC;IAEO,SAAS,CAAC,CAAS;QACzB,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAChC,CAAC;CACF"}

package/packages/core/dist/entity/ContextActivator.d.ts

@@ -0,0 +1,53 @@
+/**
+ * ContextActivator — 4-method context activation for 0agent Phase 4.
+ *
+ * Combines keyword matching, semantic similarity, entity-adjacent graph
+ * traversal, and recency boosting to surface the most relevant context
+ * nodes for the current input.
+ */
+import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
+import type { HNSWIndex } from '../embedding/HNSWIndex.js';
+import type { MultimodalEmbedder } from '../embedding/MultimodalEmbedder.js';
+export interface ActivationConfig {
+    keyword_weight: number;
+    semantic_weight: number;
+    adjacent_weight: number;
+    recency_weight: number;
+    top_k: number;
+}
+export interface ActivationScore {
+    node_id: string;
+    score: number;
+    reasons: Array<'keyword' | 'semantic' | 'adjacent' | 'recency'>;
+}
+export declare class ContextActivator {
+    private graph;
+    private embedder;
+    private hnswIndex;
+    private config;
+    constructor(graph: KnowledgeGraph, embedder: MultimodalEmbedder | null, hnswIndex: HNSWIndex | null, config?: Partial<ActivationConfig>);
+    /**
+     * Activate context by combining 4 scoring methods.
+     * Returns top_k node IDs ordered by score.
+     */
+    activate(entityIds: string[], input: string, recentNodeIds?: string[]): Promise<string[]>;
+    /**
+     * Method 1: Tokenize input, find nodes whose labels contain overlapping tokens.
+     */
+    private keywordMatch;
+    /**
+     * Method 2: HNSW search using input embedding.
+     */
+    private semanticMatch;
+    /**
+     * Method 3: 2-hop neighbors of resolved entity IDs.
+     * 1st hop gets full adjacent_weight, 2nd hop gets 0.5x.
+     */
+    private adjacentMatch;
+    /**
+     * Method 4: Boost recently accessed node IDs.
+     */
+    private recencyBoost;
+    private tokenize;
+}
+//# sourceMappingURL=ContextActivator.d.ts.map

package/packages/core/dist/entity/ContextActivator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextActivator.d.ts","sourceRoot":"","sources":["../../src/entity/ContextActivator.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC;AAI7E,MAAM,WAAW,gBAAgB;IAC/B,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,KAAK,CAAC,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC,CAAC;CACjE;AA8BD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,SAAS,CAAmB;IACpC,OAAO,CAAC,MAAM,CAAmB;gBAG/B,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,kBAAkB,GAAG,IAAI,EACnC,SAAS,EAAE,SAAS,GAAG,IAAI,EAC3B,MAAM,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC;IAQpC;;;OAGG;IACG,QAAQ,CACZ,SAAS,EAAE,MAAM,EAAE,EACnB,KAAK,EAAE,MAAM,EACb,aAAa,CAAC,EAAE,MAAM,EAAE,GACvB,OAAO,CAAC,MAAM,EAAE,CAAC;IA2CpB;;OAEG;IACH,OAAO,CAAC,YAAY;IAsBpB;;OAEG;YACW,aAAa;IAgB3B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAuCrB;;OAEG;IACH,OAAO,CAAC,YAAY;IAepB,OAAO,CAAC,QAAQ;CAMjB"}

package/packages/core/dist/entity/ContextActivator.js

@@ -0,0 +1,163 @@
+/**
+ * ContextActivator — 4-method context activation for 0agent Phase 4.
+ *
+ * Combines keyword matching, semantic similarity, entity-adjacent graph
+ * traversal, and recency boosting to surface the most relevant context
+ * nodes for the current input.
+ */
+const DEFAULT_CONFIG = {
+    keyword_weight: 1.0,
+    semantic_weight: 0.8,
+    adjacent_weight: 0.6,
+    recency_weight: 0.4,
+    top_k: 10,
+};
+// ─── Stop words for keyword matching ───────────────────────
+const STOP_WORDS = new Set([
+    'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'can', 'shall', 'to', 'of', 'in', 'for',
+    'on', 'with', 'at', 'by', 'from', 'as', 'into', 'through', 'during',
+    'before', 'after', 'above', 'below', 'between', 'out', 'off', 'over',
+    'under', 'again', 'further', 'then', 'once', 'and', 'but', 'or',
+    'nor', 'not', 'so', 'yet', 'both', 'either', 'neither', 'each',
+    'every', 'all', 'any', 'few', 'more', 'most', 'other', 'some',
+    'such', 'no', 'only', 'own', 'same', 'than', 'too', 'very',
+    'just', 'because', 'if', 'when', 'where', 'how', 'what', 'which',
+    'who', 'whom', 'this', 'that', 'these', 'those', 'i', 'me', 'my',
+    'we', 'our', 'you', 'your', 'he', 'him', 'his', 'she', 'her',
+    'it', 'its', 'they', 'them', 'their',
+]);
+// ─── Class ─────────────────────────────────────────────────
+export class ContextActivator {
+    graph;
+    embedder;
+    hnswIndex;
+    config;
+    constructor(graph, embedder, hnswIndex, config) {
+        this.graph = graph;
+        this.embedder = embedder;
+        this.hnswIndex = hnswIndex;
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Activate context by combining 4 scoring methods.
+     * Returns top_k node IDs ordered by score.
+     */
+    async activate(entityIds, input, recentNodeIds) {
+        const scoreMap = new Map();
+        const addScore = (nodeId, score, reason) => {
+            const existing = scoreMap.get(nodeId);
+            if (existing) {
+                existing.score += score;
+                if (!existing.reasons.includes(reason)) {
+                    existing.reasons.push(reason);
+                }
+            }
+            else {
+                scoreMap.set(nodeId, { node_id: nodeId, score, reasons: [reason] });
+            }
+        };
+        // ── Method 1: Keyword match (weight 1.0) ───────────────
+        this.keywordMatch(input, addScore);
+        // ── Method 2: Semantic similarity (weight 0.8) ─────────
+        await this.semanticMatch(input, addScore);
+        // ── Method 3: Entity-adjacent (weight 0.6) ─────────────
+        this.adjacentMatch(entityIds, addScore);
+        // ── Method 4: Recency boost (weight 0.4) ───────────────
+        if (recentNodeIds && recentNodeIds.length > 0) {
+            this.recencyBoost(recentNodeIds, addScore);
+        }
+        // Merge and return top_k
+        const sorted = Array.from(scoreMap.values())
+            .sort((a, b) => b.score - a.score)
+            .slice(0, this.config.top_k);
+        return sorted.map((s) => s.node_id);
+    }
+    // ─── Private scoring methods ─────────────────────────────
+    /**
+     * Method 1: Tokenize input, find nodes whose labels contain overlapping tokens.
+     */
+    keywordMatch(input, addScore) {
+        const tokens = this.tokenize(input);
+        if (tokens.length === 0)
+            return;
+        // Query a broad set of nodes to check label overlap
+        const candidates = this.graph.queryStructural({ limit: 200 });
+        for (const result of candidates) {
+            const labelTokens = this.tokenize(result.node.label);
+            const overlap = labelTokens.filter((t) => tokens.includes(t));
+            if (overlap.length > 0) {
+                const score = (overlap.length / Math.max(labelTokens.length, 1)) *
+                    this.config.keyword_weight;
+                addScore(result.node.id, score, 'keyword');
+            }
+        }
+    }
+    /**
+     * Method 2: HNSW search using input embedding.
+     */
+    async semanticMatch(input, addScore) {
+        if (!this.embedder?.isAvailable || !this.hnswIndex)
+            return;
+        const queryEmb = await this.embedder.embedText(input);
+        if (!queryEmb)
+            return;
+        const results = this.hnswIndex.search(queryEmb, this.config.top_k * 2);
+        for (const hit of results) {
+            const score = hit.similarity * this.config.semantic_weight;
+            addScore(hit.id, score, 'semantic');
+        }
+    }
+    /**
+     * Method 3: 2-hop neighbors of resolved entity IDs.
+     * 1st hop gets full adjacent_weight, 2nd hop gets 0.5x.
+     */
+    adjacentMatch(entityIds, addScore) {
+        const visited = new Set(entityIds);
+        // 1st hop
+        const firstHopIds = [];
+        for (const entityId of entityIds) {
+            const edges = this.graph.getEdgesByNode(entityId, 'both');
+            for (const edge of edges) {
+                const neighborId = edge.from_node === entityId ? edge.to_node : edge.from_node;
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    firstHopIds.push(neighborId);
+                    addScore(neighborId, this.config.adjacent_weight, 'adjacent');
+                }
+            }
+        }
+        // 2nd hop (0.5x weight)
+        for (const hopId of firstHopIds) {
+            const edges = this.graph.getEdgesByNode(hopId, 'both');
+            for (const edge of edges) {
+                const neighborId = edge.from_node === hopId ? edge.to_node : edge.from_node;
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    addScore(neighborId, this.config.adjacent_weight * 0.5, 'adjacent');
+                }
+            }
+        }
+    }
+    /**
+     * Method 4: Boost recently accessed node IDs.
+     */
+    recencyBoost(recentNodeIds, addScore) {
+        // More recent = higher boost; linear decay over the list
+        const total = recentNodeIds.length;
+        for (let i = 0; i < total; i++) {
+            const recencyFactor = (i + 1) / total; // newer items are at end
+            const score = recencyFactor * this.config.recency_weight;
+            addScore(recentNodeIds[i], score, 'recency');
+        }
+    }
+    // ─── Utility ─────────────────────────────────────────────
+    tokenize(text) {
+        return text
+            .toLowerCase()
+            .split(/\W+/)
+            .filter((t) => t.length >= 2 && !STOP_WORDS.has(t));
+    }
+}
+//# sourceMappingURL=ContextActivator.js.map

package/packages/core/dist/entity/ContextActivator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextActivator.js","sourceRoot":"","sources":["../../src/entity/ContextActivator.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAsBH,MAAM,cAAc,GAAqB;IACvC,cAAc,EAAE,GAAG;IACnB,eAAe,EAAE,GAAG;IACpB,eAAe,EAAE,GAAG;IACpB,cAAc,EAAE,GAAG;IACnB,KAAK,EAAE,EAAE;CACV,CAAC;AAEF,8DAA8D;AAE9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IACjE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ;IACnE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACpE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;IAC/D,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM;IAC9D,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM;IAC7D,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAC1D,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO;IAChE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;IAChE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IAC5D,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;CACrC,CAAC,CAAC;AAEH,8DAA8D;AAE9D,MAAM,OAAO,gBAAgB;IACnB,KAAK,CAAiB;IACtB,QAAQ,CAA4B;IACpC,SAAS,CAAmB;IAC5B,MAAM,CAAmB;IAEjC,YACE,KAAqB,EACrB,QAAmC,EACnC,SAA2B,EAC3B,MAAkC;QAElC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,QAAQ,CACZ,SAAmB,EACnB,KAAa,EACb,aAAwB;QAExB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAC;QAEpD,MAAM,QAAQ,GAAG,CACf,MAAc,EACd,KAAa,EACb,MAAuD,EACjD,EAAE;YACR,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC;gBACxB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;oBACvC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtE,CAAC;QACH,CAAC,CAAC;QAEF,0DAA0D;QAC1D,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAEnC,0DAA0D;QAC1D,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE1C,0DAA0D;QAC1D,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAExC,0DAA0D;QAC1D,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QAC7C,CAAC;QAED,yBAAyB;QACzB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE/B,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IAED,4DAA4D;IAE5D;;OAEG;IACK,YAAY,CAClB,KAAa,EACb,QAAgE;QAEhE,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEhC,oDAAoD;QACpD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAE9D,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrD,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GACT,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;gBAC7B,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CACzB,KAAa,EACb,QAAiE;QAEjE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO;QAE3D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACtD,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;YAC3D,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,aAAa,CACnB,SAAmB,EACnB,QAAiE;QAEjE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,SAAS,CAAC,CAAC;QAE3C,UAAU;QACV,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC1D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GACd,IAAI,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;gBAC9D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC7B,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACvD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GACd,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;gBAC3D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,QAAQ,CACN,UAAU,EACV,IAAI,CAAC,MAAM,CAAC,eAAe,GAAG,GAAG,EACjC,UAAU,CACX,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,aAAuB,EACvB,QAAgE;QAEhE,yDAAyD;QACzD,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,yBAAyB;YAChE,MAAM,KAAK,GAAG,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;YACzD,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,4DAA4D;IAEpD,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI;aACR,WAAW,EAAE;aACb,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACF"}

package/packages/core/dist/entity/EntityHierarchy.d.ts

@@ -0,0 +1,48 @@
+import { type GraphNode } from '../graph/GraphNode.js';
+import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
+export interface EntityContext {
+    entity: GraphNode;
+    personal_subgraph_ids: string[];
+    parent_entities: GraphNode[];
+    shared_subgraph_ids: string[];
+    merged_context: GraphNode[];
+}
+export interface VisibilityPolicy {
+    allow_work_context: boolean;
+    allow_signal_nodes: boolean;
+    allow_personality_profile: boolean;
+    allow_raw_conversations: boolean;
+}
+export declare const DEFAULT_VISIBILITY_POLICY: VisibilityPolicy;
+export declare class EntityHierarchy {
+    private graph;
+    private policy;
+    constructor(graph: KnowledgeGraph, policy?: VisibilityPolicy);
+    /**
+     * Get all parent entities for an entity (via MEMBER_OF edges, forward direction).
+     * Sarah is MEMBER_OF Acme Corp → Acme Corp is Sarah's parent.
+     */
+    getParents(entityId: string): GraphNode[];
+    /**
+     * Get all child entities (members) of an entity.
+     * Acme Corp has MEMBER_OF edges from employees → Acme Corp.
+     */
+    getMembers(entityId: string): GraphNode[];
+    /**
+     * Load full entity context for a session:
+     * - Person's own subgraph (private, full access)
+     * - Parent entities' subgraphs (company — filtered by policy)
+     */
+    loadEntityContext(entityId: string): EntityContext;
+    /**
+     * What nodes from a parent entity are visible to the child.
+     * Applies policy: strategy/plan/context nodes are shared; personality is not.
+     */
+    private isVisibleToChild;
+    /**
+     * Propagate a signal from a child entity UP to parent entities (attenuated).
+     * Called after an interaction completes. Company sees "Sarah worked on auth" but not the raw chat.
+     */
+    propagateSignalUp(childEntityId: string, signalLabel: string, signalData: string, attenuation?: number): void;
+}
+//# sourceMappingURL=EntityHierarchy.d.ts.map

package/packages/core/dist/entity/EntityHierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EntityHierarchy.d.ts","sourceRoot":"","sources":["../../src/entity/EntityHierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqC,KAAK,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAE1F,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,SAAS,CAAC;IAClB,qBAAqB,EAAE,MAAM,EAAE,CAAC;IAChC,eAAe,EAAE,SAAS,EAAE,CAAC;IAC7B,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,cAAc,EAAE,SAAS,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAE/B,kBAAkB,EAAE,OAAO,CAAC;IAC5B,kBAAkB,EAAE,OAAO,CAAC;IAC5B,yBAAyB,EAAE,OAAO,CAAC;IACnC,uBAAuB,EAAE,OAAO,CAAC;CAClC;AAED,eAAO,MAAM,yBAAyB,EAAE,gBAKvC,CAAC;AAEF,qBAAa,eAAe;IAExB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,MAAM;gBADN,KAAK,EAAE,cAAc,EACrB,MAAM,GAAE,gBAA4C;IAG9D;;;OAGG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE;IAUzC;;;OAGG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE;IASzC;;;;OAIG;IACH,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,aAAa;IAiClD;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAkBxB;;;OAGG;IACH,iBAAiB,CACf,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,MAAM,EAClB,WAAW,GAAE,MAAY,GACxB,IAAI;CAwCR"}