@steno-ai/engine 0.1.15 → 0.1.16

package/src/config.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"config.d.ts","sourceRoot":"","sources":["config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,eAAO,MAAM,SAAS,aAA2B,CAAC;AAMlD,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;EAK5B,CAAC;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAE5D,eAAO,MAAM,sBAAsB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAIjC,CAAC;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAEtE,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAE7B,CAAC;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAG9D,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAiB5B,CAAC;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAE5D,eAAO,MAAM,MAAM,+CAAgD,CAAC;AACpE,MAAM,MAAM,KAAK,GAAG,CAAC,OAAO,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;AAG5C,eAAO,MAAM,cAAc,oCAAqC,CAAC;AACjE,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D,eAAO,MAAM,UAAU,6CAA8C,CAAC;AACtE,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAEpD,eAAO,MAAM,sBAAsB,uDAAwD,CAAC;AAC5F,MAAM,MAAM,mBAAmB,GAAG,CAAC,OAAO,sBAAsB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1E,eAAO,MAAM,YAAY,+EAOf,CAAC;AACX,MAAM,MAAM,UAAU,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC;AAEvD,eAAO,MAAM,gBAAgB,kDAAmD,CAAC;AACjF,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE/D,eAAO,MAAM,qBAAqB,gEAA+C,CAAC;AAClF,MAAM,MAAM,kBAAkB,GAAG,CAAC,OAAO,qBAAqB,CAAC,CAAC,MAAM,CAAC,CAAC;AAExE,eAAO,MAAM,UAAU,yDAA0D,CAAC;AAClF,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnD,eAAO,MAAM,UAAU,kHASb,CAAC;AACX,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnD,eAAO,MAAM,mBAAmB,qEAMtB,CAAC;AACX,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEpE,eAAO,MAAM,WAAW,oFAQd,CAAC;AACX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;AAErD,eAAO,MAAM,KAAK,iDAAkD,CAAC;AACrE,MAAM,MAAM,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1C,eAAO,MAAM,cAAc,qCAAsC,CAAC;AAClE,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1D,eAAO,MAAM,cAAc,6GAMjB,CAAC;AACX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D,eAAO,MAAM,YAAY,6CAA8C,CAAC;AACxE,MAAM,MAAM,UAAU,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC"}

package/src/config.js

@@ -1,92 +0,0 @@
-import { z } from 'zod';
-// Shared Zod helpers
-export const unitFloat = z.number().min(0).max(1);
-// ---------------------------------------------------------------------------
-// Domain-scoped graph schemas — custom entity types with typed attributes
-// ---------------------------------------------------------------------------
-export const EntityFieldSchema = z.object({
-    name: z.string(),
-    type: z.enum(['string', 'number', 'boolean', 'date']),
-    description: z.string(),
-    required: z.boolean().default(false),
-});
-export const DomainEntityTypeSchema = z.object({
-    name: z.string(),
-    description: z.string(),
-    fields: z.array(EntityFieldSchema).default([]),
-});
-export const DomainSchemaSchema = z.object({
-    entityTypes: z.array(DomainEntityTypeSchema).default([]),
-});
-// Steno engine configuration schema
-export const StenoConfigSchema = z.object({
-    embeddingModel: z.string().default('text-embedding-3-small'),
-    embeddingDim: z.number().int().positive().default(1536),
-    decayHalfLifeDays: z.number().positive().default(30),
-    decayNormalizationK: z.number().positive().default(50),
-    maxFactsPerScope: z.number().int().positive().default(10000),
-    retrievalWeights: z
-        .object({
-        vector: z.number().min(0).max(1).default(0.35),
-        keyword: z.number().min(0).max(1).default(0.15),
-        graph: z.number().min(0).max(1).default(0.2),
-        recency: z.number().min(0).max(1).default(0.15),
-        salience: z.number().min(0).max(1).default(0.15),
-        temporal: z.number().min(0).max(1).default(0.20),
-    })
-        .default({}),
-    domainSchema: DomainSchemaSchema.optional(),
-});
-export const SCOPES = ['user', 'agent', 'session', 'hive'];
-// SESSION_SCOPES is a subset of SCOPES — sessions themselves cannot be scoped to another session
-export const SESSION_SCOPES = ['user', 'agent', 'hive'];
-export const OPERATIONS = ['create', 'update', 'invalidate'];
-export const CONTRADICTION_STATUSES = ['none', 'active', 'resolved', 'superseded'];
-export const SOURCE_TYPES = [
-    'conversation',
-    'document',
-    'url',
-    'raw_text',
-    'api',
-    'agent_self',
-];
-export const EXTRACTION_TIERS = ['heuristic', 'cheap_llm', 'smart_llm'];
-export const EXTRACTION_TIERS_USED = [...EXTRACTION_TIERS, 'multi_tier'];
-export const MODALITIES = ['text', 'image', 'audio', 'code', 'document'];
-export const EDGE_TYPES = [
-    'associative',
-    'causal',
-    'temporal',
-    'contradictory',
-    'hierarchical',
-    'updates', // new fact supersedes old one (knowledge chain)
-    'extends', // new fact adds detail to old one
-    'derives', // new fact is inferred from combining others
-];
-export const EXTRACTION_STATUSES = [
-    'queued',
-    'processing',
-    'completed',
-    'failed',
-    'deduped',
-];
-export const INPUT_TYPES = [
-    'conversation',
-    'document',
-    'url',
-    'raw_text',
-    'image',
-    'audio',
-    'code',
-];
-export const PLANS = ['free', 'pro', 'scale', 'enterprise'];
-export const API_KEY_SCOPES = ['read', 'write', 'admin'];
-export const FEEDBACK_TYPES = [
-    'implicit_positive',
-    'implicit_negative',
-    'explicit_positive',
-    'explicit_negative',
-    'correction',
-];
-export const ENTITY_ROLES = ['subject', 'object', 'mentioned'];
-//# sourceMappingURL=config.js.map

package/src/config.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"config.js","sourceRoot":"","sources":["config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,qBAAqB;AACrB,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAElD,8EAA8E;AAC9E,0EAA0E;AAC1E,8EAA8E;AAE9E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAChB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACrD,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;CACrC,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAChB,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;CAC/C,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;CACzD,CAAC,CAAC;AAGH,oCAAoC;AACpC,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,wBAAwB,CAAC;IAC5D,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IACvD,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IACpD,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IACtD,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;IAC5D,gBAAgB,EAAE,CAAC;SAChB,MAAM,CAAC;QACN,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC9C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC/C,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;QAC5C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC/C,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAChD,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;KACjD,CAAC;SACD,OAAO,CAAC,EAAE,CAAC;IACd,YAAY,EAAE,kBAAkB,CAAC,QAAQ,EAAE;CAC5C,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAU,CAAC;AAGpE,iGAAiG;AACjG,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,CAAU,CAAC;AAGjE,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAU,CAAC;AAGtE,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,CAAU,CAAC;AAG5F,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,cAAc;IACd,UAAU;IACV,KAAK;IACL,UAAU;IACV,KAAK;IACL,YAAY;CACJ,CAAC;AAGX,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAU,CAAC;AAGjF,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,GAAG,gBAAgB,EAAE,YAAY,CAAU,CAAC;AAGlF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,CAAU,CAAC;AAGlF,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,aAAa;IACb,QAAQ;IACR,UAAU;IACV,eAAe;IACf,cAAc;IACd,SAAS,EAAK,gDAAgD;IAC9D,SAAS,EAAK,kCAAkC;IAChD,SAAS,EAAK,6CAA6C;CACnD,CAAC;AAGX,MAAM,CAAC,MAAM,mBAAmB,GAAG;IACjC,QAAQ;IACR,YAAY;IACZ,WAAW;IACX,QAAQ;IACR,SAAS;CACD,CAAC;AAGX,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,cAAc;IACd,UAAU;IACV,KAAK;IACL,UAAU;IACV,OAAO;IACP,OAAO;IACP,MAAM;CACE,CAAC;AAGX,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,CAAU,CAAC;AAGrE,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAU,CAAC;AAGlE,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,mBAAmB;IACnB,mBAAmB;IACnB,mBAAmB;IACnB,mBAAmB;IACnB,YAAY;CACJ,CAAC;AAGX,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAS,EAAE,QAAQ,EAAE,WAAW,CAAU,CAAC"}

package/src/extraction/contradiction.d.ts

@@ -1,15 +0,0 @@
-import type { ExtractedFact } from './types.js';
-import type { ContradictionStatus } from '../config.js';
-export interface ContradictionResult {
-    fact: ExtractedFact;
-    contradictionStatus: ContradictionStatus;
-    contradictsId: string | null;
-}
-/**
- * Process extracted facts and annotate contradictions.
- * Facts with operation='contradict' get contradictionStatus='active'
- * and contradictsId set to the fact they contradict.
- * All other facts get contradictionStatus='none'.
- */
-export declare function processContradictions(facts: ExtractedFact[]): ContradictionResult[];
-//# sourceMappingURL=contradiction.d.ts.map

package/src/extraction/contradiction.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"contradiction.d.ts","sourceRoot":"","sources":["contradiction.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAExD,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,aAAa,CAAC;IACpB,mBAAmB,EAAE,mBAAmB,CAAC;IACzC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;CAC9B;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,aAAa,EAAE,GACrB,mBAAmB,EAAE,CAevB"}

package/src/extraction/contradiction.js

@@ -1,23 +0,0 @@
-/**
- * Process extracted facts and annotate contradictions.
- * Facts with operation='contradict' get contradictionStatus='active'
- * and contradictsId set to the fact they contradict.
- * All other facts get contradictionStatus='none'.
- */
-export function processContradictions(facts) {
-    return facts.map(fact => {
-        if (fact.operation === 'contradict' && fact.contradictsFactId) {
-            return {
-                fact,
-                contradictionStatus: 'active',
-                contradictsId: fact.contradictsFactId,
-            };
-        }
-        return {
-            fact,
-            contradictionStatus: 'none',
-            contradictsId: null,
-        };
-    });
-}
-//# sourceMappingURL=contradiction.js.map

package/src/extraction/contradiction.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"contradiction.js","sourceRoot":"","sources":["contradiction.ts"],"names":[],"mappings":"AASA;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAsB;IAEtB,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACtB,IAAI,IAAI,CAAC,SAAS,KAAK,YAAY,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC9D,OAAO;gBACL,IAAI;gBACJ,mBAAmB,EAAE,QAAiB;gBACtC,aAAa,EAAE,IAAI,CAAC,iBAAiB;aACtC,CAAC;QACJ,CAAC;QACD,OAAO;YACL,IAAI;YACJ,mBAAmB,EAAE,MAAe;YACpC,aAAa,EAAE,IAAI;SACpB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/src/extraction/cross-linker.d.ts

@@ -1,23 +0,0 @@
-/**
- * Cross-Fact Edge Linker — Intelligent Relationship Detection
- *
- * After extraction, finds existing facts that share entities with new facts
- * AND are semantically similar (not just any shared entity). Creates
- * 'relates_to' edges only when facts are actually about the same topic.
- *
- * Heuristics:
- * 1. Shared entity (required) — both facts mention the same entity
- * 2. Content similarity (required) — facts have overlapping keywords (>30% overlap)
- * 3. Temporal proximity (bonus) — facts created within 7 days get priority
- * 4. Skip generic entities — "user" entity is too broad to link on
- */
-import type { StorageAdapter } from '../adapters/storage.js';
-/**
- * Link newly created facts to existing related facts through shared entities.
- * Uses keyword overlap + temporal proximity to determine relevance.
- *
- * Only creates edges when facts are genuinely related — not just because
- * they both mention "Steno" or "user".
- */
-export declare function linkRelatedFacts(storage: StorageAdapter, tenantId: string, newFactIds: string[], entityIdMap: Map<string, string>): Promise<number>;
-//# sourceMappingURL=cross-linker.d.ts.map

package/src/extraction/cross-linker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cross-linker.d.ts","sourceRoot":"","sources":["cross-linker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAyD7D;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,cAAc,EACvB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,OAAO,CAAC,MAAM,CAAC,CAkFjB"}

package/src/extraction/cross-linker.js

@@ -1,146 +0,0 @@
-/**
- * Cross-Fact Edge Linker — Intelligent Relationship Detection
- *
- * After extraction, finds existing facts that share entities with new facts
- * AND are semantically similar (not just any shared entity). Creates
- * 'relates_to' edges only when facts are actually about the same topic.
- *
- * Heuristics:
- * 1. Shared entity (required) — both facts mention the same entity
- * 2. Content similarity (required) — facts have overlapping keywords (>30% overlap)
- * 3. Temporal proximity (bonus) — facts created within 7 days get priority
- * 4. Skip generic entities — "user" entity is too broad to link on
- */
-const GENERIC_ENTITIES = new Set(['user', 'assistant', 'navia', 'steno']);
-const MIN_KEYWORD_OVERLAP = 0.25; // 25% of keywords must overlap
-const MAX_LINKS_PER_FACT = 3; // Don't create too many edges per new fact
-const TEMPORAL_WINDOW_DAYS = 14; // Prefer facts within 2 weeks
-/**
- * Extract meaningful keywords from fact content for similarity comparison.
- * Strips stop words, lowercases, returns unique tokens.
- */
-function extractKeywords(content) {
-    const stopWords = 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', 'and', 'but', 'or',
-        'not', 'no', 'nor', 'so', 'yet', 'both', 'each', 'few', 'more',
-        'most', 'other', 'some', 'such', 'than', 'too', 'very', 'just',
-        'about', 'up', 'out', 'if', 'then', 'that', 'this', 'these', 'those',
-        'it', 'its', 'user', 'users', 'they', 'them', 'their', 'he', 'she',
-    ]);
-    return new Set(content.toLowerCase()
-        .replace(/[^a-z0-9\s-]/g, ' ')
-        .split(/\s+/)
-        .filter(w => w.length >= 3 && !stopWords.has(w)));
-}
-/**
- * Calculate keyword overlap ratio between two facts.
- * Returns 0-1 where 1 = identical keywords.
- */
-function keywordOverlap(a, b) {
-    if (a.size === 0 || b.size === 0)
-        return 0;
-    let shared = 0;
-    for (const word of a) {
-        if (b.has(word))
-            shared++;
-    }
-    const minSize = Math.min(a.size, b.size);
-    return shared / minSize;
-}
-/**
- * Check if two facts are temporally close (within TEMPORAL_WINDOW_DAYS).
- */
-function isTemporallyClose(a, b) {
-    const aDate = new Date(a.createdAt).getTime();
-    const bDate = new Date(b.createdAt).getTime();
-    const diffDays = Math.abs(aDate - bDate) / (1000 * 60 * 60 * 24);
-    return diffDays <= TEMPORAL_WINDOW_DAYS;
-}
-/**
- * Link newly created facts to existing related facts through shared entities.
- * Uses keyword overlap + temporal proximity to determine relevance.
- *
- * Only creates edges when facts are genuinely related — not just because
- * they both mention "Steno" or "user".
- */
-export async function linkRelatedFacts(storage, tenantId, newFactIds, entityIdMap) {
-    if (newFactIds.length === 0 || entityIdMap.size === 0)
-        return 0;
-    let edgesCreated = 0;
-    // Get the new facts' content for keyword extraction
-    const newFacts = await storage.getFactsByIds(tenantId, newFactIds);
-    if (newFacts.length === 0)
-        return 0;
-    const newFactKeywords = new Map();
-    for (const f of newFacts) {
-        newFactKeywords.set(f.id, extractKeywords(f.content));
-    }
-    // For each NON-GENERIC entity, find existing facts that also mention it
-    for (const [canonicalName, entityId] of entityIdMap) {
-        if (GENERIC_ENTITIES.has(canonicalName))
-            continue; // Skip "user", "navia", etc.
-        try {
-            const linkedFacts = await storage.getFactsForEntity(tenantId, entityId, { limit: 20 });
-            if (linkedFacts.data.length < 2)
-                continue;
-            const newFactSet = new Set(newFactIds);
-            const existingFacts = linkedFacts.data.filter(f => !newFactSet.has(f.id) &&
-                !f.tags?.includes('scratchpad') // Skip scratchpad blobs
-            );
-            for (const newFact of newFacts) {
-                const newKw = newFactKeywords.get(newFact.id);
-                if (!newKw || newKw.size < 2)
-                    continue; // Too short to compare
-                let linksForThisFact = 0;
-                for (const existingFact of existingFacts) {
-                    if (linksForThisFact >= MAX_LINKS_PER_FACT)
-                        break;
-                    const existingKw = extractKeywords(existingFact.content);
-                    const overlap = keywordOverlap(newKw, existingKw);
-                    // Must have meaningful keyword overlap
-                    if (overlap < MIN_KEYWORD_OVERLAP)
-                        continue;
-                    // Boost score for temporal proximity
-                    const temporalBoost = isTemporallyClose(newFact, existingFact) ? 0.1 : 0;
-                    const relevanceScore = overlap + temporalBoost;
-                    try {
-                        await storage.createEdge({
-                            id: crypto.randomUUID(),
-                            tenantId,
-                            sourceId: entityId,
-                            targetId: entityId,
-                            relation: 'relates_to',
-                            edgeType: 'associative',
-                            weight: Math.min(relevanceScore, 1.0),
-                            factId: newFact.id,
-                            confidence: overlap,
-                            metadata: {
-                                linkedFactId: existingFact.id,
-                                reason: 'shared_entity_and_content',
-                                entity: canonicalName,
-                                keywordOverlap: overlap.toFixed(2),
-                            },
-                        });
-                        edgesCreated++;
-                        linksForThisFact++;
-                    }
-                    catch {
-                        // Duplicate or constraint — skip
-                    }
-                }
-            }
-        }
-        catch {
-            // Entity lookup failed — continue
-        }
-    }
-    if (edgesCreated > 0) {
-        console.error(`[steno] Cross-linked ${edgesCreated} related facts via shared entities`);
-    }
-    return edgesCreated;
-}
-//# sourceMappingURL=cross-linker.js.map

package/src/extraction/cross-linker.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cross-linker.js","sourceRoot":"","sources":["cross-linker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;AAC1E,MAAM,mBAAmB,GAAG,IAAI,CAAC,CAAC,+BAA+B;AACjE,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAC,2CAA2C;AACzE,MAAM,oBAAoB,GAAG,EAAE,CAAC,CAAC,8BAA8B;AAE/D;;;GAGG;AACH,SAAS,eAAe,CAAC,OAAe;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACxB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;QACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;QACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;QACjE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ;QACnE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;QAClE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;QAC9D,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;QAC9D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;QACpE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;KACnE,CAAC,CAAC;IAEH,OAAO,IAAI,GAAG,CACZ,OAAO,CAAC,WAAW,EAAE;SAClB,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;SAC7B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACnD,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAc,EAAE,CAAc;IACpD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,OAAO,MAAM,GAAG,OAAO,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,CAAO,EAAE,CAAO;IACzC,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACjE,OAAO,QAAQ,IAAI,oBAAoB,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,OAAuB,EACvB,QAAgB,EAChB,UAAoB,EACpB,WAAgC;IAEhC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhE,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,oDAAoD;IACpD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACnE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,wEAAwE;IACxE,KAAK,MAAM,CAAC,aAAa,EAAE,QAAQ,CAAC,IAAI,WAAW,EAAE,CAAC;QACpD,IAAI,gBAAgB,CAAC,GAAG,CAAC,aAAa,CAAC;YAAE,SAAS,CAAC,6BAA6B;QAEhF,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YACvF,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAE1C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAChD,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,wBAAwB;aACzD,CAAC;YAEF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBAC9C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC;oBAAE,SAAS,CAAC,uBAAuB;gBAE/D,IAAI,gBAAgB,GAAG,CAAC,CAAC;gBAEzB,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;oBACzC,IAAI,gBAAgB,IAAI,kBAAkB;wBAAE,MAAM;oBAElD,MAAM,UAAU,GAAG,eAAe,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;oBACzD,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBAElD,uCAAuC;oBACvC,IAAI,OAAO,GAAG,mBAAmB;wBAAE,SAAS;oBAE5C,qCAAqC;oBACrC,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzE,MAAM,cAAc,GAAG,OAAO,GAAG,aAAa,CAAC;oBAE/C,IAAI,CAAC;wBACH,MAAM,OAAO,CAAC,UAAU,CAAC;4BACvB,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;4BACvB,QAAQ;4BACR,QAAQ,EAAE,QAAQ;4BAClB,QAAQ,EAAE,QAAQ;4BAClB,QAAQ,EAAE,YAAY;4BACtB,QAAQ,EAAE,aAAa;4BACvB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC;4BACrC,MAAM,EAAE,OAAO,CAAC,EAAE;4BAClB,UAAU,EAAE,OAAO;4BACnB,QAAQ,EAAE;gCACR,YAAY,EAAE,YAAY,CAAC,EAAE;gCAC7B,MAAM,EAAE,2BAA2B;gCACnC,MAAM,EAAE,aAAa;gCACrB,cAAc,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;6BACnC;yBACF,CAAC,CAAC;wBACH,YAAY,EAAE,CAAC;wBACf,gBAAgB,EAAE,CAAC;oBACrB,CAAC;oBAAC,MAAM,CAAC;wBACP,iCAAiC;oBACnC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,kCAAkC;QACpC,CAAC;IACH,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,KAAK,CAAC,wBAAwB,YAAY,oCAAoC,CAAC,CAAC;IAC1F,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/src/extraction/dedup.d.ts

@@ -1,12 +0,0 @@
-import type { EmbeddingAdapter } from '../adapters/embedding.js';
-import type { LLMAdapter } from '../adapters/llm.js';
-import type { StorageAdapter } from '../adapters/storage.js';
-import type { ExtractedFact } from './types.js';
-export interface DedupConfig {
-    storage: StorageAdapter;
-    embedding: EmbeddingAdapter;
-    llm: LLMAdapter;
-    similarityThreshold?: number;
-}
-export declare function deduplicateFacts(config: DedupConfig, facts: ExtractedFact[], tenantId: string, scope: string, scopeId: string): Promise<ExtractedFact[]>;
-//# sourceMappingURL=dedup.d.ts.map

package/src/extraction/dedup.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dedup.d.ts","sourceRoot":"","sources":["dedup.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,oBAAoB,CAAC;AACjE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,cAAc,CAAC;IACxB,SAAS,EAAE,gBAAgB,CAAC;IAC5B,GAAG,EAAE,UAAU,CAAC;IAChB,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,wBAAsB,gBAAgB,CACpC,MAAM,EAAE,WAAW,EACnB,KAAK,EAAE,aAAa,EAAE,EACtB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,aAAa,EAAE,CAAC,CA+C1B"}

package/src/extraction/dedup.js

@@ -1,93 +0,0 @@
-export async function deduplicateFacts(config, facts, tenantId, scope, scopeId) {
-    const threshold = config.similarityThreshold ?? 0.55;
-    const result = [];
-    for (const fact of facts) {
-        // If LLM already decided and it's not 'add', trust it
-        if (fact.operation && fact.operation !== 'add') {
-            result.push(fact);
-            continue;
-        }
-        // Embed the fact
-        const embedding = await config.embedding.embed(fact.content);
-        // Search for similar existing facts
-        const matches = await config.storage.vectorSearch({
-            embedding,
-            tenantId,
-            scope,
-            scopeId,
-            limit: 5,
-            minSimilarity: threshold,
-            validOnly: true,
-        });
-        if (matches.length === 0) {
-            // No similar facts — this is new
-            result.push({ ...fact, operation: 'add' });
-            continue;
-        }
-        // Similar facts found — ask LLM to classify
-        const decision = await classifyWithLLM(config.llm, fact.content, matches.map(m => ({
-            id: m.fact.id,
-            lineageId: m.fact.lineageId ?? '',
-            content: m.fact.content,
-            similarity: m.similarity,
-        })));
-        result.push({ ...fact, ...decision });
-    }
-    return result;
-}
-async function classifyWithLLM(llm, candidateContent, existingMatches) {
-    const messages = [
-        {
-            role: 'system',
-            content: `You are a memory deduplication classifier. Compare a NEW fact against EXISTING facts.
-
-RULES:
-- "noop" if the new fact says the SAME thing as an existing fact (even with different wording). Be AGGRESSIVE about noop — "User's name is Caroline" and "User is called Caroline" are NOOP.
-- "update" if the new fact adds detail or changes a value ("User likes cats" → "User loves cats and has 3")
-- "contradict" if the new fact directly conflicts ("User likes cats" vs "User hates cats")
-- "add" ONLY if genuinely new information not covered by ANY existing fact
-
-Return JSON:
-{"operation": "add|update|noop|contradict", "existing_lineage_id": "...", "contradicts_fact_id": "..."}
-
-Return ONLY valid JSON.`,
-        },
-        {
-            role: 'user',
-            content: `NEW FACT: "${candidateContent}"
-
-EXISTING FACTS:
-${existingMatches.map(m => `[id: ${m.id}, lineage_id: ${m.lineageId}, similarity: ${m.similarity.toFixed(3)}] ${m.content}`).join('\n')}
-
-Classify the new fact.`,
-        },
-    ];
-    try {
-        const response = await llm.complete(messages, { temperature: 0, responseFormat: 'json' });
-        const parsed = JSON.parse(response.content);
-        const operation = isValidDedupOp(parsed.operation) ? parsed.operation : 'add';
-        // Map dedup operations to relational versioning types
-        const relationType = operation === 'update' ? 'updates'
-            : operation === 'contradict' ? 'updates'
-                : undefined;
-        // Find the best matching existing fact for the relation
-        const relatedFactId = (operation === 'update' || operation === 'contradict') && existingMatches.length > 0
-            ? existingMatches[0].id
-            : undefined;
-        return {
-            operation,
-            existingLineageId: typeof parsed.existing_lineage_id === 'string' ? parsed.existing_lineage_id : undefined,
-            contradictsFactId: typeof parsed.contradicts_fact_id === 'string' ? parsed.contradicts_fact_id : undefined,
-            relationType,
-            relatedFactId,
-        };
-    }
-    catch {
-        // If LLM fails, default to 'add' (safe — might create a duplicate, but won't lose data)
-        return { operation: 'add' };
-    }
-}
-function isValidDedupOp(op) {
-    return typeof op === 'string' && ['add', 'update', 'noop', 'contradict', 'invalidate'].includes(op);
-}
-//# sourceMappingURL=dedup.js.map

package/src/extraction/dedup.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dedup.js","sourceRoot":"","sources":["dedup.ts"],"names":[],"mappings":"AAYA,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAmB,EACnB,KAAsB,EACtB,QAAgB,EAChB,KAAa,EACb,OAAe;IAEf,MAAM,SAAS,GAAG,MAAM,CAAC,mBAAmB,IAAI,IAAI,CAAC;IACrD,MAAM,MAAM,GAAoB,EAAE,CAAC;IAEnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sDAAsD;QACtD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QAED,iBAAiB;QACjB,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE7D,oCAAoC;QACpC,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC;YAChD,SAAS;YACT,QAAQ;YACR,KAAK;YACL,OAAO;YACP,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,SAAS;YACxB,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QAEH,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,iCAAiC;YACjC,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3C,SAAS;QACX,CAAC;QAED,4CAA4C;QAC5C,MAAM,QAAQ,GAAG,MAAM,eAAe,CACpC,MAAM,CAAC,GAAG,EACV,IAAI,CAAC,OAAO,EACZ,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChB,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;YACb,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE;YACjC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO;YACvB,UAAU,EAAE,CAAC,CAAC,UAAU;SACzB,CAAC,CAAC,CACJ,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,GAAe,EACf,gBAAwB,EACxB,eAA8F;IAE9F,MAAM,QAAQ,GAAiB;QAC7B;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;wBAWS;SACnB;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,cAAc,gBAAgB;;;EAG3C,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,SAAS,iBAAiB,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;uBAEhH;SAClB;KACF,CAAC;IAEF,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAA4B,CAAC;QAEvE,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QAE9E,sDAAsD;QACtD,MAAM,YAAY,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAkB;YAC9D,CAAC,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC,CAAC,SAAkB;gBACjD,CAAC,CAAC,SAAS,CAAC;QAEd,wDAAwD;QACxD,MAAM,aAAa,GAAG,CAAC,SAAS,KAAK,QAAQ,IAAI,SAAS,KAAK,YAAY,CAAC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC;YACxG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,EAAE;YACxB,CAAC,CAAC,SAAS,CAAC;QAEd,OAAO;YACL,SAAS;YACT,iBAAiB,EACf,OAAO,MAAM,CAAC,mBAAmB,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS;YACzF,iBAAiB,EACf,OAAO,MAAM,CAAC,mBAAmB,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS;YACzF,YAAY;YACZ,aAAa;SACd,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,wFAAwF;QACxF,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,EAAW;IACjC,OAAO,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACtG,CAAC"}

package/src/extraction/entity-extractor.d.ts

@@ -1,30 +0,0 @@
-import type { StorageAdapter } from '../adapters/storage.js';
-import type { EmbeddingAdapter } from '../adapters/embedding.js';
-import type { ExtractedEntity, ExtractedEdge } from './types.js';
-export interface EntityPersistenceResult {
-    entitiesCreated: number;
-    edgesCreated: number;
-    entityIdMap: Map<string, string>;
-}
-/**
- * Create or find all entities in the database.
- * Does NOT link entities to any fact or create edges.
- * Returns a map of canonicalName → entity.id for use in subsequent operations.
- */
-export declare function buildEntityIdMap(storage: StorageAdapter, embedding: EmbeddingAdapter, tenantId: string, entities: ExtractedEntity[]): Promise<{
-    entityIdMap: Map<string, string>;
-    entitiesCreated: number;
-}>;
-export declare function persistEdges(storage: StorageAdapter, tenantId: string, factId: string, edges: ExtractedEdge[], entityIdMap: Map<string, string>): Promise<number>;
-/**
- * Persist extracted entities and edges to the database.
- * - Creates new entities if canonical name doesn't exist for this tenant
- * - Reuses existing entities if canonical name matches
- * - Links all entities to the fact via fact_entities junction
- * - Creates edges between entities
- *
- * @deprecated Use buildEntityIdMap + persistEdges directly for better control.
- * This function is kept for backward compatibility.
- */
-export declare function persistEntitiesAndEdges(storage: StorageAdapter, embedding: EmbeddingAdapter, tenantId: string, factId: string, entities: ExtractedEntity[], edges: ExtractedEdge[]): Promise<EntityPersistenceResult>;
-//# sourceMappingURL=entity-extractor.d.ts.map

package/src/extraction/entity-extractor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"entity-extractor.d.ts","sourceRoot":"","sources":["entity-extractor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEjE,MAAM,WAAW,uBAAuB;IACtC,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED;;;;GAIG;AACH,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,cAAc,EACvB,SAAS,EAAE,gBAAgB,EAC3B,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,eAAe,EAAE,GAC1B,OAAO,CAAC;IAAE,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,CAAC,CAuCxE;AA8CD,wBAAsB,YAAY,CAChC,OAAO,EAAE,cAAc,EACvB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,aAAa,EAAE,EACtB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,OAAO,CAAC,MAAM,CAAC,CA6CjB;AAED;;;;;;;;;GASG;AACH,wBAAsB,uBAAuB,CAC3C,OAAO,EAAE,cAAc,EACvB,SAAS,EAAE,gBAAgB,EAC3B,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,eAAe,EAAE,EAC3B,KAAK,EAAE,aAAa,EAAE,GACrB,OAAO,CAAC,uBAAuB,CAAC,CAiBlC"}

package/src/extraction/entity-extractor.js

@@ -1,145 +0,0 @@
-/**
- * Create or find all entities in the database.
- * Does NOT link entities to any fact or create edges.
- * Returns a map of canonicalName → entity.id for use in subsequent operations.
- */
-export async function buildEntityIdMap(storage, embedding, tenantId, entities) {
-    const entityIdMap = new Map();
-    let entitiesCreated = 0;
-    // Deduplicate entities by canonical name within this batch
-    const uniqueEntities = new Map();
-    for (const entity of entities) {
-        if (!uniqueEntities.has(entity.canonicalName)) {
-            uniqueEntities.set(entity.canonicalName, entity);
-        }
-    }
-    // Create or find each entity
-    for (const entity of uniqueEntities.values()) {
-        const existing = await storage.findEntityByCanonicalName(tenantId, entity.canonicalName, entity.entityType);
-        if (existing) {
-            entityIdMap.set(entity.canonicalName, existing.id);
-        }
-        else {
-            const id = crypto.randomUUID();
-            const emb = await embedding.embed(entity.name);
-            await storage.createEntity({
-                ...entity,
-                id,
-                tenantId,
-                embedding: emb,
-                embeddingModel: embedding.model,
-                embeddingDim: embedding.dimensions,
-            });
-            entityIdMap.set(entity.canonicalName, id);
-            entitiesCreated++;
-        }
-    }
-    return { entityIdMap, entitiesCreated };
-}
-/**
- * Create edges between already-persisted entities.
- * Uses the entityIdMap built by buildEntityIdMap.
- */
-// Normalize relation names so "loves_deeply" and "loves" merge
-const RELATION_SYNONYMS = {
-    loves_deeply: 'loves',
-    has_relationship: 'partner_of',
-    has_relationship_with: 'partner_of',
-    dating: 'partner_of',
-    in_relationship_with: 'partner_of',
-    romantic_partner: 'partner_of',
-    girlfriend_of: 'partner_of',
-    boyfriend_of: 'partner_of',
-    married_to: 'partner_of',
-    works_for: 'works_at',
-    employed_at: 'works_at',
-    employed_by: 'works_at',
-    resides_in: 'lives_in',
-    located_at: 'located_in',
-    friends_with: 'friend_of',
-    acquainted_with: 'knows',
-    knows_about: 'knows',
-    interested_in: 'prefers',
-    attracted_to: 'prefers',
-    likes: 'prefers',
-    replaces: 'updates',
-    supersedes: 'updates',
-    overrides: 'updates',
-    corrects: 'updates',
-    supplements: 'extends',
-    refines: 'extends',
-    elaborates: 'extends',
-    details: 'extends',
-    infers: 'derives',
-    implies: 'derives',
-    combines: 'derives',
-};
-function normalizeRelation(relation) {
-    const lower = relation.toLowerCase().trim();
-    return RELATION_SYNONYMS[lower] ?? lower;
-}
-export async function persistEdges(storage, tenantId, factId, edges, entityIdMap) {
-    // Deduplicate edges by (source, target, normalized_relation) within this batch
-    const seen = new Set();
-    const dedupedEdges = [];
-    for (const edge of edges) {
-        const normalizedRelation = normalizeRelation(edge.relation);
-        const key = `${edge.sourceName}|${normalizedRelation}|${edge.targetName}`;
-        if (!seen.has(key)) {
-            seen.add(key);
-            dedupedEdges.push({ ...edge, relation: normalizedRelation });
-        }
-    }
-    let edgesCreated = 0;
-    for (const edge of dedupedEdges) {
-        const sourceId = entityIdMap.get(edge.sourceName);
-        const targetId = entityIdMap.get(edge.targetName);
-        if (sourceId && targetId) {
-            try {
-                await storage.createEdge({
-                    tenantId,
-                    sourceId,
-                    targetId,
-                    relation: edge.relation,
-                    edgeType: edge.edgeType,
-                    confidence: edge.confidence,
-                    weight: 1.0,
-                    metadata: {},
-                    factId,
-                    id: crypto.randomUUID(),
-                });
-                edgesCreated++;
-            }
-            catch {
-                // Edge creation failed (e.g., duplicate) — continue
-            }
-        }
-        if (!sourceId || !targetId) {
-            console.warn(`[steno] Edge dropped: "${edge.sourceName}" → "${edge.relation}" → "${edge.targetName}" ` +
-                `(source=${sourceId ? 'found' : 'MISSING'}, target=${targetId ? 'found' : 'MISSING'}) ` +
-                `entityMap keys: [${[...entityIdMap.keys()].join(', ')}]`);
-        }
-    }
-    return edgesCreated;
-}
-/**
- * Persist extracted entities and edges to the database.
- * - Creates new entities if canonical name doesn't exist for this tenant
- * - Reuses existing entities if canonical name matches
- * - Links all entities to the fact via fact_entities junction
- * - Creates edges between entities
- *
- * @deprecated Use buildEntityIdMap + persistEdges directly for better control.
- * This function is kept for backward compatibility.
- */
-export async function persistEntitiesAndEdges(storage, embedding, tenantId, factId, entities, edges) {
-    const { entityIdMap, entitiesCreated } = await buildEntityIdMap(storage, embedding, tenantId, entities);
-    // Link all entities to this fact
-    for (const [canonicalName, entityId] of entityIdMap) {
-        void canonicalName; // used as key only
-        await storage.linkFactEntity(factId, entityId, 'mentioned');
-    }
-    const edgesCreated = await persistEdges(storage, tenantId, factId, edges, entityIdMap);
-    return { entitiesCreated, edgesCreated, entityIdMap };
-}
-//# sourceMappingURL=entity-extractor.js.map