Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); feat(quality): measure and gate near-duplicate knowledge pages by drewstone · Pull Request #148 · tangle-network/agent-knowledge · GitHub
Skip to content
6 changes: 6 additions & 0 deletions src/rag-eval.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -20,6 +20,12 @@ export type {
RagRequiredContext,
} from './rag-eval/contracts'
export { scoreKnowledgeBaseIndex } from './rag-eval/knowledge-base'
export type {
NearDuplicateDetectionOptions,
NearDuplicatePair,
NearDuplicateReport,
} from './rag-eval/near-duplicates'
export { detectNearDuplicatePages, normalizePageText } from './rag-eval/near-duplicates'
export {
normalizeExternalRagScores,
toDeepEvalTestCases,
Expand Down
11 changes: 11 additions & 0 deletions src/rag-eval/contracts.ts
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
import type { ComparisonCost, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'
import type { AgentCandidateJsonValue as JsonValue } from '@tangle-network/agent-interface'
import type { RagGapFinding } from '../rag-improvement-loop'
import type { NearDuplicateDetectionOptions, NearDuplicateReport } from './near-duplicates'

export type RagEvalProvider =
| 'agent-knowledge'
Expand DownExpand Up@@ -166,6 +167,10 @@ export interface KnowledgeBaseQualityOptions {
strict?: boolean
minCitationRate?: number
maxStaleSourceRate?: number
/** Deterministic exact/near-duplicate detector configuration. */
nearDuplicates?: NearDuplicateDetectionOptions
/** Maximum allowed fraction of eligible pages implicated in a duplicate pair. Defaults to 1. */
maxNearDuplicatePageRate?: number
}

export interface KnowledgeBaseQualityReport {
Expand All@@ -179,7 +184,13 @@ export interface KnowledgeBaseQualityReport {
duplicate_source_hash_rate: number
lint_error_count: number
lint_warning_count: number
/** Added in the deterministic near-duplicate quality pass. */
near_duplicate_page_rate?: number
near_duplicate_page_count?: number
near_duplicate_pair_count?: number
}
/** Exact report from the deterministic detector; present when produced by this package. */
nearDuplicates?: NearDuplicateReport
findings: readonly RagGapFinding[]
}

Expand Down
45 changes: 44 additions & 1 deletion src/rag-eval/knowledge-base.ts
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,6 +3,7 @@ import type { RagGapFinding } from '../rag-improvement-loop'
import type { KnowledgeIndex } from '../types'
import { validateKnowledgeIndex } from '../validate'
import type { KnowledgeBaseQualityOptions, KnowledgeBaseQualityReport } from './contracts'
import { detectNearDuplicatePages } from './near-duplicates'

export function scoreKnowledgeBaseIndex(
index: KnowledgeIndex,
Expand All@@ -25,6 +26,11 @@ export function scoreKnowledgeBaseIndex(
(page) => sourceRefs(page.text).length > 0,
).length
const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length
const nearDuplicates = detectNearDuplicatePages(index.pages, options.nearDuplicates)
const maxNearDuplicatePageRate = unitInterval(
options.maxNearDuplicatePageRate ?? 1,
'maxNearDuplicatePageRate',
)
const metrics = {
page_count: index.pages.length,
source_count: index.sources.length,
Expand All@@ -35,6 +41,9 @@ export function scoreKnowledgeBaseIndex(
index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,
lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,
lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,
near_duplicate_page_rate: nearDuplicates.duplicatePageRate,
near_duplicate_page_count: nearDuplicates.duplicatePageCount,
near_duplicate_pair_count: nearDuplicates.duplicatePairCount,
}
const findings: RagGapFinding[] = []
if (metrics.lint_error_count > 0) {
Expand DownExpand Up@@ -64,7 +73,34 @@ export function scoreKnowledgeBaseIndex(
evidence: { stale_source_rate: metrics.stale_source_rate },
})
}
return { ok: findings.length === 0, metrics, findings }
if (nearDuplicates.truncated && maxNearDuplicatePageRate < 1) {
findings.push({
id: 'kb:near-duplicate-analysis-truncated',
kind: 'unknown',
severity: 'error',
message:
'Near-duplicate analysis reached a configured bound, so the duplicate-page gate cannot be evaluated completely.',
evidence: {
candidate_pair_count: nearDuplicates.candidatePairCount,
compared_pair_count: nearDuplicates.comparedPairCount,
duplicate_pair_count: nearDuplicates.duplicatePairCount,
},
})
} else if (metrics.near_duplicate_page_rate > maxNearDuplicatePageRate) {
findings.push({
id: 'kb:near-duplicate-page-rate',
kind: 'unknown',
severity: 'error',
message: 'Near-duplicate page rate exceeds the configured maximum.',
evidence: {
near_duplicate_page_rate: metrics.near_duplicate_page_rate,
near_duplicate_page_count: metrics.near_duplicate_page_count,
near_duplicate_pair_count: metrics.near_duplicate_pair_count,
threshold: nearDuplicates.threshold,
},
})
}
return { ok: findings.length === 0, metrics, nearDuplicates, findings }
}

function sourceRefs(text: string): string[] {
Expand All@@ -77,3 +113,10 @@ function sourceRefs(text: string): string[] {
}
return refs
}

function unitInterval(value: number, name: string): number {
if (!Number.isFinite(value) || value < 0 || value > 1) {
throw new Error(`${name} must be a finite number in [0, 1]`)
}
return value
}
204 changes: 204 additions & 0 deletions src/rag-eval/near-duplicates.test.ts
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,204 @@
import { describe, expect, it } from 'vitest'
import type { KnowledgeIndex, KnowledgePage } from '../types'
import { scoreKnowledgeBaseIndex } from './knowledge-base'
import { detectNearDuplicatePages, normalizePageText } from './near-duplicates'

const repeated =
'A verified research page explains the mechanism, records the experiment, names the evidence, and preserves the result for later agents. '

function page(id: string, title: string, text: string): KnowledgePage {
return {
id,
path: `knowledge/${id}.md`,
title,
text,
frontmatter: { id, title },
sourceIds: [],
tags: [],
outLinks: [],
}
}

function index(pages: KnowledgePage[]): KnowledgeIndex {
return {
root: '/kb',
generatedAt: '2026-08-17T00:00:00.000Z',
sources: [],
pages,
graph: { nodes: [], edges: [] },
}
}

describe('detectNearDuplicatePages', () => {
it('reports exact normalized copies with stable page identity', () => {
const pages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
]

const report = detectNearDuplicatePages(pages)

expect(report).toMatchObject({
pageCount: 2,
eligiblePageCount: 2,
candidatePairCount: 1,
comparedPairCount: 1,
duplicatePairCount: 1,
duplicatePageCount: 2,
duplicatePageRate: 1,
truncated: false,
})
expect(report.pairs).toEqual([
expect.objectContaining({
leftPageId: 'copy-a',
rightPageId: 'copy-b',
similarity: 1,
exact: true,
}),
])
})

it('finds near copies but not unrelated prose', () => {
const base = `${repeated.repeat(2)} The decisive measured value is forty two.`
const revised = `${repeated.repeat(2)} The decisive measured value is forty three.`
const unrelated =
'A kitchen inventory lists pans, knives, towels, plates, and groceries for a weekend dinner. '.repeat(
3,
)

const report = detectNearDuplicatePages(
[
page('base', 'Experiment', base),
page('revision', 'Experiment', revised),
page('unrelated', 'Kitchen', unrelated),
],
{ threshold: 0.7 },
)

expect(report.duplicatePairCount).toBe(1)
expect(report.pairs[0]).toMatchObject({
leftPageId: 'base',
rightPageId: 'revision',
exact: false,
})
expect(report.pairs[0]!.similarity).toBeGreaterThanOrEqual(0.7)
})

it('is deterministic under input reordering', () => {
const pages = [
page('z', 'Same title', repeated.repeat(2)),
page('a', 'Same title', repeated.repeat(2)),
page('m', 'Different title', `${repeated.repeat(2)} extra material`),
]

const forward = detectNearDuplicatePages(pages, { threshold: 0.7 })
const reverse = detectNearDuplicatePages([...pages].reverse(), { threshold: 0.7 })

expect(reverse).toEqual(forward)
})

it('excludes short pages and reports bounded candidate truncation', () => {
const short = detectNearDuplicatePages(
[page('short-a', 'Short', 'same'), page('short-b', 'Short', 'same')],
{ minCharacters: 80 },
)
expect(short).toMatchObject({ eligiblePageCount: 0, duplicatePairCount: 0 })

const bounded = detectNearDuplicatePages(
Array.from({ length: 4 }, (_, index) =>
page(`copy-${index}`, 'Same title', repeated.repeat(2)),
),
{ maxCandidatePairs: 2 },
)
expect(bounded).toMatchObject({
candidatePairCount: 2,
comparedPairCount: 2,
truncated: true,
})
})

it('normalizes Unicode width, case, whitespace, and URL identity', () => {
expect(normalizePageText('ALPHA https://example.com/a\nBeta')).toBe('alpha <url> beta')
})

it('refuses malformed detector limits', () => {
expect(() => detectNearDuplicatePages([], { threshold: 1.1 })).toThrow(/threshold/)
expect(() => detectNearDuplicatePages([], { maxCandidatePairs: 0 })).toThrow(
/maxCandidatePairs/,
)
expect(() => detectNearDuplicatePages([], { minCharacters: -1 })).toThrow(/minCharacters/)
})
})

describe('scoreKnowledgeBaseIndex near-duplicate quality', () => {
const duplicatePages = [
page('copy-a', 'Same title', repeated.repeat(2)),
page('copy-b', 'Same title', repeated.repeat(2)),
page(
'independent',
'Independent result',
'A separate proof studies a different theorem, with distinct assumptions and a different verification artifact. '.repeat(
3,
),
),
]

it('always reports deterministic duplicate metrics without failing by default', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages))

expect(report.ok).toBe(true)
expect(report.metrics).toMatchObject({
near_duplicate_page_rate: 0.666667,
near_duplicate_page_count: 2,
near_duplicate_pair_count: 1,
})
expect(report.nearDuplicates?.pairs).toHaveLength(1)
})

it('fails a configured duplicate-page gate with measured evidence', () => {
const report = scoreKnowledgeBaseIndex(index(duplicatePages), {
maxNearDuplicatePageRate: 0.5,
})

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({
id: 'kb:near-duplicate-page-rate',
severity: 'error',
evidence: expect.objectContaining({
near_duplicate_page_rate: 0.666667,
near_duplicate_pair_count: 1,
}),
}),
]),
)
})

it('fails closed when a configured gate rests on truncated analysis', () => {
const report = scoreKnowledgeBaseIndex(
index(
Array.from({ length: 4 }, (_, position) =>
page(`copy-${position}`, 'Same title', repeated.repeat(2)),
),
),
{
nearDuplicates: { maxCandidatePairs: 1 },
maxNearDuplicatePageRate: 0.9,
},
)

expect(report.ok).toBe(false)
expect(report.findings).toEqual(
expect.arrayContaining([
expect.objectContaining({ id: 'kb:near-duplicate-analysis-truncated' }),
]),
)
})

it('refuses a malformed quality threshold', () => {
expect(() =>
scoreKnowledgeBaseIndex(index(duplicatePages), { maxNearDuplicatePageRate: -0.1 }),
).toThrow(/maxNearDuplicatePageRate/)
})
})
Loading