sxng-cli 1.0.9 → 1.1.0

package/dist/deep/iteration-data.js

@@ -0,0 +1,48 @@
+/**
+ * Unified interface for all deep search iteration data commands.
+ *
+ * Composes the individual data modules into a single analysis call:
+ * - checkQueryRedundancy
+ * - assessResultQuality
+ * - generateQuerySuggestions
+ * - analyzeRecoveryOptions
+ * - getStrategyInfo
+ *
+ * Agent can call getSessionAnalysis() to get a comprehensive snapshot
+ * of the session state for decision-making.
+ */
+import { assessResultQuality } from './quality-assess.js';
+import { generateQuerySuggestions } from './query-suggest.js';
+import { getStrategyInfo } from './search-strategy.js';
+import { analyzeRecoveryOptions } from './recovery-analysis.js';
+import { checkQueryRedundancy } from './query-redundancy.js';
+// ── Unified analysis ──────────────────────────────────────────────
+/** Get a comprehensive analysis of the current session state.
+ *  Combines quality assessment, strategy info, query suggestions,
+ *  and recovery analysis into a single output for Agent decision-making. */
+export function getSessionAnalysis(graph, sessionResults, options) {
+    // Quality assessment
+    const quality = assessResultQuality(sessionResults, sessionResults, graph, options?.qualityThresholds);
+    // Strategy info
+    const strategy = getStrategyInfo(graph, options?.strategyConfig);
+    // Query suggestions
+    const suggestions = generateQuerySuggestions(graph, sessionResults, strategy.currentStage, quality);
+    // Recovery analysis
+    const recovery = analyzeRecoveryOptions(graph, sessionResults, quality, options?.strategyConfig);
+    return { quality, strategy, suggestions, recovery };
+}
+/** Check a new query for redundancy before execution.
+ *  Standalone convenience function — also available via query-redundancy.ts. */
+export function checkNewQueryRedundancy(newQuery, graph, config) {
+    const history = [];
+    graph.forEachNode((_node, attrs) => {
+        if (attrs.type === 'query' && attrs.query) {
+            history.push(attrs.query);
+        }
+    });
+    return checkQueryRedundancy(newQuery, history, {
+        jaccardThreshold: config?.jaccardThreshold ?? 0.7,
+        action: config?.action ?? 'warn',
+    });
+}
+//# sourceMappingURL=iteration-data.js.map

package/dist/deep/iteration-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iteration-data.js","sourceRoot":"","sources":["../../src/deep/iteration-data.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAmC,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC3F,OAAO,EAAoC,wBAAwB,EAAE,MAAM,oBAAoB,CAAC;AAChG,OAAO,EAAgC,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACrF,OAAO,EAAoB,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAClF,OAAO,EAAsC,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAWjG,qEAAqE;AAErE;;4EAE4E;AAC5E,MAAM,UAAU,kBAAkB,CAC9B,KAAoD,EACpD,cAA+B,EAC/B,OAGC;IAED,qBAAqB;IACrB,MAAM,OAAO,GAAG,mBAAmB,CAC/B,cAAc,EACd,cAAc,EACd,KAAK,EACL,OAAO,EAAE,iBAAiB,CAC7B,CAAC;IAEF,gBAAgB;IAChB,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;IAEjE,oBAAoB;IACpB,MAAM,WAAW,GAAG,wBAAwB,CACxC,KAAK,EACL,cAAc,EACd,QAAQ,CAAC,YAAY,EACrB,OAAO,CACV,CAAC;IAEF,oBAAoB;IACpB,MAAM,QAAQ,GAAG,sBAAsB,CACnC,KAAK,EACL,cAAc,EACd,OAAO,EACP,OAAO,EAAE,cAAc,CAC1B,CAAC;IAEF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AACxD,CAAC;AAED;gFACgF;AAChF,MAAM,UAAU,uBAAuB,CACnC,QAAgB,EAChB,KAAoD,EACpD,MAAkC;IAElC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,CAAC,WAAW,CAAC,CAAC,KAAa,EAAE,KAAqB,EAAE,EAAE;QACvD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,oBAAoB,CAAC,QAAQ,EAAE,OAAO,EAAE;QAC3C,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,IAAI,GAAG;QACjD,MAAM,EAAE,MAAM,EAAE,MAAM,IAAI,MAAM;KACnC,CAAC,CAAC;AACP,CAAC"}

package/dist/deep/path-extraction.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Reasoning path extraction from knowledge graphs.
+ *
+ * Detects structured reasoning patterns:
+ * - composition_chain: e₁→(r₁)→e₂→(r₂)→e₃→... (sequential chain)
+ * - conjunction: e₁→e₃←e₂ (two seeds converging on a shared target)
+ *
+ * Creates path: nodes in the graph with ordered entity IDs.
+ */
+import { DirectedGraph } from 'graphology';
+import { GraphNodeAttrs, GraphEdgeAttrs } from './graph.js';
+export interface CompositionChain {
+    id: string;
+    entities: string[];
+    hops: number;
+    relations: string[];
+}
+export interface ConjunctionPath {
+    id: string;
+    seed1: string;
+    seed2: string;
+    bridge: string;
+    hops: number;
+}
+export interface PathExtractionResult {
+    compositionChains: CompositionChain[];
+    conjunctions: ConjunctionPath[];
+    totalPaths: number;
+}
+export interface PathExtractionConfig {
+    /** Min chain length (hops). Default: 2 */
+    minChainHops?: number;
+    /** Max chain length (hops). Default: 5 */
+    maxChainHops?: number;
+    /** Max BFS depth for conjunction search. Default: 3 */
+    maxConjunctionDepth?: number;
+    /** Deduplicate paths that share the same entity set. Default: true */
+    dedup?: boolean;
+}
+/**
+ * Detect composition chains: sequences of entity→entity edges forming a path.
+ * Walks the graph from each entity, following entity→entity edges up to maxHops.
+ * Avoids revisiting nodes (cycle detection).
+ */
+export declare function detectCompositionChains(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, config?: PathExtractionConfig): CompositionChain[];
+/**
+ * Detect conjunction patterns: e₁→e₃←e₂
+ * Two entities that both have edges pointing to a shared target entity.
+ */
+export declare function detectConjunctions(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, config?: PathExtractionConfig): ConjunctionPath[];
+/** Extract all reasoning paths from a graph. Creates path: nodes. */
+export declare function extractPaths(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, config?: PathExtractionConfig): PathExtractionResult;
+//# sourceMappingURL=path-extraction.d.ts.map

package/dist/deep/path-extraction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-extraction.d.ts","sourceRoot":"","sources":["../../src/deep/path-extraction.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAwB,MAAM,YAAY,CAAC;AAKlF,MAAM,WAAW,gBAAgB;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACjC,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,YAAY,EAAE,eAAe,EAAE,CAAC;IAChC,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACjC,0CAA0C;IAC1C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0CAA0C;IAC1C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,uDAAuD;IACvD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,sEAAsE;IACtE,KAAK,CAAC,EAAE,OAAO,CAAC;CACnB;AAID;;;;GAIG;AACH,wBAAgB,uBAAuB,CACnC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,MAAM,CAAC,EAAE,oBAAoB,GAC9B,gBAAgB,EAAE,CA0CpB;AA4ED;;;GAGG;AACH,wBAAgB,kBAAkB,CAC9B,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,MAAM,CAAC,EAAE,oBAAoB,GAC9B,eAAe,EAAE,CAkDnB;AA+BD,qEAAqE;AACrE,wBAAgB,YAAY,CACxB,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,MAAM,CAAC,EAAE,oBAAoB,GAC9B,oBAAoB,CA4CtB"}

package/dist/deep/path-extraction.js

@@ -0,0 +1,229 @@
+/**
+ * Reasoning path extraction from knowledge graphs.
+ *
+ * Detects structured reasoning patterns:
+ * - composition_chain: e₁→(r₁)→e₂→(r₂)→e₃→... (sequential chain)
+ * - conjunction: e₁→e₃←e₂ (two seeds converging on a shared target)
+ *
+ * Creates path: nodes in the graph with ordered entity IDs.
+ */
+import { nextPathId } from './graph.js';
+import { getEntityDegree } from './degree-utils.js';
+// ── Composition Chain Detection ───────────────────────────────────
+/**
+ * Detect composition chains: sequences of entity→entity edges forming a path.
+ * Walks the graph from each entity, following entity→entity edges up to maxHops.
+ * Avoids revisiting nodes (cycle detection).
+ */
+export function detectCompositionChains(graph, config) {
+    const minHops = config?.minChainHops ?? 2;
+    const maxHops = config?.maxChainHops ?? 5;
+    const dedup = config?.dedup ?? true;
+    const chains = [];
+    const seenEntitySets = new Set();
+    // Get all entity nodes
+    const entityNodes = [];
+    graph.forEachNode((node, attrs) => {
+        if (attrs.type === 'entity')
+            entityNodes.push(node);
+    });
+    // Sort by degree descending — start from high-degree hubs
+    entityNodes.sort((a, b) => getEntityDegree(graph, b) - getEntityDegree(graph, a));
+    for (const startNode of entityNodes) {
+        // DFS from startNode, following entity-to-entity edges
+        const paths = dfsEntityChains(graph, startNode, maxHops);
+        for (const path of paths) {
+            if (path.entities.length - 1 < minHops)
+                continue;
+            if (dedup) {
+                const key = path.entities.join('|');
+                const reverseKey = [...path.entities].reverse().join('|');
+                if (seenEntitySets.has(key) || seenEntitySets.has(reverseKey))
+                    continue;
+                seenEntitySets.add(key);
+            }
+            const id = nextPathId(graph, 'composition_chain');
+            chains.push({
+                id,
+                entities: path.entities,
+                hops: path.entities.length - 1,
+                relations: path.relations,
+            });
+        }
+    }
+    return chains;
+}
+/** DFS from a start entity, collecting all chains up to maxHops. */
+function dfsEntityChains(graph, start, maxHops) {
+    const results = [];
+    function dfs(current, path, relations, visited) {
+        if (path.length - 1 >= maxHops) {
+            if (path.length - 1 >= 2) {
+                results.push({ entities: [...path], relations: [...relations] });
+            }
+            return;
+        }
+        // Follow outgoing entity→entity edges
+        const outEdges = graph.outEdges(current);
+        let extended = false;
+        for (const edge of outEdges) {
+            const target = graph.target(edge);
+            if (visited.has(target))
+                continue;
+            if (graph.getNodeAttributes(target).type !== 'entity')
+                continue;
+            const attrs = graph.getEdgeAttributes(current, target);
+            visited.add(target);
+            path.push(target);
+            relations.push(attrs.relation);
+            dfs(target, path, relations, visited);
+            extended = true;
+            path.pop();
+            relations.pop();
+            visited.delete(target);
+        }
+        // Also follow incoming entity→entity edges
+        const inEdges = graph.inEdges(current);
+        for (const edge of inEdges) {
+            const source = graph.source(edge);
+            if (visited.has(source))
+                continue;
+            if (graph.getNodeAttributes(source).type !== 'entity')
+                continue;
+            const attrs = graph.getEdgeAttributes(source, current);
+            visited.add(source);
+            path.push(source);
+            relations.push(attrs.relation);
+            dfs(source, path, relations, visited);
+            extended = true;
+            path.pop();
+            relations.pop();
+            visited.delete(source);
+        }
+        // Record this path if it's long enough (even if not at maxHops)
+        if (!extended && path.length - 1 >= 2) {
+            results.push({ entities: [...path], relations: [...relations] });
+        }
+    }
+    dfs(start, [start], [], new Set([start]));
+    return results;
+}
+// ── Conjunction Detection ─────────────────────────────────────────
+/**
+ * Detect conjunction patterns: e₁→e₃←e₂
+ * Two entities that both have edges pointing to a shared target entity.
+ */
+export function detectConjunctions(graph, config) {
+    const maxDepth = config?.maxConjunctionDepth ?? 3;
+    const dedup = config?.dedup ?? true;
+    const conjunctions = [];
+    const seenPairs = new Set();
+    // Get all entity nodes
+    const entityNodes = [];
+    graph.forEachNode((node, attrs) => {
+        if (attrs.type === 'entity')
+            entityNodes.push(node);
+    });
+    // For each entity, find its targets within maxDepth
+    const reachability = new Map();
+    for (const entity of entityNodes) {
+        reachability.set(entity, bfsEntityReachable(graph, entity, maxDepth));
+    }
+    // Find pairs of entities that share a common target
+    for (let i = 0; i < entityNodes.length; i++) {
+        for (let j = i + 1; j < entityNodes.length; j++) {
+            const e1 = entityNodes[i];
+            const e2 = entityNodes[j];
+            const reach1 = reachability.get(e1);
+            const reach2 = reachability.get(e2);
+            // Find common reachable entities
+            for (const [target, d1] of reach1) {
+                const d2 = reach2.get(target);
+                if (d2 === undefined)
+                    continue;
+                if (target === e1 || target === e2)
+                    continue;
+                const pairKey = [e1, e2].sort().join('|') + '→' + target;
+                if (dedup && seenPairs.has(pairKey))
+                    continue;
+                seenPairs.add(pairKey);
+                const id = nextPathId(graph, 'conjunction');
+                conjunctions.push({
+                    id,
+                    seed1: e1,
+                    seed2: e2,
+                    bridge: target,
+                    hops: Math.max(d1, d2),
+                });
+            }
+        }
+    }
+    return conjunctions;
+}
+/** BFS from an entity, returning reachable entity nodes within maxDepth. */
+function bfsEntityReachable(graph, start, maxDepth) {
+    const dist = new Map();
+    const queue = [{ id: start, d: 0 }];
+    dist.set(start, 0);
+    while (queue.length > 0) {
+        const { id, d } = queue.shift();
+        if (d >= maxDepth)
+            continue;
+        // Follow both directions
+        graph.forEachNeighbor(id, (neighbor) => {
+            if (dist.has(neighbor))
+                return;
+            if (graph.getNodeAttributes(neighbor).type !== 'entity')
+                return;
+            dist.set(neighbor, d + 1);
+            queue.push({ id: neighbor, d: d + 1 });
+        });
+    }
+    dist.delete(start); // don't include self
+    return dist;
+}
+// ── Combined extraction ───────────────────────────────────────────
+/** Extract all reasoning paths from a graph. Creates path: nodes. */
+export function extractPaths(graph, config) {
+    const chains = detectCompositionChains(graph, config);
+    const conjunctions = detectConjunctions(graph, config);
+    // Create path: nodes in the graph
+    for (const chain of chains) {
+        graph.mergeNode(chain.id, {
+            type: 'path',
+            label: `Chain: ${chain.entities.map(e => graph.getNodeAttributes(e)?.label ?? e).join(' → ')}`,
+            pathType: 'composition_chain',
+            hops: chain.hops,
+            entities: chain.entities,
+        });
+        // Add includes edges from path to each entity
+        for (const entityId of chain.entities) {
+            if (graph.hasNode(entityId) && !graph.hasEdge(chain.id, entityId)) {
+                graph.addEdge(chain.id, entityId, { relation: 'includes', weight: 1 });
+            }
+        }
+    }
+    for (const conj of conjunctions) {
+        const e1Label = graph.getNodeAttributes(conj.seed1)?.label ?? conj.seed1;
+        const e2Label = graph.getNodeAttributes(conj.seed2)?.label ?? conj.seed2;
+        const bridgeLabel = graph.getNodeAttributes(conj.bridge)?.label ?? conj.bridge;
+        graph.mergeNode(conj.id, {
+            type: 'path',
+            label: `Conj: ${e1Label} + ${e2Label} → ${bridgeLabel}`,
+            pathType: 'conjunction',
+            hops: conj.hops,
+            entities: [conj.seed1, conj.seed2, conj.bridge],
+        });
+        for (const entityId of [conj.seed1, conj.seed2, conj.bridge]) {
+            if (graph.hasNode(entityId) && !graph.hasEdge(conj.id, entityId)) {
+                graph.addEdge(conj.id, entityId, { relation: 'includes', weight: 1 });
+            }
+        }
+    }
+    return {
+        compositionChains: chains,
+        conjunctions,
+        totalPaths: chains.length + conjunctions.length,
+    };
+}
+//# sourceMappingURL=path-extraction.js.map

package/dist/deep/path-extraction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-extraction.js","sourceRoot":"","sources":["../../src/deep/path-extraction.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAkC,UAAU,EAAY,MAAM,YAAY,CAAC;AAClF,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAoCpD,qEAAqE;AAErE;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACnC,KAAoD,EACpD,MAA6B;IAE7B,MAAM,OAAO,GAAG,MAAM,EAAE,YAAY,IAAI,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,MAAM,EAAE,YAAY,IAAI,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,IAAI,CAAC;IAEpC,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,uBAAuB;IACvB,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,0DAA0D;IAC1D,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAElF,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;QAClC,uDAAuD;QACvD,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAEzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO;gBAAE,SAAS;YAEjD,IAAI,KAAK,EAAE,CAAC;gBACR,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1D,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACxE,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;YAED,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC;gBACR,EAAE;gBACF,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAC9B,SAAS,EAAE,IAAI,CAAC,SAAS;aAC5B,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAOD,oEAAoE;AACpE,SAAS,eAAe,CACpB,KAAoD,EACpD,KAAa,EACb,OAAe;IAEf,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,SAAS,GAAG,CAAC,OAAe,EAAE,IAAc,EAAE,SAAmB,EAAE,OAAoB;QACnF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YACrE,CAAC;YACD,OAAO;QACX,CAAC;QAED,sCAAsC;QACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAEhE,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACvD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAE/B,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACtC,QAAQ,GAAG,IAAI,CAAC;YAEhB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QAED,2CAA2C;QAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAEhE,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACvD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAE/B,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACtC,QAAQ,GAAG,IAAI,CAAC;YAEhB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QAED,gEAAgE;QAChE,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;IACL,CAAC;IAED,GAAG,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC;AACnB,CAAC;AAED,qEAAqE;AAErE;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAAoD,EACpD,MAA6B;IAE7B,MAAM,QAAQ,GAAG,MAAM,EAAE,mBAAmB,IAAI,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,IAAI,CAAC;IAEpC,MAAM,YAAY,GAAsB,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,uBAAuB;IACvB,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,oDAAoD;IACpD,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC5D,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QAC/B,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,oDAAoD;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACrC,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAErC,iCAAiC;YACjC,KAAK,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;gBAChC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9B,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAS;gBAC/B,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE;oBAAE,SAAS;gBAE7C,MAAM,OAAO,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC;gBACzD,IAAI,KAAK,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBAC9C,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAEvB,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;gBAC5C,YAAY,CAAC,IAAI,CAAC;oBACd,EAAE;oBACF,KAAK,EAAE,EAAE;oBACT,KAAK,EAAE,EAAE;oBACT,MAAM,EAAE,MAAM;oBACd,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;iBACzB,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAED,4EAA4E;AAC5E,SAAS,kBAAkB,CACvB,KAAoD,EACpD,KAAa,EACb,QAAgB;IAEhB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACtE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACjC,IAAI,CAAC,IAAI,QAAQ;YAAE,SAAS;QAE5B,yBAAyB;QACzB,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;YAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAC/B,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO;YAChE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,qBAAqB;IACzC,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,qEAAqE;AAErE,qEAAqE;AACrE,MAAM,UAAU,YAAY,CACxB,KAAoD,EACpD,MAA6B;IAE7B,MAAM,MAAM,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACtD,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEvD,kCAAkC;IAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE;YACtB,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,UAAU,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YAC9F,QAAQ,EAAE,mBAAmB;YAC7B,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ;SAC3B,CAAC,CAAC;QACH,8CAA8C;QAC9C,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAChE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;QACL,CAAC;IACL,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QACzE,MAAM,OAAO,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QACzE,MAAM,WAAW,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;QAC/E,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE;YACrB,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,SAAS,OAAO,MAAM,OAAO,MAAM,WAAW,EAAE;YACvD,QAAQ,EAAE,aAAa;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;SAClD,CAAC,CAAC;QACH,KAAK,MAAM,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3D,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/D,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1E,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,iBAAiB,EAAE,MAAM;QACzB,YAAY;QACZ,UAAU,EAAE,MAAM,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM;KAClD,CAAC;AACN,CAAC"}

package/dist/deep/quality-assess.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Result quality assessment for deep search sessions.
+ *
+ * After each search round, compute quality indicators independently.
+ * Each indicator has its own threshold — no weighted sum.
+ *
+ * Verdict logic:
+ * - good:    all indicators pass
+ * - acceptable: ≤2 indicators fail
+ * - poor:    ≥3 indicators fail
+ *
+ * Novelty uses SimHash similarity < 0.7 as "not similar" threshold
+ * (paired with dedup threshold of 0.85).
+ */
+import { DirectedGraph } from 'graphology';
+import { SessionResult } from './session.js';
+import { GraphNodeAttrs, GraphEdgeAttrs } from './graph.js';
+export interface IndicatorResult {
+    value: number;
+    threshold: number;
+    pass: boolean;
+}
+export interface QualityBreakdown {
+    resultCount: IndicatorResult;
+    contentDepth: IndicatorResult;
+    entityRichness: IndicatorResult;
+    sourceDiversity: IndicatorResult;
+    novelty: IndicatorResult;
+}
+export interface QualityScore {
+    verdict: 'good' | 'acceptable' | 'poor';
+    breakdown: QualityBreakdown;
+    failedIndicators: string[];
+}
+export interface QualityThresholds {
+    resultCount: number;
+    contentDepth: number;
+    entityRichness: number;
+    sourceDiversity: number;
+    novelty: number;
+}
+/** Assess the quality of new search results against session context.
+ *  All indicators use independent thresholds — no weighted sum. */
+export declare function assessResultQuality(newResults: SessionResult[], sessionResults: SessionResult[], graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, thresholds?: Partial<QualityThresholds>): QualityScore;
+//# sourceMappingURL=quality-assess.d.ts.map

package/dist/deep/quality-assess.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality-assess.d.ts","sourceRoot":"","sources":["../../src/deep/quality-assess.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAI5D,MAAM,WAAW,eAAe;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,gBAAgB;IAC7B,WAAW,EAAE,eAAe,CAAC;IAC7B,YAAY,EAAE,eAAe,CAAC;IAC9B,cAAc,EAAE,eAAe,CAAC;IAChC,eAAe,EAAE,eAAe,CAAC;IACjC,OAAO,EAAE,eAAe,CAAC;CAC5B;AAED,MAAM,WAAW,YAAY;IACzB,OAAO,EAAE,MAAM,GAAG,YAAY,GAAG,MAAM,CAAC;IACxC,SAAS,EAAE,gBAAgB,CAAC;IAC5B,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,iBAAiB;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;CACnB;AAwGD;mEACmE;AACnE,wBAAgB,mBAAmB,CAC/B,UAAU,EAAE,aAAa,EAAE,EAC3B,cAAc,EAAE,aAAa,EAAE,EAC/B,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,UAAU,CAAC,EAAE,OAAO,CAAC,iBAAiB,CAAC,GACxC,YAAY,CAyBd"}

package/dist/deep/quality-assess.js

@@ -0,0 +1,125 @@
+/**
+ * Result quality assessment for deep search sessions.
+ *
+ * After each search round, compute quality indicators independently.
+ * Each indicator has its own threshold — no weighted sum.
+ *
+ * Verdict logic:
+ * - good:    all indicators pass
+ * - acceptable: ≤2 indicators fail
+ * - poor:    ≥3 indicators fail
+ *
+ * Novelty uses SimHash similarity < 0.7 as "not similar" threshold
+ * (paired with dedup threshold of 0.85).
+ */
+import { SimHash } from './simhash.js';
+const DEFAULT_THRESHOLDS = {
+    resultCount: 5,
+    contentDepth: 150,
+    entityRichness: 2,
+    sourceDiversity: 3,
+    novelty: 0.3,
+};
+// ── Indicator computations ────────────────────────────────────────
+/** Extract domain from URL */
+function extractDomain(url) {
+    try {
+        return new URL(url).hostname;
+    }
+    catch {
+        return '';
+    }
+}
+/** Compute result count indicator */
+function computeResultCount(newResults, threshold) {
+    const value = newResults.length;
+    return { value, threshold, pass: value >= threshold };
+}
+/** Compute content depth indicator — average content length of extracted results only */
+function computeContentDepth(newResults, threshold) {
+    const extracted = newResults.filter(r => r.content && r.content.length > 0);
+    if (extracted.length === 0) {
+        return { value: 0, threshold, pass: false };
+    }
+    const totalLength = extracted.reduce((sum, r) => sum + (r.content?.length ?? 0), 0);
+    const value = totalLength / extracted.length;
+    return { value, threshold, pass: value >= threshold };
+}
+/** Compute entity richness indicator — count of Agent-added entities in the graph */
+function computeEntityRichness(graph, threshold) {
+    let entityCount = 0;
+    graph.forEachNode((_node, attrs) => {
+        if (attrs.type === 'entity')
+            entityCount++;
+    });
+    return { value: entityCount, threshold, pass: entityCount >= threshold };
+}
+/** Compute source diversity indicator — number of distinct domains */
+function computeSourceDiversity(newResults, threshold) {
+    const domains = new Set();
+    for (const r of newResults) {
+        const domain = extractDomain(r.url);
+        if (domain)
+            domains.add(domain);
+    }
+    const value = domains.size;
+    return { value, threshold, pass: value >= threshold };
+}
+/** Compute novelty indicator — fraction of new results not similar to existing session results.
+ *  Uses SimHash similarity < 0.7 as "not similar" threshold.
+ *  Caches SimHash results for performance. */
+function computeNovelty(newResults, sessionResults, threshold) {
+    if (newResults.length === 0) {
+        return { value: 0, threshold, pass: false };
+    }
+    if (sessionResults.length === 0) {
+        // No prior results → everything is novel
+        return { value: 1, threshold, pass: true };
+    }
+    const simhash = new SimHash();
+    // Cache existing hashes to avoid recomputation
+    const existingHashes = sessionResults.map(r => simhash.hash(`${r.title} ${r.content || ''}`));
+    let novelCount = 0;
+    for (const r of newResults) {
+        const h = simhash.hash(`${r.title} ${r.content || ''}`);
+        let isSimilar = false;
+        for (const existing of existingHashes) {
+            if (simhash.similarity(h, existing) >= 0.7) {
+                isSimilar = true;
+                break;
+            }
+        }
+        if (!isSimilar)
+            novelCount++;
+    }
+    const value = novelCount / newResults.length;
+    return { value, threshold, pass: value >= threshold };
+}
+// ── Main assessment ───────────────────────────────────────────────
+/** Assess the quality of new search results against session context.
+ *  All indicators use independent thresholds — no weighted sum. */
+export function assessResultQuality(newResults, sessionResults, graph, thresholds) {
+    const t = { ...DEFAULT_THRESHOLDS, ...thresholds };
+    const breakdown = {
+        resultCount: computeResultCount(newResults, t.resultCount),
+        contentDepth: computeContentDepth(newResults, t.contentDepth),
+        entityRichness: computeEntityRichness(graph, t.entityRichness),
+        sourceDiversity: computeSourceDiversity(newResults, t.sourceDiversity),
+        novelty: computeNovelty(newResults, sessionResults, t.novelty),
+    };
+    const failedIndicators = Object.entries(breakdown)
+        .filter(([, v]) => !v.pass)
+        .map(([k]) => k);
+    let verdict;
+    if (failedIndicators.length === 0) {
+        verdict = 'good';
+    }
+    else if (failedIndicators.length <= 2) {
+        verdict = 'acceptable';
+    }
+    else {
+        verdict = 'poor';
+    }
+    return { verdict, breakdown, failedIndicators };
+}
+//# sourceMappingURL=quality-assess.js.map

package/dist/deep/quality-assess.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality-assess.js","sourceRoot":"","sources":["../../src/deep/quality-assess.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAkCvC,MAAM,kBAAkB,GAAsB;IAC1C,WAAW,EAAE,CAAC;IACd,YAAY,EAAE,GAAG;IACjB,cAAc,EAAE,CAAC;IACjB,eAAe,EAAE,CAAC;IAClB,OAAO,EAAE,GAAG;CACf,CAAC;AAEF,qEAAqE;AAErE,8BAA8B;AAC9B,SAAS,aAAa,CAAC,GAAW;IAC9B,IAAI,CAAC;QACD,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,EAAE,CAAC;IACd,CAAC;AACL,CAAC;AAED,qCAAqC;AACrC,SAAS,kBAAkB,CAAC,UAA2B,EAAE,SAAiB;IACtE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC;IAChC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;AAC1D,CAAC;AAED,yFAAyF;AACzF,SAAS,mBAAmB,CAAC,UAA2B,EAAE,SAAiB;IACvE,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAChD,CAAC;IACD,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpF,MAAM,KAAK,GAAG,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC;IAC7C,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;AAC1D,CAAC;AAED,qFAAqF;AACrF,SAAS,qBAAqB,CAC1B,KAAoD,EACpD,SAAiB;IAEjB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,CAAC,WAAW,CAAC,CAAC,KAAa,EAAE,KAAqB,EAAE,EAAE;QACvD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,WAAW,EAAE,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,IAAI,SAAS,EAAE,CAAC;AAC7E,CAAC;AAED,sEAAsE;AACtE,SAAS,sBAAsB,CAAC,UAA2B,EAAE,SAAiB;IAC1E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM;YAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC;IAC3B,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;AAC1D,CAAC;AAED;;8CAE8C;AAC9C,SAAS,cAAc,CACnB,UAA2B,EAC3B,cAA+B,EAC/B,SAAiB;IAEjB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAChD,CAAC;IAED,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,yCAAyC;QACzC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC/C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC;IAE9B,+CAA+C;IAC/C,MAAM,cAAc,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,CAChD,CAAC;IAEF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,CAAC;QACxD,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACpC,IAAI,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC;gBACzC,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACV,CAAC;QACL,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,UAAU,EAAE,CAAC;IACjC,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;IAC7C,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;AAC1D,CAAC;AAED,qEAAqE;AAErE;mEACmE;AACnE,MAAM,UAAU,mBAAmB,CAC/B,UAA2B,EAC3B,cAA+B,EAC/B,KAAoD,EACpD,UAAuC;IAEvC,MAAM,CAAC,GAAG,EAAE,GAAG,kBAAkB,EAAE,GAAG,UAAU,EAAE,CAAC;IAEnD,MAAM,SAAS,GAAqB;QAChC,WAAW,EAAE,kBAAkB,CAAC,UAAU,EAAE,CAAC,CAAC,WAAW,CAAC;QAC1D,YAAY,EAAE,mBAAmB,CAAC,UAAU,EAAE,CAAC,CAAC,YAAY,CAAC;QAC7D,cAAc,EAAE,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,cAAc,CAAC;QAC9D,eAAe,EAAE,sBAAsB,CAAC,UAAU,EAAE,CAAC,CAAC,eAAe,CAAC;QACtE,OAAO,EAAE,cAAc,CAAC,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,OAAO,CAAC;KACjE,CAAC;IAEF,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;SAC7C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAErB,IAAI,OAAgC,CAAC;IACrC,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,GAAG,MAAM,CAAC;IACrB,CAAC;SAAM,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtC,OAAO,GAAG,YAAY,CAAC;IAC3B,CAAC;SAAM,CAAC;QACJ,OAAO,GAAG,MAAM,CAAC;IACrB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC;AACpD,CAAC"}

package/dist/deep/query-redundancy.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Query redundancy detection via Jaccard similarity.
+ *
+ * Before executing a new query, compare it against all historical queries
+ * in the session. If similarity exceeds a threshold, take action:
+ * - warn: output warning, proceed with search
+ * - adjust: auto-remove overlapping terms, add differentiation
+ * - skip: skip redundant query entirely
+ *
+ * Short queries (≤3 words) use character-level bigram Jaccard to avoid
+ * low similarity from minor word differences. Longer queries use word-level Jaccard.
+ */
+export interface RedundancyConfig {
+    jaccardThreshold: number;
+    action: 'warn' | 'adjust' | 'skip';
+}
+export interface RedundancyResult {
+    isRedundant: boolean;
+    maxSimilarity: number;
+    similarQueries: Array<{
+        query: string;
+        similarity: number;
+    }>;
+    adjustedQuery?: string;
+    action: RedundancyConfig['action'];
+}
+/** Compute Jaccard similarity between two queries.
+ *  - ≤2 words: character-level bigram Jaccard (case-insensitive)
+ *  - >2 words: word-level Jaccard (case-insensitive) */
+export declare function computeJaccard(a: string, b: string): number;
+/** Adjust a redundant query by removing overlapping terms and adding differentiation.
+ *  Returns the adjusted query string, or the original if no adjustment is possible. */
+export declare function adjustQuery(newQuery: string, similarQueries: Array<{
+    query: string;
+    similarity: number;
+}>): string;
+/** Check a new query against session history for redundancy. */
+export declare function checkQueryRedundancy(newQuery: string, sessionHistory: string[], config: RedundancyConfig): RedundancyResult;
+//# sourceMappingURL=query-redundancy.d.ts.map

package/dist/deep/query-redundancy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-redundancy.d.ts","sourceRoot":"","sources":["../../src/deep/query-redundancy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,MAAM,WAAW,gBAAgB;IAC7B,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,MAAM,CAAC;CACtC;AAED,MAAM,WAAW,gBAAgB;IAC7B,WAAW,EAAE,OAAO,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC7D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,gBAAgB,CAAC,QAAQ,CAAC,CAAC;CACtC;AA6BD;;wDAEwD;AACxD,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAkB3D;AAID;uFACuF;AACvF,wBAAgB,WAAW,CACvB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,KAAK,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7D,MAAM,CAwBR;AAID,gEAAgE;AAChE,wBAAgB,oBAAoB,CAChC,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EAAE,EACxB,MAAM,EAAE,gBAAgB,GACzB,gBAAgB,CA4BlB"}