TRACE: State-Aware Query Processing over Temporal Evidence Graphs for Conversational Data

• URL: http://arxiv.org/abs/2607.00339v1
• Date: Wed, 01 Jul 2026 02:28:47 GMT
• Title: TRACE: State-Aware Query Processing over Temporal Evidence Graphs for Conversational Data
• Abstract summary: We present TRACE, a query processing framework over temporal evidence graphs for evolving conversational data.<n>TRACE models conversations as a hierarchical graph spanning events, sessions, and topics, enriched with typed temporal, causal, update, and contradiction relations.<n>At query time, TRACE combines vector-based note retrieval with graph-guided evidence search, generating validity-aware support paths and a hybrid context for answer generation.
• Score: 15.389000154441986
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conversational data is increasingly used as a persistent source of user state for long-running assistants and AI agents. However, querying this data remains challenging because conversations naturally evolve: plans are revised, preferences change, and later messages frequently supersede or contradict earlier information. Existing long-memory pipelines largely treat memories as independent text or vector objects. This approach often retrieves semantically similar but stale evidence, offering limited support for state-aware reasoning. To address this problem, we present TRACE, a query processing framework over temporal evidence graphs for evolving conversational data. TRACE models conversations as a hierarchical graph spanning events, sessions, and topics, enriched with typed temporal, causal, update, and contradiction relations. Crucially, the framework maintains validity annotations so obsolete facts remain accessible for historical queries but are discounted for current-state answers. At query time, TRACE combines vector-based note retrieval with graph-guided evidence search, generating validity-aware support paths and a hybrid context for answer generation. This design separates lexical recall from evidence reconstruction, enabling bounded query-time reasoning over long conversational histories. Experiments on long-conversation query-answering (QA) benchmarks show that TRACE improves temporal and multi-hop reasoning, with ablations highlighting the importance of hierarchy, update-aware seeding, and path-grounded evidence.

Related papers

• CueMem: Cue-Guided Context Reconstruction for Long-Term Conversational Memory [38.76918926805768]
  CueMem is a cue-guided framework that treats extracted memory records as retrieval cues.<n>It reconstructs query-relevant dialogue context from their source turns.<n>Experiments on LoCoMo and LongMemEval show that CueMem consistently outperforms representative long-term memory baselines.
  arXiv  Detail & Related papers  (2026-09-11T02:27:22Z)
• What Should an Agent Forget? Separating What Is Stored from What Is Used [14.434131011155545]
  Persistent language agents need stored experience to remain available across time.<n>We present RD-Forget, a training-free framework that separates what an agent stores from what it uses.
  arXiv  Detail & Related papers  (2026-09-09T14:48:09Z)
• CMT-RAG: Complementary Memory Traces for Multi-turn Multi-hop RAG [17.889279174355227]
  We introduce MuMu-QA, a benchmark for multi-turn multi-hop RAG with explicit cross-turn sub-question dependency annotations, and CMT-RAG, a complementary memory framework for this setting.<n>MuMu-QA and corpus-level RAG benchmarks show that CMT-RAG consistently outperforms five categories of RAG baselines in answer accuracy.
  arXiv  Detail & Related papers  (2026-07-29T04:50:41Z)
• ReContext: Recursive Evidence Replay as LLM Harness for Long-Context Reasoning [78.94047086588078]
  We propose Recursive Evidence as LLM Harness for Long-Context Reasoning.<n>It is a training-free inference method for improving long-context reasoning.<n> Experiments on eight long-context datasets with 128K context length show it consistently improves evidence utilization.
  arXiv  Detail & Related papers  (2026-07-02T17:59:26Z)
• SAM: State-Adaptive Memory for Long-Horizon Reasoning Agent [51.274445160155864]
  Long-horizon agentic reasoning requires large language models to act over long interaction histories containing thoughts, tool calls, observations, and partial conclusions.<n>Existing approaches address this difficulty by truncating the interaction history, compressing it into shorter surrogates, or retrieving selected parts of it for reuse.<n>We propose State-Adaptive Memory, a standalone framework that consolidates ongoing interaction into compact memory cues while preserving raw trajectory pages for intent-driven recall.
  arXiv  Detail & Related papers  (2026-05-23T08:37:16Z)
• All-Mem: Agentic Lifelong Memory via Dynamic Topology Evolution [20.68235182577703]
  All-Mem maintains a structured memory bank via explicit, non destructive consolidation.<n>Periodically offline, an LLM diagnoser proposes confidence scored topology edits executed with three operators: SPLIT, MERGE, and UPDATE.<n>At query time, typed links enable hop bounded, budgeted expansion from active anchors to archived evidence when needed.
  arXiv  Detail & Related papers  (2026-03-20T03:14:40Z)
• AMA: Adaptive Memory via Multi-Agent Collaboration [54.490349689939166]
  We propose Adaptive Memory via Multi-Agent Collaboration (AMA), a novel framework that leverages coordinated agents to manage memory across multiple granularities.<n>AMA significantly outperforms state-of-the-art baselines while reducing token consumption by approximately 80% compared to full-context methods.
  arXiv  Detail & Related papers  (2026-01-28T08:09:49Z)
• Toward Multi-Session Personalized Conversation: A Large-Scale Dataset and Hierarchical Tree Framework for Implicit Reasoning [30.54506564763053]
  We introduce ImplexConv, a large-scale long-term dataset with 2,500 examples, each containing approximately 100 conversation sessions.<n>We also propose TaciTree, a novel hierarchical tree framework that structures conversation history into multiple levels of summarization.
  arXiv  Detail & Related papers  (2025-03-10T07:59:41Z)
• Toward Conversational Agents with Context and Time Sensitive Long-term Memory [8.085414868117917]
  Until recently, most work on RAG has focused on information retrieval from large databases of texts, like Wikipedia. We argue that effective retrieval from long-form conversational data faces two unique problems compared to static database retrieval. We generate a new dataset of ambiguous and time-based questions that build upon a recent dataset of long-form, simulated conversations.
  arXiv  Detail & Related papers  (2024-05-29T18:19:46Z)
• Phrase Retrieval for Open-Domain Conversational Question Answering with Conversational Dependency Modeling via Contrastive Learning [54.55643652781891]
  Open-Domain Conversational Question Answering (ODConvQA) aims at answering questions through a multi-turn conversation. We propose a method to directly predict answers with a phrase retrieval scheme for a sequence of words.
  arXiv  Detail & Related papers  (2023-06-07T09:46:38Z)
• History-Aware Hierarchical Transformer for Multi-session Open-domain Dialogue System [59.78425104243993]
  We propose History-Aware Hierarchical Transformer (HAHT) for multi-session open-domain dialogue. HAHT maintains a long-term memory of history conversations and utilizes history information to understand current conversation context. Experimental results on a large-scale Multi-Session Conversation dataset suggest that the proposed HAHT model consistently outperforms baseline models.
  arXiv  Detail & Related papers  (2023-02-02T06:54:33Z)
• Query Resolution for Conversational Search with Limited Supervision [63.131221660019776]
  We propose QuReTeC (Query Resolution by Term Classification), a neural query resolution model based on bidirectional transformers. We show that QuReTeC outperforms state-of-the-art models, and furthermore, that our distant supervision method can be used to substantially reduce the amount of human-curated data required to train QuReTeC.
  arXiv  Detail & Related papers  (2020-05-24T11:37:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.