causantic 0.9.3 → 0.10.0

package/dist/eval/experiments/index-differentiation/run-experiment.js

@@ -0,0 +1,338 @@
+/**
+ * Index Entry Differentiation Experiment
+ *
+ * Tests whether semantic index entries within the same topic cluster are
+ * too similar to each other, reducing the search system's ability to
+ * discriminate between chunks covering the same topic.
+ *
+ * Three phases:
+ *   1. Similarity analysis — do entries converge more than raw chunks?
+ *   2. Discrimination test — can we find the right entry among siblings?
+ *   3. Refinement simulation — does cluster-aware regeneration help?
+ *
+ * Usage:
+ *   npx tsx src/eval/experiments/index-differentiation/run-experiment.ts [--refine] [--max-clusters N]
+ *
+ * Requires: populated index entries and chunk cluster assignments.
+ * Run `npx causantic maintenance run backfill-index` first if needed.
+ */
+import { getDb } from '../../../storage/db.js';
+import { vectorStore, indexVectorStore } from '../../../storage/vector-store.js';
+import { getClusterChunkIds, getAllClusters } from '../../../storage/cluster-store.js';
+import { getIndexEntriesForChunk, getIndexEntryCount, } from '../../../storage/index-entry-store.js';
+import { getChunkById } from '../../../storage/chunk-store.js';
+import { runSimilarityAnalysis } from './similarity-analysis.js';
+import { runDiscriminationTest } from './discrimination-test.js';
+import { runAlignmentAnalysis } from './alignment-analysis.js';
+import { runRefinementTest } from './refinement-test.js';
+const MIN_ENTRIES_PER_CLUSTER = 3;
+/**
+ * Build the analysis dataset: for each cluster with enough index entries,
+ * gather the entry + chunk embeddings.
+ */
+async function buildClustersForAnalysis() {
+    // Force DB initialisation (runs migrations, loads config)
+    getDb();
+    const allClusters = getAllClusters();
+    console.log(`  Total clusters: ${allClusters.length}`);
+    // Load all embeddings
+    const chunkVectors = await vectorStore.getAllVectors();
+    const indexVectors = await indexVectorStore.getAllVectors();
+    const chunkEmbMap = new Map(chunkVectors.map((v) => [v.id, v.embedding]));
+    const indexEmbMap = new Map(indexVectors.map((v) => [v.id, v.embedding]));
+    console.log(`  Chunk vectors: ${chunkEmbMap.size}`);
+    console.log(`  Index vectors: ${indexEmbMap.size}`);
+    const clusters = [];
+    const allEntries = [];
+    const chunkContents = new Map();
+    for (const cluster of allClusters) {
+        const chunkIds = getClusterChunkIds(cluster.id);
+        // Find index entries for chunks in this cluster
+        const clusterEntries = [];
+        const seenEntryIds = new Set();
+        for (const chunkId of chunkIds) {
+            const entries = getIndexEntriesForChunk(chunkId);
+            for (const entry of entries) {
+                if (seenEntryIds.has(entry.id))
+                    continue;
+                seenEntryIds.add(entry.id);
+                const entryEmbedding = indexEmbMap.get(entry.id);
+                if (!entryEmbedding)
+                    continue;
+                // Get chunk embeddings for this entry
+                const chunkEmbeddings = [];
+                for (const cid of entry.chunkIds) {
+                    const emb = chunkEmbMap.get(cid);
+                    if (emb)
+                        chunkEmbeddings.push(emb);
+                    // Collect chunk content for refinement phase
+                    if (!chunkContents.has(cid)) {
+                        const chunk = getChunkById(cid);
+                        if (chunk)
+                            chunkContents.set(cid, chunk.content);
+                    }
+                }
+                clusterEntries.push({
+                    entryId: entry.id,
+                    entryEmbedding,
+                    chunkEmbeddings,
+                });
+                allEntries.push(entry);
+            }
+        }
+        if (clusterEntries.length >= MIN_ENTRIES_PER_CLUSTER) {
+            clusters.push({
+                clusterId: cluster.id,
+                clusterName: cluster.name,
+                entries: clusterEntries,
+            });
+        }
+    }
+    return { clusters, allEntries, chunkContents };
+}
+/**
+ * Format a number for display.
+ */
+function fmt(n, decimals = 3) {
+    return n.toFixed(decimals);
+}
+/**
+ * Run the full experiment.
+ */
+async function runExperiment() {
+    const args = process.argv.slice(2);
+    const doRefine = args.includes('--refine');
+    const maxClustersArg = args.find((a) => a.startsWith('--max-clusters='));
+    const maxClusters = maxClustersArg
+        ? parseInt(maxClustersArg.split('=')[1], 10)
+        : 5;
+    console.log('=== Index Entry Differentiation Experiment ===\n');
+    const totalEntries = getIndexEntryCount();
+    console.log(`Total index entries: ${totalEntries}`);
+    if (totalEntries === 0) {
+        console.log('\nNo index entries found. Run backfill first:\n  npx causantic maintenance run backfill-index');
+        process.exit(1);
+    }
+    // Build dataset
+    console.log('\nBuilding analysis dataset...');
+    const { clusters, allEntries, chunkContents } = await buildClustersForAnalysis();
+    console.log(`  Eligible clusters (≥${MIN_ENTRIES_PER_CLUSTER} entries): ${clusters.length}`);
+    console.log(`  Total entries in eligible clusters: ${clusters.reduce((s, c) => s + c.entries.length, 0)}`);
+    if (clusters.length === 0) {
+        console.log('\nNo clusters with enough index entries. Need at least ' +
+            `${MIN_ENTRIES_PER_CLUSTER} entries per cluster. ` +
+            'Run clustering and backfill first.');
+        process.exit(1);
+    }
+    // ── Phase 1: Similarity Analysis ──────────────────────────────────────────
+    console.log('\n── Phase 1: Intra-Cluster Similarity Analysis ──\n');
+    const similarityResults = runSimilarityAnalysis(clusters);
+    const meanCompression = similarityResults.reduce((s, r) => s + r.compressionRatio, 0) /
+        similarityResults.length;
+    const homogenized = similarityResults.filter((r) => r.compressionRatio > 1.0).length;
+    console.log('  Cluster                          Entries  Entry Sim  Chunk Sim  Ratio');
+    console.log('  ' + '─'.repeat(75));
+    for (const r of similarityResults.slice(0, 20)) {
+        const name = (r.clusterName ?? r.clusterId).slice(0, 30).padEnd(32);
+        const ratio = r.compressionRatio > 1 ? `${fmt(r.compressionRatio)} ▲` : `${fmt(r.compressionRatio)} ▼`;
+        console.log(`  ${name} ${String(r.entryCount).padStart(4)}    ${fmt(r.meanEntryPairSim)}     ${fmt(r.meanChunkPairSim)}     ${ratio}`);
+    }
+    if (similarityResults.length > 20) {
+        console.log(`  ... and ${similarityResults.length - 20} more clusters`);
+    }
+    console.log(`\n  Mean compression ratio: ${fmt(meanCompression)}`);
+    console.log(`  Homogenized clusters (ratio > 1): ${homogenized}/${similarityResults.length} (${fmt((100 * homogenized) / similarityResults.length, 1)}%)`);
+    // ── Phase 2: Discrimination Test ──────────────────────────────────────────
+    console.log('\n── Phase 2: Discrimination Test ──\n');
+    const discriminationResults = runDiscriminationTest(clusters);
+    let totalRR = 0;
+    let totalHits = 0;
+    let totalTests = 0;
+    for (const r of discriminationResults) {
+        totalRR += r.perEntry.reduce((s, e) => s + 1 / e.rankAmongSiblings, 0);
+        totalHits += r.perEntry.filter((e) => e.rankAmongSiblings === 1).length;
+        totalTests += r.perEntry.length;
+    }
+    const overallMRR = totalRR / totalTests;
+    const overallHitRate = totalHits / totalTests;
+    console.log('  Cluster                          Entries    MRR    Hit Rate');
+    console.log('  ' + '─'.repeat(65));
+    for (const r of discriminationResults.slice(0, 20)) {
+        const name = (r.clusterName ?? r.clusterId).slice(0, 30).padEnd(32);
+        console.log(`  ${name} ${String(r.entryCount).padStart(4)}    ${fmt(r.meanReciprocalRank)}   ${fmt(r.hitRate * 100, 1)}%`);
+    }
+    if (discriminationResults.length > 20) {
+        console.log(`  ... and ${discriminationResults.length - 20} more clusters`);
+    }
+    console.log(`\n  Overall MRR: ${fmt(overallMRR)}`);
+    console.log(`  Overall hit rate: ${fmt(overallHitRate * 100, 1)}%`);
+    // ── Phase 2b: Alignment Analysis ─────────────────────────────────────────
+    console.log('\n── Phase 2b: Entry-to-Chunk Alignment Analysis ──\n');
+    const alignmentResults = runAlignmentAnalysis(clusters);
+    let totalSelfAlign = 0;
+    let totalSibAlign = 0;
+    let totalGap = 0;
+    let totalUnique = 0;
+    let totalAlignEntries = 0;
+    for (const r of alignmentResults) {
+        const validCount = r.perEntry.filter((e) => e.selfAlignment > 0).length;
+        totalSelfAlign += r.meanSelfAlignment * validCount;
+        totalSibAlign += r.meanSiblingAlignment * validCount;
+        totalGap += r.meanAlignmentGap * validCount;
+        totalUnique += r.uniquelyAlignedFraction * validCount;
+        totalAlignEntries += validCount;
+    }
+    const overallSelfAlign = totalAlignEntries > 0 ? totalSelfAlign / totalAlignEntries : 0;
+    const overallSibAlign = totalAlignEntries > 0 ? totalSibAlign / totalAlignEntries : 0;
+    const overallGap = totalAlignEntries > 0 ? totalGap / totalAlignEntries : 0;
+    const overallUniquelyAligned = totalAlignEntries > 0 ? totalUnique / totalAlignEntries : 0;
+    console.log('  Cluster                          Entries  Self   Sibling  Gap    Unique%');
+    console.log('  ' + '─'.repeat(80));
+    for (const r of alignmentResults.slice(0, 20)) {
+        const name = (r.clusterName ?? r.clusterId).slice(0, 30).padEnd(32);
+        console.log(`  ${name} ${String(r.entryCount).padStart(4)}    ${fmt(r.meanSelfAlignment)}  ${fmt(r.meanSiblingAlignment)}   ${fmt(r.meanAlignmentGap)}  ${fmt(r.uniquelyAlignedFraction * 100, 1)}%`);
+    }
+    if (alignmentResults.length > 20) {
+        console.log(`  ... and ${alignmentResults.length - 20} more clusters`);
+    }
+    console.log(`\n  Overall self-alignment (entry ↔ own chunk):   ${fmt(overallSelfAlign)}`);
+    console.log(`  Overall sibling alignment (entry ↔ other chunks): ${fmt(overallSibAlign)}`);
+    console.log(`  Overall alignment gap (self - sibling):       ${fmt(overallGap)}`);
+    console.log(`  Uniquely aligned (self > max sibling):        ${fmt(overallUniquelyAligned * 100, 1)}%`);
+    // ── Phase 3: Refinement (optional) ────────────────────────────────────────
+    let refinementSection;
+    if (doRefine) {
+        console.log(`\n── Phase 3: Cluster-Aware Refinement (top ${maxClusters} worst clusters) ──\n`);
+        const discriminationScores = new Map(discriminationResults.map((r) => [r.clusterId, r.meanReciprocalRank]));
+        const refinementResults = await runRefinementTest(clusters, allEntries, chunkContents, discriminationScores, maxClusters);
+        if (refinementResults && refinementResults.length > 0) {
+            const meanMRRDelta = refinementResults.reduce((s, r) => s + (r.refinedMRR - r.baselineMRR), 0) / refinementResults.length;
+            const meanCRDelta = refinementResults.reduce((s, r) => s + r.compressionRatioDelta, 0) /
+                refinementResults.length;
+            console.log('\n  Cluster                     Baseline MRR  Refined MRR  Delta');
+            console.log('  ' + '─'.repeat(65));
+            for (const r of refinementResults) {
+                const name = (r.clusterName ?? r.clusterId).slice(0, 27).padEnd(29);
+                const delta = r.refinedMRR - r.baselineMRR;
+                const arrow = delta > 0.01 ? ' ▲' : delta < -0.01 ? ' ▼' : ' ─';
+                console.log(`  ${name} ${fmt(r.baselineMRR)}         ${fmt(r.refinedMRR)}       ${delta > 0 ? '+' : ''}${fmt(delta)}${arrow}`);
+            }
+            console.log(`\n  Mean MRR delta: ${meanMRRDelta > 0 ? '+' : ''}${fmt(meanMRRDelta)}`);
+            console.log(`  Mean compression ratio delta: ${meanCRDelta > 0 ? '+' : ''}${fmt(meanCRDelta)}`);
+            // Show sample refinements
+            const withSamples = refinementResults.filter((r) => r.sampleRefinements.length > 0);
+            if (withSamples.length > 0) {
+                console.log('\n  Sample refinements:');
+                for (const r of withSamples.slice(0, 2)) {
+                    console.log(`\n  Cluster: ${r.clusterName ?? r.clusterId}`);
+                    for (const s of r.sampleRefinements.slice(0, 2)) {
+                        console.log(`    Original:  ${s.original.slice(0, 120)}...`);
+                        console.log(`    Refined:   ${s.refined.slice(0, 120)}...`);
+                        console.log('');
+                    }
+                }
+            }
+            refinementSection = {
+                results: refinementResults,
+                meanMRRDelta,
+                meanCompressionRatioDelta: meanCRDelta,
+            };
+        }
+    }
+    else {
+        console.log('\n  (Skipping Phase 3 refinement — pass --refine to enable)');
+    }
+    // ── Summary ───────────────────────────────────────────────────────────────
+    const summary = [];
+    summary.push(`Analysed ${clusters.length} clusters (${clusters.reduce((s, c) => s + c.entries.length, 0)} entries)`);
+    if (meanCompression > 1.05) {
+        summary.push(`Compression homogenizes: mean ratio ${fmt(meanCompression)} (entries ${fmt((meanCompression - 1) * 100, 1)}% more similar than chunks)`);
+    }
+    else if (meanCompression < 0.95) {
+        summary.push(`LLM naturally differentiates: mean ratio ${fmt(meanCompression)} (entries ${fmt((1 - meanCompression) * 100, 1)}% less similar than chunks)`);
+    }
+    else {
+        summary.push(`Neutral compression: mean ratio ${fmt(meanCompression)} (entries ~same similarity as chunks)`);
+    }
+    if (overallMRR > 0.8) {
+        summary.push(`Strong discrimination: MRR=${fmt(overallMRR)}, hit rate=${fmt(overallHitRate * 100, 1)}% — entries are distinct enough within clusters`);
+    }
+    else if (overallMRR > 0.5) {
+        summary.push(`Moderate discrimination: MRR=${fmt(overallMRR)}, hit rate=${fmt(overallHitRate * 100, 1)}% — some cluster confusion, refinement may help`);
+    }
+    else {
+        summary.push(`Weak discrimination: MRR=${fmt(overallMRR)}, hit rate=${fmt(overallHitRate * 100, 1)}% — entries are too similar within clusters, refinement needed`);
+    }
+    // Alignment summary
+    if (overallGap > 0.05) {
+        summary.push(`Good alignment: gap=${fmt(overallGap)} (self=${fmt(overallSelfAlign)}, sibling=${fmt(overallSibAlign)}), ${fmt(overallUniquelyAligned * 100, 1)}% uniquely aligned — entries preserve chunk-specific signal`);
+    }
+    else if (overallGap > 0) {
+        summary.push(`Weak alignment: gap=${fmt(overallGap)} (self=${fmt(overallSelfAlign)}, sibling=${fmt(overallSibAlign)}), ${fmt(overallUniquelyAligned * 100, 1)}% uniquely aligned — LLM summarization drifts toward cluster-generic direction`);
+    }
+    else {
+        summary.push(`No alignment: gap=${fmt(overallGap)} — entries are not aligned to their source chunks, retrieval via chunk query will fail`);
+    }
+    if (refinementSection) {
+        if (refinementSection.meanMRRDelta > 0.05) {
+            summary.push(`Refinement helps: +${fmt(refinementSection.meanMRRDelta)} MRR on worst clusters — worth implementing`);
+        }
+        else if (refinementSection.meanMRRDelta > 0) {
+            summary.push(`Refinement marginal: +${fmt(refinementSection.meanMRRDelta)} MRR — may not justify the LLM cost`);
+        }
+        else {
+            summary.push(`Refinement unhelpful: ${fmt(refinementSection.meanMRRDelta)} MRR — cluster-aware regeneration doesn't improve discrimination`);
+        }
+    }
+    console.log('\n══ Summary ══\n');
+    for (const line of summary) {
+        console.log(`  • ${line}`);
+    }
+    const report = {
+        timestamp: new Date().toISOString(),
+        totalEntries,
+        eligibleClusters: clusters.length,
+        analysedClusters: clusters.length,
+        similarity: {
+            results: similarityResults,
+            meanCompressionRatio: meanCompression,
+            homogenizedFraction: homogenized / similarityResults.length,
+        },
+        discrimination: {
+            results: discriminationResults,
+            overallMRR,
+            overallHitRate,
+        },
+        alignment: {
+            results: alignmentResults.map((r) => ({
+                clusterId: r.clusterId,
+                clusterName: r.clusterName,
+                entryCount: r.entryCount,
+                meanSelfAlignment: r.meanSelfAlignment,
+                meanSiblingAlignment: r.meanSiblingAlignment,
+                meanAlignmentGap: r.meanAlignmentGap,
+                uniquelyAlignedFraction: r.uniquelyAlignedFraction,
+            })),
+            overallSelfAlignment: overallSelfAlign,
+            overallSiblingAlignment: overallSibAlign,
+            overallAlignmentGap: overallGap,
+            overallUniquelyAligned: overallUniquelyAligned,
+        },
+        refinement: refinementSection,
+        summary,
+    };
+    return report;
+}
+// ── CLI entrypoint ──────────────────────────────────────────────────────────
+import { writeFileSync } from 'fs';
+runExperiment()
+    .then((report) => {
+    const outPath = 'index-differentiation-report.json';
+    writeFileSync(outPath, JSON.stringify(report, null, 2));
+    console.log(`\nReport written to ${outPath}`);
+})
+    .catch((err) => {
+    console.error('Experiment failed:', err);
+    process.exit(1);
+});
+//# sourceMappingURL=run-experiment.js.map

package/dist/eval/experiments/index-differentiation/run-experiment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-experiment.js","sourceRoot":"","sources":["../../../../src/eval/experiments/index-differentiation/run-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACjF,OAAO,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACvF,OAAO,EACL,uBAAuB,EACvB,kBAAkB,GACnB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAG/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAGzD,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC;;;GAGG;AACH,KAAK,UAAU,wBAAwB;IAKrC,0DAA0D;IAC1D,KAAK,EAAE,CAAC;IAER,MAAM,WAAW,GAAG,cAAc,EAAE,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,qBAAqB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAEvD,sBAAsB;IACtB,MAAM,YAAY,GAAG,MAAM,WAAW,CAAC,aAAa,EAAE,CAAC;IACvD,MAAM,YAAY,GAAG,MAAM,gBAAgB,CAAC,aAAa,EAAE,CAAC;IAE5D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAE1E,OAAO,CAAC,GAAG,CAAC,oBAAoB,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IACpD,OAAO,CAAC,GAAG,CAAC,oBAAoB,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IAEpD,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,UAAU,GAAiB,EAAE,CAAC;IACpC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEhD,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEhD,gDAAgD;QAChD,MAAM,cAAc,GAAkC,EAAE,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QAEvC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;YACjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACzC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAE3B,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBAAE,SAAS;gBAE9B,sCAAsC;gBACtC,MAAM,eAAe,GAAe,EAAE,CAAC;gBACvC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;oBACjC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACjC,IAAI,GAAG;wBAAE,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAEnC,6CAA6C;oBAC7C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC5B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;wBAChC,IAAI,KAAK;4BAAE,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;gBAED,cAAc,CAAC,IAAI,CAAC;oBAClB,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,cAAc;oBACd,eAAe;iBAChB,CAAC,CAAC;gBAEH,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,cAAc,CAAC,MAAM,IAAI,uBAAuB,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,OAAO,CAAC,EAAE;gBACrB,WAAW,EAAE,OAAO,CAAC,IAAI;gBACzB,OAAO,EAAE,cAAc;aACxB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAS,GAAG,CAAC,CAAS,EAAE,QAAQ,GAAG,CAAC;IAClC,OAAO,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,aAAa;IAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACzE,MAAM,WAAW,GAAG,cAAc;QAChC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAC5C,CAAC,CAAC,CAAC,CAAC;IAEN,OAAO,CAAC,GAAG,CAAC,kDAAkD,CAAC,CAAC;IAEhE,MAAM,YAAY,GAAG,kBAAkB,EAAE,CAAC;IAC1C,OAAO,CAAC,GAAG,CAAC,wBAAwB,YAAY,EAAE,CAAC,CAAC;IAEpD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,CACT,+FAA+F,CAChG,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,gBAAgB;IAChB,OAAO,CAAC,GAAG,CAAC,gCAAgC,CAAC,CAAC;IAC9C,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,MAAM,wBAAwB,EAAE,CAAC;IAEjF,OAAO,CAAC,GAAG,CAAC,yBAAyB,uBAAuB,cAAc,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7F,OAAO,CAAC,GAAG,CACT,yCAAyC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAC9F,CAAC;IAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,GAAG,CACT,yDAAyD;YACvD,GAAG,uBAAuB,wBAAwB;YAClD,oCAAoC,CACvC,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,6EAA6E;IAE7E,OAAO,CAAC,GAAG,CAAC,sDAAsD,CAAC,CAAC;IACpE,MAAM,iBAAiB,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IAE1D,MAAM,eAAe,GACnB,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC7D,iBAAiB,CAAC,MAAM,CAAC;IAC3B,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,CAC1C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAChC,CAAC,MAAM,CAAC;IAET,OAAO,CAAC,GAAG,CAAC,yEAAyE,CAAC,CAAC;IACvF,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,KAAK,GAAG,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC;QACvG,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,QAAQ,KAAK,EAAE,CAC1H,CAAC;IACJ,CAAC;IACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,aAAa,iBAAiB,CAAC,MAAM,GAAG,EAAE,gBAAgB,CAAC,CAAC;IAC1E,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,+BAA+B,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACnE,OAAO,CAAC,GAAG,CACT,uCAAuC,WAAW,IAAI,iBAAiB,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,WAAW,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAC9I,CAAC;IAEF,6EAA6E;IAE7E,OAAO,CAAC,GAAG,CAAC,wCAAwC,CAAC,CAAC;IACtD,MAAM,qBAAqB,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IAE9D,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QACvE,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACxE,UAAU,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IAClC,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,GAAG,UAAU,CAAC;IACxC,MAAM,cAAc,GAAG,SAAS,GAAG,UAAU,CAAC;IAE9C,OAAO,CAAC,GAAG,CAAC,+DAA+D,CAAC,CAAC;IAC7E,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpE,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAC9G,CAAC;IACJ,CAAC;IACD,IAAI,qBAAqB,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QACtC,OAAO,CAAC,GAAG,CAAC,aAAa,qBAAqB,CAAC,MAAM,GAAG,EAAE,gBAAgB,CAAC,CAAC;IAC9E,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACnD,OAAO,CAAC,GAAG,CAAC,uBAAuB,GAAG,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAEpE,4EAA4E;IAE5E,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;IACrE,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAExD,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACxE,cAAc,IAAI,CAAC,CAAC,iBAAiB,GAAG,UAAU,CAAC;QACnD,aAAa,IAAI,CAAC,CAAC,oBAAoB,GAAG,UAAU,CAAC;QACrD,QAAQ,IAAI,CAAC,CAAC,gBAAgB,GAAG,UAAU,CAAC;QAC5C,WAAW,IAAI,CAAC,CAAC,uBAAuB,GAAG,UAAU,CAAC;QACtD,iBAAiB,IAAI,UAAU,CAAC;IAClC,CAAC;IAED,MAAM,gBAAgB,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,eAAe,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,sBAAsB,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3F,OAAO,CAAC,GAAG,CAAC,4EAA4E,CAAC,CAAC;IAC1F,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpE,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,uBAAuB,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CACzL,CAAC;IACJ,CAAC;IACD,IAAI,gBAAgB,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,aAAa,gBAAgB,CAAC,MAAM,GAAG,EAAE,gBAAgB,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,qDAAqD,GAAG,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;IAC1F,OAAO,CAAC,GAAG,CAAC,uDAAuD,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAC3F,OAAO,CAAC,GAAG,CAAC,mDAAmD,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAClF,OAAO,CAAC,GAAG,CAAC,mDAAmD,GAAG,CAAC,sBAAsB,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAExG,6EAA6E;IAE7E,IAAI,iBAAkE,CAAC;IAEvE,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,+CAA+C,WAAW,uBAAuB,CAAC,CAAC;QAE/F,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAClC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,kBAAkB,CAAC,CAAC,CACtE,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,iBAAiB,CAC/C,QAAQ,EACR,UAAU,EACV,aAAa,EACb,oBAAoB,EACpB,WAAW,CACZ,CAAC;QAEF,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,YAAY,GAChB,iBAAiB,CAAC,MAAM,CACtB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,WAAW,CAAC,EAC5C,CAAC,CACF,GAAG,iBAAiB,CAAC,MAAM,CAAC;YAC/B,MAAM,WAAW,GACf,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,qBAAqB,EAAE,CAAC,CAAC;gBAClE,iBAAiB,CAAC,MAAM,CAAC;YAE3B,OAAO,CAAC,GAAG,CAAC,kEAAkE,CAAC,CAAC;YAChF,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACpE,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,WAAW,CAAC;gBAC3C,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;gBAChE,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,EAAE,CAClH,CAAC;YACJ,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,uBAAuB,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YACtF,OAAO,CAAC,GAAG,CAAC,mCAAmC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YAEhG,0BAA0B;YAC1B,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpF,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;gBACvC,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACxC,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;oBAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;wBAChD,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;wBAC7D,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;wBAC5D,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,iBAAiB,GAAG;gBAClB,OAAO,EAAE,iBAAiB;gBAC1B,YAAY;gBACZ,yBAAyB,EAAE,WAAW;aACvC,CAAC;QACJ,CAAC;IACH,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,GAAG,CAAC,6DAA6D,CAAC,CAAC;IAC7E,CAAC;IAED,6EAA6E;IAE7E,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,OAAO,CAAC,IAAI,CACV,YAAY,QAAQ,CAAC,MAAM,cAAc,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CACvG,CAAC;IAEF,IAAI,eAAe,GAAG,IAAI,EAAE,CAAC;QAC3B,OAAO,CAAC,IAAI,CACV,uCAAuC,GAAG,CAAC,eAAe,CAAC,aAAa,GAAG,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,6BAA6B,CACzI,CAAC;IACJ,CAAC;SAAM,IAAI,eAAe,GAAG,IAAI,EAAE,CAAC;QAClC,OAAO,CAAC,IAAI,CACV,4CAA4C,GAAG,CAAC,eAAe,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,6BAA6B,CAC9I,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CACV,mCAAmC,GAAG,CAAC,eAAe,CAAC,uCAAuC,CAC/F,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QACrB,OAAO,CAAC,IAAI,CACV,8BAA8B,GAAG,CAAC,UAAU,CAAC,cAAc,GAAG,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC,CAAC,iDAAiD,CACzI,CAAC;IACJ,CAAC;SAAM,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CACV,gCAAgC,GAAG,CAAC,UAAU,CAAC,cAAc,GAAG,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC,CAAC,iDAAiD,CAC3I,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CACV,4BAA4B,GAAG,CAAC,UAAU,CAAC,cAAc,GAAG,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC,CAAC,gEAAgE,CACtJ,CAAC;IACJ,CAAC;IAED,oBAAoB;IACpB,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CACV,uBAAuB,GAAG,CAAC,UAAU,CAAC,UAAU,GAAG,CAAC,gBAAgB,CAAC,aAAa,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,sBAAsB,GAAG,GAAG,EAAE,CAAC,CAAC,6DAA6D,CAC9M,CAAC;IACJ,CAAC;SAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CACV,uBAAuB,GAAG,CAAC,UAAU,CAAC,UAAU,GAAG,CAAC,gBAAgB,CAAC,aAAa,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,sBAAsB,GAAG,GAAG,EAAE,CAAC,CAAC,gFAAgF,CACjO,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CACV,qBAAqB,GAAG,CAAC,UAAU,CAAC,wFAAwF,CAC7H,CAAC;IACJ,CAAC;IAED,IAAI,iBAAiB,EAAE,CAAC;QACtB,IAAI,iBAAiB,CAAC,YAAY,GAAG,IAAI,EAAE,CAAC;YAC1C,OAAO,CAAC,IAAI,CACV,sBAAsB,GAAG,CAAC,iBAAiB,CAAC,YAAY,CAAC,6CAA6C,CACvG,CAAC;QACJ,CAAC;aAAM,IAAI,iBAAiB,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAC9C,OAAO,CAAC,IAAI,CACV,yBAAyB,GAAG,CAAC,iBAAiB,CAAC,YAAY,CAAC,qCAAqC,CAClG,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CACV,yBAAyB,GAAG,CAAC,iBAAiB,CAAC,YAAY,CAAC,kEAAkE,CAC/H,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,MAAM,GAA0B;QACpC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,YAAY;QACZ,gBAAgB,EAAE,QAAQ,CAAC,MAAM;QACjC,gBAAgB,EAAE,QAAQ,CAAC,MAAM;QACjC,UAAU,EAAE;YACV,OAAO,EAAE,iBAAiB;YAC1B,oBAAoB,EAAE,eAAe;YACrC,mBAAmB,EAAE,WAAW,GAAG,iBAAiB,CAAC,MAAM;SAC5D;QACD,cAAc,EAAE;YACd,OAAO,EAAE,qBAAqB;YAC9B,UAAU;YACV,cAAc;SACf;QACD,SAAS,EAAE;YACT,OAAO,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACpC,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,iBAAiB,EAAE,CAAC,CAAC,iBAAiB;gBACtC,oBAAoB,EAAE,CAAC,CAAC,oBAAoB;gBAC5C,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;gBACpC,uBAAuB,EAAE,CAAC,CAAC,uBAAuB;aACnD,CAAC,CAAC;YACH,oBAAoB,EAAE,gBAAgB;YACtC,uBAAuB,EAAE,eAAe;YACxC,mBAAmB,EAAE,UAAU;YAC/B,sBAAsB,EAAE,sBAAsB;SAC/C;QACD,UAAU,EAAE,iBAAiB;QAC7B,OAAO;KACR,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAE/E,OAAO,EAAE,aAAa,EAAE,MAAM,IAAI,CAAC;AAEnC,aAAa,EAAE;KACZ,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;IACf,MAAM,OAAO,GAAG,mCAAmC,CAAC;IACpD,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,CAAC,GAAG,CAAC,uBAAuB,OAAO,EAAE,CAAC,CAAC;AAChD,CAAC,CAAC;KACD,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;IACb,OAAO,CAAC,KAAK,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAAC;IACzC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/eval/experiments/index-differentiation/similarity-analysis.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Phase 1: Intra-cluster similarity analysis.
+ *
+ * For each cluster with 3+ index entries, compute:
+ * - Mean pairwise cosine similarity between index entry embeddings
+ * - Mean pairwise cosine similarity between raw chunk embeddings
+ * - Compression ratio (entry_sim / chunk_sim)
+ *
+ * If ratio > 1, the LLM compression homogenized the entries (bad for discrimination).
+ * If ratio < 1, the LLM naturally differentiates entries (good).
+ */
+import type { ClusterSimilarityResult } from './types.js';
+/** Input: a cluster ready for analysis, with matched embeddings. */
+export interface ClusterForAnalysis {
+    clusterId: string;
+    clusterName: string | null;
+    entries: Array<{
+        entryId: string;
+        entryEmbedding: number[];
+        chunkEmbeddings: number[][];
+    }>;
+}
+/**
+ * Analyse similarity for a single cluster.
+ */
+export declare function analyseCluster(cluster: ClusterForAnalysis): ClusterSimilarityResult;
+/**
+ * Run similarity analysis across all eligible clusters.
+ */
+export declare function runSimilarityAnalysis(clusters: ClusterForAnalysis[]): ClusterSimilarityResult[];
+//# sourceMappingURL=similarity-analysis.d.ts.map

package/dist/eval/experiments/index-differentiation/similarity-analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity-analysis.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/index-differentiation/similarity-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,YAAY,CAAC;AAE1D,oEAAoE;AACpE,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,KAAK,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,eAAe,EAAE,MAAM,EAAE,EAAE,CAAC;KAC7B,CAAC,CAAC;CACJ;AAqBD;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,kBAAkB,GAAG,uBAAuB,CAwBnF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,kBAAkB,EAAE,GAC7B,uBAAuB,EAAE,CAE3B"}

package/dist/eval/experiments/index-differentiation/similarity-analysis.js

@@ -0,0 +1,60 @@
+/**
+ * Phase 1: Intra-cluster similarity analysis.
+ *
+ * For each cluster with 3+ index entries, compute:
+ * - Mean pairwise cosine similarity between index entry embeddings
+ * - Mean pairwise cosine similarity between raw chunk embeddings
+ * - Compression ratio (entry_sim / chunk_sim)
+ *
+ * If ratio > 1, the LLM compression homogenized the entries (bad for discrimination).
+ * If ratio < 1, the LLM naturally differentiates entries (good).
+ */
+import { cosineSimilarity } from '../../../utils/angular-distance.js';
+/**
+ * Compute pairwise cosine similarity statistics for a set of vectors.
+ * Returns mean and standard deviation.
+ */
+function pairwiseStats(vectors) {
+    if (vectors.length < 2)
+        return { mean: 1.0, stdDev: 0 };
+    const sims = [];
+    for (let i = 0; i < vectors.length; i++) {
+        for (let j = i + 1; j < vectors.length; j++) {
+            sims.push(cosineSimilarity(vectors[i], vectors[j]));
+        }
+    }
+    const mean = sims.reduce((a, b) => a + b, 0) / sims.length;
+    const variance = sims.reduce((a, b) => a + (b - mean) ** 2, 0) / sims.length;
+    return { mean, stdDev: Math.sqrt(variance) };
+}
+/**
+ * Analyse similarity for a single cluster.
+ */
+export function analyseCluster(cluster) {
+    const entryEmbeddings = cluster.entries.map((e) => e.entryEmbedding);
+    const entryStats = pairwiseStats(entryEmbeddings);
+    // For chunk comparison, take the first chunk embedding per entry
+    // (entries are 1:1 with chunks currently)
+    const chunkEmbeddings = cluster.entries
+        .flatMap((e) => e.chunkEmbeddings)
+        .filter((e) => e.length > 0);
+    const chunkStats = pairwiseStats(chunkEmbeddings);
+    const compressionRatio = chunkStats.mean > 0 ? entryStats.mean / chunkStats.mean : 1.0;
+    return {
+        clusterId: cluster.clusterId,
+        clusterName: cluster.clusterName,
+        entryCount: cluster.entries.length,
+        chunkCount: chunkEmbeddings.length,
+        meanEntryPairSim: entryStats.mean,
+        meanChunkPairSim: chunkStats.mean,
+        compressionRatio,
+        entrySimStdDev: entryStats.stdDev,
+    };
+}
+/**
+ * Run similarity analysis across all eligible clusters.
+ */
+export function runSimilarityAnalysis(clusters) {
+    return clusters.map(analyseCluster);
+}
+//# sourceMappingURL=similarity-analysis.js.map

package/dist/eval/experiments/index-differentiation/similarity-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity-analysis.js","sourceRoot":"","sources":["../../../../src/eval/experiments/index-differentiation/similarity-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AActE;;;GAGG;AACH,SAAS,aAAa,CAAC,OAAmB;IACxC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAExD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7E,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAA2B;IACxD,MAAM,eAAe,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,aAAa,CAAC,eAAe,CAAC,CAAC;IAElD,iEAAiE;IACjE,0CAA0C;IAC1C,MAAM,eAAe,GAAG,OAAO,CAAC,OAAO;SACpC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC;SACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/B,MAAM,UAAU,GAAG,aAAa,CAAC,eAAe,CAAC,CAAC;IAElD,MAAM,gBAAgB,GACpB,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IAEhE,OAAO;QACL,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM;QAClC,UAAU,EAAE,eAAe,CAAC,MAAM;QAClC,gBAAgB,EAAE,UAAU,CAAC,IAAI;QACjC,gBAAgB,EAAE,UAAU,CAAC,IAAI;QACjC,gBAAgB;QAChB,cAAc,EAAE,UAAU,CAAC,MAAM;KAClC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,QAA8B;IAE9B,OAAO,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;AACtC,CAAC"}

package/dist/eval/experiments/index-differentiation/types.d.ts

@@ -0,0 +1,114 @@
+/**
+ * Types for the index entry differentiation experiment.
+ *
+ * Tests whether semantic index entries within the same cluster are
+ * too similar, and whether cluster-aware refinement improves discrimination.
+ */
+/** Per-cluster similarity analysis. */
+export interface ClusterSimilarityResult {
+    clusterId: string;
+    clusterName: string | null;
+    entryCount: number;
+    chunkCount: number;
+    /** Mean pairwise cosine similarity between index entry embeddings. */
+    meanEntryPairSim: number;
+    /** Mean pairwise cosine similarity between raw chunk embeddings. */
+    meanChunkPairSim: number;
+    /**
+     * Ratio of entry similarity to chunk similarity.
+     * > 1 = entries more similar (compression homogenized)
+     * < 1 = entries more different (LLM differentiates naturally)
+     * = 1 = no change
+     */
+    compressionRatio: number;
+    /** Standard deviation of pairwise entry similarities. */
+    entrySimStdDev: number;
+}
+/** Discrimination test: can we find the right entry among cluster siblings? */
+export interface DiscriminationResult {
+    clusterId: string;
+    clusterName: string | null;
+    entryCount: number;
+    /** Mean reciprocal rank for finding the correct entry when querying by its description embedding. */
+    meanReciprocalRank: number;
+    /** Fraction of entries where correct entry was rank 1 among cluster siblings. */
+    hitRate: number;
+    /** Per-entry discrimination scores (for analysis). */
+    perEntry: Array<{
+        entryId: string;
+        rankAmongSiblings: number;
+        correctSimilarity: number;
+        bestSiblingSimilarity: number;
+    }>;
+}
+/** Refinement comparison: baseline vs cluster-aware regeneration. */
+export interface RefinementResult {
+    clusterId: string;
+    clusterName: string | null;
+    entryCount: number;
+    baselineMRR: number;
+    refinedMRR: number;
+    baselineHitRate: number;
+    refinedHitRate: number;
+    /** How much compression ratio changed (negative = more differentiated). */
+    compressionRatioDelta: number;
+    /** Sample refined descriptions for inspection. */
+    sampleRefinements: Array<{
+        entryId: string;
+        original: string;
+        refined: string;
+    }>;
+}
+/** Full experiment report. */
+export interface DifferentiationReport {
+    timestamp: string;
+    /** Total index entries in the system. */
+    totalEntries: number;
+    /** Total clusters with 3+ index entries (experiment-eligible). */
+    eligibleClusters: number;
+    /** Total clusters analysed. */
+    analysedClusters: number;
+    similarity: {
+        results: ClusterSimilarityResult[];
+        /** Mean compression ratio across all eligible clusters. */
+        meanCompressionRatio: number;
+        /** Fraction of clusters where entries are more similar than chunks. */
+        homogenizedFraction: number;
+    };
+    discrimination: {
+        results: DiscriminationResult[];
+        /** Overall MRR across all entries in all clusters. */
+        overallMRR: number;
+        /** Overall hit rate (correct entry at rank 1). */
+        overallHitRate: number;
+    };
+    alignment?: {
+        results: Array<{
+            clusterId: string;
+            clusterName: string | null;
+            entryCount: number;
+            meanSelfAlignment: number;
+            meanSiblingAlignment: number;
+            meanAlignmentGap: number;
+            uniquelyAlignedFraction: number;
+        }>;
+        /** Overall mean self-alignment (entry ↔ own chunk). */
+        overallSelfAlignment: number;
+        /** Overall mean sibling alignment (entry ↔ other chunks). */
+        overallSiblingAlignment: number;
+        /** Overall mean alignment gap (self - sibling). */
+        overallAlignmentGap: number;
+        /** Overall fraction of entries uniquely aligned to own chunk. */
+        overallUniquelyAligned: number;
+    };
+    refinement?: {
+        results: RefinementResult[];
+        /** Mean MRR improvement from refinement. */
+        meanMRRDelta: number;
+        /** Mean compression ratio change. */
+        meanCompressionRatioDelta: number;
+    };
+    /** Human-readable summary. */
+    summary: string[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/eval/experiments/index-differentiation/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/index-differentiation/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,uCAAuC;AACvC,MAAM,WAAW,uBAAuB;IACtC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IAEnB,sEAAsE;IACtE,gBAAgB,EAAE,MAAM,CAAC;IACzB,oEAAoE;IACpE,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,gBAAgB,EAAE,MAAM,CAAC;IACzB,yDAAyD;IACzD,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,+EAA+E;AAC/E,MAAM,WAAW,oBAAoB;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,qGAAqG;IACrG,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iFAAiF;IACjF,OAAO,EAAE,MAAM,CAAC;IAChB,sDAAsD;IACtD,QAAQ,EAAE,KAAK,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;QAChB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,iBAAiB,EAAE,MAAM,CAAC;QAC1B,qBAAqB,EAAE,MAAM,CAAC;KAC/B,CAAC,CAAC;CACJ;AAED,qEAAqE;AACrE,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,2EAA2E;IAC3E,qBAAqB,EAAE,MAAM,CAAC;IAC9B,kDAAkD;IAClD,iBAAiB,EAAE,KAAK,CAAC;QACvB,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC,CAAC;CACJ;AAED,8BAA8B;AAC9B,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,yCAAyC;IACzC,YAAY,EAAE,MAAM,CAAC;IACrB,kEAAkE;IAClE,gBAAgB,EAAE,MAAM,CAAC;IACzB,+BAA+B;IAC/B,gBAAgB,EAAE,MAAM,CAAC;IAGzB,UAAU,EAAE;QACV,OAAO,EAAE,uBAAuB,EAAE,CAAC;QACnC,2DAA2D;QAC3D,oBAAoB,EAAE,MAAM,CAAC;QAC7B,uEAAuE;QACvE,mBAAmB,EAAE,MAAM,CAAC;KAC7B,CAAC;IAGF,cAAc,EAAE;QACd,OAAO,EAAE,oBAAoB,EAAE,CAAC;QAChC,sDAAsD;QACtD,UAAU,EAAE,MAAM,CAAC;QACnB,kDAAkD;QAClD,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;IAGF,SAAS,CAAC,EAAE;QACV,OAAO,EAAE,KAAK,CAAC;YACb,SAAS,EAAE,MAAM,CAAC;YAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;YAC3B,UAAU,EAAE,MAAM,CAAC;YACnB,iBAAiB,EAAE,MAAM,CAAC;YAC1B,oBAAoB,EAAE,MAAM,CAAC;YAC7B,gBAAgB,EAAE,MAAM,CAAC;YACzB,uBAAuB,EAAE,MAAM,CAAC;SACjC,CAAC,CAAC;QACH,uDAAuD;QACvD,oBAAoB,EAAE,MAAM,CAAC;QAC7B,6DAA6D;QAC7D,uBAAuB,EAAE,MAAM,CAAC;QAChC,mDAAmD;QACnD,mBAAmB,EAAE,MAAM,CAAC;QAC5B,iEAAiE;QACjE,sBAAsB,EAAE,MAAM,CAAC;KAChC,CAAC;IAGF,UAAU,CAAC,EAAE;QACX,OAAO,EAAE,gBAAgB,EAAE,CAAC;QAC5B,4CAA4C;QAC5C,YAAY,EAAE,MAAM,CAAC;QACrB,qCAAqC;QACrC,yBAAyB,EAAE,MAAM,CAAC;KACnC,CAAC;IAEF,8BAA8B;IAC9B,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB"}

package/dist/eval/experiments/index-differentiation/types.js

@@ -0,0 +1,8 @@
+/**
+ * Types for the index entry differentiation experiment.
+ *
+ * Tests whether semantic index entries within the same cluster are
+ * too similar, and whether cluster-aware refinement improves discrimination.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/eval/experiments/index-differentiation/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/eval/experiments/index-differentiation/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/eval/experiments/index-vs-chunk/jeopardy-experiment.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Jeopardy vs Summary Index Entry Comparison
+ *
+ * A/B test comparing two index entry generation strategies:
+ *   A) Summary-style: "This chunk discusses configuring ESLint..."
+ *   B) Jeopardy-style: "How to fix ESLint module resolution with TS path aliases?"
+ *
+ * For a sample of chunks:
+ *   1. Gather existing summary entries + embeddings
+ *   2. Generate Jeopardy entries + embed them
+ *   3. Generate natural language search queries (independent ground truth)
+ *   4. For each query, find the ground truth chunk among all sample entries
+ *   5. Compare recall: which entry style is found more often?
+ *
+ * Usage:
+ *   npx tsx src/eval/experiments/index-vs-chunk/jeopardy-experiment.ts [--sample-size N]
+ */
+export {};
+//# sourceMappingURL=jeopardy-experiment.d.ts.map

package/dist/eval/experiments/index-vs-chunk/jeopardy-experiment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"jeopardy-experiment.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/index-vs-chunk/jeopardy-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}