Byte-Exact Deduplication in Retrieval-Augmented Generation: A Three-Regime Empirical Analysis Across Public Benchmarks
On the map: Retrieval-augmented generation → Generation and context integration
Abstract (arXiv)
This preprint presents an empirical analysis of byte-exact chunk-level deduplication in Retrieval-Augmented Generation (RAG) pipelines. We measure context reduction across three distinct operating regimes: clean academic retrieval (0.16% byte reduction on 22.2M BeIR passages), constructed enterprise patterns (24.03% reduction), and multi-turn conversational AI (80.34% reduction). To validate quality preservation, we conducted a cross-vendor 5-judge calibrated panel evaluation across four production APIs (Google Gemini 2.5 Flash, Anthropic Claude Sonnet 4.6, Meta Llama 3.3 70B, and OpenAI GPT-5.1). Applying a five-category human-in-the-loop noise-removal protocol to panel-majority materially different (MAT) pairs, we establish that byte-exact deduplication introduces zero measurable quality regression. Post-audit, all four vendors clear the strict <5% Wilson 95% upper-bound MAT threshold in both the clean and high-redundancy RAG regimes. This work demonstrates that substantial inference compute savings can be achieved deterministically without compromising evaluation-grade model quality.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 17 of its 23 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
17 of 23 references.
Closest ancestors · 3
Same direction, newest first
- 2026Prompt Compression in the Wild: Measuring Latency, Rate Adherence, and Quality for Faster LLM Inference3 Apr
- 2026Rethinking Soft Compression in Retrieval-Augmented Generation: A Query-Conditioned Selector Perspective25 Jan
- 2025REFRAG: Rethinking RAG based Decoding1 Sep
Other references · 14
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2022Quantifying Memorization Across Neural Language Modelscited by 763
- 2021Deduplicating Training Data Makes Language Models Bettercited by 714
- 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 453
- 2023Scalable Extraction of Training Data from (Production) Language Modelscited by 434
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 348
- 2023LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Modelscited by 336
- 2023SemDeDup: Data-efficient learning at web-scale through semantic deduplicationcited by 303
- 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 287
- 2023FinanceBench: A New Benchmark for Financial Question Answeringcited by 270
- 2023D4: Improving LLM Pretraining via Document De-Duplication and Diversificationcited by 150
- 2024The Mosaic Memory of Large Language Modelscited by 10
2 more
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026A Frozen 12B Beats Frontier Models on Verified Work: 100% Accuracy, 0 Tokens, Bit-Exact, Forevercited by 2
- 2026Working Around the Compute Ceiling: Byte-Exact Memory in Galahad Makes LLM Reading a One-Time Cost LLM Reading a One-Time Costcited by 1
- 2026The Recall Trap: A Recall-Maximizing Retriever Configuration Reduces Issue Resolution in Fixed-Budget Code Contextcited by 0
- 2026Finding the Right Balance: Relevance and Diversity in LLM Retrievalcited by 0
- 2026Finding the Right Balance: Relevance and Diversity in LLM Retrieval7 Oct 2026
- 2026Working Around the Compute Ceiling: Byte-Exact Memory in Galahad Makes LLM Reading a One-Time Cost LLM Reading a One-Time Cost30 Sep 2026
- 2026The Recall Trap: A Recall-Maximizing Retriever Configuration Reduces Issue Resolution in Fixed-Budget Code Context14 Aug 2026
- 2026A Frozen 12B Beats Frontier Models on Verified Work: 100% Accuracy, 0 Tokens, Bit-Exact, Forever26 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2025Optimizing Retrieval-Augmented Generation: Analysis of Hyperparameter Impact on Performance and Efficiency
- 2025Stronger Baselines for Retrieval-Augmented Generation with Long-Context Language Models
- 2026Faithfulness Is Not Free: Auditing Offline KV-Cache Quantization in Retrieval-Augmented Generation
- 2026RAGStress: A controlled benchmark for evaluating retrieval-augmented generation under knowledge-base degradation
- 2026A Systems-Level Analysis of Sensitivity, Robustness, and Stability in Retrieval-Augmented Generation
- 2025A New HOPE: Domain-agnostic Automatic Evaluation of Text Chunking
- 2026A Systematic Analysis of Chunking Strategies for Reliable Question Answering
- 2024Toward Optimal Search and Retrieval for RAG