sxng-cli 1.0.8 → 1.1.0

package/dist/deep/graph-sampling.js

@@ -0,0 +1,409 @@
+/**
+ * Graph sampling strategies for knowledge graph exploration.
+ *
+ * Given a graph, seed entities, and a strategy, produces a sampled subgraph
+ * focused on the most relevant structures for reasoning.
+ *
+ * Strategies:
+ * - augmented_chain: sequential entity chain with attribute enrichment
+ * - dual_core_bridge: two seed entities converging on a shared target
+ * - community_core_path: high-degree hub → peripheral entities
+ * - deep_chain: depth-limited DFS (max 5-8 hops)
+ * - mixed: randomly pick one of the above
+ */
+import { getEntityDegree, filterEntitiesByDegree, adaptiveDegreeRange } from './degree-utils.js';
+// ── Helpers ───────────────────────────────────────────────────────
+/** Create a simple seeded PRNG (mulberry32). */
+function mulberry32(seed) {
+    let s = seed | 0;
+    return () => {
+        s = (s + 0x6D2B79F5) | 0;
+        let t = Math.imul(s ^ (s >>> 15), 1 | s);
+        t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+function toSampledEntity(graph, nodeId) {
+    const attrs = graph.getNodeAttributes(nodeId);
+    return {
+        id: nodeId,
+        label: attrs.label,
+        entityType: attrs.entityType,
+        score: attrs.score,
+        degree: getEntityDegree(graph, nodeId),
+    };
+}
+function collectEdge(graph, source, target) {
+    if (!graph.hasEdge(source, target))
+        return null;
+    const attrs = graph.getEdgeAttributes(source, target);
+    return { source, target, relation: attrs.relation, weight: attrs.weight };
+}
+function collectAllEdgesBetween(graph, nodeSet) {
+    const edges = [];
+    graph.forEachEdge((edge, attrs, source, target) => {
+        if (nodeSet.has(source) && nodeSet.has(target)) {
+            edges.push({ source, target, relation: attrs.relation, weight: attrs.weight });
+        }
+    });
+    return edges;
+}
+/** Filter entity neighbors by adaptive degree range.
+ *  Falls back to all entity neighbors if degree filtering removes everything
+ *  (common for very small graphs where adaptive range is too tight). */
+function degreeFilteredNeighbors(graph, nodeId, config) {
+    const range = adaptiveDegreeRange(graph, {
+        minDegree: config.degreeRange?.min,
+        maxDegreeCap: config.degreeRange?.max ?? config.degreeRange?.maxDegreeCap,
+    });
+    const filtered = [];
+    const allEntityNeighbors = [];
+    graph.forEachNeighbor(nodeId, (neighbor) => {
+        if (graph.getNodeAttributes(neighbor).type !== 'entity')
+            return;
+        allEntityNeighbors.push(neighbor);
+        const deg = getEntityDegree(graph, neighbor);
+        if (deg >= range.min && deg <= range.max) {
+            filtered.push(neighbor);
+        }
+    });
+    // Fallback: if degree range filtered everything out, use all entity neighbors
+    // This is common for very small graphs where the adaptive range is too tight
+    return filtered.length > 0 ? filtered : allEntityNeighbors;
+}
+/** Get unvisited entity neighbors, preferring degree-filtered ones but falling
+ *  back to all when the filtered set is empty or all-filtered are already visited. */
+function getNextEntityNeighbors(graph, nodeId, config, visited) {
+    const preferred = degreeFilteredNeighbors(graph, nodeId, config);
+    const unvisitedPreferred = preferred.filter(n => !visited.has(n));
+    if (unvisitedPreferred.length > 0)
+        return unvisitedPreferred;
+    // All preferred neighbors are visited — try all entity neighbors
+    const all = [];
+    graph.forEachNeighbor(nodeId, (neighbor) => {
+        if (graph.getNodeAttributes(neighbor).type !== 'entity' && !visited.has(neighbor))
+            return;
+        if (!visited.has(neighbor))
+            all.push(neighbor);
+    });
+    return all;
+}
+// ── augmented_chain ───────────────────────────────────────────────
+/**
+ * Walk a sequential chain from seed entity, picking the highest-degree
+ * neighbor at each hop. Enrich each node with degree and score.
+ * Good for multi-hop reasoning questions.
+ */
+function sampleAugmentedChain(graph, config) {
+    const visited = new Set();
+    const entityOrder = [];
+    const maxHops = config.maxHops;
+    let current = config.seedEntities[0];
+    if (!current || !graph.hasNode(current)) {
+        return { strategy: 'augmented_chain', entities: [], edges: [], hopsCovered: 0, metadata: { reason: 'no_valid_seed' } };
+    }
+    visited.add(current);
+    entityOrder.push(current);
+    let hops = 0;
+    while (hops < maxHops) {
+        const neighbors = getNextEntityNeighbors(graph, current, config, visited);
+        if (neighbors.length === 0)
+            break;
+        // Pick the highest-degree neighbor
+        neighbors.sort((a, b) => getEntityDegree(graph, b) - getEntityDegree(graph, a));
+        const next = neighbors[0];
+        visited.add(next);
+        entityOrder.push(next);
+        current = next;
+        hops++;
+    }
+    const nodeSet = new Set(entityOrder);
+    const edges = collectAllEdgesBetween(graph, nodeSet);
+    return {
+        strategy: 'augmented_chain',
+        entities: entityOrder.map(id => toSampledEntity(graph, id)),
+        edges,
+        hopsCovered: hops,
+        metadata: { chainLength: entityOrder.length },
+    };
+}
+// ── dual_core_bridge ──────────────────────────────────────────────
+/**
+ * Given two seed entities, find if they converge on a shared target entity.
+ * Good for comparative analysis (e.g., "tokio vs async-std").
+ */
+function sampleDualCoreBridge(graph, config) {
+    const seeds = config.seedEntities.slice(0, 2);
+    const validSeeds = seeds.filter(s => graph.hasNode(s));
+    if (validSeeds.length < 2) {
+        return { strategy: 'dual_core_bridge', entities: [], edges: [], hopsCovered: 0, metadata: { reason: 'need_two_seeds' } };
+    }
+    const [seed1, seed2] = validSeeds;
+    const maxHops = config.maxHops;
+    // BFS from each seed, collecting reachable entity nodes within maxHops
+    function bfsReachable(start) {
+        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 >= maxHops)
+                continue;
+            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 });
+            });
+        }
+        return dist;
+    }
+    const reach1 = bfsReachable(seed1);
+    const reach2 = bfsReachable(seed2);
+    // Find convergence nodes: entities reachable from both seeds
+    const convergenceNodes = [];
+    for (const [nodeId, d1] of reach1) {
+        const d2 = reach2.get(nodeId);
+        if (d2 !== undefined && nodeId !== seed1 && nodeId !== seed2) {
+            convergenceNodes.push({ id: nodeId, totalDist: d1 + d2, dist1: d1, dist2: d2 });
+        }
+    }
+    convergenceNodes.sort((a, b) => a.totalDist - b.totalDist);
+    if (convergenceNodes.length === 0) {
+        // No convergence: just return the two seeds with their direct neighbors
+        const nodeSet = new Set([seed1, seed2]);
+        const neighbors1 = degreeFilteredNeighbors(graph, seed1, config).slice(0, 3);
+        const neighbors2 = degreeFilteredNeighbors(graph, seed2, config).slice(0, 3);
+        for (const n of neighbors1)
+            nodeSet.add(n);
+        for (const n of neighbors2)
+            nodeSet.add(n);
+        return {
+            strategy: 'dual_core_bridge',
+            entities: Array.from(nodeSet).map(id => toSampledEntity(graph, id)),
+            edges: collectAllEdgesBetween(graph, nodeSet),
+            hopsCovered: 0,
+            metadata: { convergence: false, reason: 'no_shared_target' },
+        };
+    }
+    // Trace shortest paths from each seed to the best convergence node
+    const bridgeNode = convergenceNodes[0];
+    const allNodes = new Set([seed1, seed2, bridgeNode.id]);
+    // Trace path seed1 → bridge
+    const path1 = tracePath(graph, seed1, bridgeNode.id, bridgeNode.dist1);
+    const path2 = tracePath(graph, seed2, bridgeNode.id, bridgeNode.dist2);
+    for (const n of path1)
+        allNodes.add(n);
+    for (const n of path2)
+        allNodes.add(n);
+    const edges = collectAllEdgesBetween(graph, allNodes);
+    const maxDist = Math.max(bridgeNode.dist1, bridgeNode.dist2);
+    return {
+        strategy: 'dual_core_bridge',
+        entities: Array.from(allNodes).map(id => toSampledEntity(graph, id)),
+        edges,
+        hopsCovered: maxDist,
+        metadata: {
+            convergence: true,
+            bridgeEntity: bridgeNode.id,
+            bridgeLabel: graph.getNodeAttributes(bridgeNode.id).label,
+            distFromSeed1: bridgeNode.dist1,
+            distFromSeed2: bridgeNode.dist2,
+            totalConvergencePoints: convergenceNodes.length,
+        },
+    };
+}
+/** Trace a shortest path from start to target using BFS (entity-only). */
+function tracePath(graph, start, target, maxDepth) {
+    const prev = new Map();
+    const visited = new Set([start]);
+    const queue = [{ id: start, d: 0 }];
+    while (queue.length > 0) {
+        const { id, d } = queue.shift();
+        if (id === target)
+            break;
+        if (d >= maxDepth)
+            continue;
+        graph.forEachNeighbor(id, (neighbor) => {
+            if (visited.has(neighbor))
+                return;
+            if (graph.getNodeAttributes(neighbor).type !== 'entity')
+                return;
+            visited.add(neighbor);
+            prev.set(neighbor, id);
+            queue.push({ id: neighbor, d: d + 1 });
+        });
+    }
+    // Reconstruct path
+    const path = [];
+    let cur = target;
+    while (cur && cur !== start) {
+        path.push(cur);
+        cur = prev.get(cur);
+    }
+    return path;
+}
+// ── community_core_path ───────────────────────────────────────────
+/**
+ * High-degree hub entities at the center, paths radiating to peripheral entities.
+ * Useful for understanding the "backbone" of the knowledge graph.
+ */
+function sampleCommunityCorePath(graph, config) {
+    const range = adaptiveDegreeRange(graph, {
+        minDegree: config.degreeRange?.min,
+        maxDegreeCap: config.degreeRange?.max ?? config.degreeRange?.maxDegreeCap,
+    });
+    // Find hub entities within degree range
+    let allEntities = filterEntitiesByDegree(graph, {
+        minDegree: range.min,
+        maxDegreeCap: range.max,
+    });
+    // Fallback: if degree filtering removes everything, use all entities
+    if (allEntities.length === 0) {
+        const entities = [];
+        graph.forEachNode((node, attrs) => {
+            if (attrs.type === 'entity') {
+                entities.push({ id: node, degree: getEntityDegree(graph, node), label: attrs.label });
+            }
+        });
+        entities.sort((a, b) => b.degree - a.degree);
+        allEntities = entities;
+    }
+    if (allEntities.length === 0) {
+        return { strategy: 'community_core_path', entities: [], edges: [], hopsCovered: 0, metadata: { reason: 'no_entities' } };
+    }
+    // Top hub: highest-degree entity (or seed if provided)
+    let hubId = allEntities[0].id;
+    if (config.seedEntities.length > 0 && graph.hasNode(config.seedEntities[0])) {
+        hubId = config.seedEntities[0];
+    }
+    // Collect hub and its neighbors within maxHops
+    // Use degreeFilteredNeighbors with fallback for each step
+    const visited = new Set();
+    const nodeSet = new Set();
+    const queue = [{ id: hubId, d: 0 }];
+    visited.add(hubId);
+    while (queue.length > 0) {
+        const { id, d } = queue.shift();
+        if (d > config.maxHops)
+            continue;
+        const attrs = graph.getNodeAttributes(id);
+        if (attrs.type === 'entity')
+            nodeSet.add(id);
+        // Use getNextEntityNeighbors for consistent fallback behavior
+        const visitedSet = visited;
+        graph.forEachNeighbor(id, (neighbor) => {
+            if (visited.has(neighbor))
+                return;
+            if (graph.getNodeAttributes(neighbor).type !== 'entity')
+                return;
+            visited.add(neighbor);
+            queue.push({ id: neighbor, d: d + 1 });
+        });
+    }
+    const edges = collectAllEdgesBetween(graph, nodeSet);
+    return {
+        strategy: 'community_core_path',
+        entities: Array.from(nodeSet).map(id => toSampledEntity(graph, id)),
+        edges,
+        hopsCovered: Math.min(config.maxHops, ...Array.from(nodeSet).map(id => {
+            // BFS distance from hub
+            const visited2 = new Set();
+            const q = [{ n: hubId, d: 0 }];
+            visited2.add(hubId);
+            while (q.length > 0) {
+                const { n, d } = q.shift();
+                if (n === id)
+                    return d;
+                graph.forEachNeighbor(n, (nb) => {
+                    if (!visited2.has(nb) && nodeSet.has(nb)) {
+                        visited2.add(nb);
+                        q.push({ n: nb, d: d + 1 });
+                    }
+                });
+            }
+            return config.maxHops;
+        })),
+        metadata: {
+            hubEntity: hubId,
+            hubLabel: graph.getNodeAttributes(hubId).label,
+            hubDegree: getEntityDegree(graph, hubId),
+            totalEntities: allEntities.length,
+        },
+    };
+}
+// ── deep_chain ────────────────────────────────────────────────────
+/**
+ * Depth-limited DFS (max 5-8 hops), exploring the deepest reachable paths.
+ * Not NP-hard longest path — just a bounded DFS with cycle detection.
+ */
+function sampleDeepChain(graph, config) {
+    const start = config.seedEntities[0];
+    if (!start || !graph.hasNode(start)) {
+        return { strategy: 'deep_chain', entities: [], edges: [], hopsCovered: 0, metadata: { reason: 'no_valid_seed' } };
+    }
+    const maxHops = Math.min(config.maxHops, 8); // hard cap at 8
+    // DFS tracking the deepest path found
+    let bestPath = [start];
+    function dfs(current, path, visited) {
+        if (path.length > bestPath.length) {
+            bestPath = [...path];
+        }
+        if (path.length - 1 >= maxHops)
+            return;
+        const neighbors = getNextEntityNeighbors(graph, current, config, visited);
+        for (const next of neighbors) {
+            visited.add(next);
+            path.push(next);
+            dfs(next, path, visited);
+            path.pop();
+            visited.delete(next);
+        }
+    }
+    const visited = new Set([start]);
+    dfs(start, [start], visited);
+    const nodeSet = new Set(bestPath);
+    const edges = collectAllEdgesBetween(graph, nodeSet);
+    return {
+        strategy: 'deep_chain',
+        entities: bestPath.map(id => toSampledEntity(graph, id)),
+        edges,
+        hopsCovered: bestPath.length - 1,
+        metadata: { chainLength: bestPath.length },
+    };
+}
+// ── mixed ─────────────────────────────────────────────────────────
+/** Randomly pick one of the concrete strategies. */
+function sampleMixed(graph, config) {
+    const strategies = [
+        'augmented_chain',
+        'dual_core_bridge',
+        'community_core_path',
+        'deep_chain',
+    ];
+    const rng = mulberry32(config.rngSeed ?? 42);
+    const idx = Math.floor(rng() * strategies.length);
+    const chosen = strategies[idx];
+    return sampleGraph(graph, { ...config, strategy: chosen });
+}
+// ── Main dispatch ─────────────────────────────────────────────────
+/** Sample a knowledge graph using the specified strategy. */
+export function sampleGraph(graph, config) {
+    switch (config.strategy) {
+        case 'augmented_chain':
+            return sampleAugmentedChain(graph, config);
+        case 'dual_core_bridge':
+            return sampleDualCoreBridge(graph, config);
+        case 'community_core_path':
+            return sampleCommunityCorePath(graph, config);
+        case 'deep_chain':
+            return sampleDeepChain(graph, config);
+        case 'mixed':
+            return sampleMixed(graph, config);
+        default:
+            return { strategy: config.strategy, entities: [], edges: [], hopsCovered: 0, metadata: { reason: 'unknown_strategy' } };
+    }
+}
+//# sourceMappingURL=graph-sampling.js.map

package/dist/deep/graph-sampling.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-sampling.js","sourceRoot":"","sources":["../../src/deep/graph-sampling.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AA2CjG,qEAAqE;AAErE,gDAAgD;AAChD,SAAS,UAAU,CAAC,IAAY;IAC5B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,OAAO,GAAG,EAAE;QACR,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IACjD,CAAC,CAAC;AACN,CAAC;AAED,SAAS,eAAe,CACpB,KAAoD,EACpD,MAAc;IAEd,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC9C,OAAO;QACH,EAAE,EAAE,MAAM;QACV,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;KACzC,CAAC;AACN,CAAC;AAED,SAAS,WAAW,CAChB,KAAoD,EACpD,MAAc,EACd,MAAc;IAEd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAChD,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;AAC9E,CAAC;AAED,SAAS,sBAAsB,CAC3B,KAAoD,EACpD,OAAoB;IAEpB,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;QACtF,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACnF,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;wEAEwE;AACxE,SAAS,uBAAuB,CAC5B,KAAoD,EACpD,MAAc,EACd,MAAsB;IAEtB,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,EAAE;QACrC,SAAS,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG;QAClC,YAAY,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,YAAY;KAC5E,CAAC,CAAC;IACH,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,QAAgB,EAAE,EAAE;QAC/C,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAChE,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC7C,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC,CAAC,CAAC;IACH,8EAA8E;IAC9E,6EAA6E;IAC7E,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC;AAC/D,CAAC;AAED;sFACsF;AACtF,SAAS,sBAAsB,CAC3B,KAAoD,EACpD,MAAc,EACd,MAAsB,EACtB,OAAoB;IAEpB,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,kBAAkB,CAAC;IAE7D,iEAAiE;IACjE,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,QAAgB,EAAE,EAAE;QAC/C,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAC1F,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACf,CAAC;AAED,qEAAqE;AAErE;;;;GAIG;AACH,SAAS,oBAAoB,CACzB,KAAoD,EACpD,MAAsB;IAEtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAE/B,IAAI,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,eAAe,EAAE,EAAE,CAAC;IAC3H,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrB,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAE1B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,OAAO,EAAE,CAAC;QACpB,MAAM,SAAS,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAE1E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAElC,mCAAmC;QACnC,SAAS,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;QAChF,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,GAAG,IAAI,CAAC;QACf,IAAI,EAAE,CAAC;IACX,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAErD,OAAO;QACH,QAAQ,EAAE,iBAAiB;QAC3B,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC3D,KAAK;QACL,WAAW,EAAE,IAAI;QACjB,QAAQ,EAAE,EAAE,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE;KAChD,CAAC;AACN,CAAC;AAED,qEAAqE;AAErE;;;GAGG;AACH,SAAS,oBAAoB,CACzB,KAAoD,EACpD,MAAsB;IAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,EAAE,CAAC;IAC7H,CAAC;IAED,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC;IAClC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAE/B,uEAAuE;IACvE,SAAS,YAAY,CAAC,KAAa;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACjC,IAAI,CAAC,IAAI,OAAO;gBAAE,SAAS;YAC3B,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;gBAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,OAAO;gBAC/B,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ;oBAAE,OAAO;gBAChE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;QACP,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAEnC,6DAA6D;IAC7D,MAAM,gBAAgB,GAA2E,EAAE,CAAC;IACpG,KAAK,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YAC3D,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACpF,CAAC;IACL,CAAC;IACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IAE3D,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,wEAAwE;QACxE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7E,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7E,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE3C,OAAO;YACH,QAAQ,EAAE,kBAAkB;YAC5B,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACnE,KAAK,EAAE,sBAAsB,CAAC,KAAK,EAAE,OAAO,CAAC;YAC7C,WAAW,EAAE,CAAC;YACd,QAAQ,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE;SAC/D,CAAC;IACN,CAAC;IAED,mEAAmE;IACnE,MAAM,UAAU,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,4BAA4B;IAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvC,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACtD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IAE7D,OAAO;QACH,QAAQ,EAAE,kBAAkB;QAC5B,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACpE,KAAK;QACL,WAAW,EAAE,OAAO;QACpB,QAAQ,EAAE;YACN,WAAW,EAAE,IAAI;YACjB,YAAY,EAAE,UAAU,CAAC,EAAE;YAC3B,WAAW,EAAE,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,KAAK;YACzD,aAAa,EAAE,UAAU,CAAC,KAAK;YAC/B,aAAa,EAAE,UAAU,CAAC,KAAK;YAC/B,sBAAsB,EAAE,gBAAgB,CAAC,MAAM;SAClD;KACJ,CAAC;AACN,CAAC;AAED,0EAA0E;AAC1E,SAAS,SAAS,CACd,KAAoD,EACpD,KAAa,EACb,MAAc,EACd,QAAgB;IAEhB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAEtE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACjC,IAAI,EAAE,KAAK,MAAM;YAAE,MAAM;QACzB,IAAI,CAAC,IAAI,QAAQ;YAAE,SAAS;QAE5B,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;YAC3C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO;YAChE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC;IAED,mBAAmB;IACnB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,OAAO,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;IACzB,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,qEAAqE;AAErE;;;GAGG;AACH,SAAS,uBAAuB,CAC5B,KAAoD,EACpD,MAAsB;IAEtB,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,EAAE;QACrC,SAAS,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG;QAClC,YAAY,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,YAAY;KAC5E,CAAC,CAAC;IAEH,wCAAwC;IACxC,IAAI,WAAW,GAAG,sBAAsB,CAAC,KAAK,EAAE;QAC5C,SAAS,EAAE,KAAK,CAAC,GAAG;QACpB,YAAY,EAAE,KAAK,CAAC,GAAG;KAC1B,CAAC,CAAC;IAEH,qEAAqE;IACrE,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAyD,EAAE,CAAC;QAC1E,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;YACtD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1F,CAAC;QACL,CAAC,CAAC,CAAC;QACH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7C,WAAW,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;IAC7H,CAAC;IAED,uDAAuD;IACvD,IAAI,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9B,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,+CAA+C;IAC/C,0DAA0D;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACtE,OAAO,CAAC,GAAG,CAAC,KAAK,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,GAAG,MAAM,CAAC,OAAO;YAAE,SAAS;QACjC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAE7C,8DAA8D;QAC9D,MAAM,UAAU,GAAG,OAAsB,CAAC;QAC1C,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;YAC3C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO;YAChE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC;IAED,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAErD,OAAO;QACH,QAAQ,EAAE,qBAAqB;QAC/B,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACnE,KAAK;QACL,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAClE,wBAAwB;YACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YACnC,MAAM,CAAC,GAAoC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAChE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpB,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAG,CAAC;gBAC5B,IAAI,CAAC,KAAK,EAAE;oBAAE,OAAO,CAAC,CAAC;gBACvB,KAAK,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAU,EAAE,EAAE;oBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;wBACvC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACjB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAChC,CAAC;gBACL,CAAC,CAAC,CAAC;YACP,CAAC;YACD,OAAO,MAAM,CAAC,OAAO,CAAC;QAC1B,CAAC,CAAC,CAAC;QACH,QAAQ,EAAE;YACN,SAAS,EAAE,KAAK;YAChB,QAAQ,EAAE,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,KAAK;YAC9C,SAAS,EAAE,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;YACxC,aAAa,EAAE,WAAW,CAAC,MAAM;SACpC;KACJ,CAAC;AACN,CAAC;AAED,qEAAqE;AAErE;;;GAGG;AACH,SAAS,eAAe,CACpB,KAAoD,EACpD,MAAsB;IAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,eAAe,EAAE,EAAE,CAAC;IACtH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;IAE7D,sCAAsC;IACtC,IAAI,QAAQ,GAAa,CAAC,KAAK,CAAC,CAAC;IAEjC,SAAS,GAAG,CAAC,OAAe,EAAE,IAAc,EAAE,OAAoB;QAC9D,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAChC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO;YAAE,OAAO;QAEvC,MAAM,SAAS,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAE1E,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACzB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,GAAG,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;IAE7B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAErD,OAAO;QACH,QAAQ,EAAE,YAAY;QACtB,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACxD,KAAK;QACL,WAAW,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC;QAChC,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,CAAC,MAAM,EAAE;KAC7C,CAAC;AACN,CAAC;AAED,qEAAqE;AAErE,oDAAoD;AACpD,SAAS,WAAW,CAChB,KAAoD,EACpD,MAAsB;IAEtB,MAAM,UAAU,GAAuB;QACnC,iBAAiB;QACjB,kBAAkB;QAClB,qBAAqB;QACrB,YAAY;KACf,CAAC;IAEF,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAE/B,OAAO,WAAW,CAAC,KAAK,EAAE,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED,qEAAqE;AAErE,6DAA6D;AAC7D,MAAM,UAAU,WAAW,CACvB,KAAoD,EACpD,MAAsB;IAEtB,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtB,KAAK,iBAAiB;YAClB,OAAO,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC/C,KAAK,kBAAkB;YACnB,OAAO,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC/C,KAAK,qBAAqB;YACtB,OAAO,uBAAuB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClD,KAAK,YAAY;YACb,OAAO,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1C,KAAK,OAAO;YACR,OAAO,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACtC;YACI,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,kBAAkB,EAAE,EAAE,CAAC;IAChI,CAAC;AACL,CAAC"}

package/dist/deep/graph.d.ts

@@ -9,17 +9,36 @@
  * The CLI only stores what the Agent sends via graph-add.
  */
 import { DirectedGraph } from 'graphology';
+/** Semantic edge relation types */
+export declare const EDGE_RELATIONS: {
+    readonly yields: "yields";
+    readonly belongs_to: "belongs_to";
+    readonly mentions: "mentions";
+    readonly alternative_to: "alternative_to";
+    readonly depends_on: "depends_on";
+    readonly co_occurs_with: "co_occurs_with";
+    readonly mentioned_in: "mentioned_in";
+    readonly includes: "includes";
+};
+export type PathType = 'composition_chain' | 'conjunction' | 'augmented_chain' | 'community_core_path' | 'dual_core_bridge';
 export interface GraphNodeAttrs {
-    type: 'entity' | 'result' | 'query' | 'domain';
+    type: 'entity' | 'result' | 'query' | 'domain' | 'path';
     label: string;
     entityType?: string;
     score?: number;
+    reasoningPaths?: string[];
+    sourceRounds?: number[];
+    frequency?: number;
+    obfuscatedLabel?: string;
     url?: string;
     rank?: number;
     title?: string;
     query?: string;
     round?: number;
     domain?: string;
+    pathType?: PathType;
+    hops?: number;
+    entities?: string[];
 }
 export interface GraphEdgeAttrs {
     relation: string;
@@ -35,6 +54,9 @@ export declare function resultId(url: string): string;
 export declare function queryId(query: string): string;
 /** Generate a node ID for a domain */
 export declare function domainId(domain: string): string;
+/** Generate the next path node ID for a given path type.
+ *  Scans existing graph nodes to find the current max counter. */
+export declare function nextPathId(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, pathType: PathType): string;
 /** Auto-build structural edges: query→result→domain */
 export declare function buildStructuralEdges(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, query: string, results: Array<{
     url: string;
@@ -51,5 +73,6 @@ export declare function graphStats(graph: DirectedGraph<GraphNodeAttrs, GraphEdg
     results: number;
     queries: number;
     domains: number;
+    paths: number;
 };
 //# sourceMappingURL=graph.d.ts.map

package/dist/deep/graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/deep/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,MAAM,WAAW,cAAc;IAC3B,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAC;IAC/C,KAAK,EAAE,MAAM,CAAC;IAEd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,cAAc;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAClB;AAMD,qDAAqD;AACrD,wBAAgB,WAAW,IAAI,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CAE3E;AAED,uCAAuC;AACvC,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9C;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED,qCAAqC;AACrC,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7C;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE/C;AAWD,uDAAuD;AACvD,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,KAAK,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,EAC7D,KAAK,CAAC,EAAE,MAAM,GACf,IAAI,CAuDN;AAED,wBAAgB,WAAW,CACvB,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,GAAE,MAAU,GAClB,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CA+B/C;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG,MAAM,CAE3F;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,GAAG,GAAG,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CAIzF;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG;IAC9E,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACnB,CAiBA"}
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/deep/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,mCAAmC;AACnC,eAAO,MAAM,cAAc;;;;;;;;;CASjB,CAAC;AAEX,MAAM,MAAM,QAAQ,GAAG,mBAAmB,GAAG,aAAa,GAAG,iBAAiB,GAAG,qBAAqB,GAAG,kBAAkB,CAAC;AAE5H,MAAM,WAAW,cAAc;IAC3B,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAC;IACxD,KAAK,EAAE,MAAM,CAAC;IAEd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAClB;AAMD,qDAAqD;AACrD,wBAAgB,WAAW,IAAI,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CAE3E;AAED,uCAAuC;AACvC,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9C;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED,qCAAqC;AACrC,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7C;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE/C;AAWD;kEACkE;AAClE,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAe3G;AAWD,uDAAuD;AACvD,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,KAAK,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,EAC7D,KAAK,CAAC,EAAE,MAAM,GACf,IAAI,CAuDN;AAED,wBAAgB,WAAW,CACvB,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,GAAE,MAAU,GAClB,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CA+B/C;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG,MAAM,CAE3F;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,GAAG,GAAG,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,CAIzF;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG;IAC9E,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACjB,CAmBA"}

package/dist/deep/graph.js

@@ -9,6 +9,17 @@
  * The CLI only stores what the Agent sends via graph-add.
  */
 import { DirectedGraph } from 'graphology';
+/** Semantic edge relation types */
+export const EDGE_RELATIONS = {
+    yields: 'yields', // query → result
+    belongs_to: 'belongs_to', // result → domain
+    mentions: 'mentions', // result → entity
+    alternative_to: 'alternative_to', // entity ↔ entity
+    depends_on: 'depends_on', // entity → entity
+    co_occurs_with: 'co_occurs_with', // entity ↔ entity
+    mentioned_in: 'mentioned_in', // entity → result
+    includes: 'includes', // path → entity
+};
 function generateId(prefix, value) {
     return `${prefix}:${value.toLowerCase().replace(/[^\w]+/g, '_').slice(0, 60)}`;
 }
@@ -32,6 +43,33 @@ export function queryId(query) {
 export function domainId(domain) {
     return generateId('d', domain);
 }
+/** Map from PathType to ID prefix */
+const PATH_TYPE_PREFIX = {
+    composition_chain: 'chain',
+    conjunction: 'conj',
+    augmented_chain: 'aug',
+    community_core_path: 'core',
+    dual_core_bridge: 'bridge',
+};
+/** Generate the next path node ID for a given path type.
+ *  Scans existing graph nodes to find the current max counter. */
+export function nextPathId(graph, pathType) {
+    const prefix = PATH_TYPE_PREFIX[pathType];
+    let maxCounter = 0;
+    graph.forEachNode((node, attrs) => {
+        if (attrs.type === 'path' && attrs.pathType === pathType) {
+            // Extract counter from node ID: p:<prefix>_NNN
+            const match = node.match(new RegExp(`^p:${prefix}_(\\d+)$`));
+            if (match) {
+                const counter = parseInt(match[1], 10);
+                if (counter > maxCounter)
+                    maxCounter = counter;
+            }
+        }
+    });
+    const next = maxCounter + 1;
+    return `p:${prefix}_${String(next).padStart(3, '0')}`;
+}
 /** Extract domain from URL */
 function extractDomain(url) {
     try {
@@ -130,7 +168,7 @@ export function deserializeGraph(data) {
     return graph;
 }
 export function graphStats(graph) {
-    let entities = 0, results = 0, queries = 0, domains = 0;
+    let entities = 0, results = 0, queries = 0, domains = 0, paths = 0;
     graph.forEachNode((node, attrs) => {
         if (attrs.type === 'entity')
             entities++;
@@ -140,6 +178,8 @@ export function graphStats(graph) {
             queries++;
         else if (attrs.type === 'domain')
             domains++;
+        else if (attrs.type === 'path')
+            paths++;
     });
     return {
         nodes: graph.order,
@@ -148,6 +188,7 @@ export function graphStats(graph) {
         results,
         queries,
         domains,
+        paths,
     };
 }
 //# sourceMappingURL=graph.js.map

package/dist/deep/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/deep/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAwB3C,SAAS,UAAU,CAAC,MAAc,EAAE,KAAa;IAC7C,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACnF,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,WAAW;IACvB,OAAO,IAAI,aAAa,EAAkC,CAAC;AAC/D,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,QAAQ,CAAC,KAAa;IAClC,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,QAAQ,CAAC,GAAW;IAChC,OAAO,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,qCAAqC;AACrC,MAAM,UAAU,OAAO,CAAC,KAAa;IACjC,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,QAAQ,CAAC,MAAc;IACnC,OAAO,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,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,GAAG,CAAC;IACf,CAAC;AACL,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,oBAAoB,CAChC,KAAoD,EACpD,KAAa,EACb,OAA6D,EAC7D,KAAc;IAEd,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAE3B,2BAA2B;IAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;YACjB,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,KAAK;YACZ,KAAK;YACL,KAAK;SACR,CAAC,CAAC;IACP,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE5B,4BAA4B;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;gBACjB,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,GAAG,EAAE,CAAC,CAAC,GAAG;gBACV,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC;aACxB,CAAC,CAAC;QACP,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE;gBACpB,QAAQ,EAAE,QAAQ;gBAClB,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;aACtB,CAAC,CAAC;QACP,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;oBACjB,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,MAAM;oBACb,MAAM;iBACT,CAAC,CAAC;YACP,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE;oBACpB,QAAQ,EAAE,YAAY;oBACtB,MAAM,EAAE,CAAC;iBACZ,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED,MAAM,UAAU,WAAW,CACvB,KAAoD,EACpD,KAAe,EACf,QAAgB,CAAC;IAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,KAAK;SACpD,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;SAC/B,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACxC,IAAI,CAAC,GAAG,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAE3C,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,aAAa,EAAkC,CAAC;IACrE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC9C,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;QACtF,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAoD;IAC/E,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,IAAS;IACtC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAkC,CAAC;IAClE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAoD;IAQ3E,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;IACxD,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,QAAQ,EAAE,CAAC;aACnC,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;aACvC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,EAAE,CAAC;aACtC,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,OAAO;QACH,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,KAAK,EAAE,KAAK,CAAC,IAAI;QACjB,QAAQ;QACR,OAAO;QACP,OAAO;QACP,OAAO;KACV,CAAC;AACN,CAAC"}
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/deep/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,mCAAmC;AACnC,MAAM,CAAC,MAAM,cAAc,GAAG;IAC1B,MAAM,EAAE,QAAQ,EAAY,iBAAiB;IAC7C,UAAU,EAAE,YAAY,EAAI,kBAAkB;IAC9C,QAAQ,EAAE,UAAU,EAAQ,kBAAkB;IAC9C,cAAc,EAAE,gBAAgB,EAAE,kBAAkB;IACpD,UAAU,EAAE,YAAY,EAAI,kBAAkB;IAC9C,cAAc,EAAE,gBAAgB,EAAE,kBAAkB;IACpD,YAAY,EAAE,cAAc,EAAM,kBAAkB;IACpD,QAAQ,EAAE,UAAU,EAAc,gBAAgB;CAC5C,CAAC;AAkCX,SAAS,UAAU,CAAC,MAAc,EAAE,KAAa;IAC7C,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACnF,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,WAAW;IACvB,OAAO,IAAI,aAAa,EAAkC,CAAC;AAC/D,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,QAAQ,CAAC,KAAa;IAClC,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,QAAQ,CAAC,GAAW;IAChC,OAAO,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,qCAAqC;AACrC,MAAM,UAAU,OAAO,CAAC,KAAa;IACjC,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,QAAQ,CAAC,MAAc;IACnC,OAAO,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,qCAAqC;AACrC,MAAM,gBAAgB,GAA6B;IAC/C,iBAAiB,EAAE,OAAO;IAC1B,WAAW,EAAE,MAAM;IACnB,eAAe,EAAE,KAAK;IACtB,mBAAmB,EAAE,MAAM;IAC3B,gBAAgB,EAAE,QAAQ;CAC7B,CAAC;AAEF;kEACkE;AAClE,MAAM,UAAU,UAAU,CAAC,KAAoD,EAAE,QAAkB;IAC/F,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACvD,+CAA+C;YAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,MAAM,UAAU,CAAC,CAAC,CAAC;YAC7D,IAAI,KAAK,EAAE,CAAC;gBACR,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvC,IAAI,OAAO,GAAG,UAAU;oBAAE,UAAU,GAAG,OAAO,CAAC;YACnD,CAAC;QACL,CAAC;IACL,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,UAAU,GAAG,CAAC,CAAC;IAC5B,OAAO,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,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,GAAG,CAAC;IACf,CAAC;AACL,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,oBAAoB,CAChC,KAAoD,EACpD,KAAa,EACb,OAA6D,EAC7D,KAAc;IAEd,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAE3B,2BAA2B;IAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;YACjB,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,KAAK;YACZ,KAAK;YACL,KAAK;SACR,CAAC,CAAC;IACP,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE5B,4BAA4B;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;gBACjB,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,GAAG,EAAE,CAAC,CAAC,GAAG;gBACV,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC;aACxB,CAAC,CAAC;QACP,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE;gBACpB,QAAQ,EAAE,QAAQ;gBAClB,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;aACtB,CAAC,CAAC;QACP,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;oBACjB,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,MAAM;oBACb,MAAM;iBACT,CAAC,CAAC;YACP,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE;oBACpB,QAAQ,EAAE,YAAY;oBACtB,MAAM,EAAE,CAAC;iBACZ,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED,MAAM,UAAU,WAAW,CACvB,KAAoD,EACpD,KAAe,EACf,QAAgB,CAAC;IAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,KAAK;SACpD,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;SAC/B,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACxC,IAAI,CAAC,GAAG,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAE3C,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,CAAC,QAAgB,EAAE,EAAE;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,aAAa,EAAkC,CAAC;IACrE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC9C,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;QACtF,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAoD;IAC/E,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,IAAS;IACtC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAkC,CAAC;IAClE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAoD;IAS3E,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IACnE,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAqB,EAAE,EAAE;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,QAAQ,EAAE,CAAC;aACnC,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;aACvC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,EAAE,CAAC;aACtC,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;aACvC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;YAAE,KAAK,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,OAAO;QACH,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,KAAK,EAAE,KAAK,CAAC,IAAI;QACjB,QAAQ;QACR,OAAO;QACP,OAAO;QACP,OAAO;QACP,KAAK;KACR,CAAC;AACN,CAAC"}

package/dist/deep/iteration-data.d.ts

@@ -0,0 +1,38 @@
+/**
+ * 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 { DirectedGraph } from 'graphology';
+import { GraphNodeAttrs, GraphEdgeAttrs } from './graph.js';
+import { SessionResult } from './session.js';
+import { QualityScore, QualityThresholds } from './quality-assess.js';
+import { QuerySuggestionData } from './query-suggest.js';
+import { StrategyConfig, StrategyInfo } from './search-strategy.js';
+import { RecoveryAnalysis } from './recovery-analysis.js';
+import { RedundancyConfig, RedundancyResult } from './query-redundancy.js';
+export interface SessionAnalysis {
+    quality: QualityScore;
+    strategy: StrategyInfo;
+    suggestions: QuerySuggestionData;
+    recovery: RecoveryAnalysis;
+}
+/** 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 declare function getSessionAnalysis(graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, sessionResults: SessionResult[], options?: {
+    qualityThresholds?: Partial<QualityThresholds>;
+    strategyConfig?: Partial<StrategyConfig>;
+}): SessionAnalysis;
+/** Check a new query for redundancy before execution.
+ *  Standalone convenience function — also available via query-redundancy.ts. */
+export declare function checkNewQueryRedundancy(newQuery: string, graph: DirectedGraph<GraphNodeAttrs, GraphEdgeAttrs>, config?: Partial<RedundancyConfig>): RedundancyResult;
+//# sourceMappingURL=iteration-data.d.ts.map

package/dist/deep/iteration-data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iteration-data.d.ts","sourceRoot":"","sources":["../../src/deep/iteration-data.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAuB,MAAM,qBAAqB,CAAC;AAC3F,OAAO,EAAE,mBAAmB,EAAyC,MAAM,oBAAoB,CAAC;AAChG,OAAO,EAAE,cAAc,EAAE,YAAY,EAAmB,MAAM,sBAAsB,CAAC;AACrF,OAAO,EAAE,gBAAgB,EAA0B,MAAM,wBAAwB,CAAC;AAClF,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAwB,MAAM,uBAAuB,CAAC;AAIjG,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,YAAY,CAAC;IACtB,QAAQ,EAAE,YAAY,CAAC;IACvB,WAAW,EAAE,mBAAmB,CAAC;IACjC,QAAQ,EAAE,gBAAgB,CAAC;CAC9B;AAID;;4EAE4E;AAC5E,wBAAgB,kBAAkB,CAC9B,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,cAAc,EAAE,aAAa,EAAE,EAC/B,OAAO,CAAC,EAAE;IACN,iBAAiB,CAAC,EAAE,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAC/C,cAAc,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;CAC5C,GACF,eAAe,CA6BjB;AAED;gFACgF;AAChF,wBAAgB,uBAAuB,CACnC,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,aAAa,CAAC,cAAc,EAAE,cAAc,CAAC,EACpD,MAAM,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GACnC,gBAAgB,CAYlB"}