arXiv Computation and Language

EGCForest: Structured Agent Memory Organization for Enterprise Group Chats

EGCForest is a multi‑view hierarchical memory framework designed for enterprise group chats. It organizes the immutable message log into three complementary forests—Channel, Actor, and Artifact—each capturing temporal workflows, speaker‑conditioned context, and deliverable lifecycles, respectively. By using a Placement Map and sparse structural bridges, EGCForest jointly leverages message‑level relevance, forest summaries, and cross‑view links to retrieve and assemble distributed evidence, outperforming RAG and memory‑system baselines by up to 20.85 points on three benchmarks.

arXiv Computation and Language
Sep 1

UTILMEM: Benchmarking Evidence Utilization in Long-Term Conversational Memory

UTILMEM is a new diagnostic benchmark that tests how conversational agents use long‑term memory, focusing on reasoning over dense histories, spotting implicitly relevant memories, synthesizing distributed evidence, and resisting interference from similar distractors. It contains 1,717 instances across five domains and evaluates a range of retrieval‑based and memory‑augmented systems. The study shows that strong performance on traditional factual recall does not guarantee effective memory utilization, highlighting a gap between retrieving information and integrating it into coherent, task‑oriented outputs.

By Peijun Qing, Fobo Shi, Soroush Vosoughi
arXiv Computation and Language
Oct 12

Temporal Evidence Forests for Long-Horizon Multi-Party Conversational Memory

The paper introduces T‑Mem, a memory framework that uses temporal structure to manage long‑horizon multi‑party conversations. It employs Temporal Evidence Discovery to find locally concentrated evidence, Temporal Memory Structuring to model state transitions and compress low‑information spans, and Evidence Forest Linearization to serialize the evidence for answer generation. Experiments on two benchmarks show that T‑Mem outperforms existing memory frameworks across various settings.

By Junyou Guo, Chongyang Tao, Yan He, Yong Wang, Shuai Ma
arXiv Computation and Language
Aug 31

Entity-Memory Graph Retrieval Improves Evidence Coverage in Long-Conversation Question Answering

Entity-Memory graph retrieval preserves dialogue turns as verbatim memory nodes, links repeated mentions via shared entities, and connects adjacent memories with chronological edges. During retrieval, the system gates through entities, fuses semantics, and performs one‑hop chronological recovery before dense backfill, allowing it to keep neighboring memories that dense cosine ranking might miss. On 1,986 questions from ten LoCoMo conversations, this graph retrieval method increases official evidence recall at top‑k 25 from 79.7468 % to 84.4842 %, with the advantage extending from top‑k 5 to 50, though it does not improve overall final‑answer F1.

By Shumao Sun
arXiv Computation and Language
Oct 9

Event-Centric Memory with Query-Aware Graph Augmentation for Long-Term Conversational Agents

The paper introduces QGMem, a memory framework for conversational agents that organizes dialogue history into event-indexed atomic units and consolidates related units into dynamic memory traces. When a query is posed, QGMem retrieves complementary candidate memories, reranks them to form a compact working memory, and represents this working memory as a local graph to expose relational dependencies. Experiments on six benchmarks demonstrate consistent improvements in retrieval, multi‑hop evidence composition, conflict resolution, and ultra‑long dialogue reasoning while keeping context size and inference cost moderate.

By Yichen Liu, Chunfeng Yuan, Haowei Liu, Wenjuan Li, Zefeng Lin, Bing Li, Xu Chen, Weiming Hu
arXiv Computation and Language
Aug 27

Reconstructing the Right Episode: Evaluating Interleaved Conversational Memory Beyond Long Context

The paper introduces SCALE-QA, a new QA benchmark that tests conversational memory in flat, unsegmented multi‑topic threads by requiring agents to infer which earlier episode supports a later task decision. The dataset contains 3,000 audited questions across ten domains, uses deterministic four‑way multiple‑choice grading, and includes a runtime builder for reproducibility. The authors also propose Temporal‑Semantic Interleaved Memory Reconstruction (TSIM), a hierarchical memory stack that segments turns into coherent episodes and indexes them with deterministic summaries and cluster‑routing views, achieving significant accuracy gains over strong RAG baselines and long‑context LLMs.

By Zhexi Feng, Ruiyi Zhang, Yongbo Yang, Pengtao Xie