Skip to content
Preprint

Same Agent, Different Answers: A Repeat-Aware Audit of Corpus-Induced Answer Churn in Retrieval-Augmented QA

Aug 2026 · 0 citations · 78 references
Computer Science

TL;DR

The hidden phenomenon accuracy-blind answer churn is called and the Snapshot Compatibility Audit is introduced, which estimates excess answer churn by subtracting same-snapshot repeat disagreement from cross-snapshot disagreement.

Abstract

A retrieval-augmented QA system can return different answers after an index expansion even when its requested model identifier, prompt, retrieval policy, evidence depth, rendering, and exposed generation controls are held fixed. Aggregate accuracy may hide these changes when gains and losses cancel, while ordinary generation variability makes one-shot comparisons overstate update effects. We call the hidden phenomenon accuracy-blind answer churn and introduce the \emph{Snapshot Compatibility Audit}, which estimates excess answer churn by subtracting same-snapshot repeat disagreement from cross-snapshot disagreement. We instantiate it by expanding one frozen FineWeb prefix from one to seven shards. In a preregistered 400-question Natural Questions study, normalized-exact and blinded-semantic excess churn are 6.44 and 10.25 percentage points while exact-match accuracy changes by only $-1.50$ points. A post-hoc analysis finds repeat-stable semantic flips on 40/400 questions. A separately preregistered 200-question TriviaQA study yields smaller, directionally consistent excess churn while exact-match accuracy moves in the opposite direction. An outcome-blind post-hoc 100-question subset replication with a second DeepSeek generator and serving configuration finds 8.75 pp of semantic excess churn even as exact match rises by 3.00 percentage points. Answer-level compatibility can therefore fail without a conspicuous or consistently directed utility shift. Retrieval-augmented releases should audit compatibility alongside utility.

View source

Similar papers

Jul 2026

Beyond Self-Knowledge: Propagating Uncertainty Across Reasoning and Retrieval in LLMs

BeyondUncertainty first elicits a structured provisional answer and confidence estimate, then applies a model-specific threshold selected on held-out validation data and frozen before test evaluation, revealing a trade-off between more selective evidence acquisition and end-to-end token efficiency.

Chandan Kumar Sah, Xiaoli Lian, Li Zhang · 0 citations
Open access Aug 2026

TRACE-QA: Task-routed constraint elimination for auditable multi-agent question answering

The proposed TRACE-QA, a training-free multi-agent protocol that routes each instance to a sparse set of reasoning operators, constructs option-blind necessity constraints, audits every candidate in a structured elimination ledger, revisits risky eliminations through global risk-aware rescue, and aggregates role-specialized judge votes, supports constraint-guided elimination as an auditable alternative to answer-first debate.

Jia-Xin Lu, Hao Chen, Yan-Cheng Zhu et al. · 0 citations
Preprint Jul 2026

Inject or Navigate? Token-Efficient Retrieval for LLM Analysis of Transactional Legal Documents

A closed-form caching-crossover rule is derived: cached injection is cheaper in dollars only while the corpus stays below roughly ten times the retrieval payload, and cached injection is cheaper in dollars only while the corpus stays below roughly ten times the retrieval payload.

Mahmoud Hany, Mourad ElSheraey, Mahmoud Said et al. · 0 citations
#small language model Open access Aug 2026

Retrieval Granularity as Evidence Design in Small-Model RAG Question Answering: A Diagnostic HotpotQA Study

Results align with a diagnostic perspective on chunking: using evidence at a task-appropriate level of granularity can improve grounding, auditability, and answer quality, but the observed patterns should be interpreted within the HotpotQA distractor setting, fixed generator, and tested context budgets.

Wei-Mao Ke, Li-Xia Yang, Meng-Yang Xu · 0 citations
Preprint Aug 2026

When Your Agent Opens the Chat App: Agent-Controlled Search over Raw Chat Logs Rivals Structured Memory

The results indicate that for precise, evidence-grounded questions over chat archives, much of the benefit credited to elaborate memory structures is recoverable by giving an agent controllable search over the unmodified record, with no LLM-based index construction at all.

Ruizhe Li, L. Zhang, Benfeng Xu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.