Do We Need an LLM to Know Why Sources Conflict? Decision Models for Knowledge-Conflict Typing in RAG

Parv Khatri, Harshul Jain, Mehak Kapoor, Tanya Sah

Independent Researcher

Published October 27, 2026 · on the feed November 4, 2026 · ▲ 5 · arXiv 2610.36915

Retrieval, memory & search Code arXiv ↗Hugging Face ↗

The abstract

When the sources retrieved for a query disagree, the right response depends on why they disagree: a question with several valid answers, a contested topic, stale information and a false source each call for different behaviour. Cattan et al. (2025) showed that telling a generator the conflict type improves its responses by about 24 points, but that predicting the type is hard even for frontier LLMs. We study whether typed decision models, which return probabilities over fixed options in a single forward pass instead of generating text, can do this classification fast and cheaply. Using the CONFLICTS benchmark and the original paper's prompt verbatim, we evaluate all 11 decision models served by one commercial inference gateway, from 7 providers, against Gemini models on identical inputs. Asked directly, the decision models reach 50.0--67.0% accuracy; 10 of the 11 match or exceed Gemini 2.5 Flash, the paper's model (61.3%), at 4--39x lower billed cost (2 were free) and 2.6--6.0x lower latency. The current Gemini 3.8 Flash (70.0%) is significantly more accurate than 8 of them, but sending each decision model's least confident quarter of queries to it gives a cascade statistically tied with it for 8 of the 11, at 25--37% of its cost. End to end, answers generated with the types of 10 of the 11 follow the expected behaviour as often as with the LLM's types. Decomposing the taxonomy into yes/no questions lowers accuracy for every model, and a repair fitted on one model does not transfer. Pre-specified diagnostics show that dates play no measurable role and that sensitivity to source order varies widely between models. Decision models detect a planted false source less reliably than the LLM as hard labels, but their probabilities still separate planted from clean sources. We release code, prompts and all model outputs at https://github.com/Parv17k/decision-models-conflict-typing.

The Brief

2:39

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Do We Need an LLM to Know Why Sources Conflict? Decision Models for Knowledge-Conflict Typing in RAG. By Parv Khatri and three others, working independently. Published on the twenty-seventh of October.

When the sources retrieved for a query disagree, the right response depends on why. A question with several valid answers, a contested topic, stale information and a false source each call for different behaviour. Earlier work by Cattan and colleagues showed that telling a generator the conflict type improves its responses by about twenty-four points, but that predicting the type is hard even for frontier LLMs. This study asks whether the prediction needs an LLM at all. Typed decision models return probabilities over fixed options in a single forward pass instead of generating text, and the answer is that they can match the model used in that earlier work, faster and far more cheaply, though not the newest one.

The setup holds everything else fixed. Using the CONFLICTS benchmark and the original paper's prompt word for word, the authors evaluate all eleven decision models served by one commercial inference gateway, drawn from seven providers, against Gemini models on identical inputs. Asked directly, the decision models reach between fifty and sixty-seven percent accuracy. Ten of the eleven match or exceed Gemini two point five Flash, the original paper's model, which scores sixty-one point three percent. They do so at four to thirty-nine times lower billed cost, with two of them free, and at two point six to six times lower latency.

The current Gemini three point eight Flash, at seventy percent, is significantly more accurate than eight of them. A cascade narrows that gap. Send each decision model's least confident quarter of queries to the Gemini model, and for eight of the eleven the result is statistically tied with it, at twenty-five to thirty-seven percent of its cost. End to end, answers generated with the types from ten of the eleven decision models follow the expected behaviour as often as answers generated with the LLM's types.

There are limits, and the study charts them. Breaking the taxonomy into yes or no questions lowers accuracy for every model, and a repair fitted on one model does not transfer. Pre-specified diagnostics show that dates play no measurable role, while sensitivity to the order of sources varies widely between models. Decision models also detect a planted false source less reliably than the LLM when read as hard labels, though their probabilities still separate planted sources from clean ones. All of this rests on one benchmark, one prompt, and one gateway's catalogue of models.

The title's question gets a qualified no. For knowing why sources conflict, a classifier that outputs probabilities can stand in for a generating model on most of the work, and its confidence is useful in its own right: it picks out which queries deserve escalation. The expensive model becomes the exception rather than the default.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.