ReliableRAG: Combating Misinformation in Retrieval-Augmented Generation via Reliability-Guided Reasoning Chains

# ReliableRAG: Combating Misinformation in Retrieval-Augmented Generation via Reliability-Guided Reasoning Chains
Source: [https://arxiv.org/html/2608.25487](https://arxiv.org/html/2608.25487)
DOI:[XXXXXXX\.XXXXXXX](https://doi.org/XXXXXXX.XXXXXXX)Conference:; November 10–14, 2026; Rio de Janeiro, BrazilCCS:Computing methodologies Natural language processingCCS:Information systems Information retrievalJinpu JiangNote:Equal Contribution\.Affiliation:College of Software, Jilin University,Changchun,Jilin,Chinaemail:[jiangjp24@mails\.jlu\.edu\.cn](mailto:[email protected])Xuan WuAffiliation:College of Computer Science and Technology, Jilin University,Changchun,Jilin,Chinaemail:[wuuu22@mails\.jlu\.edu\.cn](mailto:[email protected]),Wenhao SongAffiliation:College of Software, Jilin University,Changchun,Jilin,Chinaemail:[songwh23@mails\.jlu\.edu\.cn](mailto:[email protected]),Bo YangAffiliation:Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University,Changchun,Jilin,Chinaemail:[ybo@jlu\.edu\.cn](mailto:[email protected]),You ZhouAffiliation:Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University,Changchun,Jilin,Chinaemail:[zyou@jlu\.edu\.cn](mailto:[email protected]),Hongwei GeAffiliation:College of Computer Science and Technology, Dalian University of Technology,Dalian,Liaoning,Chinaemail:[hwge@dlut\.edu\.cn](mailto:[email protected]),Heow Pueh LeeAffiliation:Department of Mechanical Engineering, National University of Singapore,Singaporeemail:[mpeleehp@nus\.edu\.sg](mailto:[email protected]),Yanchun LiangAffiliation:School of Computer Science, Zhuhai College of Science and Technology,Zhuhai,Guangdong,Chinaemail:[ycliang@jlu\.edu\.cn](mailto:[email protected])andChunguo WuNote:Corresponding Authors\.Affiliation:Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University,Changchun,Jilin,Chinaemail:[wucg@jlu\.edu\.cn](mailto:[email protected])

2018

###### Abstract\.

Retrieval\-Augmented Generation \(RAG\) has emerged as a potent system architecture for addressing Question Answering \(QA\) tasks by integrating external information into Large Language Models \(LLMs\)\. However, the proliferation of false, inaccurate, and misleading information in news and social media poses a challenge to real\-world RAG systems, particularly in multi\-hop QA where complex, multi\-step reasoning is easily misled by even a single deceptive misinformation segment within the misinformation\-polluted source documents\. While existing approaches primarily adopt paradigms of implicit alignment or explicit regulation to mitigate this issue, their inability to perceive fine\-grained information reliability makes them highly susceptible to fine\-grained deceptive misinformation that is semantically aligned with the question but factually incorrect, ultimately leading to the generation of erroneous answers\. To address this limitation, we propose ReliableRAG, which, to the best of our knowledge, is the first reliability\-driven framework designed to prevent the misleading effects of deceptive misinformation in multi\-hop QA through the evaluation of fine\-grained individual triples\. Specifically, ReliableRAG first extracts information segments from source documents and represents them as fine\-grained structured triples\. It then performs fine\-grained reliability quantification by synthesizing query\-triple semantic relevance and triple credibility, ensuring the retention of only the top\-KKmost reliable and non\-redundant triples\. By autoregressively constructing robust reasoning chains from these refined triples, the framework effectively consolidates trustworthy information and filters out deceptive misinformation, ensuring accurate answers that is faithful to reliable information\. Experimental results on three multi\-hop QA datasets demonstrate that ReliableRAG outperforms existing methods, significantly enhancing the factual reliability and robustness of RAG systems under deceptive misinformation injection\.

###### Keywords:

Retrieval\-Augmented Generation, Multi\-hop QA, Misinformation Robustness, Reasoning Chains

## 1\.Introduction

Retrieval\-Augmented Generation \(RAG\), a potent system architecture for Question Answering \(QA\) tasks, empowers Large Language Models \(LLMs\) by incorporating external information\([Lewis et al\., 2020](https://arxiv.org/html/2608.25487#bib.bib1);[Shen et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib45);[Zhang et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib14)\)\. To resolve multi\-hop QA tasks that require complex, multi\-step reasoning\([Yang et al\., 2018](https://arxiv.org/html/2608.25487#bib.bib11);[Ho et al\., 2020](https://arxiv.org/html/2608.25487#bib.bib12);[Trivedi et al\., 2022](https://arxiv.org/html/2608.25487#bib.bib13)\), this system requires retrieving the top\-KKdocuments most relevant to the given questionQQfrom a vast Web corpus to aggregate complementary information across disparate sources\. These documents are then prepended to the question, with the resulting concatenation serving as the input to an LLM\-based generator to produce the final answer\([Ramesh et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib18)\)\. However, the reliability of RAG can be substantially compromised when the retrieved documents contain maliciously generated deceptive misinformation, ultimately degrading their overall performance\([Pan et al\., 2023b](https://arxiv.org/html/2608.25487#bib.bib2);[Pan et al\., 2023a](https://arxiv.org/html/2608.25487#bib.bib3);[Garbacea et al\., 2019](https://arxiv.org/html/2608.25487#bib.bib40);[Zellers et al\., 2019](https://arxiv.org/html/2608.25487#bib.bib41)\), particularly in multi\-hop Question Answering \(QA\) tasks\. In such scenarios, even a few deceptive misinformation segments may propagate through the reasoning process, triggering a cascade of errors that corrupts the entire reasoning chain and yields incorrect answers\([Bhuiya et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib31);[Wu et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib26);[Huang et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib16);[Kazlaris et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib25)\)\.

![Refer to caption](https://arxiv.org/html/2608.25487v1/fig1_9.png)

Figure 1\.Illustration of the differences between existing methods and ReliableRAG under the interference of misinformation\. Green text denotes the correct answer, while red text represents a misleading incorrect answer\. While implicit alignment and explicit regulation paradigms often falter when faced with semantically similar fine\-grained deceptive misinformation, thereby leading to incorrect answers, ReliableRAG identifies the fine\-grained reliability of information and constructs robust reasoning chains to prevent deceptive misinformation, ensuring accurate answers\.To improve the robustness of RAG facing misinformation in multi\-hop QA, Recent studies primarily adopt two paradigms, namely implicit alignment and explicit regulation\. Specifically, implicit alignment methods achieve this by training models to internalize criteria such as self\-reflection signals, learned decision policies, or credibility awareness, enabling them to autonomously regulate reliance on retrieved information during generation and thereby enhance factual accuracy in retrieval\-augmented systems\([Asai et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib30);[Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4);[Lin et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib29)\)\. However, these methods necessitate substantial computational resources and high\-quality training data which are often difficult to acquire\([Devine, 2025](https://arxiv.org/html/2608.25487#bib.bib47)\)\. Moreover, the inherent domain gap between specialized training datasets and real\-world test scenarios limits their generalization\([Zeng et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib46)\)\. In contrast, explicit regulation approaches explicitly regulate the model’s reliance on retrieved information using external signals such as document credibility scores \(i\.e\., the extent to which a document is free from misinformation\) or knowledge graph structures, thereby enhancing factual accuracy and robustness in RAG systems\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10);[Liu et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib28)\)\. Despite these advancements, current explicit regulation methods exhibit critical shortcomings in perceiving fine\-grained information reliability\. As illustrated in Figure[1](https://arxiv.org/html/2608.25487#S1.F1), these approaches often fail to discern between highly relevant but factually incorrect fine\-grained deceptive misinformation, leading them to be misled by such misinformation\. These misinformation subsequently propagate through and undermine the entire reasoning chain, ultimately yielding inaccurate answers\([Bhuiya et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib31);[Zou et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib27)\)\. Therefore, in this work, we investigate the following research question:

Can we equip RAG systems with fine\-grained reliability awareness to discern deceptive misinformation within fine\-grained information, and thereby prevent its propagation during multi\-hop reasoning?

To address this research question, we propose ReliableRAG, which, to the best of our knowledge, is the first reliability\-driven framework designed to prevent the misleading effects of deceptive misinformation in multi\-hop QA through the evaluation of fine\-grained individual triples\. The framework achieves this through three integrated modules: Triple Extraction, Triple Evaluation, and Chain Construction, which operate across two distinct phases\. In the offline phase, the Triple Extraction module pre\-processes each source document into fine\-grained structured triple representations\. Subsequently, an LLM\-based evaluator is employed to pre\-assess these triples and assign each an interpretable credibility score \(i\.e\., the extent to which a triple is free from misinformation\)\. Collectively, these steps provide fine\-grained information and pre\-computed factors for subsequent retrieval and inference\. During online phase, given the questionQQ, the Triple Evaluation module first dynamically formulates a unique search query for every individual existing reasoning chain constructed from the preceding hop by prepending its accumulated information to the questionQQ\. This one\-to\-one mapping ensures that each query is uniquely tailored to its corresponding chain to retrieve the supplementary information required to extend that chain further\. Leveraging these queries, the module quantifies the reliability of each triple by synthesizing two factors: query\-triple semantic relevance and triple credibility\. Based on these fine\-grained reliability scores, the module selects the top\-KKmost reliable and non\-redundant triples for each existing chain, thereby filtering out those containing deceptive misinformation to provide a highly trustworthy search space for constructing candidate reasoning chains for the current hop\. Operating within this search space, the Chain Construction module employs a beam search strategy to autoregressively construct multiple candidate reasoning chains\. Specifically, the module employs a multiple\-option reasoning prompt to guide an LLM\-based selector in deciding, for each existing chain, whether to append the most probable triple from the search space to expand it, or to execute an early termination if the accumulated information within it is already sufficient to answerQQ\. Simultaneously, the module updates the confidence score of each candidate chain based on the probability of the selector’s decision\. According to these updated scores, only the top\-FFmost confident candidate chains are retained as the input for the subsequent hop\. In this manner, the iterative cycle of Triple Evaluation and Chain Construction continues until all chains terminate or a maximum hop limit is reached\. Ultimately, the framework synthesizes the final robust chains into a refined and reliable supporting context, denoted as𝒵\\mathcal\{Z\}\. This𝒵\\mathcal\{Z\}is prepended to the questionQQto form a unified input𝒳\\mathcal\{X\}, which is fed into the generator to produce the final answer\.

To evaluate the effectiveness of ReliableRAG, we conduct extensive experiments on three multi\-hop QA datasets adversarially augmented with deceptive misinformation\. The experimental results demonstrate that ReliableRAG outperforms existing methods across all datasets, effectively mitigating the interference of misinformation\. Further analyses indicate that by anchoring reasoning in reliable triples, our framework enhances the factual reliability and robustness of the RAG system, enabling more accurate answers even under deceptive misinformation injection\.

The key contributions of this work are as follows\.

I\)We discover that prioritizing fine\-grained reliability at the triple level facilitates the filtering of fine\-grained deceptive misinformation, thereby preventing its propagation and promoting more robust and reliable multi\-hop reasoning\.

II\)We propose ReliableRAG, which, to the best of our knowledge, is the first reliability\-driven framework that features a novel Triple Evaluation module to dynamically quantify fine\-grained information reliability at the triple level, thus preventing the misleading effects of deceptive misinformation in multi\-hop QA and constructing a highly trustworthy search space\.

III\)ReliableRAG seamlessly integrates the Triple Evaluation module into the reasoning pipeline, enabling the Chain Construction module to leverage a highly trustworthy search space to autoregressively construct robust, multi\-hop reasoning chains that are anchored in reliable triples, thereby preventing misinformation propagation before generating the final answer\.

IV\)We conduct extensive experiments on three multi\-hop QA datasets adversarially augmented with deceptive misinformation\. The results demonstrate that ReliableRAG significantly outperforms existing methods, thereby enhancing the factual reliability and robustness of RAG systems and validating its effectiveness in systematically preventing misinformation propagation throughout the reasoning process\.

## 2\.Related Work

RAG advancements in multi\-hop QA improve performance by facilitating the reasoning process through techniques such as iterative search, Reasoning with Attributions, and preference optimization\([Trivedi et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib17);[Li et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib32);[Liu et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib33)\)\. However, these systems are vulnerable to misinformation, where plausible distractors or adversarial passages can significantly degrade performance and poison the generation process\([Zhou et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib5);[Bhuiya et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib31);[Wang et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib34);[Su et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib35)\)\. To address this, prior work has evolved from early feature\-based classification methods\([Kaliyar et al\., 2021](https://arxiv.org/html/2608.25487#bib.bib6);[Kaliyar and Singh, 2019](https://arxiv.org/html/2608.25487#bib.bib7);[Vaibhav et al\., 2019](https://arxiv.org/html/2608.25487#bib.bib19)\)to modern LLM\-based credibility assessment approaches\([Pelrine et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib8);[Quelle and Bovet, 2024](https://arxiv.org/html/2608.25487#bib.bib9)\)to detect misinformation\. Based on this, recent studies have advanced robustness through two primary paradigms: implicit alignment and explicit regulation\([Liu et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib28);[Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10);[Lin et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib29);[Asai et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib30);[Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4)\)\.

![Refer to caption](https://arxiv.org/html/2608.25487v1/fig2_12.png)

Figure 2\.The overall pipeline of the ReliableRAG framework\. ReliableRAG first employs the Triple Extraction module to extract information segments from documents and represent them as structured triples\. Subsequently, the Triple Evaluation module performs fine\-grained reliability quantification by synthesizing query\-triple semantic relevance and triple credibility, ensuring the retention of only the top\-KKmost reliable and non\-redundant triples for robust multi\-hop reasoning\. Leveraging these refined triples, the Chain Construction module autoregressively constructs robust reasoning chains to consolidate trustworthy information and filter out deceptive misinformation, ultimately ensuring the generation of accurate answers\.Implicit alignment methods achieve this by training models to internalize criteria such as self\-reflection signals, learned decision policies, or credibility awareness, enabling them to autonomously regulate reliance on retrieved information during generation and thereby enhance factual accuracy in retrieval\-augmented systems\. For instance, Asai et al\.\([Asai et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib30)\)introduced a framework that generates reflection tokens to adaptively judge retrieval necessity and output relevance, thereby filtering out erroneous content\. Pan et al\.\([Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4)\)employed instruction fine\-tuning to teach LLMs to differentiate and process information according to provided credibility indicators\. Similarly, Lin et al\.\([Lin et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib29)\)utilized a reinforcement learning approach to balance internal parametric knowledge with external context, allowing the LLM to fall back on its own knowledge when encountering misleading information\. However, these methods necessitate substantial computational resources and high\-quality training data which are often difficult to acquire\([Devine, 2025](https://arxiv.org/html/2608.25487#bib.bib47)\)\. Moreover, the inherent domain gap between specialized training datasets and real\-world test scenarios limits their generalization\([Zeng et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib46)\)\. In contrast, explicit regulation approaches explicitly regulate the model’s reliance on retrieved information using external signals such as credibility scores or knowledge graph structures, thereby enhancing factual accuracy and robustness in RAG systems\. Deng et al\.\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\)mitigated the influence of low\-credibility documents by attenuating their corresponding attention weights during the decoding process\. However, this approach relies on coarse\-grained, document\-level credibility scores, failing to perceive the fine\-grained information reliability required for robust multi\-hop QA\. Furthermore, Liu et al\.\([Liu et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib28)\)proposed constructing knowledge graphs to identify factual\-level conflicts via entropy\-based filtering, effectively blocking the propagation of misinformation\. Nevertheless, this method retrieves fine\-grained structured triples based solely on semantic similarity, which may fail to discern fine\-grained deceptive misinformation that is semantically aligned with the question but factually incorrect\. Such misinformation subsequently propagates through and undermines the entire reasoning chain, ultimately yielding inaccurate answers\([Bhuiya et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib31);[Zou et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib27)\)\.

To address these limitations, we introduce ReliableRAG, a training\-free framework that transforms documents into structured triples to quantify fine\-grained reliability via query\-triple semantic relevance and triple credibility, constructing robust reasoning chains to consolidate trustworthy information and filter out deceptive misinformation\.

## 3\.ReliableRAG

Given a multi\-hop questionQQ, the objective is to derive a correct answeraaby identifying and integrating the top\-KKdocuments most relevant toQQfrom the given set of documents𝒟=\{d1,d2,…,dN\}\\mathcal\{D\}=\\\{d\_\{1\},d\_\{2\},\\dots,d\_\{N\}\\\}, within at mostLLreasoning hops\. These documents are pre\-retrieved from external sources such as Wikipedia\([Trivedi et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib17)\), where each documentdjd\_\{j\}comprises a title and the corresponding text\. However, RAG is vulnerable to misinformative documents that are semantically relevant toQQbut factually incorrect, which can mislead the LLM\-based generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}into producing erroneous answers\. To address this limitation, as illustrated in Figure[2](https://arxiv.org/html/2608.25487#S2.F2), we introduce ReliableRAG, which comprises three core modules, namely Triple Extraction, Triple Evaluation, and Chain Construction\. The source code of ReliableRAG is available online anonymously111https://anonymous\.4open\.science/r/ReliableRAG\-734C\.

### 3\.1\.Triple Extraction

Although LLMs are capable of processing long contexts, directly reasoning over coarse\-grained documents often suffers from the lost\-in\-the\-middle phenomenon\([Liu et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib44)\), wherein LLMs tend to overlook critical information located in the middle of long inputs\. This phenomenon is further exacerbated in multi\-hop QA tasks, where relevant evidence is scattered across multiple documents, thereby making it easier for the generator to overlook key information and hindering the production of accurate answers\.

To address this limitation, we incorporate this module that transforms each documentdi∈𝒟d\_\{i\}\\in\\mathcal\{D\}, consisting of a title and text content, into multiple fine\-grained structured triples, each comprising a subject, predicate, and object\. Specifically, we leverage the In\-Context Learning \(ICL\) ability of LLMs\([Schoch and Ji, 2025](https://arxiv.org/html/2608.25487#bib.bib36);[Dong et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib20)\)to prompt the LLM\-based extractorℳext\\mathcal\{M\}\_\{\\text\{ext\}\}to extract triples \(see Appendix[G\.1](https://arxiv.org/html/2608.25487#A7.SS1)for experiments on various extractors\)\. To facilitate fine\-grained processing, the text content of target documentdid\_\{i\}is first segmented into individual sentences based on periods\. Following recent studies on knowledge graph construction\([Fang et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib15);[Wei et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib42);[Zhang and Soh, 2024](https://arxiv.org/html/2608.25487#bib.bib43)\), the extraction process is guided by an extraction prompt that incorporates both the documentdid\_\{i\}\(its title and segmented sentences\) and three in\-context exemplars\. These three exemplars are the ones most semantically similar to the title and text ofdid\_\{i\}, selected from a manually annotated set while ensuring no overlap with the test datasets\. Given this prompt, the extractorℳext\\mathcal\{M\}\_\{\\text\{ext\}\}identifies the title, along with information segments within each sentence, as entities, subsequently inferring the relationships between them\. This strategy leverages the inherent relevance between the title and each sentence within the text content, ensuring that both the extracted entities and their inferred relationships are substantively anchored to the core topic\. Through this parallelized process, a single document yields multiple structured triples, which collectively form the set of triples𝒯\\mathcal\{T\}for the questionQQ:

\(1\)𝒯=\{tj=\(sj,pj,oj\)\}j=1M\\displaystyle\\mathcal\{T\}=\\\{t\_\{j\}=\(s\_\{j\},p\_\{j\},o\_\{j\}\)\\\}\_\{j=1\}^\{M\}wheresj,pj,ojs\_\{j\},p\_\{j\},o\_\{j\}denote the subject, predicate, and object of thejj\-th triple, respectively, withM≥KM\\geq K\. By adopting this design, this module produces a structured set of triples, thereby mitigating the lost\-in\-the\-middle issue\. Ablation studies demonstrate that this module significantly contributes to the overall performance \(see Section[4\.3](https://arxiv.org/html/2608.25487#S4.SS3)for details\)\.

### 3\.2\.Triple Evaluation

In this subsection, we delineate the process of Triple Evaluation, which comprises Chain Definition and Query Formulation followed by Fine\-grained Reliability Quantification\.

#### 3\.2\.1\.Chain Definition and Query Formulation

To search for the required information to autoregressively construct reasoning chains, we follow the query formulation in prior studies\([Sun et al\., 2019](https://arxiv.org/html/2608.25487#bib.bib48);[Trivedi et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib17);[Fang et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib15)\)\. Let𝒞i=\{uji\}j=1\|𝒞i\|\\mathcal\{C\}^\{i\}=\\\{u^\{i\}\_\{j\}\\\}^\{\|\\mathcal\{C\}^\{i\}\|\}\_\{j=1\}denote the set of reasoning chains maintained at hopii, where\|𝒞i\|\|\\mathcal\{C\}^\{i\}\|represents the current number of reasoning chains\. Notably, the superscriptiiindicates the current reasoning hop rather than the actual depth of each individual chain\. During online inference, the process begins at hopi=1i=1with a primary queryq1q^\{1\}is first initialized solely from the questionQQto trigger the construction of the initial reasoning chains𝒞1\\mathcal\{C\}^\{1\}\. For subsequent hopsi∈\{2,…,L\}i\\in\\\{2,\\dots,L\\\}, a set of dynamic queries\{qji\}j=1\|𝒞i−1\|\\\{\{q^\{i\}\_\{j\}\}\\\}\_\{j=1\}^\{\|\\mathcal\{C\}^\{i\-1\}\|\}is generated based on the existing chains in𝒞i−1\\mathcal\{C\}^\{i\-1\}\. Specifically, each queryqjiq^\{i\}\_\{j\}is formed by prepending its corresponding reasoning chainuji−1u^\{i\-1\}\_\{j\}to the questionQQ, thereby representing the triple information required at current hopiito further addressQQ\.

#### 3\.2\.2\.Fine\-grained Reliability Quantification

Since the documents contain deceptive misinformation, the extracted triples are also prone to inheriting misleading misinformation\. These triples can propagate through the reasoning process, triggering a cascade of errors that corrupts the entire reasoning chain and ultimately leads to incorrect answers\([Bhuiya et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib31);[Wu et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib26);[Huang et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib16);[Kazlaris et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib25)\)\. To address this, we propose a dual\-factor perception mechanism that formulates a fine\-grained reliability score by synthesizing the triple’s semantic relevance to queryqjiq^\{i\}\_\{j\}with triple credibility \(i\.e\., the extent to which the triple is free from misinformation\), thereby selecting the top\-KKmost reliable triples from𝒯\\mathcal\{T\}for eachqjiq^\{i\}\_\{j\}at each hop\. To obtain the fine\-grained reliability score, we first measure the semantic relevance of each triple to the queryqjiq^\{i\}\_\{j\}\. Specifically, we employ a bi\-encoder \(see Appendix[F\.2](https://arxiv.org/html/2608.25487#A6.SS2)for experiments on different bi\-encoder\) to mapqjiq^\{i\}\_\{j\}and each tripletk∈𝒯t\_\{k\}\\in\\mathcal\{T\}into a unified feature space\. Each tripletkt\_\{k\}is represented as a formatted string⟨sk;pk;ok⟩\\langle s\_\{k\};p\_\{k\};o\_\{k\}\\rangle\. By encoding both the query and these formatted strings, we obtain the dense vector representationshji,hk∈ℝHh^\{i\}\_\{j\},h\_\{k\}\\in\\mathbb\{R\}^\{H\}, whereHHdenotes the dimensionality of the embedding space\. The semantic relevance is then quantified by the cosine similarity between these vectors, reflecting how closely the information within the triple matches the query’s intent:

\(2\)Φ⁡\(hji,hk\)=hji⋅hk‖hji‖​‖hk‖\\displaystyle\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)=\\frac\{h^\{i\}\_\{j\}\\cdot h\_\{k\}\}\{\\\|h^\{i\}\_\{j\}\\\|\\\|h\_\{k\}\\\|\}A higher value ofΦ⁡\(hji,hk\)\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)indicates a stronger semantic match\. However, high semantic relevance alone does not guarantee the reliability of selected triples, as semantically relevant triples may still be factually incorrect\. This motivates the need for an additional criterion to assess their credibility\. Unlike recent studies that assign credibility scores to entire documents\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10);[Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4)\), we propose a fine\-grained assessment framework that operates at the triple level\. Specifically, this framework evaluates each tripletk=\(sk,pk,ok\)t\_\{k\}=\(s\_\{k\},p\_\{k\},o\_\{k\}\)based on its basic components: the subject, the predicate, and the object\. It employs the LLM\-based evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}to perform fine\-grained analyses on the credibility of these components \(see Appendix[G\.3](https://arxiv.org/html/2608.25487#A7.SS3)for experiments on different evaluators\)\. Based on this qualitative analysis, the evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}subsequently derives an interpretable credibility score, denoted asηk\\eta\_\{k\}, for each triple, which is assigned as an additional, respective attribute\. This process consists of the following steps:

Step 1:Entity Credibility Analysis\. The subjectsks\_\{k\}and objectoko\_\{k\}are first independently analyzed to determine whether they represent authentic and established entities rather than spurious or hallucinated concepts\. This stage provides the analytical basis regarding the factual existence of components for the subsequent evaluation\.

Step 2:Relational Credibility Analysis\. Building upon the entity analysis, the relationship described by the predicatepkp\_\{k\}between subjectsks\_\{k\}and objectoko\_\{k\}is analyzed to verify its authentic coherence\. For instance, in the triple\(Albert Einstein, was the first recipient in 1921 of, the Nobel Prize in Physics\), the analysis recognizes that while the entities are authentic, the specific relational claim is spurious\. This provides the logical rationale for determining the triple’s credibility\.

Step 3:Synthesis and Quantitative Scoring\. Finally, the qualitative insights from the preceding steps are integrated to generate a finalized credibility score ranging from 0 to 10\. This synthesis ensures that the numerical result is grounded in the established analytical steps, reflecting a comprehensive judgment of both entity and relational credibility\.

The aforementioned analytical steps are performed by leveraging the ICL ability of the LLM\. By employing prompts with few\-shot demonstrations, the reasoning behavior of the evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}is constrained to align with this triple\-level assessment framework’s logic\. To enhance scalability, the framework utilizes parallel invocations for large\-scale assessment by pre\-assigning credibility scores to the triples𝒯\\mathcal\{T\}associated with each questionQQin an offline manner\. The specific prompt structure and design for this assessment are detailed in Appendix[B](https://arxiv.org/html/2608.25487#A2)\. Upon deriving the semantic relevanceΦ⁡\(hji,hk\)\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)between each queryqjiq^\{i\}\_\{j\}and each tripletk∈𝒯t\_\{k\}\\in\\mathcal\{T\}, alongside the per\-triple credibility scoreηk\\eta\_\{k\}, the dual\-factor perception mechanism synthesizes these factors into the fine\-grained reliability score\. Formally, this fine\-grained reliability score is computed as:

\(3\)Rj,ki=α⋅Φ⁡\(hji,hk\)\+\(1−α\)⋅ηk\\displaystyle R^\{i\}\_\{j,k\}=\\alpha\\cdot\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)\+\(1\-\\alpha\)\\cdot\\eta\_\{k\}whereα∈\[0,1\]\\alpha\\in\[0,1\]is a balancing coefficient\. As each queryqjiq^\{i\}\_\{j\}evolve at each hopii, the semantic relevanceΦ⁡\(hji,hk\)\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)is updated and the fine\-grained reliability scoreRj,kiR^\{i\}\_\{j,k\}is re\-computed accordingly\. To avoid the redundant selection of information, we mask the fine\-grained reliability scores of triples already included in the existing reasoning chains𝒞i−1\\mathcal\{C\}^\{i\-1\}with an extremely large negative value before ranking\. For each queryqjiq^\{i\}\_\{j\}, this penalization ensures that the subsequent selection prioritizes unexplored information\. Accordingly, we denote𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}as the set of top\-KKmost reliable triples selected from the set𝒯\\mathcal\{T\}for each queryqjiq^\{i\}\_\{j\}\. Furthermore, these triples are both semantically relevant toqjiq^\{i\}\_\{j\}and credible, serves as a highly trustworthy search space to facilitate the construction of the reasoning chains𝒞i\\mathcal\{C\}^\{i\}at hopii\. Experimental results in Section[4\.4\.2](https://arxiv.org/html/2608.25487#S4.SS4.SSS2)demonstrate that the dual\-factor perception mechanism effectively filters out deceptive misinformation by identifying reliable triples\. This mechanism plays a crucial role in providing effective guidance for constructing reasoning chains, thereby significantly enhancing the ReliableRAG’s overall robustness and final answer accuracy\.

### 3\.3\.Chain Construction

The objective of this module is to autoregressively construct robust reasoning chains by adopting a beam search strategy, where at each hopii, the chain for each queryqjiq^\{i\}\_\{j\}is progressively constructed by utilizing its respective set of top\-KKmost reliable triples𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}\. Unlike the prior study\([Fang et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib15)\)that are susceptible to deceptive misinformation during chain construction, our approach uniquely prioritizes and leverages reliable triples to build robust reasoning chains\. Specifically, we employ a multiple\-option reasoning prompt to guide the LLM\-based selectorℳsel\\mathcal\{M\}\_\{\\text\{sel\}\}in identifying the top\-BBmost probable triples from the set𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}to construct multiple candidate reasoning chains \(experiments on different selectors are provided in Appendix[G\.2](https://arxiv.org/html/2608.25487#A7.SS2)\)\. Formally, at each hopii, the reasoning prompt is formulated as follows:

\(4\)Iji=Ψ⁡\(Instr,Exemp,qji,𝒮ji\)\\displaystyle I^\{i\}\_\{j\}=\\Psi\(\\text\{Instr\},\\text\{Exemp\},q^\{i\}\_\{j\},\\mathcal\{S\}^\{i\}\_\{j\}\)whereInstrandExempdenote the task instruction and the three in\-context exemplars most semantically similar to the current questionQQ, selected from a manually annotated set, respectively\. Following the prior study\([Fang et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib15)\), these exemplars are curated to maintain no overlap with the test datasets\. To construct the promptIjiI^\{i\}\_\{j\}, the functionΨ⁡\(⋅\)\\Psi\(\\cdot\)first incorporates a specific task instruction and the selected exemplars into the context to guide the reasoning process\. Subsequently, it organizes the termination option and the set of reliable triples𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}into an enumerated list\. In this list, the termination option is assigned to option A, indicating that the current reasoning chainuji−1∈𝒞i−1u^\{i\-1\}\_\{j\}\\in\\mathcal\{C\}^\{i\-1\}is sufficient to answer the questionQQ\. The triples in𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}are then sequentially mapped to the subsequent option labels, such as B, C, D, and so forth, to form the complete candidate options\. Guided by the reasoning promptIjiI^\{i\}\_\{j\}, the LLM\-based selectorℳsel\\mathcal\{M\}\_\{\\text\{sel\}\}identifies the label corresponding to the termination signal or the next possible triple that best facilitates answering the questionQQ\. By extracting the probability distribution over all option labels fromℳsel\\mathcal\{M\}\_\{\\text\{sel\}\}, we select top\-BBhighest\-probability options to make multiple next\-hop decisions\. This selection is formulated as follows:

\(5\)ℰji=Top−⁡Bek​\(Pℳsel​\(ek∣Iji\)\)\\displaystyle\\mathcal\{E\}^\{i\}\_\{j\}=\\operatorname\{Top\-\}B\_\{e\_\{k\}\}\\Big\(P\_\{\\mathcal\{M\}\_\{\\text\{sel\}\}\}\(e\_\{k\}\\mid I^\{i\}\_\{j\}\)\\Big\)whereℰji\\mathcal\{E\}^\{i\}\_\{j\}denotes the set of theBBhighest\-probability options selected according to the probability distribution\. Subsequently, for each selected optionek∈ℰjie\_\{k\}\\in\\mathcal\{E\}^\{i\}\_\{j\}, the previous reasoning chainuji−1u^\{i\-1\}\_\{j\}undergoes branching to form a candidate reasoning chain for current hopii, contingent on the type of the selected option\. Specifically, ifeke\_\{k\}represents the termination signal, the chainuji−1u^\{i\-1\}\_\{j\}is designated as a candidate reasoning chain for current hopiiwithout further expansion\. Otherwise, it is expanded by appending the tripletk∈𝒮jit\_\{k\}\\in\\mathcal\{S\}^\{i\}\_\{j\}corresponding to the chosen option label\. This branching process uses the beam search strategy to allow for the parallel exploration of multiple promising candidate chains, and is formally defined as:

\(6\)umi=\{uji−1,ek​is option Aor​uji−1​is already terminated,uji−1⊕tk,otherwise,\\displaystyle u^\{i\}\_\{m\}=\\begin\{cases\}u^\{i\-1\}\_\{j\},&e\_\{k\}\\text\{ is option A\}\\text\{ or \}u^\{i\-1\}\_\{j\}\\text\{ is already terminated\},\\\\ u^\{i\-1\}\_\{j\}\\oplus t\_\{k\},&\\text\{otherwise\},\\end\{cases\}whereumiu^\{i\}\_\{m\}denotes a candidate reasoning chain generated at hopiirepresenting a branch derived from the previous chainuji−1u^\{i\-1\}\_\{j\}and the selected optionek∈ℰjie\_\{k\}\\in\\mathcal\{E\}^\{i\}\_\{j\}\. The operator⊕\\oplusdenotes the concatenation of the new tripletkt\_\{k\}to the existing sequenceuji−1u^\{i\-1\}\_\{j\}\. Letρj,ki\\rho^\{i\}\_\{j,k\}denote the selection probability ofeke\_\{k\}foruji−1u^\{i\-1\}\_\{j\}, and the confidence of this branch is then measured by its cumulative probability, computed as follows:

\(7\)ωmi=ωji−1⋅ρj,ki\\displaystyle\\omega^\{i\}\_\{m\}=\\omega^\{i\-1\}\_\{j\}\\cdot\\rho^\{i\}\_\{j,k\}whereωji−1\\omega^\{i\-1\}\_\{j\}is the confidence of the previous chainuji−1u^\{i\-1\}\_\{j\}\. Starting from the set of reasoning chains𝒞i−1\\mathcal\{C\}^\{i\-1\}, all candidate reasoning chains collected for the current hopiiare ranked by their confidence, with only the top\-FFmost confident candidate chains retained to form𝒞i\\mathcal\{C\}^\{i\}at hopii\. This autoregressive construction process continues until the maximum hopi=Li=Lis reached or all reasoning chains in the set have reached the termination signal\. At the final hopLL, which defines the maximum number of triples allowed in each chain, this module constructs the comprehensive and robust set of reasoning chains𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}\. Consequently, the sequence of triples within each reasoning chain in𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}provides diverse and reliable evidence to derive the answer to the questionQQ\. Ablation studies in Section[4\.3](https://arxiv.org/html/2608.25487#S4.SS3)demonstrate that this module is indispensable to the overall performance of ReliableRAG\. The complete procedure of the Reliability\-Guided Chain Construction is formally detailed in Algorithm[1](https://arxiv.org/html/2608.25487#alg1)\.

Algorithm 1Reliability\-Guided Chain ConstructionInput:questionQQ, triples with injected misinformation𝒯mis\\mathcal\{T\}\_\{\\text\{mis\}\}, maximum number of reasoning hopsLL, number of reasoningchains to be retainedFF, beam sizeBB, number of selected triplesKKoutput:Reasoning Chains𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}
1:initialize reasoning chains

𝒞0←∅\\mathcal\{C\}^\{0\}\\leftarrow\\emptysetand confidence score for each chain

Ω0←\{1\.0\}\\Omega^\{0\}\\leftarrow\\\{1\.0\\\}
2:for

i=1i=1to

LLdo

3:Generate queries

\{qji\}j=1\|𝒞i−1\|\\\{q^\{i\}\_\{j\}\\\}\_\{j=1\}^\{\|\\mathcal\{C\}^\{i\-1\}\|\}from

QQand

𝒞i−1\\mathcal\{C\}^\{i\-1\}\#\|𝒞i−1\|≤F\|\\mathcal\{C\}^\{i\-1\}\|\\leq F

4:Obtain embeddings

\{hji\}j=1\|𝒞i−1\|\\\{h^\{i\}\_\{j\}\\\}\_\{j=1\}^\{\|\\mathcal\{C\}^\{i\-1\}\|\}and

\{hk\}k=1M\\\{h\_\{k\}\\\}\_\{k=1\}^\{M\}
5:Compute similarity

Φ⁡\(hji,hk\)\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)for

j∈\[1,\|𝒞i−1\|\}\],k∈\[1,M\]j\\in\[1,\{\|\\mathcal\{C\}^\{i\-1\}\|\}\\\}\],k\\in\[1,M\]
6:Obtain credibility score

ηk\\eta\_\{k\}for each triple

7:Compute reliability score

Rj,ki←α⋅Φ⁡\(hji,hk\)\+\(1−α\)⋅ηkR^\{i\}\_\{j,k\}\\leftarrow\\alpha\\cdot\\Phi\(h^\{i\}\_\{j\},h\_\{k\}\)\+\(1\-\\alpha\)\\cdot\\eta\_\{k\}
8:Mask reliability score

Rj,ki←−∞,∀tk∈uji−1,uji−1∈𝒞i−1R^\{i\}\_\{j,k\}\\leftarrow\-\\infty,\\forall t\_\{k\}\\in u^\{i\-1\}\_\{j\},u^\{i\-1\}\_\{j\}\\in\\mathcal\{C\}^\{i\-1\}
9:\# Ensuring non\-redundant triple selection

10:Select top\-

KKmost reliable triples

𝒮ji\\mathcal\{S\}^\{i\}\_\{j\}by reliability

11:Construct reasoning prompt

Iji←Ψ⁡\(Instr,Exemp,qji,𝒮ji\)I^\{i\}\_\{j\}\\leftarrow\\Psi\(\\text\{Instr\},\\text\{Exemp\},q^\{i\}\_\{j\},\\mathcal\{S\}^\{i\}\_\{j\}\)
12:Identify top\-

BBlikely options

ℰji←Top−⁡Bek​\(Pℳsel​\(ek∣Iji\)\)\\mathcal\{E\}^\{i\}\_\{j\}\\leftarrow\\operatorname\{Top\-\}B\_\{e\_\{k\}\}\(P\_\{\\mathcal\{M\}\_\{\\text\{sel\}\}\}\(e\_\{k\}\\mid I^\{i\}\_\{j\}\)\)
13:foreach option

eke\_\{k\}in

ℰji\\mathcal\{E\}^\{i\}\_\{j\}do

14:if

ek​is option Aor​uji−1​is already terminatede\_\{k\}\\text\{ is option A\}\\text\{ or \}u^\{i\-1\}\_\{j\}\\text\{ is already terminated\}then

15:Retain the current chain

umi←uji−1u^\{i\}\_\{m\}\\leftarrow u^\{i\-1\}\_\{j\}
16:else

17:Extend the chain:

umi←uji−1⊕tku^\{i\}\_\{m\}\\leftarrow u^\{i\-1\}\_\{j\}\\oplus t\_\{k\}
18:Update confidence score

ωmi=ωji−1⋅ρj,ki\\omega^\{i\}\_\{m\}=\\omega^\{i\-1\}\_\{j\}\\cdot\\rho^\{i\}\_\{j,k\}
19:\# Accumulate confidence with selection probability

20:Retain the top\-

FFcandidate chains

𝒞i\\mathcal\{C\}^\{i\}by confidence

21:return

𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}

Table 1\.Main results between ReliableRAG and compared methods under both the ideal setting and the evaluator\-generated setting\. The best performance within each setting is highlighted in bold\. ‘w/ Low\-credibility Docs’ denotes the injection of one low\-credibility document per question\. The dash ‘\-’ denotes that the method is either not applicable to the setting or identical in practice to another setting already reported\.

## 4\.Experiments

To comprehensively evaluate ReliableRAG, we first conduct extensive experiments on three multi\-hop QA datasets\. Next, we conduct ablation studies to validate the effectiveness of each individual module\. Finally, we perform sensitivity analyses to investigate the impact of key hyperparameters\. Detailed experimental setup, the two synthesis strategies \(TBS and SBS\), and an in\-depth case study are presented in Appendices[A](https://arxiv.org/html/2608.25487#A1)to[C](https://arxiv.org/html/2608.25487#A3), respectively\. Additional results including experiments under the evaluator\-generated setting, additional analysis \(including the ablation study for ReliableRAG\-SBS\), experiments on different extractor, evaluator, and selector, and analysis of evaluator capability are available in Appendices[E](https://arxiv.org/html/2608.25487#A5)to[H](https://arxiv.org/html/2608.25487#A8)\.

### 4\.1\.Experimental Setups

#### 4\.1\.1\.Datasets\.

Experiments are conducted on three multi\-hop QA datasets: HotPotQA\([Yang et al\., 2018](https://arxiv.org/html/2608.25487#bib.bib11)\), 2WikiMultiHopQA\([Ho et al\., 2020](https://arxiv.org/html/2608.25487#bib.bib12)\), and MuSiQue\([Trivedi et al\., 2022](https://arxiv.org/html/2608.25487#bib.bib13)\)\. These datasets typically require 2–4 reasoning hops, with each question associated with 10, 10, and 20 Wikipedia\-sourced documents, respectively\. Following the preprocessing by Fang et al\.\([Fang et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib15)\), we filter out sensitive content\. To balance computational efficiency with statistical significance, we randomly sample 1,000 questions from each test set for evaluation, while an additional 100 questions from each development set are utilized for hyperparameter tuning\. Misinformation scenarios are simulated by injecting low\-credibility documents \(each containing LLM\-generated deceptive misinformation\) for each question, with performance evaluated under both Ideal and Evaluator\-generated settings\.

Figure 3\.Performance comparison between ReliableRAG and six compared methods on the test sets of three multi\-hop QA datasets with varying numbers of low\-credibility documents per question, evaluated under the ideal setting\.
#### 4\.1\.2\.Compared Methods and Evaluation Metrics\.

ReliableRAG is compared against a diverse set of compared methods, including Naive LLM, Vanilla RAG, Prompt\-based, Exclusion, Self\-RAG\([Asai et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib30)\), CAG\([Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4)\), Knowledgeable\-R1\([Lin et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib29)\), CrAM\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\), TruthfulRAG\([Liu et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib28)\)\. To comprehensively evaluate the performance of all methods, we adopt two standard QA metrics: Exact Match \(EM\)\([Kamalloo et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib23);[Alinejad et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib24)\)and F1 score \(F1\)\([Lin and Chen, 2018](https://arxiv.org/html/2608.25487#bib.bib21);[Wang et al\., 2024c](https://arxiv.org/html/2608.25487#bib.bib22)\)\.

### 4\.2\.Main Results

#### 4\.2\.1\.Performance Comparison

Table[1](https://arxiv.org/html/2608.25487#S3.T1)presents the comparison between ReliableRAG and nine compared methods, covering both fine\-tuning and non\-fine\-tuning methods\. The results clearly demonstrate that ReliableRAG significantly outperforms all compared methods under the Ideal setting\. Across the three tested LLMs, it delivers the highest EM performance on all test sets, achieving 55\.10%, 49\.50%, and 31\.60% on HotPotQA, 2WikiMultiHopQA, and MuSiQue, respectively\. Similarly, ReliableRAG attains the highest EM performance under the evaluator\-generated setting across all tested LLMs, yielding 40\.30%, 33\.80%, and 19\.50% on HotPotQA, 2WikiMultiHopQA, and MuSiQue, respectively\. These findings underscore the superior robustness of ReliableRAG in resisting the interference of deceptive misinformation, preventing its propagation during multi\-hop reasoning, and maintaining stability during complex multi\-hop QA tasks\. Notably, the CAG method exhibits significant instruction\-following difficulties and tends to generate excessive explanatory content, which leads to abysmal EM performance\.

#### 4\.2\.2\.Robustness to Misinformation

To further validate robustness, we vary the number of low\-credibility documents per question on all test sets, considering both ideal and evaluator\-generated settings using Mistral\-7B as the generator\. As shown in Figure[3](https://arxiv.org/html/2608.25487#S4.F3), ReliableRAG outperforms six compared methods with minimal performance drops\. Results in evaluator\-generated settings exhibit a similar pattern \(see Appendix[E\.2](https://arxiv.org/html/2608.25487#A5.SS2)for detailed results\)\. Interestingly, we observe that the EM performance of ReliableRAG\-SBS on HotpotQA even improves slightly as the misinformation proportion rises\. We hypothesize that our framework can uncover fine\-grained correct information hidden even within low\-credibility documents, subsequently transforming these fine\-grained informational into structured triples that are effectively utilized to derive the final answer\. We attribute this capability to the dual\-factor perception mechanism within the Triple Evaluation module, which effectively captures these correct triples and integrates them into robust reasoning chains\. This allows the framework to leverage valid fine\-grained information while resisting deceptive misinformation, thereby enhancing the framework’s overall robustness\. Furthermore, our framework ultimately yields a concise input context𝒳\\mathcal\{X\}for final generation, the input computational overhead of which is detailed in Appendix[F\.4](https://arxiv.org/html/2608.25487#A6.SS4)through experimental results\.

### 4\.3\.Ablation Studies

To evaluate the contribution of each component within ReliableRAG\-TBS, we conduct a systematic ablation study\. For the ‘w/o Chain Construction’ variant, instead of generating a reasoning chain, we employ E5\-Mistral to retrieve the top\-KKmost reliable triples directly from the set of triples𝒯\\mathcal\{T\}for each query\. These triplets are then provided as the supporting context for the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}to produce the final answer\. To ensure a fair comparison, we evaluate this variant across various values ofKKand report the corresponding results\.

Results in Table[2](https://arxiv.org/html/2608.25487#S4.T2)show that the complete ReliableRAG\-TBS achieves best performance across all test sets \(Detailed analysis for ReliableRAG\-SBS is provided in Appendix[F\.3](https://arxiv.org/html/2608.25487#A6.SS3)\)\. Notably, removing Triple Extraction triggers the most substantial performance decline, represented by a 34\.1% drop in EM on the HotpotQA test set, underscoring the triples’ pivotal role in organizing information for multi\-hop QA\. Similarly, excluding Triple Evaluation leads to a 15\.6% EM decrease, highlighting its importance in preventing misinformation propagation during multi\-hop reasoning\. Furthermore, we observe a distinct performance threshold in the ablation variant without Chain Construction\. Specifically, the EM performance of ReliableRAG\-TBS on HotPotQA and MuSiQue begins to decline once the number of triples exceeds a certain threshold, typically between 15 and 25\. This suggests that blindly increasing the number of triples does not yield further performance gains\. This demonstrates the importance of Chain Construction in utilizing these triples to construct reasoning chains\. Notably, while the removal of Chain Construction leads to a performance drop, the margin of decline remains relatively moderate compared to the preceding two modules\. This indicates that the Triple Extraction and Triple Evaluation modules establish a search space comprising highly reliable triples, which is pivotal in preventing the propagation of misinformation during multi\-hop reasoning\. Building upon this, the Chain Construction module constructs robust multi\-hop reasoning chains from the highly reliable triples within the search space\. These chains aggregate as many logically coherent and reliable triples as possible, ultimately synthesizing them into a comprehensive and reliable supporting context, thereby further fortifying the system’s overall robustness and factual reliability, and ensuring final answer precision\.

Table 2\.Ablation results of ReliableRAG\-TBS on the test sets of three multi\-hop QA datasets\. The Top\-KKTriple variants represent the performance where the supporting context𝒵\\mathcal\{Z\}is constructed by applying the TBS synthesis strategy to the top\-KKmost reliable triples without the Chain Construction module\.![Refer to caption](https://arxiv.org/html/2608.25487v1/weight_dev100_heatmaps.png)

Figure 4\.EM and F1 performance of ReliableRAG across various configurations of the balancing coefficientα\\alphathat regulates the dual\-factor perception mechanism within the Triple Evaluation module\. Results compare \(a\) ReliableRAG\-TBS and \(b\) ReliableRAG\-SBS variants, evaluated under the ideal setting using the dev sets of three multi\-hop QA datasets\.
### 4\.4\.Sensitivity analyses

#### 4\.4\.1\.Trade\-off in Triple Evaluation

We systematically evaluate the influence of the balancing coefficientα\\alphathat regulates the dual\-factor perception mechanism within the Triple Evaluation module\. Using Llama3\-8B as the generator, we perform a grid search forα∈\[0,1\.0\]\\alpha\\in\[0,1\.0\]across the development sets of three multi\-hop QA datasets, each injected with one low\-credibility document per question\. As illustrated in Figure[4](https://arxiv.org/html/2608.25487#S4.F4), ReliableRAG achieves its most balanced performance atα∗=0\.4\\alpha^\{\*\}=0\.4, striking an optimal trade\-off between query\-triple semantic relevance and triple credibility\. Specifically, while a largerα\\alphaprioritizes semantic relevance, it renders the framework more susceptible to deceptive misinformation\. Conversely, a smallerα\\alphamore effectively suppresses misinformation but may overly restrict information utilization, thereby compromising the overall generation accuracy\.

#### 4\.4\.2\.Effectiveness in Preventing Misinformation

Following the prior study\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\)that quantifies the contribution of specific components by measuring the change in generation probability, we adopt the Indirect Effect \(IE\) to validate the efficacy of the dual\-factor perception mechanism within the Triple Evaluation module and its role in guiding the construction of reasoning chains\. The formal definition of IE is detailed in Appendix[D](https://arxiv.org/html/2608.25487#A4)\. Specifically, across the development sets of three multi\-hop QA datasets \(each injected with one low\-credibility document per question\), we analyze the distribution of the IE for all ReliableRAG variants \(including both TBS and SBS\) at the optimal balancing coefficientα∗=0\.4\\alpha^\{\*\}=0\.4\. As illustrated in Figure[5](https://arxiv.org/html/2608.25487#S4.F5), the distribution approximates a normal shape centered near zero, with a significant density shift toward the positive side\. Notably, positive effects account for 70\.5% of the cases, indicating that our balancing coefficient adjustment generally enhances reasoning correctness\. These findings confirm that the dual\-factor perception mechanism not only fortifies ReliableRAG against misinformation but also provides effective guidance for constructing reasoning chains, thereby bolstering the overall robustness and factual reliability of the RAG system\.

Figure 5\.IE density distribution under the optimal configurationα∗=0\.4\\alpha^\{\*\}=0\.4\.
#### 4\.4\.3\.Impact of Reasoning Depth

To investigate how the maximum allowable number of reasoning steps \(i\.e\., the maximum reasoning chain lengthLL\) affects performance, we perform a sensitivity analysis of ReliableRAG by varyingLLfrom 1 to 6\. As illustrated in Figure[6](https://arxiv.org/html/2608.25487#S4.F6), across two dev sets, the average chain length exhibits sub\-linear growth asLLincreases, eventually plateauing rather than increasing indefinitely\. We observe that although the average chain length continues to grow albeit at a much slower rate asLLincreases from 4 to 6, this additional depth does not translate into detectable EM gains\. Notably, whenL\>4L\>4, the EM performance remains virtually stagnant or even experiences a slight decline \(additional results on the MuSiQue dataset are detailed in Appendix[F\.1](https://arxiv.org/html/2608.25487#A6.SS1)\)\. This suggests that excessively increasing the reasoning depth does not yield further gains\. Instead, it may introduce deceptive misinformation that contaminates the reasoning process, ultimately undermining the system’s robustness\.

Figure 6\.Impact of the maximum reasoning chain lengthLLon the QA performance and average chain length of ReliableRAG\-TBS on the dev sets of two multi\-hop QA datasets, under an ideal setting where one low\-credibility document is injected per question\.

## 5\.Conclusion

In this paper, we introduce ReliableRAG, a novel framework designed to combat deceptive misinformation in multi\-hop QA\. By dynamically evaluating fine\-grained reliability at the triple level, our approach filters deceptive misinformation to construct reliable, autoregressive reasoning chains\. Extensive experiments demonstrate that ReliableRAG significantly outperforms existing methods, providing RAG systems with a highly robust solution to ensure factual reliability and prevent misinformation propagation during multi\-hop reasoning processes\.

###### Acknowledgements\.

To Robert, for the bagels and explaining CMYK and color spaces\.

## References

- Alinejadet al\.\(2024\)A\. Alinejad, K\. Kumar, and A\. VahdatEvaluating the retrieval component in llm\-based question answering systems\.External Links:2406\.06458,[Link](https://arxiv.org/abs/2406.06458)Cited by:[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Asaiet al\.\(2024\)A\. Asai, Z\. Wu, Y\. Wang, A\. Sil, and H\. HajishirziSelf\-RAG: learning to retrieve, generate, and critique through self\-reflection\.InThe Twelfth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=hSyW5go0v8)Cited by:[§A\.1](https://arxiv.org/html/2608.25487#A1.SS1.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Bhuiyaet al\.\(2024\)N\. Bhuiya, V\. Schlegel, and S\. WinklerSeemingly plausible distractors in multi\-hop reasoning: are large language models attentive readers?\.InProceedings of the 2024 Conference on Empirical Methods in Natural Language Processing,Y\. Al\-Onaizan, M\. Bansal, and Y\. Chen \(Eds\.\),Miami, Florida, USA,pp\. 2514–2528\.External Links:[Link](https://aclanthology.org/2024.emnlp-main.147/),[Document](https://dx.doi.org/10.18653/v1/2024.emnlp-main.147)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.1)\.
- Denget al\.\(2025\)B\. Deng, W\. Wang, F\. Zhu, Q\. Wang, and F\. FengCrAM: credibility\-aware attention modification in llms for combating misinformation in rag\.Proceedings of the AAAI Conference on Artificial Intelligence39\(22\),pp\. 23760–23768\.External Links:[Link](https://ojs.aaai.org/index.php/AAAI/article/view/34547),[Document](https://dx.doi.org/10.1609/aaai.v39i22.34547)Cited by:[§A\.1](https://arxiv.org/html/2608.25487#A1.SS1.p1.1),[§A\.2](https://arxiv.org/html/2608.25487#A1.SS2.p1.1),[Appendix D](https://arxiv.org/html/2608.25487#A4.p1.1),[§H\.2](https://arxiv.org/html/2608.25487#A8.SS2.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.2),[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1),[§4\.4\.2](https://arxiv.org/html/2608.25487#S4.SS4.SSS2.p1.1)\.
- Devine \(2025\)P\. DevineALoFTRAG: automatic local fine tuning for retrieval augmented generation\.External Links:2501\.11929,[Link](https://arxiv.org/abs/2501.11929)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1)\.
- Donget al\.\(2024\)Q\. Dong, L\. Li, D\. Dai, C\. Zheng, J\. Ma, R\. Li, H\. Xia, J\. Xu, Z\. Wu, B\. Chang, X\. Sun, L\. Li, and Z\. SuiA survey on in\-context learning\.InProceedings of the 2024 Conference on Empirical Methods in Natural Language Processing,Y\. Al\-Onaizan, M\. Bansal, and Y\. Chen \(Eds\.\),Miami, Florida, USA,pp\. 1107–1128\.External Links:[Link](https://aclanthology.org/2024.emnlp-main.64/),[Document](https://dx.doi.org/10.18653/v1/2024.emnlp-main.64)Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p2.1)\.
- Fanget al\.\(2024\)J\. Fang, Z\. Meng, and C\. MacDonaldTRACE the evidence: constructing knowledge\-grounded reasoning chains for retrieval\-augmented generation\.InFindings of the Association for Computational Linguistics: EMNLP 2024,Y\. Al\-Onaizan, M\. Bansal, and Y\. Chen \(Eds\.\),Miami, Florida, USA,pp\. 8472–8494\.External Links:[Link](https://aclanthology.org/2024.findings-emnlp.496/),[Document](https://dx.doi.org/10.18653/v1/2024.findings-emnlp.496)Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p2.1),[§3\.2\.1](https://arxiv.org/html/2608.25487#S3.SS2.SSS1.p1.1),[§3\.3](https://arxiv.org/html/2608.25487#S3.SS3.p1.1),[§3\.3](https://arxiv.org/html/2608.25487#S3.SS3.p1.2),[§4\.1\.1](https://arxiv.org/html/2608.25487#S4.SS1.SSS1.p1.1)\.
- Garbaceaet al\.\(2019\)C\. Garbacea, S\. Carton, S\. Yan, and Q\. MeiJudge the judges: a large\-scale evaluation study of neural language models for online review generation\.InProceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing \(EMNLP\-IJCNLP\),K\. Inui, J\. Jiang, V\. Ng, and X\. Wan \(Eds\.\),Hong Kong, China,pp\. 3968–3981\.External Links:[Link](https://aclanthology.org/D19-1409/),[Document](https://dx.doi.org/10.18653/v1/D19-1409)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Hoet al\.\(2020\)X\. Ho, A\. Duong Nguyen, S\. Sugawara, and A\. AizawaConstructing a multi\-hop QA dataset for comprehensive evaluation of reasoning steps\.InProceedings of the 28th International Conference on Computational Linguistics,D\. Scott, N\. Bel, and C\. Zong \(Eds\.\),Barcelona, Spain \(Online\),pp\. 6609–6625\.External Links:[Link](https://aclanthology.org/2020.coling-main.580/),[Document](https://dx.doi.org/10.18653/v1/2020.coling-main.580)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§4\.1\.1](https://arxiv.org/html/2608.25487#S4.SS1.SSS1.p1.1)\.
- Huanget al\.\(2025\)L\. Huang, W\. Yu, W\. Ma, W\. Zhong, Z\. Feng, H\. Wang, Q\. Chen, W\. Peng, X\. Feng, B\. Qin, and T\. LiuA survey on hallucination in large language models: principles, taxonomy, challenges, and open questions\.ACM Trans\. Inf\. Syst\.43\(2\)\.External Links:ISSN 1046\-8188,[Link](https://doi.org/10.1145/3703155),[Document](https://dx.doi.org/10.1145/3703155)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.1)\.
- Kaliyaret al\.\(2021\)R\. K\. Kaliyar, A\. Goswami, and P\. NarangFakeBERT: fake news detection in social media with a bert\-based deep learning approach\.80\(8\)\.External Links:ISSN 1380\-7501,[Link](https://doi.org/10.1007/s11042-020-10183-2),[Document](https://dx.doi.org/10.1007/s11042-020-10183-2)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Kaliyar and Singh \(2019\)R\. K\. Kaliyar and N\. SinghMisinformation detection on online social media\-a survey\.In2019 10th International Conference on Computing, Communication and Networking Technologies \(ICCCNT\),Vol\.,pp\. 1–6\.External Links:[Document](https://dx.doi.org/10.1109/ICCCNT45670.2019.8944587)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Kamallooet al\.\(2023\)E\. Kamalloo, N\. Dziri, C\. Clarke, and D\. RafieiEvaluating open\-domain question answering in the era of large language models\.InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),A\. Rogers, J\. Boyd\-Graber, and N\. Okazaki \(Eds\.\),Toronto, Canada,pp\. 5591–5606\.External Links:[Link](https://aclanthology.org/2023.acl-long.307/),[Document](https://dx.doi.org/10.18653/v1/2023.acl-long.307)Cited by:[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Kazlariset al\.\(2025\)I\. Kazlaris, E\. Antoniou, K\. Diamantaras, and C\. BratsasFrom illusion to insight: a taxonomic survey of hallucination mitigation techniques in llms\.AI6\(10\)\.External Links:[Link](https://www.mdpi.com/2673-2688/6/10/260),ISSN 2673\-2688,[Document](https://dx.doi.org/10.3390/ai6100260)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.1)\.
- Lewiset al\.\(2020\)P\. Lewis, E\. Perez, A\. Piktus, F\. Petroni, V\. Karpukhin, N\. Goyal, H\. Küttler, M\. Lewis, W\. Yih, T\. Rocktäschel, S\. Riedel, and D\. KielaRetrieval\-augmented generation for knowledge\-intensive nlp tasks\.InAdvances in Neural Information Processing Systems,H\. Larochelle, M\. Ranzato, R\. Hadsell, M\.F\. Balcan, and H\. Lin \(Eds\.\),Vol\.33,pp\. 9459–9474\.External Links:[Link](https://proceedings.neurips.cc/paper_files/paper/2020/file/6b493230205f780e1bc26945df7481e5-Paper.pdf)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Liet al\.\(2024\)Y\. Li, S\. Liang, M\. Lyu, and L\. WangMaking long\-context language models better multi\-hop reasoners\.InProceedings of the 62nd Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),L\. Ku, A\. Martins, and V\. Srikumar \(Eds\.\),Bangkok, Thailand,pp\. 2462–2475\.External Links:[Link](https://aclanthology.org/2024.acl-long.135/),[Document](https://dx.doi.org/10.18653/v1/2024.acl-long.135)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Linet al\.\(2026\)C\. Lin, Y\. Wen, D\. Su, H\. Tan, F\. Sun, M\. Chen, C\. Bao, and Z\. LyuResisting contextual interference in rag via parametric\-knowledge reinforcement\.External Links:2506\.05154,[Link](https://arxiv.org/abs/2506.05154)Cited by:[§A\.1](https://arxiv.org/html/2608.25487#A1.SS1.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Linet al\.\(2023\)S\. Lin, A\. Asai, M\. Li, B\. Oguz, J\. Lin, Y\. Mehdad, W\. Yih, and X\. ChenHow to train your dragon: diverse augmentation towards generalizable dense retrieval\.InFindings of the Association for Computational Linguistics: EMNLP 2023,H\. Bouamor, J\. Pino, and K\. Bali \(Eds\.\),Singapore,pp\. 6385–6400\.External Links:[Link](https://aclanthology.org/2023.findings-emnlp.423/),[Document](https://dx.doi.org/10.18653/v1/2023.findings-emnlp.423)Cited by:[§F\.2](https://arxiv.org/html/2608.25487#A6.SS2.p1.1)\.
- Lin and Chen \(2018\)X\. Lin and L\. ChenDomain\-aware multi\-truth discovery from conflicting sources\.Proc\. VLDB Endow\.11\(5\),pp\. 635–647\.External Links:ISSN 2150\-8097,[Link](https://doi.org/10.1145/3177732.3177739),[Document](https://dx.doi.org/10.1145/3177732.3177739)Cited by:[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Liuet al\.\(2024\)N\. F\. Liu, K\. Lin, J\. Hewitt, A\. Paranjape, M\. Bevilacqua, F\. Petroni, and P\. LiangLost in the middle: how language models use long contexts\.Transactions of the Association for Computational Linguistics12,pp\. 157–173\.External Links:[Link](https://aclanthology.org/2024.tacl-1.9/),[Document](https://dx.doi.org/10.1162/tacl%5Fa%5F00638)Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p1.1)\.
- Liuet al\.\(2026\)S\. Liu, Y\. Shang, and X\. ZhangTruthfulRAG: resolving factual\-level conflicts in retrieval\-augmented generation with knowledge graphs\.Proceedings of the AAAI Conference on Artificial Intelligence40\(38\),pp\. 32168–32176\.External Links:[Link](https://ojs.aaai.org/index.php/AAAI/article/view/40489),[Document](https://dx.doi.org/10.1609/aaai.v40i38.40489)Cited by:[§A\.1](https://arxiv.org/html/2608.25487#A1.SS1.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Liuet al\.\(2025\)T\. Liu, H\. Jiang, T\. Wang, R\. Xu, Y\. Yu, L\. Zhang, T\. Zhao, and H\. WangRoseRAG: robust retrieval\-augmented generation with small\-scale LLMs via margin\-aware preference optimization\.InFindings of the Association for Computational Linguistics: ACL 2025,W\. Che, J\. Nabende, E\. Shutova, and M\. T\. Pilehvar \(Eds\.\),Vienna, Austria,pp\. 13036–13054\.External Links:[Link](https://aclanthology.org/2025.findings-acl.676/),[Document](https://dx.doi.org/10.18653/v1/2025.findings-acl.676),ISBN 979\-8\-89176\-256\-5Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Panet al\.\(2023a\)L\. Pan, W\. Chen, M\. Kan, and W\. Y\. WangAttacking open\-domain question answering by injecting misinformation\.InProceedings of the 13th International Joint Conference on Natural Language Processing and the 3rd Conference of the Asia\-Pacific Chapter of the Association for Computational Linguistics \(Volume 1: Long Papers\),J\. C\. Park, Y\. Arase, B\. Hu, W\. Lu, D\. Wijaya, A\. Purwarianti, and A\. A\. Krisnadhi \(Eds\.\),Nusa Dua, Bali,pp\. 525–539\.External Links:[Link](https://aclanthology.org/2023.ijcnlp-main.35/),[Document](https://dx.doi.org/10.18653/v1/2023.ijcnlp-main.35)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Panet al\.\(2024\)R\. Pan, B\. Cao, H\. Lin, X\. Han, J\. Zheng, S\. Wang, X\. Cai, and L\. SunNot all contexts are equal: teaching LLMs credibility\-aware generation\.InProceedings of the 2024 Conference on Empirical Methods in Natural Language Processing,Y\. Al\-Onaizan, M\. Bansal, and Y\. Chen \(Eds\.\),Miami, Florida, USA,pp\. 19844–19863\.External Links:[Link](https://aclanthology.org/2024.emnlp-main.1109/),[Document](https://dx.doi.org/10.18653/v1/2024.emnlp-main.1109)Cited by:[§A\.1](https://arxiv.org/html/2608.25487#A1.SS1.p1.1),[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.2),[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Panet al\.\(2023b\)Y\. Pan, L\. Pan, W\. Chen, P\. Nakov, M\. Kan, and W\. WangOn the risk of misinformation pollution with large language models\.InFindings of the Association for Computational Linguistics: EMNLP 2023,H\. Bouamor, J\. Pino, and K\. Bali \(Eds\.\),Singapore,pp\. 1389–1403\.External Links:[Link](https://aclanthology.org/2023.findings-emnlp.97/),[Document](https://dx.doi.org/10.18653/v1/2023.findings-emnlp.97)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Pelrineet al\.\(2023\)K\. Pelrine, A\. Imouza, C\. Thibault, M\. Reksoprodjo, C\. Gupta, J\. Christoph, J\. Godbout, and R\. RabbanyTowards reliable misinformation mitigation: generalization, uncertainty, and GPT\-4\.InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing,H\. Bouamor, J\. Pino, and K\. Bali \(Eds\.\),Singapore,pp\. 6399–6429\.External Links:[Link](https://aclanthology.org/2023.emnlp-main.395/),[Document](https://dx.doi.org/10.18653/v1/2023.emnlp-main.395)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Quelle and Bovet \(2024\)D\. Quelle and A\. BovetThe perils and promises of fact\-checking with large language models\.Frontiers in Artificial IntelligenceVolume 7 \- 2024\.External Links:[Link](https://www.frontiersin.org/journals/artificial-intelligence/articles/10.3389/frai.2024.1341697),[Document](https://dx.doi.org/10.3389/frai.2024.1341697),ISSN 2624\-8212Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Rameshet al\.\(2023\)G\. Ramesh, M\. N\. Sreedhar, and J\. HuSingle sequence prediction over reasoning graphs for multi\-hop QA\.InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),A\. Rogers, J\. Boyd\-Graber, and N\. Okazaki \(Eds\.\),Toronto, Canada,pp\. 11466–11481\.External Links:[Link](https://aclanthology.org/2023.acl-long.642/),[Document](https://dx.doi.org/10.18653/v1/2023.acl-long.642)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Schoch and Ji \(2025\)S\. Schoch and Y\. JiThe good, the bad, and the debatable: a survey on the impacts of data for in\-context learning\.InProceedings of the 2025 Conference on Empirical Methods in Natural Language Processing,C\. Christodoulopoulos, T\. Chakraborty, C\. Rose, and V\. Peng \(Eds\.\),Suzhou, China,pp\. 29798–29812\.External Links:[Link](https://aclanthology.org/2025.emnlp-main.1514/),[Document](https://dx.doi.org/10.18653/v1/2025.emnlp-main.1514),ISBN 979\-8\-89176\-332\-6Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p2.1)\.
- Shenet al\.\(2025\)Z\. Shen, C\. Diao, P\. Vougiouklis, P\. Merita, S\. Piramanayagam, E\. Chen, D\. Graux, A\. Melo, R\. Lai, Z\. Jiang, Z\. Li, Y\. Qi, Y\. Ren, D\. Tu, and J\. Z\. PanGeAR: graph\-enhanced agent for retrieval\-augmented generation\.InFindings of the Association for Computational Linguistics: ACL 2025,W\. Che, J\. Nabende, E\. Shutova, and M\. T\. Pilehvar \(Eds\.\),Vienna, Austria,pp\. 12049–12072\.External Links:[Link](https://aclanthology.org/2025.findings-acl.624/),[Document](https://dx.doi.org/10.18653/v1/2025.findings-acl.624),ISBN 979\-8\-89176\-256\-5Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Suet al\.\(2025\)J\. Su, J\. P\. Zhou, Z\. Zhang, P\. Nakov, and C\. CardieTowards more robust retrieval\-augmented generation: evaluating rag under adversarial poisoning attacks\.External Links:2412\.16708,[Link](https://arxiv.org/abs/2412.16708)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Sunet al\.\(2019\)H\. Sun, T\. Bedrax\-Weiss, and W\. CohenPullNet: open domain question answering with iterative retrieval on knowledge bases and text\.InProceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing \(EMNLP\-IJCNLP\),K\. Inui, J\. Jiang, V\. Ng, and X\. Wan \(Eds\.\),Hong Kong, China,pp\. 2380–2390\.External Links:[Link](https://aclanthology.org/D19-1242/),[Document](https://dx.doi.org/10.18653/v1/D19-1242)Cited by:[§3\.2\.1](https://arxiv.org/html/2608.25487#S3.SS2.SSS1.p1.1)\.
- Trivediet al\.\(2022\)H\. Trivedi, N\. Balasubramanian, T\. Khot, and A\. SabharwalMuSiQue: multihop questions via single\-hop question composition\.Transactions of the Association for Computational Linguistics10,pp\. 539–554\.External Links:[Link](https://aclanthology.org/2022.tacl-1.31/),[Document](https://dx.doi.org/10.1162/tacl%5Fa%5F00475)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§4\.1\.1](https://arxiv.org/html/2608.25487#S4.SS1.SSS1.p1.1)\.
- Trivediet al\.\(2023\)H\. Trivedi, N\. Balasubramanian, T\. Khot, and A\. SabharwalInterleaving retrieval with chain\-of\-thought reasoning for knowledge\-intensive multi\-step questions\.InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),A\. Rogers, J\. Boyd\-Graber, and N\. Okazaki \(Eds\.\),Toronto, Canada,pp\. 10014–10037\.External Links:[Link](https://aclanthology.org/2023.acl-long.557/),[Document](https://dx.doi.org/10.18653/v1/2023.acl-long.557)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1),[§3\.2\.1](https://arxiv.org/html/2608.25487#S3.SS2.SSS1.p1.1),[§3](https://arxiv.org/html/2608.25487#S3.p1.1)\.
- Vaibhavet al\.\(2019\)Vaibhav, R\. Mandyam Annasamy, and E\. HovyDo sentence interactions matter? leveraging sentence level representations for fake news classification\.InProceedings of the Thirteenth Workshop on Graph\-Based Methods for Natural Language Processing \(TextGraphs\-13\),D\. Ustalov, S\. Somasundaran, P\. Jansen, G\. Glavaš, M\. Riedl, M\. Surdeanu, and M\. Vazirgiannis \(Eds\.\),Hong Kong,pp\. 134–139\.External Links:[Link](https://aclanthology.org/D19-5316/),[Document](https://dx.doi.org/10.18653/v1/D19-5316)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Wanget al\.\(2025\)F\. Wang, X\. Wan, R\. Sun, J\. Chen, and S\. O\. ArikAstute RAG: overcoming imperfect retrieval augmentation and knowledge conflicts for large language models\.InProceedings of the 63rd Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),W\. Che, J\. Nabende, E\. Shutova, and M\. T\. Pilehvar \(Eds\.\),Vienna, Austria,pp\. 30553–30571\.External Links:[Link](https://aclanthology.org/2025.acl-long.1476/),[Document](https://dx.doi.org/10.18653/v1/2025.acl-long.1476),ISBN 979\-8\-89176\-251\-0Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Wanget al\.\(2024a\)L\. Wang, N\. Yang, X\. Huang, B\. Jiao, L\. Yang, D\. Jiang, R\. Majumder, and F\. WeiText embeddings by weakly\-supervised contrastive pre\-training\.External Links:2212\.03533,[Link](https://arxiv.org/abs/2212.03533)Cited by:[§F\.2](https://arxiv.org/html/2608.25487#A6.SS2.p1.1)\.
- Wanget al\.\(2024b\)L\. Wang, N\. Yang, X\. Huang, L\. Yang, R\. Majumder, and F\. WeiImproving text embeddings with large language models\.InProceedings of the 62nd Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),L\. Ku, A\. Martins, and V\. Srikumar \(Eds\.\),Bangkok, Thailand,pp\. 11897–11916\.External Links:[Link](https://aclanthology.org/2024.acl-long.642/),[Document](https://dx.doi.org/10.18653/v1/2024.acl-long.642)Cited by:[§F\.2](https://arxiv.org/html/2608.25487#A6.SS2.p1.1)\.
- Wanget al\.\(2024c\)Y\. Wang, N\. Lipka, R\. A\. Rossi, A\. Siu, R\. Zhang, and T\. DerrKnowledge graph prompting for multi\-document question answering\.Proceedings of the AAAI Conference on Artificial Intelligence38\(17\),pp\. 19206–19214\.External Links:[Link](https://ojs.aaai.org/index.php/AAAI/article/view/29889),[Document](https://dx.doi.org/10.1609/aaai.v38i17.29889)Cited by:[§4\.1\.2](https://arxiv.org/html/2608.25487#S4.SS1.SSS2.p1.1)\.
- Weiet al\.\(2024\)X\. Wei, X\. Cui, N\. Cheng, X\. Wang, X\. Zhang, S\. Huang, P\. Xie, J\. Xu, Y\. Chen, M\. Zhang, Y\. Jiang, and W\. HanChatIE: zero\-shot information extraction via chatting with chatgpt\.External Links:2302\.10205,[Link](https://arxiv.org/abs/2302.10205)Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p2.1)\.
- Wuet al\.\(2025\)W\. Wu, H\. Wang, B\. Li, P\. Huang, X\. Zhao, and L\. LiangMultiRAG: a knowledge\-guided framework for mitigating hallucination in multi\-source retrieval augmented generation\.In2025 IEEE 41st International Conference on Data Engineering \(ICDE\),Vol\.,pp\. 3070–3083\.External Links:[Document](https://dx.doi.org/10.1109/ICDE65448.2025.00230)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§3\.2\.2](https://arxiv.org/html/2608.25487#S3.SS2.SSS2.p1.1)\.
- Yanget al\.\(2018\)Z\. Yang, P\. Qi, S\. Zhang, Y\. Bengio, W\. Cohen, R\. Salakhutdinov, and C\. D\. ManningHotpotQA: a dataset for diverse, explainable multi\-hop question answering\.InProceedings of the 2018 Conference on Empirical Methods in Natural Language Processing,E\. Riloff, D\. Chiang, J\. Hockenmaier, and J\. Tsujii \(Eds\.\),Brussels, Belgium,pp\. 2369–2380\.External Links:[Link](https://aclanthology.org/D18-1259/),[Document](https://dx.doi.org/10.18653/v1/D18-1259)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1),[§4\.1\.1](https://arxiv.org/html/2608.25487#S4.SS1.SSS1.p1.1)\.
- Zellerset al\.\(2019\)R\. Zellers, A\. Holtzman, H\. Rashkin, Y\. Bisk, A\. Farhadi, F\. Roesner, and Y\. ChoiDefending against neural fake news\.InAdvances in Neural Information Processing Systems,H\. Wallach, H\. Larochelle, A\. Beygelzimer, F\. d'Alché\-Buc, E\. Fox, and R\. Garnett \(Eds\.\),Vol\.32,pp\.\.External Links:[Link](https://proceedings.neurips.cc/paper_files/paper/2019/file/3e9f0fc9b2f89e043bc6233994dfcf76-Paper.pdf)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Zenget al\.\(2026\)L\. Zeng, R\. Gupta, D\. Motwani, Y\. Zhang, and D\. YangWorse than zero\-shot? a fact\-checking dataset for evaluating the robustness of rag against misleading retrievals\.External Links:2502\.16101,[Link](https://arxiv.org/abs/2502.16101)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1)\.
- Zhang and Soh \(2024\)B\. Zhang and H\. SohExtract, define, canonicalize: an LLM\-based framework for knowledge graph construction\.InProceedings of the 2024 Conference on Empirical Methods in Natural Language Processing,Y\. Al\-Onaizan, M\. Bansal, and Y\. Chen \(Eds\.\),Miami, Florida, USA,pp\. 9820–9836\.External Links:[Link](https://aclanthology.org/2024.emnlp-main.548/),[Document](https://dx.doi.org/10.18653/v1/2024.emnlp-main.548)Cited by:[§3\.1](https://arxiv.org/html/2608.25487#S3.SS1.p2.1)\.
- Zhanget al\.\(2025\)Z\. Zhang, Y\. Feng, and M\. ZhangLevelRAG: enhancing retrieval\-augmented generation with multi\-hop logic planning over rewriting augmented searchers\.External Links:2502\.18139,[Link](https://arxiv.org/abs/2502.18139)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p1.1)\.
- Zhouet al\.\(2024\)Y\. Zhou, Y\. Liu, X\. Li, J\. Jin, H\. Qian, Z\. Liu, C\. Li, Z\. Dou, T\. Ho, and P\. S\. YuTrustworthiness in retrieval\-augmented generation systems: a survey\.External Links:2409\.10102,[Link](https://arxiv.org/abs/2409.10102)Cited by:[§2](https://arxiv.org/html/2608.25487#S2.p1.1)\.
- Zouet al\.\(2025\)W\. Zou, R\. Geng, B\. Wang, and J\. JiaPoisonedRAG: knowledge corruption attacks to retrieval\-augmented generation of large language models\.In34th USENIX Security Symposium, USENIX Security 2025, Seattle, WA, USA, August 13\-15, 2025,L\. Bauer and G\. Pellegrino \(Eds\.\),pp\. 3827–3844\.External Links:[Link](https://www.usenix.org/conference/usenixsecurity25/presentation/zou-poisonedrag)Cited by:[§1](https://arxiv.org/html/2608.25487#S1.p2.1),[§2](https://arxiv.org/html/2608.25487#S2.p2.1)\.

## Appendix ADetailed Experimental Setup

In this section, we provide the detailed configurations for compared methods, the document injection process, and our implementation\.

### A\.1\.Compared Methods

ReliableRAG is compared against a diverse set of compared methods: \(1\) Naive LLM, which generates answers using only internal knowledge without retrieval; \(2\) Vanilla RAG, which follows the standard RAG pipeline but lacks any mechanism to mitigate misinformation; \(3\) Prompt\-based, which incorporates document credibility into prompts to guide the generation of the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}without parameter updates; \(4\) Exclusion, a strategy built upon prompt\-based method to filter out documents below a fixed credibility threshold; \(5\) Self\-RAG\([Asai et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib30)\), fine\-tuned on Llama2\-7B that utilizes reflection tokens for self\-assessment of retrieval and generation; \(6\) CAG\([Pan et al\., 2024](https://arxiv.org/html/2608.25487#bib.bib4)\), fine\-tuned on Llama2\-7B by encoding both content and credibility scores; \(7\) Knowledgeable\-R1\([Lin et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib29)\), fine\-tuned on Qwen2\.5\-7B\-Instruct to enhance resistance against misleading contexts; \(8\) CrAM\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\), which dynamically adjusts attention weights based on document credibility; and \(9\) TruthfulRAG\([Liu et al\., 2026](https://arxiv.org/html/2608.25487#bib.bib28)\), which employs knowledge graphs and entropy\-based filtering to eliminate factual inconsistencies\. In addition, we conduct comparative experiments by employing Llama2\-7B and Qwen2\.5\-7B\-Instruct as the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}, providing a fair comparison against methods including Self\-RAG, CAG, and Knowledgeable\-R1 to further validate the versatility of our framework \(see Appendix[F\.5](https://arxiv.org/html/2608.25487#A6.SS5)\)\.

### A\.2\.Low\-credibility Document Injection

To evaluate the effectiveness of ReliableRAG in preventing misinformation, we construct low\-credibility documents that contain misinformation and support incorrect answers using an LLM \(i\.e\., GLM\-4\-Flash\)\. Following the prior study\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\), the LLM is guided by specific prompts to generate coherent yet misleading content\. For each question, we inject three diverse low\-credibility documents supporting the same erroneous answer to simulate a challenging misinformation environment\. Two evaluation settings are considered: \(1\) Ideal setting, where high\-credibility \(Wikipedia\-sourced\) and low\-credibility documents are assigned fixed scores of 10 and 1, respectively, to establish an upper\-bound performance; and \(2\) Evaluator\-generated setting, where the evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}assigns credibility scores \(ranging from 0 to 10\) to each document\.

### A\.3\.Implementation Details

Experiments were run on a platform with Python 3\.10 and CUDA 12\.1\. Unless otherwise specified, we employ Llama3\-8B\-Instruct as the default LLM and e5\-Mistral\-7B\-Instruct as the default bi\-encoder for computing query–document and query–triple similarities throughout the framework\. The platform comprised an Intel Xeon Gold 6348 CPU, 503 GB of memory, and an NVIDIA A800 80GB GPU\. Specifically, generation used a temperature of 1\.0 with deterministic sampling\. Whereas compared methods retrieve the top 5 documents by similarity, ReliableRAG selects the top 5 reasoning chains in𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}based on their confidence scores\. These selected chains are then utilized to construct the supporting context𝒵\\mathcal\{Z\}, which is integrated into the unified input𝒳\\mathcal\{X\}\. This input𝒳\\mathcal\{X\}is subsequently fed into the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}to produce the final answer\.

## Appendix BPrompting and Context Synthesis Strategies

This section provides supplementary details regarding our framework\. First, the detailed content of the assessment framework is illustrated in Figure[13](https://arxiv.org/html/2608.25487#A8.F13)\. Furthermore, we elaborate on the context synthesis strategies as depicted in Figure[7](https://arxiv.org/html/2608.25487#A2.F7)\. Following the construction of the reasoning chain set𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}, we transform the selected chains into a reliable, evidence\-based supporting context𝒵\\mathcal\{Z\}that is formatted to be comprehensible to the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}\. To achieve this, we employ two representative strategies to synthesize𝒵\\mathcal\{Z\}:

\(1\) Triple\-based Synthesis \(TBS\):This strategy directly converts the triples into a concise natural language format\. Specifically, for each tripletk=\(sk,pk,ok\)t\_\{k\}=\(s\_\{k\},p\_\{k\},o\_\{k\}\)within each reasoning chaincjL∈𝒞finalc^\{L\}\_\{j\}\\in\\mathcal\{C\}\_\{\\text\{final\}\}, the constituent subjectsks\_\{k\}, predicatepkp\_\{k\}, and objectoko\_\{k\}are concatenated into a textual string\. These strings are then integrated to form the supporting context𝒵\\mathcal\{Z\}\. By presenting the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}with this information\-dense context \(as part of the unified input𝒳\\mathcal\{X\}\), this strategy ensures thatℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}is grounded in a concise information space for final answering\.

\(2\) Source\-based Synthesis \(SBS\):This strategy constructs the supporting context𝒵\\mathcal\{Z\}by mapping each triple back to its original source document\. Specifically, for each tripletkt\_\{k\}within a reasoning chainujfinal∈𝒞finalu^\{\\text\{final\}\}\_\{j\}\\in\\mathcal\{C\}\_\{\\text\{final\}\}, we define a projection functionπ⁡\(tk\)\\pi\(t\_\{k\}\)that maps it back to its corresponding source documentdn∈𝒟d\_\{n\}\\in\\mathcal\{D\}, thereby restoring the rich semantic details\. By treating each such mapping as a vote fordnd\_\{n\}, we employ a frequency\-based voting mechanism to rank the documents based on their total occurrences\. The documents identified through these mappings are then sequentially integrated according to their ranked order to form𝒵\\mathcal\{Z\}\. This ensures that the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}is grounded in the comprehensive content of the original source documents\.

Figure 7\.Illustration of the Context Synthesis Strategies\. Triple\-based Synthesis \(TBS\) directly converts triples into a concise natural language format by concatenating their components into textual strings to maximize information density\. In contrast, Source\-based Synthesis \(SBS\) utilizes the projection functionπ⁡\(⋅\)\\pi\(\\cdot\)to map triples back to original source documents, identifying the most representative evidence documents through a frequency\-based voting mechanism, thereby restoring the rich semantic details\.
## Appendix CDetailed Case Study

In this section, we present a case study in Table[16](https://arxiv.org/html/2608.25487#A8.T16)to nstantiate the internal reasoning process of ReliableRAG when encountering deceptive misinformation\. This case is selected from the HotPotQA test set\. The execution flow and logical evolution of each module are described as follows:

Step 1: Triple Extraction\.This module transforms the source documents into a set of structured triples\. As shown in the Table[16](https://arxiv.org/html/2608.25487#A8.T16), the set includes both triples from high\-credibility documents \(e\.g\., Wikipedia\), such as\(Leo Harris, notable deal, handshake deal with Walt Disney to use Donald Duck as the basis for the Oregon Duck mascot\), and deceptive misinformation from low\-credibility documents, such as\(Mickey Mouse’s Legacy in Animation Education, popular misconception, that Donald Duck was featured in the deal, not Mickey Mouse\)\. By providing such fine\-grained information for subsequent multi\-hop reasoning, this approach effectively mitigates the lost\-in\-the\-middle issue\.

Step 2: Triple Evaluation\.Building upon the structured triples derived from the Triple Extraction module and their respective credibility scores assigned by the evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}, this module performs fine\-grained reliability quantification by synthesizing query\-triple semantic relevance and triple credibility\. This mechanism ensures the retention of only the top\-KKmost reliable and non\-redundant triples, thereby providing a highly trustworthy search space for subsequent chain construction\. As illustrated in Table[16](https://arxiv.org/html/2608.25487#A8.T16), this module effectively filters out triples containing deceptive misinformation while preserving the most reliable evidence triples\.

Step 3: Chain Construction\.Operating on the trustworthy search space established by the Triple Evaluation module, this module employs a beam search strategy to autoregressively construct robust reasoning chains at each hop\. Since the search space has been filtered for reliability, the construction process naturally avoids deceptive misinformation\. As demonstrated in Table[16](https://arxiv.org/html/2608.25487#A8.T16), the highest\-ranked candidate chain at the second hop, which consists of\(Leo Harris, notable deal, handshake deal with Walt Disney to use Donald Duck as the basis for the Oregon Duck mascot\)and\(Donald Duck, creation year, 1934\), contains sufficient information to directly answer the questionQQ\.

Finally, the final reasoning chains𝒞final\\mathcal\{C\}\_\{\\text\{final\}\}are synthesized into the supporting context𝒵\\mathcal\{Z\}through context synthesis strategies, then integrated into the unified input𝒳\\mathcal\{X\}for the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}\. By supplying this refined and reliable context𝒵\\mathcal\{Z\}, ReliableRAG effectively alleviates the burden onℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}of integrating raw, potentially deceptive misinformation, thereby enabling the generation of the accurate final answer: “Donald Duck\.”

## Appendix DDefinition of Indirect Effect

In this section, following the prior study\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\)that quantifies the contribution of specific components by measuring the change in generation probability, we adopt the Indirect Effect \(IE\) to validate the efficacy of the dual\-factor perception mechanism and its role in guiding the construction of reasoning chains\. Specifically, we first establish a baseline probabilityP0P\_\{0\}, which represents the likelihood of deriving the correct answer for each questionQQwhen the balancing coefficientα\\alphawithin the dual\-factor perception mechanism is set toα0=1\\alpha^\{0\}=1\. To compute this probability, we apply two distinct strategies to the constructed reasoning chains to synthesize two corresponding types of supporting contexts𝒵k\\mathcal\{Z\}\_\{k\}\(wherek∈\{1,2\}k\\in\\\{1,2\\\}\)\. Each𝒵k\\mathcal\{Z\}\_\{k\}is independently integrated into the input𝒳k\\mathcal\{X\}\_\{k\}and fed to the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}, yielding two separate probabilities whose combination definesP0P\_\{0\}\. This resulting probabilityP0P\_\{0\}serves as our reference standard, formulated as follows:

\(8\)P0=\{Pℳgen​\(a∣𝒳k,α0\)\}k=12\\displaystyle P\_\{0\}=\\\{P\_\{\\mathcal\{M\}\_\{\\text\{gen\}\}\}\(a\\mid\\mathcal\{X\}\_\{k\},\\alpha^\{0\}\)\\\}\_\{k=1\}^\{2\}Subsequently, to determine the optimal balance between these factors, we conduct a grid search forα\\alphaon the development sets of three multi\-hop QA datasets, each injected with one low\-credibility document per question\. This process identifies the most balanced parameter configuration , denoted asα∗\\alpha^\{\*\}, which maximizes the performance of both ReliableRAG\-TBS and ReliableRAG\-SBS across all tasks\. The probability of generating the correct answer under this configuration is expressed as:

\(9\)P1=\{Pℳgen​\(a∣𝒳k,α∗\)\}k=12\\displaystyle P\_\{1\}=\\\{P\_\{\\mathcal\{M\}\_\{\\text\{gen\}\}\}\(a\\mid\\mathcal\{X\}\_\{k\},\\alpha^\{\*\}\)\\\}\_\{k=1\}^\{2\}The influence of the balancing coefficientα\\alphais quantified as the IE:

\(10\)IEα∗=P1−P0\\displaystyle\\mathrm\{IE\}\_\{\\alpha^\{\*\}\}=P\_\{1\}\-P\_\{0\}Intuitively, the IE distribution across all evaluated questions characterizes the mechanism’s overall efficacy, where a positive shift in this distribution signifies an enhanced capacity to mitigate misinformation\.

## Appendix ERobustness Analysis under Evaluator\-generated Settings

In this section, we analyze the robustness of our proposed framework under evaluator\-generated settings\. Specifically, we first investigate the vulnerability of compared methods, followed by a demonstration of the superior robustness of ReliableRAG\.

### E\.1\.Vulnerability of Compared Methods

Under the evaluator\-generated setting, we conduct a comparative analysis by varying the proportion of low\-credibility documents containing deceptive misinformation\. As illustrated in Figure[8](https://arxiv.org/html/2608.25487#A5.F8), compared methods such as CrAM and Exclusion exhibit a substantial decline in performance as the misinformation ratio increases\. This pronounced degradation confirms the inherent vulnerability of these approaches when confronted with dense and deceptive misinformation\.

### E\.2\.Robustness of ReliableRAG

As shown in Figure[8](https://arxiv.org/html/2608.25487#A5.F8), our proposed method maintains robust performance with minimal degradation, significantly outperforming the compared methods\. Notably, the Exact Match \(EM\) performance of ReliableRAG\-TBS on complex tasks such as MuSiQue remains remarkably stable even as the proportion of misinformation scales up\. This observed stability potentially relates to the hypothesis proposed in Section[4\.2\.2](https://arxiv.org/html/2608.25487#S4.SS2.SSS2): the dual\-factor perception mechanism within the Triple Evaluation module effectively captures factually correct triples within low\-credibility documents while filtering out those containing misinformation\. By utilizing these correct triples to construct reasoning chains, our approach successfully prevents the propagation of misinformation throughout the multi\-hop reasoning process\.

Figure 8\.Performance of ReliableRAG versus compared methods under the evaluator\-generated setting, across three multi\-hop QA datasets with varying proportions of low\-credibility documents per question\.

## Appendix FAdditional Analysis

In this section, we provide a comprehensive analysis of various factors influencing the framework’s performance\. Specifically, we first investigate the sensitivity to the maximum chain lengthLLon the MuSiQue dataset, followed by an assessment of the impact of various bi\-encoder models\. Then, we conduct an ablation study for ReliableRAG\-SBS and analyze the input computational overhead\. Finally, we provide extra evidence regarding the framework’s generalizability and robustness across various generators and settings\.

### F\.1\.Sensitivity to Maximum Chain LengthLLon MuSiQue

As illustrated in Figure[9](https://arxiv.org/html/2608.25487#A6.F9), the results on the MuSiQue development set align with our previous findings on HotpotQA and 2WikiMultiHopQA\. Specifically, we observe that whenL\>4L\>4, the growth of the average chain length slows significantly, while the EM performance remains virtually stagnant or even experiences a slight decline\. This cross\-dataset consistency further reinforces our earlier observation that increasing reasoning depth beyond a certain threshold yields diminishing returns, as additional reasoning hops tend to introduce deceptive misinformation that compromises overall accuracy\.

Figure 9\.Impact ofLLon the multi\-hop QA performance and average chain length of ReliableRAG\-TBS on the dev set of MuSiQue under the ideal setting where one low\-credibility document is injected per question\.
### F\.2\.Impact of Various Bi\-encoder Models

To determine the optimal bi\-encoder for triple retrieval, we compare the performance of ReliableRAG using three representative models: DRAGON\+\([Lin et al\., 2023](https://arxiv.org/html/2608.25487#bib.bib37)\), E5\([Wang et al\., 2024a](https://arxiv.org/html/2608.25487#bib.bib38)\), and E5\-Mistral\([Wang et al\., 2024b](https://arxiv.org/html/2608.25487#bib.bib39)\)\. The evaluation results on the dev sets of three multi\-hop QA datasets for both TBS and SBS strategies are presented in Table[3](https://arxiv.org/html/2608.25487#A6.T3)and Table[4](https://arxiv.org/html/2608.25487#A6.T4)\. The empirical results demonstrate that E5\-Mistral delivers strong performance across various datasets and strategies, particularly showing notable advantages on complex multi\-hop scenarios like 2WikiMultiHopQA and MuSiQue\. These findings suggest that E5\-Mistral provides superior semantic alignment that effectively facilitates the subsequent reasoning chain construction\. Given its robust overall performance and better adaptability to challenging datasets, we select E5\-Mistral as the default bi\-encoder for all primary experiments\.

Table 3\.Performance comparison of ReliableRAG\-TBS employing different bi\-encoder models for triple retrieval on the dev sets of three multi\-hop QA datasets under the ideal setting where one low\-credibility document is injected per question\.Table 4\.Performance comparison of ReliableRAG\-SBS employing different bi\-encoder models for triple retrieval on the dev sets of three multi\-hop QA datasets under the ideal setting where one low\-credibility document is injected per question\.
### F\.3\.Ablation study for ReliableRAG\-SBS

Similar to the experimental setup in Section[4\.3](https://arxiv.org/html/2608.25487#S4.SS3), we conduct an ablation study on ReliableRAG\-SBS\. Results in Table[5](https://arxiv.org/html/2608.25487#A6.T5)demonstrate that the complete ReliableRAG\-SBS outperforms all of its variants across all test sets\. Consistent with the trends observed in ReliableRAG\-TBS, the removal of Triple Extraction on the HotpotQA test set triggers the most substantial performance drop of 35\.8% in EM, confirming the triples’ pivotal role in organizing information for multi\-hop QA\.

Furthermore, excluding Triple Evaluation results in a 31\.0% decrease in EM\. Notably, the performance penalty for removing this stage is significantly more pronounced in the SBS variant than in TBS\. This is primarily because the SBS strategy constructs the supporting context𝒵\\mathcal\{Z\}by mapping each triple back to its original coarse\-grained source document\. Without the Triple Evaluation process, the quality of𝒵\\mathcal\{Z\}diminishes sharply, which directly impacts ReliableRAG’s ability to resist deceptive misinformation\. Finally, ReliableRAG\-SBS exhibits a distinct performance threshold similar to that observed in ReliableRAG\-TBS\. Specifically, without Chain Construction, the EM performance across all datasets begins to decline once the number of triples exceeds a certain threshold \(typically between 15 and 20\)\. This again confirms that blindly increasing the number of triples does not yield further performance gains, highlighting the critical role of Chain Construction in organizing these triples into coherent reasoning chains\. Collectively, these findings further validate the efficacy of each module within our framework and its overall capacity to bolster the robustness and factual reliability of RAG systems\.

Table 5\.Ablation results of ReliableRAG\-SBS on the test sets of three multi\-hop QA datasets\. The Top\-KKTriple variants represent the performance where the supporting context𝒵\\mathcal\{Z\}is constructed by applying the SBS synthesis strategy to the top\-KKmost reliable triples without the Chain Construction module\.
### F\.4\.Analysis of Input Computational Overhead

Table[6](https://arxiv.org/html/2608.25487#A6.T6)presents the average input context length \(in tokens\) across the test sets of all evaluated datasets, comparing our proposed methods with other approaches under different LLMs\. The results indicate that ReliableRAG\-TBS maintains the most concise input context\. This conciseness stems from its strategy of concatenating the subject, predicate, and object of each triple into a single textual string\. By transforming structured triples into a single textual string, TBS focuses on delivering reliable and succinct information\. This ensures that the generatorℳgen\\mathcal\{M\}\_\{\\text\{gen\}\}receives only the most reliable evidence, thereby minimizing input computational overhead while maintaining high precision in reasoning\.

In contrast, ReliableRAG\-SBS exhibits a larger average input context length\. This is primarily because the SBS strategy constructs the supporting context𝒵\\mathcal\{Z\}by mapping each triple back to its original source document\. Although this approach increases the input overhead, it preserves the rich semantic nuances of the source documents\. By providing a more comprehensive textual background within𝒵\\mathcal\{Z\}, the SBS variant prioritizes maximizing the prevention of deceptive misinformation propagation throughout the multi\-hop process, effectively utilizing a broader context to identify the evidence required for answering questions and resist misinformation\.

Table 6\.Average input context length \(in tokens\) of ReliableRAG versus compared methods across various LLMs on the test sets of three multi\-hop QA datasets\.
### F\.5\.Extra Results

To establish a fairer comparison with fine\-tuning methods, such as CAG, Self\-RAG, and Knowledgeable\-R1, we conducted supplementary experiments by substituting our default generator with Llama\-2\-7B and Qwen2\.5\-7B \(Instruct\)\. We evaluated these alternative generators across both TBS \(Table[7](https://arxiv.org/html/2608.25487#A6.T7)\) and SBS \(Table[8](https://arxiv.org/html/2608.25487#A6.T8)\) variants under the ideal setting\. The experimental results demonstrate that ReliableRAG achieves highly satisfactory and competitive performance across all datasets when integrated with different models\. Notably, when utilizing Qwen2\.5\-7B under the SBS strategy, our framework achieves an impressive F1 score of 71\.3% on HotPotQA\. These findings highlight the strong generalizability and model\-agnostic nature of our framework, proving that it can effectively maintain robust performance without relying on a specific generator\. Furthermore, we conduct an additional experiment by offline evaluating the credibility score for each document\. We then apply the dual\-factor perception mechanism to coarse\-grained documents and perform evaluations under the optimal configuration \(α∗=0\.4\\alpha^\{\*\}=0\.4\)\. The experimental results are presented in Table[9](https://arxiv.org/html/2608.25487#A6.T9)\.

Table 7\.Impact of Different Generators on ReliableRAG\-TBS performance on the test sets of three multi\-hop QA datasets, where one low\-credibility document is injected per question\.Table 8\.Impact of Different Generators on ReliableRAG\-SBS performance on the test sets of three multi\-hop QA datasets, where one low\-credibility document is injected per question\.Table 9\.Experimental results of applying the dual\-factor perception mechanism to coarse\-grained documents under the ideal setting\.

## Appendix GComparative Study of Extractor, Evaluator, and Selector

In this section, we conduct a comparative study focusing on three key functional units within our framework: the extractor, the evaluator, and the selector\. Specifically, we first investigate the impact of different extractors, followed by an analysis of various selectors, and finally explore the influence of different evaluators\.

### G\.1\.Impact of Different Extractors

To evaluate the robustness of our framework across various extractors, we select Llama3\-8B\-Instruct, Qwen\-7B\-Instruct, and Qwen\-14B\-Instruct for comparison\. For this analysis, we employ an ablated configuration where the triple evaluation and chain construction modules are bypassed\. Specifically, the top\-20 relevant triples are directly synthesized into the supporting context𝒵\\mathcal\{Z\}using either the TBS or SBS strategy within a single reasoning hop before being processed by the generator\. As shown in Tables[10](https://arxiv.org/html/2608.25487#A7.T10)and[11](https://arxiv.org/html/2608.25487#A7.T11), the performance variance across the three Extractor LLMs is marginal, with F1 scores on HotPotQA, for instance, converging around 42% for the TBS strategy and 26% for the SBS strategy\. This consistency suggests that the ReliableRAG framework is model\-agnostic, as the overall performance is not sensitive to the specific choice of the Extractor\.

Table 10\.Impact of Different Extractors on ReliableRAG\-TBS performance on the test sets of multi\-hop three QA datasets, where one low\-credibility document is injected per question\.Table 11\.Impact of Different Extractors on ReliableRAG\-SBS performance on the test sets of three multi\-hop QA datasets, where one low\-credibility document is injected per question\.
### G\.2\.Impact of Different Selectors

To evaluate the robustness of ReliableRAG across various selectors, we conduct comparative experiments using Llama3\-8B\-Instruct, Mistral\-7B, and Gemma\-7B\. The performance results for the two framework variants are reported in Table[12](https://arxiv.org/html/2608.25487#A7.T12)and Table[13](https://arxiv.org/html/2608.25487#A7.T13)\. The experimental data reveals that Llama3\-8B\-Instruct achieves the highest scores across all metrics and datasets\. In the TBS variant, Llama3\-8B reaches an EM of 53\.4% on HotPotQA, outperforming Mistral\-7B and Gemma\-7B by a wide margin\. This trend extends to the SBS variant, where Llama3\-8B maintains a leading EM of 55\.1% on HotPotQA, which is significantly higher than the other LLMs\. This performance gap suggests that superior instruction\-following capabilities and internal knowledge density allow the selector to more accurately identify misinformation, thereby constructing robust reasoning chains\.

Table 12\.Impact of different selectors on ReliableRAG\-TBS performance under the ideal setting across the test sets of three multi\-hop QA datasets, with one low\-credibility document injected per question\.Table 13\.Impact of different selectors on ReliableRAG\-SBS performance under the ideal setting across the test sets of three multi\-hop QA datasets, with one low\-credibility document injected per question\.
### G\.3\.Impact of Different Evaluators

To investigate the sensitivity of ReliableRAG to the choice of the evaluator, we compare the performance of GLM\-4\-Flash, Mistral\-Small\-24B, and Qwen3\.5\-35B\-A3B under both TBS \(Table[14](https://arxiv.org/html/2608.25487#A7.T14)\) and SBS \(Table[15](https://arxiv.org/html/2608.25487#A7.T15)\) variants within the evaluator\-generated setting\. Similar to the experimental configuration in Section[G\.1](https://arxiv.org/html/2608.25487#A7.SS1), with the notable exception that we retain the triple evaluation module for this analysis\. The results demonstrate that while models with larger parameter scales, such as Qwen3\.5\-35B\-A3B, achieve marginally higher metrics across the datasets, the overall performance differences among the three evaluators are relatively small\. This consistency indicates the robustness of our framework, suggesting that its effectiveness is not heavily dependent on a specific underlying LLM\. Taking into account the practical trade\-offs regarding API cost, computational resources, and evaluation efficiency, we ultimately select GLM\-4\-Flash as the default evaluator for our primary experiments\.

Table 14\.Impact of Different Evaluators on ReliableRAG\-TBS performance on the test sets of three multi\-hop QA datasets, where one low\-credibility document is injected per question\.Table 15\.Impact of Different Evaluators on ReliableRAG\-SBS performance on the test sets of three multi\-hop QA datasets, where one low\-credibility document is injected per question\.Figure 10\.Distribution of credibility scores generated by the evaluator on low\-credibility and Wikipedia\-sourced documents on the test sets of three multi\-hop QA datasets\.

## Appendix HAnalysis of Evaluator Capability

In this section, we examine the evaluator’s discriminative capability in assessing the credibility of both triples and documents across three test sets, where three low\-credibility documents containing misinformation are injected per question\. Specifically, we first present a distribution analysis of the credibility scores, followed by a quantitative evaluation using ROC curves\.

Figure 11\.Distribution of credibility scores generated by the evaluator on triples extracted from low\-credibility and Wikipedia\-sourced documents on the test sets of three multi\-hop QA datasets\.### H\.1\.Distribution Analysis

Figure[10](https://arxiv.org/html/2608.25487#A7.F10)and Figure[11](https://arxiv.org/html/2608.25487#A8.F11)illustrate the distribution of credibility scores for documents and extracted triples, respectively\. For Wikipedia\-sourced samples, scores are predominantly concentrated in the high\-value range, exhibiting a clear aggregation trend\. Conversely, the distribution of low\-credibility samples is more dispersed, with a subset of scores remaining in the high\-value intervals\. This suggests that certain segments within low\-credibility documents may still contain correct information, which aligns with the conjectures in Section[4\.2\.2](https://arxiv.org/html/2608.25487#S4.SS2.SSS2)\. Notably, compared to document\-level scores, the fine\-grained nature of triples allows capturing correct information even within deceptive contexts\. This granularity is crucial for identifying reliable information in complex, multi\-hop QA tasks under the misleading influence of deceptive misinformation\.

Figure 12\.ROC curves of credibility scores generated by the evaluator for both documents and triples across the test sets of three multi\-hop QA datasets\.
### H\.2\.Quantitative Evaluation via ROC Curves

Following the approach of the prior study to examine the capability of evaluators in assessing the credibility of coarse\-grained documents\([Deng et al\., 2025](https://arxiv.org/html/2608.25487#bib.bib10)\), we quantitatively analyze the discriminative performance of the evaluator across varying thresholds\. Specifically, samples are categorized as low\-credibility if their scores fall below a given threshold \(ranging from 0 to 10\) and high\-credibility otherwise\. By calculating the True Positive Rate \(TPR\) and False Positive Rate \(FPR\) across the entire range of thresholds, we derive the Area Under the Curve \(AUC\)\. Accordingly, the ROC curves in Figure[12](https://arxiv.org/html/2608.25487#A8.F12)illustrate the performance of GLM\-4\-Flash as the evaluator across three test sets, achieving AUC scores of 0\.86 and 0\.67 for document\- and triple\-level assessments, respectively\. It is important to emphasize that while GLM\-4\-Flash serves as an assessment tool within our framework, its performance represents a lower bound of the overall system’s potential\. Since ReliableRAG is designed to be model\-agnostic, the integration of more advanced LLMs as evaluators would theoretically yield even higher discriminative precision\. Nevertheless, the current results sufficiently demonstrate that our framework maintains high reliability and robustness even with GLM\-4\-Flash as the evaluator, effectively mitigating the impact of deceptive misinformation\.

Table 16\.A case study of the ReliableRAG pipeline on the test set of HotPotQA under the ideal setting\.Figure 13\.Content of the assessment framework\. For instance, in the triple\(Albert Einstein, was the first recipient in 1921 of, the Nobel Prize in Physics\), the analysis recognizes that while the entities are authentic, the specific relational claim is inaccurate\. Integrating this analysis, the evaluatorℳeva\\mathcal\{M\}\_\{\\text\{eva\}\}generates the final credibility score\.