causantic 0.2.0

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

@@ -0,0 +1,316 @@
+/**
+ * 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?
+ */
+import { getDb } from '../../../storage/db.js';
+import { deserialize, hopCount } from '../../../temporal/vector-clock.js';
+import { getReferenceClock } from '../../../storage/clock-store.js';
+const MIN_HOP = 4; // Beyond Claude's context
+const MAX_HOP = 20; // Graph traversal limit
+const NEGATIVE_SAMPLE_COUNT = 10;
+const WPH_VALUES = [0.70, 0.75, 0.80, 0.85, 0.90, 0.95];
+const MIN_PATH_WEIGHT = 0.001;
+function calculatePathWeight(hops, wph) {
+    const weight = Math.pow(wph, hops);
+    return weight >= MIN_PATH_WEIGHT ? weight : 0;
+}
+const db = getDb();
+// Load chunks
+const chunks = new Map();
+const chunkRows = db.prepare(`
+  SELECT id, session_slug as sessionSlug, vector_clock as vectorClock
+  FROM chunks WHERE vector_clock IS NOT NULL
+`).all();
+for (const row of chunkRows) {
+    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);
+}
+// ============================================================
+// BACKWARD ANALYSIS (4-20 hops)
+// ============================================================
+console.log('='.repeat(100));
+console.log('BACKWARD ANALYSIS: Graph Traversal for 4-20 Hop Range');
+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 >= MIN_HOP && hops <= MAX_HOP) {
+        backwardInRange.push({ ...edge, hops, projectSlug: sourceChunk.sessionSlug });
+    }
+}
+console.log(`\nEdges in 4-20 hop range: ${backwardInRange.length}`);
+// Hop distribution
+const backwardHopDist = {};
+for (const edge of backwardInRange) {
+    const bin = `${Math.floor(edge.hops / 5) * 5}-${Math.floor(edge.hops / 5) * 5 + 4}`;
+    backwardHopDist[bin] = (backwardHopDist[bin] ?? 0) + 1;
+}
+console.log('\nHop distribution:');
+for (const [bin, count] of Object.entries(backwardHopDist).sort()) {
+    console.log(`  ${bin}: ${count} (${(count / backwardInRange.length * 100).toFixed(1)}%)`);
+}
+// Group by source
+const backwardBySource = new Map();
+for (const edge of backwardInRange) {
+    const existing = backwardBySource.get(edge.sourceChunkId) ?? [];
+    existing.push(edge);
+    backwardBySource.set(edge.sourceChunkId, existing);
+}
+// Run experiment
+console.log('\nPath weight = wph^hops\n');
+console.log('wph   | MRR    | Reach% | 4-9    | 10-14  | 15-20  | Rank@1 | n');
+console.log('-'.repeat(75));
+const backwardResults = [];
+for (const wph of WPH_VALUES) {
+    let totalRR = 0;
+    let rank1 = 0;
+    let queries = 0;
+    let reachable = 0;
+    const rrByBin = { '4-9': [], '10-14': [], '15-20': [] };
+    for (const [sourceChunkId, edges] of backwardBySource) {
+        const sourceChunk = chunks.get(sourceChunkId);
+        const refClock = getRefClock(sourceChunk.sessionSlug);
+        const positives = edges.map(e => ({
+            chunkId: e.targetChunkId,
+            hops: e.hops,
+            pathWeight: calculatePathWeight(e.hops, wph),
+        }));
+        const anyReachable = positives.some(p => p.pathWeight > 0);
+        if (anyReachable)
+            reachable++;
+        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 = hopCount(clock, refClock);
+            return { chunkId: c.id, hops, pathWeight: calculatePathWeight(hops, wph) };
+        });
+        const candidates = [
+            ...positives.map(p => ({ ...p, isPositive: true })),
+            ...negatives.map(n => ({ ...n, isPositive: false })),
+        ];
+        candidates.sort((a, b) => b.pathWeight - a.pathWeight);
+        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));
+        const bin = minHop < 10 ? '4-9' : minHop < 15 ? '10-14' : '15-20';
+        rrByBin[bin].push(rr);
+    }
+    const mrr = queries > 0 ? totalRR / queries : 0;
+    const mrrByBin = {};
+    for (const bin of ['4-9', '10-14', '15-20']) {
+        mrrByBin[bin] = rrByBin[bin].length > 0
+            ? rrByBin[bin].reduce((a, b) => a + b, 0) / rrByBin[bin].length : 0;
+    }
+    backwardResults.push({ wph, mrr, reachPct: reachable / queries * 100, mrrByBin, rank1, n: queries });
+    console.log([
+        wph.toFixed(2),
+        mrr.toFixed(3).padStart(6),
+        `${(reachable / queries * 100).toFixed(0)}%`.padStart(6),
+        mrrByBin['4-9'].toFixed(3).padStart(6),
+        mrrByBin['10-14'].toFixed(3).padStart(6),
+        mrrByBin['15-20'].toFixed(3).padStart(6),
+        rank1.toString().padStart(6),
+        queries.toString().padStart(5),
+    ].join(' | '));
+}
+// ============================================================
+// FORWARD ANALYSIS
+// ============================================================
+console.log('\n' + '='.repeat(100));
+console.log('FORWARD ANALYSIS: Predicting Future References');
+console.log('='.repeat(100));
+console.log('\nQuestion: Given a chunk, which future chunks (1-20 hops ahead) will reference it?');
+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);
+    // Forward hops: how far ahead is target from source
+    // This is the opposite direction of backward hops
+    const forwardHops = hopCount(sourceClock, targetClock);
+    if (forwardHops >= 1 && forwardHops <= MAX_HOP) {
+        forwardInRange.push({ ...edge, forwardHops, projectSlug: sourceChunk.sessionSlug });
+    }
+}
+console.log(`\nForward edges in 1-20 hop range: ${forwardInRange.length}`);
+// Hop distribution
+const forwardHopDist = {};
+for (const edge of forwardInRange) {
+    const bin = edge.forwardHops <= 3 ? '1-3' :
+        edge.forwardHops <= 7 ? '4-7' :
+            edge.forwardHops <= 12 ? '8-12' : '13-20';
+    forwardHopDist[bin] = (forwardHopDist[bin] ?? 0) + 1;
+}
+console.log('\nForward hop distribution (how far ahead is the referencing chunk):');
+for (const [bin, count] of Object.entries(forwardHopDist)) {
+    console.log(`  ${bin} hops ahead: ${count} (${(count / forwardInRange.length * 100).toFixed(1)}%)`);
+}
+// Group by source (the chunk being referenced)
+const forwardBySource = new Map();
+for (const edge of forwardInRange) {
+    const existing = forwardBySource.get(edge.sourceChunkId) ?? [];
+    existing.push(edge);
+    forwardBySource.set(edge.sourceChunkId, existing);
+}
+// Run forward experiment
+console.log('\nForward decay: predicting which future chunks reference this one');
+console.log('Path weight = wph^forwardHops (decay into the future)\n');
+console.log('wph   | MRR    | Reach% | 1-3    | 4-7    | 8-12   | 13-20  | Rank@1 | n');
+console.log('-'.repeat(80));
+const forwardResults = [];
+for (const wph of WPH_VALUES) {
+    let totalRR = 0;
+    let rank1 = 0;
+    let queries = 0;
+    let reachable = 0;
+    const rrByBin = { '1-3': [], '4-7': [], '8-12': [], '13-20': [] };
+    for (const [sourceChunkId, edges] of forwardBySource) {
+        const sourceChunk = chunks.get(sourceChunkId);
+        const sourceClock = deserialize(sourceChunk.vectorClock);
+        // Positives are the target chunks that reference this source
+        const positives = edges.map(e => ({
+            chunkId: e.targetChunkId,
+            forwardHops: e.forwardHops,
+            pathWeight: calculatePathWeight(e.forwardHops, wph),
+        }));
+        const anyReachable = positives.some(p => p.pathWeight > 0);
+        if (anyReachable)
+            reachable++;
+        // Sample negatives from same project
+        const excludeIds = new Set([sourceChunkId, ...positives.map(p => p.chunkId)]);
+        const negChunks = sampleNegatives(sourceChunk.sessionSlug, excludeIds, NEGATIVE_SAMPLE_COUNT);
+        if (negChunks.length === 0)
+            continue;
+        // Calculate forward hops for negatives
+        const negatives = negChunks.filter(c => c.vectorClock).map(c => {
+            const negClock = deserialize(c.vectorClock);
+            const forwardHops = hopCount(sourceClock, negClock);
+            return {
+                chunkId: c.id,
+                forwardHops,
+                pathWeight: calculatePathWeight(Math.abs(forwardHops), wph),
+            };
+        });
+        const candidates = [
+            ...positives.map(p => ({ ...p, isPositive: true })),
+            ...negatives.map(n => ({ ...n, isPositive: false })),
+        ];
+        candidates.sort((a, b) => b.pathWeight - a.pathWeight);
+        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.forwardHops));
+        const bin = minHop <= 3 ? '1-3' : minHop <= 7 ? '4-7' : minHop <= 12 ? '8-12' : '13-20';
+        rrByBin[bin].push(rr);
+    }
+    const mrr = queries > 0 ? totalRR / queries : 0;
+    const mrrByBin = {};
+    for (const bin of ['1-3', '4-7', '8-12', '13-20']) {
+        mrrByBin[bin] = rrByBin[bin].length > 0
+            ? rrByBin[bin].reduce((a, b) => a + b, 0) / rrByBin[bin].length : 0;
+    }
+    forwardResults.push({ wph, mrr, reachPct: reachable / queries * 100, mrrByBin, rank1, n: queries });
+    console.log([
+        wph.toFixed(2),
+        mrr.toFixed(3).padStart(6),
+        `${(reachable / queries * 100).toFixed(0)}%`.padStart(6),
+        mrrByBin['1-3'].toFixed(3).padStart(6),
+        mrrByBin['4-7'].toFixed(3).padStart(6),
+        mrrByBin['8-12'].toFixed(3).padStart(6),
+        mrrByBin['13-20'].toFixed(3).padStart(6),
+        rank1.toString().padStart(6),
+        queries.toString().padStart(5),
+    ].join(' | '));
+}
+// ============================================================
+// SUMMARY
+// ============================================================
+console.log('\n' + '='.repeat(100));
+console.log('SUMMARY');
+console.log('='.repeat(100));
+const bestBackward = backwardResults.reduce((a, b) => a.mrr > b.mrr ? a : b);
+const bestForward = forwardResults.reduce((a, b) => a.mrr > b.mrr ? a : b);
+console.log('\nBACKWARD (4-20 hops, retrieval):');
+console.log(`  Best: wph=${bestBackward.wph} (MRR=${bestBackward.mrr.toFixed(3)}, ${bestBackward.reachPct.toFixed(0)}% reachable)`);
+console.log('\nFORWARD (1-20 hops, prediction):');
+console.log(`  Best: wph=${bestForward.wph} (MRR=${bestForward.mrr.toFixed(3)}, ${bestForward.reachPct.toFixed(0)}% reachable)`);
+// Check if different curves are optimal
+if (bestBackward.wph !== bestForward.wph) {
+    console.log('\n  → Different optimal decay rates for backward vs forward!');
+    console.log(`    Backward: ${bestBackward.wph}, Forward: ${bestForward.wph}`);
+}
+//# sourceMappingURL=graph-range-experiment.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-range-experiment.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/graph-range-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;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,OAAO,GAAG,CAAC,CAAC,CAAG,0BAA0B;AAC/C,MAAM,OAAO,GAAG,EAAE,CAAC,CAAE,wBAAwB;AAC7C,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACjC,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACxD,MAAM,eAAe,GAAG,KAAK,CAAC;AAe9B,SAAS,mBAAmB,CAAC,IAAY,EAAE,GAAW;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACnC,OAAO,MAAM,IAAI,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;AAEnB,cAAc;AACd,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;AAC3C,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC;;;CAG5B,CAAC,CAAC,GAAG,EAAgB,CAAC;AACvB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;IAC5B,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,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAE/D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;AACrE,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;AAQtB,MAAM,eAAe,GAAoB,EAAE,CAAC;AAC5C,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;IAExC,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;IAE3C,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC;QACvC,eAAe,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;IAChF,CAAC;AACH,CAAC;AAED,OAAO,CAAC,GAAG,CAAC,8BAA8B,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;AAEpE,mBAAmB;AACnB,MAAM,eAAe,GAA2B,EAAE,CAAC;AACnD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;IACnC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;IACpF,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACzD,CAAC;AACD,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;AACnC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;IAClE,OAAO,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,KAAK,KAAK,CAAC,KAAK,GAAG,eAAe,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5F,CAAC;AAED,kBAAkB;AAClB,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA2B,CAAC;AAC5D,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;IAChE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;AACrD,CAAC;AAED,iBAAiB;AACjB,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;AAC1C,OAAO,CAAC,GAAG,CAAC,iEAAiE,CAAC,CAAC;AAC/E,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAW5B,MAAM,eAAe,GAAa,EAAE,CAAC;AAErC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,OAAO,GAA6B,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAElF,KAAK,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;QACtD,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAEtD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE,CAAC,CAAC,aAAa;YACxB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,UAAU,EAAE,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC;SAC7C,CAAC,CAAC,CAAC;QAEJ,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,YAAY;YAAE,SAAS,EAAE,CAAC;QAE9B,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;QAC9E,MAAM,SAAS,GAAG,eAAe,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;QAC9F,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAErC,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC7D,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,WAAY,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YACvC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG;YACjB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;SACrD,CAAC;QACF,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAEvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QAChE,CAAC;QAED,MAAM,EAAE,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,EAAE,CAAC;QACd,IAAI,YAAY,KAAK,CAAC;YAAE,KAAK,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QAEV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAClE,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QAC5C,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC;YACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,eAAe,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,GAAG,OAAO,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;IAErG,OAAO,CAAC,GAAG,CAAC;QACV,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACd,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,SAAS,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxD,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;KAC/B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,mBAAmB;AACnB,+DAA+D;AAE/D,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC;AAC9D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,OAAO,CAAC,GAAG,CAAC,qFAAqF,CAAC,CAAC;AAEnG,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;CAM/B,CAAC,CAAC,GAAG,EAAe,CAAC;AAUtB,MAAM,cAAc,GAA2B,EAAE,CAAC;AAClD,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;IAErE,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAEzD,oDAAoD;IACpD,kDAAkD;IAClD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAEvD,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,OAAO,EAAE,CAAC;QAC/C,cAAc,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;IACtF,CAAC;AACH,CAAC;AAED,OAAO,CAAC,GAAG,CAAC,sCAAsC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC;AAE3E,mBAAmB;AACnB,MAAM,cAAc,GAA2B,EAAE,CAAC;AAClD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IACtD,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACvD,CAAC;AACD,OAAO,CAAC,GAAG,CAAC,sEAAsE,CAAC,CAAC;AACpF,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;IAC1D,OAAO,CAAC,GAAG,CAAC,KAAK,GAAG,gBAAgB,KAAK,KAAK,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtG,CAAC;AAED,+CAA+C;AAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkC,CAAC;AAClE,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;IAC/D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;AACpD,CAAC;AAED,yBAAyB;AACzB,OAAO,CAAC,GAAG,CAAC,oEAAoE,CAAC,CAAC;AAClF,OAAO,CAAC,GAAG,CAAC,yDAAyD,CAAC,CAAC;AACvE,OAAO,CAAC,GAAG,CAAC,0EAA0E,CAAC,CAAC;AACxF,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5B,MAAM,cAAc,GAAa,EAAE,CAAC;AAEpC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,OAAO,GAA6B,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAE5F,KAAK,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE,CAAC;QACrD,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,WAAY,CAAC,CAAC;QAE1D,6DAA6D;QAC7D,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE,CAAC,CAAC,aAAa;YACxB,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,UAAU,EAAE,mBAAmB,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC;SACpD,CAAC,CAAC,CAAC;QAEJ,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,YAAY;YAAE,SAAS,EAAE,CAAC;QAE9B,qCAAqC;QACrC,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;QAC9E,MAAM,SAAS,GAAG,eAAe,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;QAC9F,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAErC,uCAAuC;QACvC,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC7D,MAAM,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,WAAY,CAAC,CAAC;YAC7C,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YACpD,OAAO;gBACL,OAAO,EAAE,CAAC,CAAC,EAAE;gBACb,WAAW;gBACX,UAAU,EAAE,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC;aAC5D,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG;YACjB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;SACrD,CAAC;QACF,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAEvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QAChE,CAAC;QAED,MAAM,EAAE,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,EAAE,CAAC;QACd,IAAI,YAAY,KAAK,CAAC;YAAE,KAAK,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QAEV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9D,MAAM,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;QACxF,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAClD,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC;YACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,cAAc,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,GAAG,OAAO,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;IAEpG,OAAO,CAAC,GAAG,CAAC;QACV,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACd,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,SAAS,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxD,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtC,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5B,OAAO,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,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7E,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE3E,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;AAClD,OAAO,CAAC,GAAG,CAAC,eAAe,YAAY,CAAC,GAAG,SAAS,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;AAEpI,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;AAClD,OAAO,CAAC,GAAG,CAAC,eAAe,WAAW,CAAC,GAAG,SAAS,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;AAEjI,wCAAwC;AACxC,IAAI,YAAY,CAAC,GAAG,KAAK,WAAW,CAAC,GAAG,EAAE,CAAC;IACzC,OAAO,CAAC,GAAG,CAAC,8DAA8D,CAAC,CAAC;IAC5E,OAAO,CAAC,GAAG,CAAC,iBAAiB,YAAY,CAAC,GAAG,cAAc,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC;AAChF,CAAC"}

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

@@ -0,0 +1,19 @@
+/**
+ * Hop-based decay curve calculations.
+ *
+ * Translates the time-based decay curve concepts to hop counts:
+ * - Exponential: weight = w0 * (weightPerHop)^hops
+ * - Linear: weight = w0 - decayPerHop * hops
+ * - Delayed Linear: hold for N hops, then linear
+ * - Multi-linear: sum of multiple tiers
+ */
+import type { HopDecayConfig } from './types.js';
+/**
+ * Calculate decay weight for a given hop count.
+ */
+export declare function calculateHopDecayWeight(config: HopDecayConfig, hops: number): number;
+/**
+ * Get the hop count where weight reaches zero (or null if asymptotic).
+ */
+export declare function getDeathHops(config: HopDecayConfig): number | null;
+//# sourceMappingURL=hop-decay.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hop-decay.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/hop-decay.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAgB,MAAM,YAAY,CAAC;AAE/D;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAuBpF;AA+DD;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAqClE"}

package/dist/eval/experiments/vector-decay-shapes/hop-decay.js

@@ -0,0 +1,127 @@
+/**
+ * Hop-based decay curve calculations.
+ *
+ * Translates the time-based decay curve concepts to hop counts:
+ * - Exponential: weight = w0 * (weightPerHop)^hops
+ * - Linear: weight = w0 - decayPerHop * hops
+ * - Delayed Linear: hold for N hops, then linear
+ * - Multi-linear: sum of multiple tiers
+ */
+/**
+ * Calculate decay weight for a given hop count.
+ */
+export function calculateHopDecayWeight(config, hops) {
+    if (hops < 0)
+        return config.initialWeight;
+    let weight;
+    switch (config.type) {
+        case 'exponential':
+            weight = calculateExponential(config, hops);
+            break;
+        case 'linear':
+            weight = calculateLinear(config, hops);
+            break;
+        case 'delayed-linear':
+            weight = calculateDelayedLinear(config, hops);
+            break;
+        case 'multi-linear':
+            weight = calculateMultiLinear(config, hops);
+            break;
+        default:
+            weight = config.initialWeight;
+    }
+    return weight >= config.minWeight ? weight : 0;
+}
+/**
+ * Exponential decay by hops: w(h) = w0 * (weightPerHop)^h
+ */
+function calculateExponential(config, hops) {
+    const w0 = config.initialWeight;
+    const wph = config.weightPerHop ?? 0.8;
+    return w0 * Math.pow(wph, hops);
+}
+/**
+ * Linear decay by hops: w(h) = w0 - decayPerHop * h
+ */
+function calculateLinear(config, hops) {
+    const w0 = config.initialWeight;
+    const rate = config.decayPerHop ?? 0.1;
+    return Math.max(0, w0 - rate * hops);
+}
+/**
+ * Delayed linear: hold at w0 for holdHops, then linear decay.
+ * w(h) = w0 if h < holdHops, else w0 - rate * (h - holdHops)
+ */
+function calculateDelayedLinear(config, hops) {
+    const w0 = config.initialWeight;
+    const hold = config.holdHops ?? 0;
+    const rate = config.decayPerHop ?? 0.1;
+    if (hops < hold) {
+        return w0;
+    }
+    const decayHops = hops - hold;
+    return Math.max(0, w0 - rate * decayHops);
+}
+/**
+ * Multi-linear: sum of multiple tiers.
+ */
+function calculateMultiLinear(config, hops) {
+    const tiers = config.tiers ?? [];
+    let totalWeight = 0;
+    for (const tier of tiers) {
+        totalWeight += calculateTierWeight(tier, hops);
+    }
+    return totalWeight;
+}
+/**
+ * Calculate weight for a single tier.
+ */
+function calculateTierWeight(tier, hops) {
+    if (hops < tier.holdHops) {
+        return tier.initialWeight;
+    }
+    const decayHops = hops - tier.holdHops;
+    return Math.max(0, tier.initialWeight - tier.decayPerHop * decayHops);
+}
+/**
+ * Get the hop count where weight reaches zero (or null if asymptotic).
+ */
+export function getDeathHops(config) {
+    switch (config.type) {
+        case 'exponential':
+            // Asymptotic - never reaches zero
+            return null;
+        case 'linear': {
+            const w0 = config.initialWeight;
+            const rate = config.decayPerHop ?? 0.1;
+            if (rate <= 0)
+                return null;
+            return Math.ceil(w0 / rate);
+        }
+        case 'delayed-linear': {
+            const w0 = config.initialWeight;
+            const hold = config.holdHops ?? 0;
+            const rate = config.decayPerHop ?? 0.1;
+            if (rate <= 0)
+                return null;
+            return hold + Math.ceil(w0 / rate);
+        }
+        case 'multi-linear': {
+            const tiers = config.tiers ?? [];
+            if (tiers.length === 0)
+                return 0;
+            // Find the tier that dies last
+            let maxDeathHops = 0;
+            for (const tier of tiers) {
+                if (tier.decayPerHop <= 0)
+                    return null;
+                const deathHops = tier.holdHops + Math.ceil(tier.initialWeight / tier.decayPerHop);
+                maxDeathHops = Math.max(maxDeathHops, deathHops);
+            }
+            return maxDeathHops;
+        }
+        default:
+            return null;
+    }
+}
+//# sourceMappingURL=hop-decay.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hop-decay.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/hop-decay.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,MAAsB,EAAE,IAAY;IAC1E,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,aAAa,CAAC;IAE1C,IAAI,MAAc,CAAC;IAEnB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,aAAa;YAChB,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC5C,MAAM;QACR,KAAK,QAAQ;YACX,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACvC,MAAM;QACR,KAAK,gBAAgB;YACnB,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC9C,MAAM;QACR,KAAK,cAAc;YACjB,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC5C,MAAM;QACR;YACE,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,MAAsB,EAAE,IAAY;IAChE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC;IAChC,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,IAAI,GAAG,CAAC;IACvC,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,MAAsB,EAAE,IAAY;IAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,MAAsB,EAAE,IAAY;IAClE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;IAEvC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;QAChB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC;IAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC;AAC5C,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,MAAsB,EAAE,IAAY;IAChE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;IACjC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,WAAW,IAAI,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,IAAkB,EAAE,IAAY;IAC3D,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAsB;IACjD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,aAAa;YAChB,kCAAkC;YAClC,OAAO,IAAI,CAAC;QAEd,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;YACvC,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;YACvC,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACrC,CAAC;QAED,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACjC,+BAA+B;YAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACvC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;gBACnF,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;YACnD,CAAC;YACD,OAAO,YAAY,CAAC;QACtB,CAAC;QAED;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,11 @@
+/**
+ * Hop-based decay shape experiments.
+ *
+ * Tests different decay curve shapes using hop count (D-T-D cycles)
+ * for both backward (retrieval) and forward (prediction) traversal.
+ */
+export * from './types.js';
+export * from './hop-decay.js';
+export * from './presets.js';
+export { runHopDecayShapeExperiment, formatResults } from './run-experiment.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,OAAO,EAAE,0BAA0B,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/eval/experiments/vector-decay-shapes/index.js

@@ -0,0 +1,11 @@
+/**
+ * Hop-based decay shape experiments.
+ *
+ * Tests different decay curve shapes using hop count (D-T-D cycles)
+ * for both backward (retrieval) and forward (prediction) traversal.
+ */
+export * from './types.js';
+export * from './hop-decay.js';
+export * from './presets.js';
+export { runHopDecayShapeExperiment, formatResults } from './run-experiment.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-shapes/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,OAAO,EAAE,0BAA0B,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC"}

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

@@ -0,0 +1,14 @@
+/**
+ * Path traversal experiment for decay curve evaluation.
+ *
+ * This properly simulates the actual retrieval mechanism:
+ * - Path weight = product of edge weights along path
+ * - For a path of N hops with uniform decay: weight = wph^N
+ * - Node score = sum of path weights reaching it
+ *
+ * Key insight: Linear decay doesn't make sense for path traversal
+ * because path weights are multiplicative. Only exponential decay
+ * properly models "each hop multiplies weight by wph".
+ */
+export {};
+//# sourceMappingURL=path-traversal-experiment.d.ts.map

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

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