Skip to content
Open access

EviGraphRAG: Constraint-Verified Retrieval-Augmented Question Answering over Event Knowledge Graphs

2026 · Computers, Materials & Continua · 0 citations · 28 references

TL;DR

EviGraphRAG is proposed, a ranker-agnostic reliability layer that separates candidate ranking from exact verification and explicit abstention, and exact conjunction over represented event constraints and linked source-record connectivity can improve selective reliability, while parser quality and candidate retrieval remain limiting factors.

Abstract

: Event knowledge graphs support event-centric question answering by linking events to temporal, location, participant, and source-record information, but semantic relevance alone does not guarantee that a selected event satisfies every represented condition. We propose EviGraphRAG, a ranker-agnostic reliability layer that separates candidate ranking from exact verification and explicit abstention; EviGraphRAG-Struct is the default configuration. On the controlled oracle-normalized 4800-question benchmark, it preserves the unverified ranker’s positive-task outputs while attaining 0.9792 abstention accuracy. A separate 600-question set from machine-assisted drafting with deterministic construction and semantic-consistency checks shows realistic extraction noise: parser-based Macro Score is 0.7317 vs. 0.8717 with oracle constraints, with location extraction the largest weakness. After quoted-title-aware actor and location parsing repairs, the fixed predicted-cluster evaluation reaches 0.8448 Macro Score without positive false rejection. These results support a scoped claim: exact conjunction over represented event constraints and linked source-record connectivity can improve selective reliability, while parser quality and candidate retrieval remain limiting factors.

Read PDF

Similar papers

#natural language process... Preprint Sep 2026

SCoP: Structured Constraint Parsing for Evidence-Space Control in Temporal Knowledge Graph Question Answering

SCoP (Structured Constraint Parsing), a constraint-centric framework that externalizes temporal decisions before answer inference, separates answer-seeking event patterns from temporal anchor events, conservatively grounds them to canonical TKG entities and relations, and translates temporal intent into executable cons...

Xiao-Kun Guo, Zhen Xu, Dongdong Huo et al. · 0 citations
#natural language process... Preprint Sep 2026

TRACE: Target-Aware Retrieval, Attributed Evidence, and Contract-Constrained Extraction for LitTraceQA

Finding a relevant paper is not the same as producing a verifiable answer from it. LitTraceQA requires canonical paper identifiers, exact evidence at the page or object level, and typed answers that match the evaluator. We call the separation between source access and scorer-visible correctness the grounding contract g...

Sachin Gupta, Divya Godara · 0 citations
Book Open access Aug 2026

RA-QGQA: A Question-Driven Pipeline for Corpus-Grounded Knowledge Graph Verification

RA-QGQA is presented, which recasts triple verification as a question-driven, corpus-grounded task, and demonstrates RA-QGQA as an interactive web system in which users import a KG and its source corpus, verify all triples in a single pass, and inspect the passages that justify its verdict.

Si-Yang Liu, Hong Duc Nguyen, Yun-Miao Li et al. · 0 citations
Preprint Aug 2026

Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models

A relation-centric exploration paradigm is introduced, which uses relations rather than entities as search units and thus avoids unreliable entity pruning and proposes Compositional Chain-of-Relations (CCoR), a simple and effective framework that grounds both phases in the KG with two relation chains.

Chenhui Liu, Jianpeng Zhou, Jia-Hai Wang · 0 citations
#artificial intelligence Preprint Aug 2026

Ingest-Time Fact Compilation for Cost-Efficient and Reliable Question Answering over Revised Corpora

This work presents ingest-time fact compilation, an architecture that performs this work when corpus data is ingested or changed and supports a narrow but practical claim: resolving a corpus state once can make subsequent QA cheaper and more reliable for inexpensive models.

Kyle Wild, Yusuke Takahashi, Asako Uraki · 0 citations
Preprint Aug 2026

TraceSQL: Traceable Answerability Estimation for Reference-Free Text-to-SQL Verification

Results show that SQL verification can be performed with a lightweight learned model while retaining feature-level evidence for inspecting and diagnosing its predictions, and feature attribution shows that the model relies on both semantic grounding and deterministic SQL-structure signals.

N. Shukla, Debasmita Panda, Srutanik Bhaduri et al. · 0 citations

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