causantic 0.2.0 → 0.3.0

package/dist/eval/collection-benchmark/graph-value.d.ts

@@ -1,16 +0,0 @@
-/**
- * Graph value benchmarks.
- *
- * Quantifies what the knowledge graph adds beyond pure vector similarity.
- * Measures source attribution, graph vs vector-only comparison, and
- * edge type effectiveness.
- */
-import type { GraphValueResult, BenchmarkSample, SkippedBenchmark } from './types.js';
-/**
- * Run graph value benchmarks.
- */
-export declare function runGraphValueBenchmarks(sample: BenchmarkSample, topK: number, onProgress?: (msg: string) => void): Promise<{
-    result: GraphValueResult;
-    skipped: SkippedBenchmark[];
-}>;
-//# sourceMappingURL=graph-value.d.ts.map

package/dist/eval/collection-benchmark/graph-value.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-value.d.ts","sourceRoot":"","sources":["../../../src/eval/collection-benchmark/graph-value.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AASH,OAAO,KAAK,EACV,gBAAgB,EAGhB,eAAe,EACf,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAGpB;;GAEG;AACH,wBAAsB,uBAAuB,CAC3C,MAAM,EAAE,eAAe,EACvB,IAAI,EAAE,MAAM,EACZ,UAAU,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,GACjC,OAAO,CAAC;IAAE,MAAM,EAAE,gBAAgB,CAAC;IAAC,OAAO,EAAE,gBAAgB,EAAE,CAAA;CAAE,CAAC,CAsJpE"}

package/dist/eval/collection-benchmark/graph-value.js

@@ -1,162 +0,0 @@
-/**
- * Graph value benchmarks.
- *
- * Quantifies what the knowledge graph adds beyond pure vector similarity.
- * Measures source attribution, graph vs vector-only comparison, and
- * edge type effectiveness.
- */
-import { getChunkById } from '../../storage/chunk-store.js';
-import { getOutgoingEdges, getIncomingEdges } from '../../storage/edge-store.js';
-import { assembleContext, } from '../../retrieval/context-assembler.js';
-/**
- * Run graph value benchmarks.
- */
-export async function runGraphValueBenchmarks(sample, topK, onProgress) {
-    const skipped = [];
-    // Source attribution: run retrieval and count by source
-    const sourceCounts = { vector: 0, keyword: 0, cluster: 0, graph: 0 };
-    let totalResults = 0;
-    let vectorOnlyResults = 0;
-    let totalGraphBoosted = 0;
-    const queryIds = sample.queryChunkIds.slice(0, Math.min(30, sample.queryChunkIds.length));
-    let processed = 0;
-    // Full pipeline results + vector-only results for comparison
-    const fullResults = [];
-    const vectorOnlyResponses = [];
-    for (const chunkId of queryIds) {
-        const chunk = getChunkById(chunkId);
-        if (!chunk)
-            continue;
-        onProgress?.(`[${++processed}/${queryIds.length}] Graph value analysis...`);
-        // Full pipeline
-        const fullResponse = await assembleContext({
-            query: chunk.content.slice(0, 500),
-            mode: 'recall',
-            projectFilter: chunk.sessionSlug,
-            maxTokens: 10000,
-            vectorSearchLimit: topK * 2,
-        });
-        fullResults.push(fullResponse);
-        totalGraphBoosted += fullResponse.graphBoosted ?? 0;
-        for (const result of fullResponse.chunks) {
-            totalResults++;
-            const source = result.source ?? 'vector';
-            sourceCounts[source]++;
-        }
-        // Vector-only (skip graph and clusters)
-        const vectorOnlyResponse = await assembleContext({
-            query: chunk.content.slice(0, 500),
-            mode: 'recall',
-            projectFilter: chunk.sessionSlug,
-            maxTokens: 10000,
-            vectorSearchLimit: topK * 2,
-            skipGraph: true,
-            skipClusters: true,
-        });
-        vectorOnlyResponses.push(vectorOnlyResponse);
-        vectorOnlyResults += vectorOnlyResponse.chunks.length;
-    }
-    // Source attribution
-    const sourceAttribution = {
-        vectorPercentage: totalResults > 0 ? sourceCounts.vector / totalResults : 0,
-        keywordPercentage: totalResults > 0 ? sourceCounts.keyword / totalResults : 0,
-        clusterPercentage: totalResults > 0 ? sourceCounts.cluster / totalResults : 0,
-        graphPercentage: totalResults > 0 ? sourceCounts.graph / totalResults : 0,
-        augmentationRatio: vectorOnlyResults > 0 ? totalResults / vectorOnlyResults : 1,
-    };
-    // Graph vs vector-only comparison using adjacent pairs as ground truth
-    let fullRecallAt10 = 0;
-    let vectorOnlyRecallAt10 = 0;
-    let uniqueGraphFinds = 0;
-    let comparisonCount = 0;
-    if (sample.adjacentPairs.length > 0) {
-        // Build a map: queryChunkId -> adjacent pairs
-        const adjacentMap = new Map();
-        for (const pair of sample.adjacentPairs) {
-            const list = adjacentMap.get(pair.queryChunkId) ?? [];
-            list.push(pair.adjacentChunkId);
-            adjacentMap.set(pair.queryChunkId, list);
-        }
-        for (let i = 0; i < queryIds.length; i++) {
-            const chunkId = queryIds[i];
-            const adjacents = adjacentMap.get(chunkId);
-            if (!adjacents || adjacents.length === 0)
-                continue;
-            const fullResultIds = new Set(fullResults[i]?.chunks.slice(0, topK).map(c => c.id) ?? []);
-            const vectorOnlyIds = new Set(vectorOnlyResponses[i]?.chunks.slice(0, topK).map(c => c.id) ?? []);
-            for (const adjId of adjacents) {
-                if (fullResultIds.has(adjId))
-                    fullRecallAt10++;
-                if (vectorOnlyIds.has(adjId))
-                    vectorOnlyRecallAt10++;
-                if (fullResultIds.has(adjId) && !vectorOnlyIds.has(adjId))
-                    uniqueGraphFinds++;
-                comparisonCount++;
-            }
-        }
-    }
-    const normalizedFullRecall = comparisonCount > 0 ? fullRecallAt10 / comparisonCount : 0;
-    const normalizedVectorOnlyRecall = comparisonCount > 0 ? vectorOnlyRecallAt10 / comparisonCount : 0;
-    const lift = normalizedVectorOnlyRecall > 0
-        ? (normalizedFullRecall - normalizedVectorOnlyRecall) / normalizedVectorOnlyRecall
-        : normalizedFullRecall > 0 ? 1 : 0;
-    // Edge type effectiveness
-    const edgeTypeEffectiveness = [];
-    const edgeTypeSurfaced = new Map();
-    const edgeTypeRecallHits = new Map();
-    // Count graph-sourced results by examining response metadata
-    for (const response of fullResults) {
-        for (const chunk of response.chunks) {
-            if (chunk.source === 'graph') {
-                // We can't directly track which edge type led to this result
-                // without additional instrumentation, so we approximate by
-                // looking at what edge types exist for this chunk
-                const edgeTypes = getEdgeTypesForChunk(chunk.id);
-                for (const type of edgeTypes) {
-                    edgeTypeSurfaced.set(type, (edgeTypeSurfaced.get(type) ?? 0) + 1);
-                }
-            }
-        }
-    }
-    const allEdgeTypes = [
-        'file-path', 'code-entity', 'explicit-backref', 'error-fragment',
-        'tool-output', 'adjacent', 'cross-session', 'brief', 'debrief',
-    ];
-    for (const type of allEdgeTypes) {
-        const surfaced = edgeTypeSurfaced.get(type) ?? 0;
-        if (surfaced > 0) {
-            edgeTypeEffectiveness.push({
-                type,
-                chunksSurfaced: surfaced,
-                recallContribution: totalResults > 0 ? surfaced / totalResults : 0,
-            });
-        }
-    }
-    edgeTypeEffectiveness.sort((a, b) => b.chunksSurfaced - a.chunksSurfaced);
-    return {
-        result: {
-            sourceAttribution,
-            fullRecallAt10: normalizedFullRecall,
-            vectorOnlyRecallAt10: normalizedVectorOnlyRecall,
-            uniqueGraphFinds,
-            graphBoostedCount: totalGraphBoosted,
-            lift,
-            edgeTypeEffectiveness,
-        },
-        skipped,
-    };
-}
-/**
- * Get the reference types of edges connected to a chunk.
- */
-function getEdgeTypesForChunk(chunkId) {
-    const outgoing = getOutgoingEdges(chunkId);
-    const incoming = getIncomingEdges(chunkId);
-    const types = new Set();
-    for (const edge of [...outgoing, ...incoming]) {
-        if (edge.referenceType)
-            types.add(edge.referenceType);
-    }
-    return [...types];
-}
-//# sourceMappingURL=graph-value.js.map

package/dist/eval/collection-benchmark/graph-value.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-value.js","sourceRoot":"","sources":["../../../src/eval/collection-benchmark/graph-value.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AACjF,OAAO,EACL,eAAe,GAGhB,MAAM,sCAAsC,CAAC;AAU9C;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,MAAuB,EACvB,IAAY,EACZ,UAAkC;IAElC,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,wDAAwD;IACxD,MAAM,YAAY,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACrE,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,MAAM,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1F,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,6DAA6D;IAC7D,MAAM,WAAW,GAAwB,EAAE,CAAC;IAC5C,MAAM,mBAAmB,GAAwB,EAAE,CAAC;IAEpD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,UAAU,EAAE,CAAC,IAAI,EAAE,SAAS,IAAI,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;QAE5E,gBAAgB;QAChB,MAAM,YAAY,GAAG,MAAM,eAAe,CAAC;YACzC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YAClC,IAAI,EAAE,QAAQ;YACd,aAAa,EAAE,KAAK,CAAC,WAAW;YAChC,SAAS,EAAE,KAAK;YAChB,iBAAiB,EAAE,IAAI,GAAG,CAAC;SAC5B,CAAC,CAAC;QACH,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC/B,iBAAiB,IAAI,YAAY,CAAC,YAAY,IAAI,CAAC,CAAC;QAEpD,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;YACzC,YAAY,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,QAAQ,CAAC;YACzC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,CAAC;QAED,wCAAwC;QACxC,MAAM,kBAAkB,GAAG,MAAM,eAAe,CAAC;YAC/C,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YAClC,IAAI,EAAE,QAAQ;YACd,aAAa,EAAE,KAAK,CAAC,WAAW;YAChC,SAAS,EAAE,KAAK;YAChB,iBAAiB,EAAE,IAAI,GAAG,CAAC;YAC3B,SAAS,EAAE,IAAI;YACf,YAAY,EAAE,IAAI;SACiD,CAAC,CAAC;QACvE,mBAAmB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC7C,iBAAiB,IAAI,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC;IACxD,CAAC;IAED,qBAAqB;IACrB,MAAM,iBAAiB,GAAsB;QAC3C,gBAAgB,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3E,iBAAiB,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7E,iBAAiB,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7E,eAAe,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACzE,iBAAiB,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;KAChF,CAAC;IAEF,uEAAuE;IACvE,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAC7B,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,IAAI,MAAM,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,8CAA8C;QAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YACtD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAChC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YAC1F,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YAElG,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC9B,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,cAAc,EAAE,CAAC;gBAC/C,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,oBAAoB,EAAE,CAAC;gBACrD,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,gBAAgB,EAAE,CAAC;gBAC9E,eAAe,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,oBAAoB,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,0BAA0B,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IACpG,MAAM,IAAI,GAAG,0BAA0B,GAAG,CAAC;QACzC,CAAC,CAAC,CAAC,oBAAoB,GAAG,0BAA0B,CAAC,GAAG,0BAA0B;QAClF,CAAC,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErC,0BAA0B;IAC1B,MAAM,qBAAqB,GAA4B,EAAE,CAAC;IAC1D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAErD,6DAA6D;IAC7D,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;gBAC7B,6DAA6D;gBAC7D,2DAA2D;gBAC3D,kDAAkD;gBAClD,MAAM,SAAS,GAAG,oBAAoB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACjD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;oBAC7B,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAoB;QACpC,WAAW,EAAE,aAAa,EAAE,kBAAkB,EAAE,gBAAgB;QAChE,aAAa,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,SAAS;KAC/D,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,qBAAqB,CAAC,IAAI,CAAC;gBACzB,IAAI;gBACJ,cAAc,EAAE,QAAQ;gBACxB,kBAAkB,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;aACnE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;IAE1E,OAAO;QACL,MAAM,EAAE;YACN,iBAAiB;YACjB,cAAc,EAAE,oBAAoB;YACpC,oBAAoB,EAAE,0BAA0B;YAChD,gBAAgB;YAChB,iBAAiB,EAAE,iBAAiB;YACpC,IAAI;YACJ,qBAAqB;SACtB;QACD,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,OAAe;IAC3C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,aAAa;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;AACpB,CAAC"}

package/dist/eval/experiments/vector-decay-shapes/curve-shapes-experiment.d.ts

@@ -1,10 +0,0 @@
-/**
- * Test different decay curve SHAPES for graph traversal range.
- *
- * Curves to test:
- * - Exponential: weight = wph^hops
- * - Linear: weight = max(0, 1 - rate * hops)
- * - Delayed Linear: weight = 1 if hops < hold, else max(0, 1 - rate * (hops - hold))
- */
-export {};
-//# sourceMappingURL=curve-shapes-experiment.d.ts.map

package/dist/eval/experiments/vector-decay-shapes/curve-shapes-experiment.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"curve-shapes-experiment.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/curve-shapes-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/eval/experiments/vector-decay-shapes/curve-shapes-experiment.js

@@ -1,229 +0,0 @@
-/**
- * Test different decay curve SHAPES for graph traversal range.
- *
- * Curves to test:
- * - Exponential: weight = wph^hops
- * - Linear: weight = max(0, 1 - rate * hops)
- * - Delayed Linear: weight = 1 if hops < hold, else max(0, 1 - rate * (hops - hold))
- */
-import { getDb } from '../../../storage/db.js';
-import { deserialize, hopCount } from '../../../temporal/vector-clock.js';
-import { getReferenceClock } from '../../../storage/clock-store.js';
-const MIN_PATH_WEIGHT = 0.001;
-const NEGATIVE_SAMPLE_COUNT = 10;
-const CURVES = [
-    // Exponential variants
-    { id: 'exp-80', name: 'Exponential 0.80', calc: h => Math.pow(0.80, h) },
-    { id: 'exp-85', name: 'Exponential 0.85', calc: h => Math.pow(0.85, h) },
-    { id: 'exp-90', name: 'Exponential 0.90', calc: h => Math.pow(0.90, h) },
-    // Linear variants (die at different hop counts)
-    { id: 'lin-10', name: 'Linear (dies@10)', calc: h => Math.max(0, 1 - h * 0.1) },
-    { id: 'lin-20', name: 'Linear (dies@20)', calc: h => Math.max(0, 1 - h * 0.05) },
-    { id: 'lin-30', name: 'Linear (dies@30)', calc: h => Math.max(0, 1 - h * 0.033) },
-    // Delayed linear: hold for N hops, then linear decay
-    { id: 'del-2-15', name: 'Delayed (2h, dies@15)', calc: h => h < 2 ? 1 : Math.max(0, 1 - (h - 2) * 0.077) },
-    { id: 'del-3-15', name: 'Delayed (3h, dies@15)', calc: h => h < 3 ? 1 : Math.max(0, 1 - (h - 3) * 0.083) },
-    { id: 'del-3-20', name: 'Delayed (3h, dies@20)', calc: h => h < 3 ? 1 : Math.max(0, 1 - (h - 3) * 0.059) },
-    { id: 'del-5-20', name: 'Delayed (5h, dies@20)', calc: h => h < 5 ? 1 : Math.max(0, 1 - (h - 5) * 0.067) },
-    { id: 'del-5-25', name: 'Delayed (5h, dies@25)', calc: h => h < 5 ? 1 : Math.max(0, 1 - (h - 5) * 0.05) },
-];
-const db = getDb();
-// Load chunks
-const chunks = new Map();
-for (const row of db.prepare(`
-  SELECT id, session_slug as sessionSlug, vector_clock as vectorClock
-  FROM chunks WHERE vector_clock IS NOT NULL
-`).all()) {
-    chunks.set(row.id, row);
-}
-// Cache reference clocks
-const refClocks = new Map();
-function getRefClock(slug) {
-    if (!refClocks.has(slug)) {
-        refClocks.set(slug, getReferenceClock(slug));
-    }
-    return refClocks.get(slug);
-}
-// Group chunks by project
-const projectChunks = new Map();
-for (const chunk of chunks.values()) {
-    const existing = projectChunks.get(chunk.sessionSlug) ?? [];
-    existing.push(chunk);
-    projectChunks.set(chunk.sessionSlug, existing);
-}
-function sampleNegatives(projectSlug, excludeIds, count) {
-    const available = projectChunks.get(projectSlug) ?? [];
-    const candidates = available.filter(c => !excludeIds.has(c.id));
-    const shuffled = [...candidates];
-    for (let i = shuffled.length - 1; i > 0; i--) {
-        const j = Math.floor(Math.random() * (i + 1));
-        [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
-    }
-    return shuffled.slice(0, count);
-}
-function runExperiment(edges, curves, direction) {
-    // Group by source
-    const bySource = new Map();
-    for (const edge of edges) {
-        const existing = bySource.get(edge.sourceChunkId) ?? [];
-        existing.push(edge);
-        bySource.set(edge.sourceChunkId, existing);
-    }
-    const results = new Map();
-    for (const curve of curves) {
-        let totalRR = 0;
-        let rank1 = 0;
-        let queries = 0;
-        const bins = direction === 'backward'
-            ? { '4-9': [], '10-14': [], '15-20': [] }
-            : { '1-3': [], '4-7': [], '8-12': [], '13-20': [] };
-        for (const [sourceChunkId, srcEdges] of bySource) {
-            const sourceChunk = chunks.get(sourceChunkId);
-            const refClock = getRefClock(sourceChunk.sessionSlug);
-            const positives = srcEdges.map(e => ({
-                chunkId: e.targetChunkId,
-                hops: e.hops,
-                weight: Math.max(0, curve.calc(e.hops)),
-            }));
-            const excludeIds = new Set([sourceChunkId, ...positives.map(p => p.chunkId)]);
-            const negChunks = sampleNegatives(sourceChunk.sessionSlug, excludeIds, NEGATIVE_SAMPLE_COUNT);
-            if (negChunks.length === 0)
-                continue;
-            const negatives = negChunks.filter(c => c.vectorClock).map(c => {
-                const clock = deserialize(c.vectorClock);
-                const hops = direction === 'backward'
-                    ? hopCount(clock, refClock)
-                    : hopCount(deserialize(sourceChunk.vectorClock), clock);
-                return { chunkId: c.id, hops, weight: Math.max(0, curve.calc(Math.abs(hops))) };
-            });
-            const candidates = [
-                ...positives.map(p => ({ ...p, isPositive: true })),
-                ...negatives.map(n => ({ ...n, isPositive: false })),
-            ];
-            candidates.sort((a, b) => b.weight - a.weight);
-            let firstPosRank = 0;
-            for (let i = 0; i < candidates.length; i++) {
-                if (candidates[i].isPositive) {
-                    firstPosRank = i + 1;
-                    break;
-                }
-            }
-            const rr = firstPosRank > 0 ? 1 / firstPosRank : 0;
-            totalRR += rr;
-            if (firstPosRank === 1)
-                rank1++;
-            queries++;
-            const minHop = Math.min(...positives.map(p => p.hops));
-            let bin;
-            if (direction === 'backward') {
-                bin = minHop < 10 ? '4-9' : minHop < 15 ? '10-14' : '15-20';
-            }
-            else {
-                bin = minHop <= 3 ? '1-3' : minHop <= 7 ? '4-7' : minHop <= 12 ? '8-12' : '13-20';
-            }
-            bins[bin]?.push(rr);
-        }
-        const mrr = queries > 0 ? totalRR / queries : 0;
-        const mrrByBin = {};
-        for (const [bin, rrs] of Object.entries(bins)) {
-            mrrByBin[bin] = rrs.length > 0 ? rrs.reduce((a, b) => a + b, 0) / rrs.length : 0;
-        }
-        results.set(curve.id, { mrr, rank1, n: queries, mrrByBin });
-    }
-    return results;
-}
-// ============================================================
-// BACKWARD (4-20 hops)
-// ============================================================
-console.log('='.repeat(100));
-console.log('BACKWARD: Different Curve Shapes (4-20 hops)');
-console.log('='.repeat(100));
-const backwardEdges = db.prepare(`
-  SELECT source_chunk_id as sourceChunkId, target_chunk_id as targetChunkId,
-         vector_clock as vectorClock, reference_type as referenceType
-  FROM edges
-  WHERE edge_type = 'backward' AND vector_clock IS NOT NULL
-    AND reference_type IN ('file-path', 'code-entity', 'explicit-backref', 'error-fragment')
-`).all();
-const backwardInRange = [];
-for (const edge of backwardEdges) {
-    const sourceChunk = chunks.get(edge.sourceChunkId);
-    if (!sourceChunk?.vectorClock)
-        continue;
-    const edgeClock = deserialize(edge.vectorClock);
-    const refClock = getRefClock(sourceChunk.sessionSlug);
-    const hops = hopCount(edgeClock, refClock);
-    if (hops >= 4 && hops <= 20) {
-        backwardInRange.push({ sourceChunkId: edge.sourceChunkId, targetChunkId: edge.targetChunkId, hops, projectSlug: sourceChunk.sessionSlug });
-    }
-}
-console.log(`\nEdges: ${backwardInRange.length}\n`);
-const backwardResults = runExperiment(backwardInRange, CURVES, 'backward');
-console.log('Curve                     | MRR    | 4-9    | 10-14  | 15-20  | Rank@1');
-console.log('-'.repeat(75));
-const sortedBackward = [...backwardResults.entries()].sort((a, b) => b[1].mrr - a[1].mrr);
-for (const [id, r] of sortedBackward) {
-    const curve = CURVES.find(c => c.id === id);
-    console.log([
-        curve.name.padEnd(25),
-        r.mrr.toFixed(3).padStart(6),
-        r.mrrByBin['4-9'].toFixed(3).padStart(6),
-        r.mrrByBin['10-14'].toFixed(3).padStart(6),
-        r.mrrByBin['15-20'].toFixed(3).padStart(6),
-        r.rank1.toString().padStart(6),
-    ].join(' | '));
-}
-// ============================================================
-// FORWARD (1-20 hops)
-// ============================================================
-console.log('\n' + '='.repeat(100));
-console.log('FORWARD: Different Curve Shapes (1-20 hops)');
-console.log('='.repeat(100));
-const forwardEdges = db.prepare(`
-  SELECT source_chunk_id as sourceChunkId, target_chunk_id as targetChunkId,
-         vector_clock as vectorClock, reference_type as referenceType
-  FROM edges
-  WHERE edge_type = 'forward' AND vector_clock IS NOT NULL
-    AND reference_type IN ('file-path', 'code-entity', 'explicit-backref', 'error-fragment')
-`).all();
-const forwardInRange = [];
-for (const edge of forwardEdges) {
-    const sourceChunk = chunks.get(edge.sourceChunkId);
-    const targetChunk = chunks.get(edge.targetChunkId);
-    if (!sourceChunk?.vectorClock || !targetChunk?.vectorClock)
-        continue;
-    const sourceClock = deserialize(sourceChunk.vectorClock);
-    const targetClock = deserialize(targetChunk.vectorClock);
-    const forwardHops = hopCount(sourceClock, targetClock);
-    if (forwardHops >= 1 && forwardHops <= 20) {
-        forwardInRange.push({ sourceChunkId: edge.sourceChunkId, targetChunkId: edge.targetChunkId, hops: forwardHops, projectSlug: sourceChunk.sessionSlug });
-    }
-}
-console.log(`\nEdges: ${forwardInRange.length}\n`);
-const forwardResults = runExperiment(forwardInRange, CURVES, 'forward');
-console.log('Curve                     | MRR    | 1-3    | 4-7    | 8-12   | 13-20  | Rank@1');
-console.log('-'.repeat(85));
-const sortedForward = [...forwardResults.entries()].sort((a, b) => b[1].mrr - a[1].mrr);
-for (const [id, r] of sortedForward) {
-    const curve = CURVES.find(c => c.id === id);
-    console.log([
-        curve.name.padEnd(25),
-        r.mrr.toFixed(3).padStart(6),
-        r.mrrByBin['1-3'].toFixed(3).padStart(6),
-        r.mrrByBin['4-7'].toFixed(3).padStart(6),
-        r.mrrByBin['8-12'].toFixed(3).padStart(6),
-        r.mrrByBin['13-20'].toFixed(3).padStart(6),
-        r.rank1.toString().padStart(6),
-    ].join(' | '));
-}
-// ============================================================
-// SUMMARY
-// ============================================================
-console.log('\n' + '='.repeat(100));
-console.log('SUMMARY');
-console.log('='.repeat(100));
-const bestBackward = sortedBackward[0];
-const bestForward = sortedForward[0];
-console.log(`\nBACKWARD best: ${CURVES.find(c => c.id === bestBackward[0]).name} (MRR=${bestBackward[1].mrr.toFixed(3)})`);
-console.log(`FORWARD best:  ${CURVES.find(c => c.id === bestForward[0]).name} (MRR=${bestForward[1].mrr.toFixed(3)})`);
-//# sourceMappingURL=curve-shapes-experiment.js.map

package/dist/eval/experiments/vector-decay-shapes/curve-shapes-experiment.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"curve-shapes-experiment.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/curve-shapes-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAoB,MAAM,mCAAmC,CAAC;AAC5F,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAEpE,MAAM,eAAe,GAAG,KAAK,CAAC;AAC9B,MAAM,qBAAqB,GAAG,EAAE,CAAC;AASjC,MAAM,MAAM,GAAkB;IAC5B,uBAAuB;IACvB,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;IACxE,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;IACxE,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;IAExE,gDAAgD;IAChD,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE;IAC/E,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE;IAChF,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE;IAEjF,qDAAqD;IACrD,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE;IAC1G,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE;IAC1G,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE;IAC1G,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE;IAC1G,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE;CAC1G,CAAC;AAeF,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;AAEnB,cAAc;AACd,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;AAC3C,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC;;;CAG5B,CAAC,CAAC,GAAG,EAAgB,EAAE,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED,yBAAyB;AACzB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;AACjD,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;AAC9B,CAAC;AAED,0BAA0B;AAC1B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAsB,CAAC;AACpD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IAC5D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,eAAe,CAAC,WAAmB,EAAE,UAAuB,EAAE,KAAa;IAClF,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,aAAa,CACpB,KAAiG,EACjG,MAAqB,EACrB,SAAiC;IAGjC,kBAAkB;IAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACxD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuF,CAAC;IAE/G,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,IAAI,GAA6B,SAAS,KAAK,UAAU;YAC7D,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;YACzC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAEtD,KAAK,MAAM,CAAC,aAAa,EAAE,QAAQ,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjD,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;YAC/C,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;YAEtD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnC,OAAO,EAAE,CAAC,CAAC,aAAa;gBACxB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACxC,CAAC,CAAC,CAAC;YAEJ,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,SAAS,GAAG,eAAe,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;YAC9F,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAErC,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBAC7D,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,WAAY,CAAC,CAAC;gBAC1C,MAAM,IAAI,GAAG,SAAS,KAAK,UAAU;oBACnC,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC3B,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,WAAW,CAAC,WAAY,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC3D,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,CAAC,CAAC,CAAC;YAEH,MAAM,UAAU,GAAG;gBACjB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnD,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;aACrD,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAE/C,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;oBAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;oBAAC,MAAM;gBAAC,CAAC;YAChE,CAAC;YAED,MAAM,EAAE,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,IAAI,EAAE,CAAC;YACd,IAAI,YAAY,KAAK,CAAC;gBAAE,KAAK,EAAE,CAAC;YAChC,OAAO,EAAE,CAAC;YAEV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,IAAI,GAAW,CAAC;YAChB,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;gBAC7B,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9D,CAAC;iBAAM,CAAC;gBACN,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YACpF,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACnG,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAE/D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,OAAO,CAAC,GAAG,CAAC,8CAA8C,CAAC,CAAC;AAC5D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAE7B,MAAM,aAAa,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;CAMhC,CAAC,CAAC,GAAG,EAAe,CAAC;AAEtB,MAAM,eAAe,GAA+F,EAAE,CAAC;AACvH,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;IACjC,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnD,IAAI,CAAC,WAAW,EAAE,WAAW;QAAE,SAAS;IACxC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC3C,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;QAC5B,eAAe,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;IAC7I,CAAC;AACH,CAAC;AAED,OAAO,CAAC,GAAG,CAAC,YAAY,eAAe,CAAC,MAAM,IAAI,CAAC,CAAC;AAEpD,MAAM,eAAe,GAAG,aAAa,CAAC,eAAe,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;AAE3E,OAAO,CAAC,GAAG,CAAC,wEAAwE,CAAC,CAAC;AACtF,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5B,MAAM,cAAc,GAAG,CAAC,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC1F,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,cAAc,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAE,CAAC;IAC7C,OAAO,CAAC,GAAG,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;KAC/B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,sBAAsB;AACtB,+DAA+D;AAE/D,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;AAC3D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAE7B,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;CAM/B,CAAC,CAAC,GAAG,EAAe,CAAC;AAEtB,MAAM,cAAc,GAA+F,EAAE,CAAC;AACtH,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;IAChC,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnD,IAAI,CAAC,WAAW,EAAE,WAAW,IAAI,CAAC,WAAW,EAAE,WAAW;QAAE,SAAS;IACrE,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IACvD,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,EAAE,EAAE,CAAC;QAC1C,cAAc,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;IACzJ,CAAC;AACH,CAAC;AAED,OAAO,CAAC,GAAG,CAAC,YAAY,cAAc,CAAC,MAAM,IAAI,CAAC,CAAC;AAEnD,MAAM,cAAc,GAAG,aAAa,CAAC,cAAc,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;AAExE,OAAO,CAAC,GAAG,CAAC,iFAAiF,CAAC,CAAC;AAC/F,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5B,MAAM,aAAa,GAAG,CAAC,GAAG,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACxF,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,aAAa,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAE,CAAC;IAC7C,OAAO,CAAC,GAAG,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;KAC/B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,UAAU;AACV,+DAA+D;AAE/D,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACvB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAE7B,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;AACvC,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AAErC,OAAO,CAAC,GAAG,CAAC,oBAAoB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,SAAS,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC5H,OAAO,CAAC,GAAG,CAAC,kBAAkB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,SAAS,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC"}

package/dist/eval/experiments/vector-decay-shapes/graph-range-experiment.d.ts

@@ -1,12 +0,0 @@
-/**
- * Graph traversal experiment for the 4-20 hop range.
- *
- * This is the "sweet spot" for graph-based retrieval:
- * - 0-3 hops: Claude already has in context
- * - 4-20 hops: Graph traversal with decay
- * - 20+ hops: Vector similarity search (not graph)
- *
- * Also runs forward analysis: how does relevance decay into the future?
- */
-export {};
-//# sourceMappingURL=graph-range-experiment.d.ts.map

package/dist/eval/experiments/vector-decay-shapes/graph-range-experiment.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-range-experiment.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/graph-range-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}