Long-term conversational question answering can require several separated dialogue turns that support an answer only together. We introduce EviCover, a retrieval approach designed to retain this complementary evidence. It converts questions into observable evidence requirements, checks requirement coverage using retrieved source identifiers, and selects turns jointly. We track annotated support sets - the benchmark-labeled dialogue turns associated with each question - through retrieval, reranking, and final answer-generation context. We evaluate the baseline memory pipeline on generated, human-verified LoCoMo conversations and human-written REALTALK conversations, and examine EviCover on REALTALK's 108 multi-hop questions. Compared with the hybrid lexical/dense baseline, support-turn recall among 60 candidate turns rises from 0.526 to 0.575, and recall in the final ten-turn context rises from 0.349 to 0.379. The evidence funnel identifies separate discovery and selection failures, while paired answer evaluation shows that greater evidence recall does not yet establish a correctness gain. This analysis locates where complementary evidence is lost and distinguishes evidence retrieval from its use in answer generation.
Figures & tables
Figure 1: EviCover overview: provenance-constrained proof-set retrieval. Requirement coverage is accepted only with a retrieved turn identifier. The pointwise and setwise top-10 contexts use the same discovered candidates and relevance scores; only final set selection changes. ER and PS are measured at every stored boundary.
Run
R@5
F1
CP
CR
Cit.-Gr.
LoCoMo initial
.772
.316
.463
.448
.493
LoCoMo revised
.771
.394
.558
.535
.593
REALTALK baseline
.579
.291
.477
.374
.511
Table 1: Baseline evaluation on both datasets. CP/CR are citation precision/recall; Cit.-Gr. is the mechanical citation-grounded answer rate defined in Sec. 3.2 .
Type ( n )
R@5
F1
J-C/P
J-Sup.
Cit.-Gr.
Factual (301)
.391
.381
.847
.787
.475
Temporal (319)
.814
.239
.777
.702
.611
Multi-hop (108)
.409
.191
.750
.556
.315
Table 2: REALTALK baseline by query type. J-C/P is judge correct-or-partial; J-Sup. is judge-supported; Cit.-Gr. is the mechanical metric.
Distance unit
Median
P90
Maximum
Turn positions
380
989
1574
Sessions
12
19
24
Days
12
21
23
Table 3: Distance from each of 327 support turns to the final observed turn.
System
Stage
Hits/327
ER
Full sets
Flat hybrid
top-60
172
.526
50/108
Flat hybrid
final top-10
114
.349
36/108
Req. discovery
accumulated
217
.664
63/108
Req. discovery
top-60
188
.575
55/108
Req. discovery
top-120
207
.633
60/108
Pointwise
final top-10
116
.355
36/108
Table 4: Evidence funnel on all 108 multi-hop questions. “Req. discovery” denotes requirement-guided retrieval. Top-60/120 rows report ranked candidates.
Long-term conversational memory requires retrieving evidence scattered across multiple sessions, yet single-pass retrieval fails on temporal and multi-hop questions. Existing iterative methods refine queries via generated content or document-level signals, but none explicitly diagnoses the evidence gap, namely what is missing from the accumulated retrieval set, leaving query refinement untargeted. We present EviMem, combining IRIS (Iterative Retrieval via Insufficiency Signals), a closed-loop framework that detects evidence gaps through sufficiency evaluation, diagnoses what is missing, and drives targeted query refinement, with LaceMem (Layered Architecture for Conversational Evidence Memory), a coarse-to-fine memory hierarchy supporting fine-grained gap diagnosis. On LoCoMo, EviMem improves Judge Accuracy over MIRIX on temporal (73.3% to 81.6%) and multi-hop (65.9% to 85.2%) questions at 4.5x lower latency. Code: https://github.com/AIGeeksGroup/EviMem.
Long-term memory enables language models to use past interactions in future conversations. However, evidence needed to answer a question may be scattered across distant turns, while the question itself omits clues needed to locate it. Retrieved facts can reveal these clues, motivating retrieval decisions conditioned on evidence already found. We introduce MERA (Missing-Evidence Retrieval Augmentation), which separates globally searchable memory from a question-specific evidence state. Verified evidence guides subsequent retrieval without restricting access to the global memory. We train a lightweight planner through reinforcement learning, rewarding queries that recover previously missing evidence. MERA achieves strong answer accuracy across Qwen3-30B and GPT-4o-mini backbones. With Qwen3-30B for evidence processing and answer generation, the trained 0.6B planner achieves 77.40% accuracy on LoCoMo and 71.29% on LongMemEval-S, exceeding a 30B planner without retrieval-grounded training by 4.10% and 3.96%, respectively. On LoCoMo, later retrieval rounds increase cumulative evidence recall from 55.5% to 80.5%.
Entity-Memory graph retrieval keeps dialogue turns as verbatim Memory nodes, links repeated mentions through shared Entities, and connects adjacent Memories with directed chronological edges. At query time the retriever moves from Entity gating through semantic fusion and one-hop chronological recovery to dense backfill. The path can keep a neighboring Memory that dense cosine ranking would otherwise omit. A matched dense control shares the Memory and query vectors, context budget, requested answer protocol, and evaluator, isolating graph structure from changes to the reader. On 1,986 questions from ten LoCoMo conversations, graph retrieval raises official evidence recall at top-k 25 from 79.7468% to 84.4842%. The recall advantage is supported from top-k 5 to 50, while no matched cutoff supports an overall final-answer F1 difference. Four paper-eligible requested configurations support empirical robustness across the tested GPT-3.5 and DeepSeek extractors on both outcomes. Embedding robustness is mixed: F1 has no supported contrast, but recall is sensitive to the embedding artifact. The comparison isolates a retrieval-coverage gain from graph structure. It does not establish a final-answer F1 gain, model or embedding equivalence, or cross-dataset generalization.