REVIEW 6 cited by
DyG-RAG: Dynamic Graph Retrieval-Augmented Generation with Event-Centric Reasoning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
DyG-RAG: Dynamic Graph Retrieval-Augmented Generation with Event-Centric Reasoning
read the original abstract
Graph Retrieval-Augmented Generation has emerged as a powerful paradigm for grounding large language models with external structured knowledge. However, existing Graph RAG methods struggle with temporal reasoning, due to their inability to model the evolving structure and order of real-world events. In this work, we introduce DyG-RAG, a novel event-centric dynamic graph retrieval-augmented generation framework designed to capture and reason over temporal knowledge embedded in unstructured text. To eliminate temporal ambiguity in traditional retrieval units, DyG-RAG proposes Dynamic Event Units (DEUs) that explicitly encode both semantic content and precise temporal anchors, enabling accurate and interpretable time-aware retrieval. To capture temporal and causal dependencies across events, DyG-RAG constructs an event graph by linking DEUs that share entities and occur close in time, supporting efficient and meaningful multi-hop reasoning. To ensure temporally consistent generation, DyG-RAG introduces an event timeline retrieval pipeline that retrieves event sequences via time-aware traversal, and proposes a Time Chain-of-Thought strategy for temporally grounded answer generation. This unified pipeline enables DyG-RAG to retrieve coherent, temporally ordered event sequences and to answer complex, time-sensitive queries that standard RAG systems cannot resolve. Extensive experiments on temporal QA benchmarks demonstrate that DyG-RAG significantly improves the accuracy and recall of three typical types of temporal reasoning questions, paving the way for more faithful and temporal-aware generation. DyG-RAG is available at https://github.com/RingBDStack/DyG-RAG.
Forward citations
Cited by 6 Pith papers
-
IA-RAG: Interval-Algebra-Driven Temporal Reasoning for Dynamic Knowledge Retrieval
IA-RAG is a hierarchical RAG framework that represents facts as Interval Event Units organized in a Thematic Forest under Allen's Interval Algebra, with Sub-graph Time Tightening for fuzzy intervals, and reports impro...
-
Knowledge Is Not Static: Order-Aware Hypergraph RAG for Language Models
OKH-RAG represents knowledge as ordered hyperedges and retrieves coherent interaction sequences via a learned transition model, outperforming permutation-invariant RAG baselines on order-sensitive QA tasks.
-
PulseCX: Breaking the Closed-World Assumption in Real-Time CX
PulseCX decouples knowledge acquisition from response generation via a DA-TKG and hierarchical intent gating to achieve low-latency real-time CX performance.
-
Event-Centric World Modeling with Memory-Augmented Retrieval for Embodied Decision-Making
An event-centric framework encodes environments as semantic events and retrieves weighted prior maneuvers from a knowledge bank to enable interpretable, physics-aware decision-making for UAVs.
-
Event-Centric World Modeling with Memory-Augmented Retrieval for Embodied Decision-Making
ERA encodes environments as semantic events, retrieves prior event–action pairs from a knowledge bank, and forms actions by weighted aggregation for interpretable embodied control.
-
Chronological Knowledge Retrieval: A Retrieval-Augmented Generation Approach to Construction Project Documentation
A RAG framework integrates semantic search and LLMs to deliver time-annotated answers to natural-language questions on construction project meeting minutes, demonstrated on an industry dataset with public code and dat...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.