Test-Time Memory Construction

# Test-Time Memory Construction
Source: [https://arxiv.org/html/2610.13348](https://arxiv.org/html/2610.13348)
Zijun Wang††thanks:indicates equal contribution\.Yifan Ji11footnotemark:1Affiliation:School of Computer Science and Engineering, Northeastern University, ChinaHaidong XinAffiliation:School of Computer Science and Engineering, Northeastern University, ChinaZhenghao Liu††thanks:indicates corresponding author\.Affiliation:School of Computer Science and Engineering, Northeastern University, ChinaYukun YanAffiliation:Department of Computer Science and Technology, Tsinghua University, ChinaZulong ChenAffiliation:Alibaba Group, ChinaYu GuAffiliation:School of Computer Science and Engineering, Northeastern University, ChinaGe YuAffiliation:School of Computer Science and Engineering, Northeastern University, ChinaMaosong SunAffiliation:Department of Computer Science and Technology, Tsinghua University, China

###### Abstract

Large Language Models \(LLMs\) struggle to answer questions over long interaction histories, where relevant evidence may be scattered across distant sessions\. Existing memory systems typically construct and maintain sophisticated memory representations offline, before user queries are observed, incurring substantial overhead and limiting their ability to adapt memory construction to query\-specific information needs\. In this paper, we propose T2Mem, aTest\-TimeMemory construction framework that defers memory construction to inference and progressively builds memory along the reasoning process\. Specifically, T2Mem extracts lightweight episode\-level metadata offline to capture key events and temporal associations as retrieval cues, while retaining links to the original interactions to facilitate the reconstruction of dependencies across episodes\. At test time, the LLM adaptively retrieves and organizes metadata and raw interactions, progressively constructing query\-specific memory as reasoning unfolds\. Experiments on LoCoMo and LongMemEval show the effectiveness of T2Mem by consistently outperforming strong baselines across different backbone LLMs while substantially reducing the overhead of memory construction\. Further analysis demonstrates that deferring memory construction to inference enables the memory construction process to dynamically adapt to the information needs of individual queries\. All code is available at[https://github\.com/OpenBMB/T2Mem](https://github.com/OpenBMB/T2Mem)\.

## 1Introduction

Large Language Models \(LLMs\) have demonstrated strong emergent capabilities across a wide range of tasks\([Yao et al\., 2023](https://arxiv.org/html/2610.13348#bib.bib18);[Li et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib21);[Xin et al\., 2026b](https://arxiv.org/html/2610.13348#bib.bib28);[Liu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib7)\)\. However, as user interactions grow longer, LLMs still struggle to reason over extended interaction histories due to limited context windows and the difficulty of effectively locating relevant information within long contexts\([Hu et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib27);[Liu et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib11);[Hsieh et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib19)\)\. A straightforward solution is Retrieval\-Augmented Generation \(RAG\), which segments historical interactions into chunks and retrieves relevant ones at inference time\([Lewis et al\., 2020](https://arxiv.org/html/2610.13348#bib.bib6);[Edge et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib20);[Li et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib21);[Li et al\., 2026b](https://arxiv.org/html/2610.13348#bib.bib1)\)\. However, chunk\-level retrieval often treats historical interactions as isolated units, potentially disrupting temporal context and cross\-turn dependencies among related interactions\. This fragmentation makes it difficult for LLMs to fully exploit the interconnected information embedded in long interaction histories\([Xin et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib23);[Zhang et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib39)\)\.

To address this limitation, recent memory systems\([Chhikara et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib13);[Kang et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib14);[Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17)\)organize long interaction histories into manageable memory units\. These methods introduce dedicated mechanisms to filter, summarize, and consolidate historical interactions into persistent memory representations, enabling efficient access in future interactions\. However, constructing and maintaining such sophisticated memory representations can incur substantial overhead\. In particular, offline memory construction must anticipate diverse future queries and preserve sufficiently comprehensive information in each memory unit, resulting in considerable preprocessing and maintenance costs that can hinder the scalability and practical deployment of memory systems\([Peng et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib33)\)\. Recent efforts have therefore explored deferring memory construction to test time, reducing the reliance on costly preconstructed memory representations\([Yu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib31);[Yin and Tang, 2026](https://arxiv.org/html/2610.13348#bib.bib32)\)\. Nevertheless, these approaches typically construct memory from an initially retrieved candidate set, making it difficult to acquire additional evidence that is not retrieved initially but becomes necessary as the memory construction process unfolds\.

Recent advances in test\-time scaling have demonstrated the potential of leveraging additional inference\-time computation to elicit stronger reasoning capabilities from LLMs\. By allocating more computation at inference time, LLMs can iteratively explore, verify, and revise intermediate solutions\([Snell et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib30);[OpenAI et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib29);[Guo et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib5)\)\. This raises a natural question:Can memory construction similarly benefit from inference\-time reasoning, allowing an LLM to dynamically determine what historical information to activate and organize as it reasons?We answer this question by treating memory not as a fixed representation constructed offline, but as an evolving state that is progressively constructed during inference\.

Based on this perspective, we propose T2Mem, aTest\-TimeMemory construction framework that dynamically constructs memory during inference\. T2Mem draws inspiration from associative recall, where relevant memories can be progressively activated as retrieval cues emerge\([Teyler and Rudy, 2007](https://arxiv.org/html/2610.13348#bib.bib3);[Horner et al\., 2015](https://arxiv.org/html/2610.13348#bib.bib2)\)\. Instead of constructing sophisticated memory representations offline, T2Mem first extracts lightweight episode\-level metadata that captures salient events and temporal associations, while retaining backlinks to the corresponding raw interactions\. The metadata provides a compact structure for associating related episodes and locating their underlying evidence\. During inference, the LLM progressively reasons over the query and uses this evolving reasoning process to navigate the metadata and selectively activate corresponding raw interactions\. In this way, memory construction and reasoning are interleaved: each newly activated piece of evidence can inform subsequent reasoning and, in turn, guide the construction of a more relevant memory state\. The final memory is therefore not predetermined before inference, but emerges progressively from the interaction between reasoning and memory activation\.

In our experiments, we evaluate T2Mem on LoCoMo and LongMemEval with two backbone LLMs\. Across both benchmarks, T2Mem consistently outperforms strong memory and retrieval baselines under comparable total token budgets, demonstrating the effectiveness of dynamically constructing memory at test time\. Further analysis reveals that deferring memory construction to inference allows T2Mem to adapt the construction process to the specific information needs of each query\. This advantage is particularly evident for queries that require deeper memory construction, such as multi\-hop and temporal questions, where relevant evidence is distributed across multiple episodes and cannot be fully identified through a single initial retrieval step\. Moreover, by leveraging episode\-level metadata, T2Mem enables the LLM to establish dependencies across episodes and trace these dependencies back to relevant source interactions during reasoning, facilitating more effective memory construction without the substantial overhead of maintaining sophisticated memory units\.

## 2Related Work

Large Language Models \(LLMs\) struggle to reason over long\-horizon interaction histories due to limited context windows\([Liu et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib11);[Hsieh et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib19)\)\. Retrieval\-Augmented Generation \(RAG\) methods address this limitation by segmenting interaction histories into chunks and retrieving query\-relevant ones as context for answering user queries\([Lewis et al\., 2020](https://arxiv.org/html/2610.13348#bib.bib6);[Edge et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib20)\)\. However, such chunk\-based retrieval often breaks the contextual and temporal dependencies inherent in interaction histories\([Xin et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib23)\)\. Recent memory systems therefore introduce dedicated memory management mechanisms to organize, retain, and update historical interactions\. For example, MemGPT\([Packer et al\., 2023](https://arxiv.org/html/2610.13348#bib.bib9)\)and MemoryOS\([Kang et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib14)\)are inspired by operating systems and maintain memory states by continuously incorporating relevant information into existing memory units\. MemoryBank\([Zhong et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib8)\)draws inspiration from human memory and incorporates the Ebbinghaus forgetting curve to regulate the retention and updating of memory units\. Despite their effectiveness, these approaches primarily focus on memory maintenance, while the structure and representation of memory units, which can directly affect how effectively memories are retained, updated, and accessed, remain less explored\.

To construct more effective memory representations, existing methods typically segment, compress, and consolidate interaction histories using different strategies\. Specifically, HiMem\([Zhang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib22)\)segments interaction histories along event boundaries to form coherent episodic memories, while LightMem\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17)\)compresses and consolidates interactions by topic to preserve salient information\. Subsequent approaches further organize these compact memories into higher\-level semantic\([Hu et al\., 2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)or temporal\([Li et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib4)\)structures, allowing evidence distributed across interactions to be accessed at different levels of abstraction\. To further enhance the traceability of memory representations, AnchorMem\([Shen et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib16)\)links memory units to their original interactions, allowing fine\-grained source information to be retrieved when needed\. However, these approaches often incur substantial overhead in constructing and maintaining sophisticated memory representations, which can hinder the practical deployment and scalability of memory systems\([Peng et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib33)\)\.

To alleviate the reliance of memory effectiveness on predefined memory representations, recent work has shifted toward query\-time memory construction\([Yu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib31);[Yin and Tang, 2026](https://arxiv.org/html/2610.13348#bib.bib32)\)\. These methods typically retrieve a broad set of query\-relevant facts and reorganize them into memory\. While this paradigm enables more comprehensive memory construction, its retrieval process remains largely rigid and one\-shot, focusing on retrieving more relevant information rather than actively identifying what information is actually needed to construct an effective memory\. Such a passive retrieval process may therefore fail to acquire missing evidence that only becomes apparent from the partially constructed memory\([Yao et al\., 2023](https://arxiv.org/html/2610.13348#bib.bib18);[Li et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib21)\)\. To enable LLMs to actively acquire information according to their evolving needs, T2Mem treats memory construction as a dynamic reasoning process at test time\. Inspired by the test\-time scaling of LLMs\([OpenAI et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib29);[Guo et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib5);[Snell et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib30)\), T2Mem allows the evolving memory state to actively determine what evidence should be retrieved and integrated next\. This closed\-loop process enables the model to seek information genuinely needed for memory construction, better distinguish between potentially conflicting or ambiguous facts, and progressively refine memory as reasoning unfolds\.

## 3Methodology

In this section, we introduce T2Mem, a*test\-time memory construction*framework for long\-term conversational question answering\. Unlike conventional approaches that construct a query\-agnostic memory before inference, T2Mem dynamically constructs memory at test time by progressively uncovering and organizing relevant information from the raw interaction history\. We first revisit existing memory systems and show how T2Mem decouples memory construction from the offline preprocessing stage, enabling memory to be constructed dynamically during inference \(Sec\.[3\.1](https://arxiv.org/html/2610.13348#S3.SS1)\)\. We then present the architecture of T2Mem, which leverages the reasoning capabilities of LLMs to progressively incorporate relevant information to construct tailored memory \(Sec\.[3\.2](https://arxiv.org/html/2610.13348#S3.SS2)\)\.

### 3\.1Disentangling Memory Orchestration from Offline to Test Time

Given a long\-term interaction history𝒮=\{s1,s2,…,sn\}\\mathcal\{S\}=\\\{s\_\{1\},s\_\{2\},\\ldots,s\_\{n\}\\\}, a memory system organizes information scattered across interaction sessions into manageable memory unitsℳ=\{m1,m2,…,mN\}\\mathcal\{M\}=\\\{m\_\{1\},m\_\{2\},\\ldots,m\_\{N\}\\\}\. These memory units focus on preserving factual knowledge, user preferences, and cross\-session dependencies by resolving conflicts in the interactions and incorporating potentially useful information\. Existing memory systems typically construct such memory representations offline, before future queries are presented to the LLM\. In contrast, T2Mem defers memory orchestration to test time, using the given query to incorporate acquired information into the reasoning trajectory, thereby organizing relevant knowledge dynamically during inference\.

Offline Memory Construction\.Existing memory systems first construct a query\-agnostic memory collectionℳ\\mathcal\{M\}from the raw interaction history𝒮\\mathcal\{S\}by extracting, summarizing, and organizing potentially useful information:

ℳ=πmem​\(s1,s2,…,sn\),\\mathcal\{M\}=\\pi\_\{\\mathrm\{mem\}\}\(s\_\{1\},s\_\{2\},\\ldots,s\_\{n\}\),\(1\)whereπmem\\pi\_\{\\mathrm\{mem\}\}denotes the memory construction policy, which may repeatedly invoke LLMs to extract, update, and delete information as new interactions arrive, while also maintaining sophisticated memory representations such as hierarchical or graph\-based structures\. Moreover, since such construction is query\-agnostic, the memory system must organize information without knowing which parts will be relevant to future queries, often incurring substantial construction and maintenance overhead\([Peng et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib33)\)\. Given a user queryqq, the system retrieves a subset of the preconstructed memory units and uses them to generate the answer:

y=LLM⁡\(q,Retriever⁡\(q,ℳ\)\),y=\\operatorname\{LLM\}\(q,\\operatorname\{Retriever\}\(q,\\mathcal\{M\}\)\),\(2\)whereRetriever⁡\(⋅\)\\operatorname\{Retriever\}\(\\cdot\)denotes the memory retrieval procedure\. By extracting and organizing information in advance, these methods maintain persistent memory representations that can be directly retrieved at inference time\([Kang et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib14);[Hu et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)\.

Test\-Time Memory Evolving\.Rather than constructing sophisticated memory representations offline, T2Mem mimics human associative recall by progressively activating relevant episodes as reasoning unfolds, allowing the LLM to orchestrate memory at test time\([Horner et al\., 2015](https://arxiv.org/html/2610.13348#bib.bib2)\)\. To represent episodic experiences\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17)\), T2Mem first extracts episode\-level metadata that captures the dependencies among key events and temporal associations within each episode, using concise episode descriptions as retrieval cues\. Given a query, the LLM then progressively uncovers query\-relevant information by following these cues and locating the corresponding raw dialogue through the extracted metadata\.

Specifically, T2Mem employs an LLMπmeta\\pi\_\{\\mathrm\{meta\}\}to extract lightweight, episode\-level metadataℐ\\mathcal\{I\}from the dialog history𝒮=\{s1,s2,…,sn\}\\mathcal\{S\}=\\\{s\_\{1\},s\_\{2\},\\ldots,s\_\{n\}\\\}:

ℐ=πmeta​\(s1,s2,…,sn\),\\mathcal\{I\}=\\pi\_\{\\mathrm\{meta\}\}\(s\_\{1\},s\_\{2\},\\ldots,s\_\{n\}\),\(3\)whereℐ=\{i1,i2,…,in\}\\mathcal\{I\}=\\\{i\_\{1\},i\_\{2\},\\ldots,i\_\{n\}\\\}contains extracted metadata entries for dialog sessions\. Eachiki\_\{k\}organizes the key events, facts, entities, and temporal cues from sessionsks\_\{k\}into a semi\-structured representation, while maintaining a source linkℒ⁡\(ik\)=sk\\mathcal\{L\}\(i\_\{k\}\)=s\_\{k\}for traceability\([Sun et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib37);[Shen et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib16)\)\. These metadata entries serve as compact retrieval cues for associating related episodes at test time \(Eq\.[4](https://arxiv.org/html/2610.13348#S3.E4)\), allowing T2Mem to identify cross\-episode dependencies through the metadata and trace the retrieved cues back to their corresponding source sessions viaℒ⁡\(ik\)\\mathcal\{L\}\(i\_\{k\}\)\.

Subsequently, given a queryqq, T2Mem dynamically constructs memory by accessing the metadataℐ\\mathcal\{I\}and the original interaction history𝒮\\mathcal\{S\}through a set of information\-access tools𝒯\\mathcal\{T\}:

y=LLM⁡\(q,ℐ,𝒮,𝒯\)\.y=\\operatorname\{LLM\}\\bigl\(q,\\mathcal\{I\},\\mathcal\{S\},\\mathcal\{T\}\\bigr\)\.\(4\)Rather than relying on rigid, one\-shot retrieval, T2Mem invokes the tools in𝒯\\mathcal\{T\}during inference to progressively acquire relevant information in response to its evolving reasoning needs\. The retrieved information is incorporated into the ongoing reasoning process, enabling the model to iteratively construct memory as reasoning unfolds\. Thus, T2Mem decouples memory construction from costly offline memory orchestration, instead deferring memory construction to test time, where it can be dynamically tailored to the query and the evolving reasoning process\.

![Refer to caption](https://arxiv.org/html/2610.13348v1/model.png)Figure 1:Overall Architecture of Our Proposed T2Mem Framework\.
### 3\.2Dynamic Memory Construction During LLM Reasoning

As illustrated in Figure[1](https://arxiv.org/html/2610.13348#S3.F1), we detail how T2Mem dynamically constructs query\-specific memory at test time \(Eq\.[4](https://arxiv.org/html/2610.13348#S3.E4)\) by progressively acquiring, distilling, and organizing relevant information during reasoning\. At each step, the LLM reasons over the accumulated memory and the current observation, distills query\-relevant information into the evolving memory state, and determines what additional information is needed\. Based on this information need, it either terminates the process or selects an appropriate tool from𝒯\\mathcal\{T\}to access episode\-level metadata or fine\-grained raw information, thereby supporting subsequent memory construction\.

We first formulate this process as an iterative reasoning trajectoryτ\\tauconsisting ofTTmemory construction steps:

τ=\(\(r1,m1,a1\),\(r2,m2,a2\),…,\(rT,mT,aT\)\),\\tau=\\bigl\(\(r\_\{1\},m\_\{1\},a\_\{1\}\),\(r\_\{2\},m\_\{2\},a\_\{2\}\),\\ldots,\(r\_\{T\},m\_\{T\},a\_\{T\}\)\\bigr\),\(5\)wherertr\_\{t\},mtm\_\{t\}, andata\_\{t\}denote the reasoning trace, newly constructed memory cache, and selected action at steptt, respectively\. The accumulated memory cachesℳt\\mathcal\{M\}\_\{t\}generated throughout the trajectory are progressively concatenated to form the final query\-specific memoryℳT\\mathcal\{M\}\_\{T\}:

ℳT=m1⊕m2⊕⋯⊕mT,\\mathcal\{M\}\_\{T\}=m\_\{1\}\\oplus m\_\{2\}\\oplus\\cdots\\oplus m\_\{T\},\(6\)where⊕\\oplusdenotes the concatenation operation\. The LLM then generates the final answer conditioned on the user queryqqand the resulting memoryℳT\\mathcal\{M\}\_\{T\}:

y=LLM⁡\(q,ℳT\)\.y=\\operatorname\{LLM\}\(q,\\mathcal\{M\}\_\{T\}\)\.\(7\)Dynamic Memory Construction\.We next describe how each step produces\(rt,mt,at\)\(r\_\{t\},m\_\{t\},a\_\{t\}\)and updates the memory state\. At steptt, the LLM takes the queryqq, the accumulated memoryℳt−1\\mathcal\{M\}\_\{t\-1\}, the latest observationot−1o\_\{t\-1\}, and the available tool set𝒯\\mathcal\{T\}as input, and jointly produces a reasoning tracertr\_\{t\}, a newly constructed memory cachemtm\_\{t\}, and the next actionata\_\{t\}:

\(rt,mt,at\)=LLM⁡\(q,ℳt−1,ot−1,𝒯\),\(r\_\{t\},m\_\{t\},a\_\{t\}\)=\\operatorname\{LLM\}\(q,\\mathcal\{M\}\_\{t\-1\},o\_\{t\-1\},\\mathcal\{T\}\),\(8\)where the memory is initialized asℳ0=∅\\mathcal\{M\}\_\{0\}=\\varnothing\. The initial observation is obtained by retrieving the top\-kkmetadata entries inℐ\\mathcal\{I\}most relevant toqq:

o0=Top−⁡k⁡\(q,ℐ\),o\_\{0\}=\\operatorname\{Top\-\}k\(q,\\mathcal\{I\}\),\(9\)whereTop−⁡k\\operatorname\{Top\-\}kselects thekkmetadata entries inℐ\\mathcal\{I\}that are most relevant to the queryqq\. The reasoning tracertr\_\{t\}guides the LLM in distilling query\-relevant evidence fromot−1o\_\{t\-1\}into the newly constructed memory cachemtm\_\{t\}\. The memory is then updated by appendingmtm\_\{t\}to the accumulated memory:

ℳt=ℳt−1⊕mt,\\mathcal\{M\}\_\{t\}=\\mathcal\{M\}\_\{t\-1\}\\oplus m\_\{t\},\(10\)thereby completing the memory update at steptt\. The process terminates when the current memory state satisfies the information need of the given query or when the maximum number of construction stepsTmaxT\_\{\\max\}is reached\. LetT≤TmaxT\\leq T\_\{\\max\}denote the actual number of executed steps\. Finally, the accumulated memoryℳT\\mathcal\{M\}\_\{T\}is used to help the LLM generate the final answer according to Eq\.[7](https://arxiv.org/html/2610.13348#S3.E7)\.

Adaptive Searching During LLM Reasoning\.After constructingmtm\_\{t\}, the LLM executes the selected actionata\_\{t\}, either terminating the process withAnsweror invoking an information\-access tool to obtain the next observationoto\_\{t\}\. Specifically, we define the tool set𝒯\\mathcal\{T\}as:

𝒯=\{SearchMeta​\(⋅\),ReadRaw​\(⋅\)\},\\mathcal\{T\}=\\left\\\{\\texttt\{SearchMeta\}\(\\cdot\),\\texttt\{ReadRaw\}\(\\cdot\)\\right\\\},\(11\)whereSearchMeta​\(⋅\)\\texttt\{SearchMeta\}\(\\cdot\)retrieves additional episode\-level metadata, whileReadRaw​\(⋅\)\\texttt\{ReadRaw\}\(\\cdot\)follows the source linkℒ⁡\(ik\)=sk\\mathcal\{L\}\(i\_\{k\}\)=s\_\{k\}associated with the observed metadata entryiki\_\{k\}to recover the corresponding raw session\. To avoid repeatedly reading the same metadata entry, we maintain a query\-specific set of previously observed entries,ℐseen⊆ℐ\\mathcal\{I\}^\{\\mathrm\{seen\}\}\\subseteq\\mathcal\{I\}, initialized with the metadata entries contained ino0o\_\{0\}\.

When the current evidence is insufficient and additional events or temporal cues are required, the LLM selectsSearchMeta​\(⋅\)\\texttt\{SearchMeta\}\(\\cdot\)to acquire previously unseen metadata\. The tool excludes entries already contained inℐseen\\mathcal\{I\}^\{\\mathrm\{seen\}\}and retrieves the highest\-ranked remaining entries:

SearchMeta​\(q\)=Top−⁡k⁡\(q,ℐ∖ℐseen\)\.\\texttt\{SearchMeta\}\(q\)=\\operatorname\{Top\-\}k\\left\(q,\\mathcal\{I\}\\setminus\\mathcal\{I\}^\{\\mathrm\{seen\}\}\\right\)\.\(12\)After each call toSearchMeta​\(⋅\)\\texttt\{SearchMeta\}\(\\cdot\), the returned entries are added toℐseen\\mathcal\{I\}^\{\\mathrm\{seen\}\}, preventing redundant reading\. When an observed metadata entryiki\_\{k\}points to a relevant session but does not provide sufficient detail, the LLM can instead selectReadRaw​\(k\)\\texttt\{ReadRaw\}\(k\)to access the corresponding raw session:

ReadRaw​\(k\)=ℒ⁡\(ik\)=sk,\\texttt\{ReadRaw\}\(k\)=\\mathcal\{L\}\(i\_\{k\}\)=s\_\{k\},\(13\)whereik∈ℐseeni\_\{k\}\\in\\mathcal\{I\}^\{\\mathrm\{seen\}\}\. This operation enables the LLM to recover fine\-grained evidence from the corresponding raw interaction when the lightweight metadata is insufficient, thereby allowing the memory construction process to adaptively incorporate fine\-grained evidence into the evolving memory\.

## 4Experimental Methodology

In this section, we describe the experimental setup for evaluating T2Mem\. We first introduce the datasets, baselines, and evaluation metrics, and then present the implementation details\.

Table 1:Overall Performance of T2Mem and Baseline Methods on the LoCoMo Dataset\. Thebestandsecond\-bestresults are highlighted\.Method\# Token \(×103\\times 10^\{3\}\)Multi\-HopTemporalOpen\-DomainSingle\-HopAvg\.Qwen3\.5\-27BNaive RAG\([2020](https://arxiv.org/html/2610.13348#bib.bib6)\)1,01232\.9860\.1238\.5464\.6856\.30Search\-o1\([2025](https://arxiv.org/html/2610.13348#bib.bib21)\)2,38049\.2961\.6853\.1260\.6458\.31MemoryOS\([2025](https://arxiv.org/html/2610.13348#bib.bib14)\)6,46051\.7741\.1242\.7172\.7760\.45LightMem\([2026](https://arxiv.org/html/2610.13348#bib.bib17)\)6,17858\.5170\.7240\.6274\.5568\.70EverMemOS\([2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)12,95551\.7766\.3658\.3369\.2064\.74HiMem\([2026](https://arxiv.org/html/2610.13348#bib.bib22)\)11,05659\.0368\.3749\.8171\.1765\.34xMemory\([2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)8,22957\.0971\.9647\.9272\.6568\.12AnchorMem\([2026](https://arxiv.org/html/2610.13348#bib.bib16)\)10,94047\.1670\.7242\.7175\.8367\.45LazyMem\([2026](https://arxiv.org/html/2610.13348#bib.bib31)\)11,25351\.7762\.5036\.9682\.2869\.84T2Mem \(Ours\)8,76559\.2275\.7050\.0076\.8171\.69Gemma4\-31B\-InstructNaive RAG\([2020](https://arxiv.org/html/2610.13348#bib.bib6)\)1,02532\.6259\.5031\.2563\.5055\.00Search\-o1\([2025](https://arxiv.org/html/2610.13348#bib.bib21)\)1,89139\.3657\.6344\.7958\.0353\.70MemoryOS\([2025](https://arxiv.org/html/2610.13348#bib.bib14)\)7,35756\.0364\.1750\.0075\.5165\.84LightMem\([2026](https://arxiv.org/html/2610.13348#bib.bib17)\)6,32662\.0677\.2637\.5072\.0669\.16EverMemOS\([2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)11,06352\.4865\.4250\.0066\.4762\.66HiMem\([2026](https://arxiv.org/html/2610.13348#bib.bib22)\)10,28947\.8766\.3628\.1263\.8159\.19xMemory\([2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)8,19055\.3271\.3445\.8371\.9467\.14AnchorMem\([2026](https://arxiv.org/html/2610.13348#bib.bib16)\)8,94948\.9476\.0140\.6274\.5268\.03LazyMem\([2026](https://arxiv.org/html/2610.13348#bib.bib31)\)10,62452\.4862\.5036\.9683\.2370\.49T2Mem \(Ours\)7,27456\.7477\.2652\.0876\.1071\.30

Datasets\.We evaluate T2Mem on two widely adopted benchmarks for long\-term memory, LoCoMo\([Maharana et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib10)\)and LongMemEval\([Wu et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib12)\)\. These benchmarks assess the ability of memory systems to retain, retrieve, and utilize information from long\-term interaction histories\. Further details are provided in Appendix[A\.2](https://arxiv.org/html/2610.13348#A1.SS2)\.

Baselines\.We compare T2Mem with several representative baselines spanning three categories: retrieval\-based methods, memory systems that construct structured memory representations offline, and recent test\-time approaches that defer memory construction to inference\.

For retrieval\-based methods, we evaluate Naive RAG\([Lewis et al\., 2020](https://arxiv.org/html/2610.13348#bib.bib6)\)and Search\-o1\([Li et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib21)\), which directly retrieve relevant dialogue segments to support LLM\-based answering\. We then compare T2Mem with representative memory systems\. MemoryOS\([Kang et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib14)\)draws inspiration from operating systems and continuously incorporates relevant information into existing memory units\. LightMem\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17)\)and HiMem\([Zhang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib22)\)construct compact memory units through topic\-based consolidation and event\-level organization, respectively\. EverMemOS\([Hu et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)and xMemory\([Hu et al\., 2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)further organize memory into higher\-level semantic structures to facilitate subsequent retrieval\. AnchorMem\([Shen et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib16)\)preserves links between memory units and their source interactions, enabling the recovery of fine\-grained details when needed\. Finally, we adopt LazyMem\([Yu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib31)\)as a test\-time baseline, which follows a retrieve\-then\-construct paradigm to build memory from a broad set of retrieved candidates during inference\.

Evaluation Metrics\.Following prior work\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17);[Xin et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib23)\), we use accuracy as the primary evaluation metric and employ an LLM\-based judge to determine whether each response is consistent with the ground\-truth answer\([Zheng et al\., 2023](https://arxiv.org/html/2610.13348#bib.bib38)\)\. For a fair comparison, all methods are evaluated using Qwen3\.5\-Plus\([Qwen Team, 2026](https://arxiv.org/html/2610.13348#bib.bib24)\)as the judge model\. The evaluation prompts are provided in Appendix[A\.8](https://arxiv.org/html/2610.13348#A1.SS8)\.

Implementation Details\.In our experiments, we use Qwen3\.5\-27B\([Qwen Team, 2026](https://arxiv.org/html/2610.13348#bib.bib24)\)and Gemma4\-31B\-Instruct\([Team et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib34)\)as the backbone models for all compared methods, and BGE\-M3\([Chen et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib25)\)as the embedding model for metadata retrieval\. For T2Mem, we setk=5k=5for the initial retrieval fromℐ\\mathcal\{I\}to obtaino0o\_\{0\}\. In each subsequentSearchMetacall, we setk=1k=1to retrieve the highest\-ranked entry fromℐ∖ℐseen\\mathcal\{I\}\\setminus\\mathcal\{I\}^\{\\mathrm\{seen\}\}\. We set the maximum number of memory construction steps toTmax=5T\_\{\\max\}=5in the main experiments\. The prompt templates used by T2Mem are provided in Appendix[A\.8](https://arxiv.org/html/2610.13348#A1.SS8), while additional implementation details are reported in Appendix[A\.3](https://arxiv.org/html/2610.13348#A1.SS3)\.

## 5Experimental Results

In this section, we first report the overall performance of T2Mem and conduct ablation studies to show the effectiveness of different components\. Then, we evaluate the quality of the memory constructed by T2Mem and other representative methods\. Subsequently, we compare token consumption between offline preprocessing and test\-time inference, and investigate the test\-time scaling of T2Mem under different test\-time token budgets\. Finally, case studies are provided in Appendix[A\.6](https://arxiv.org/html/2610.13348#A1.SS6)\.

Table 2:Overall Performance of T2Mem and Baseline Methods on the LongMemEval Dataset\.MethodSingleSingleSingleMultiKnowledgeTemporalAvg\.UserAssistantPreferenceSessionUpdateReasoningQwen3\.5\-27BNaive RAG\([2020](https://arxiv.org/html/2610.13348#bib.bib6)\)92\.8687\.5036\.6769\.9279\.4958\.6571\.60Search\-o1\([2025](https://arxiv.org/html/2610.13348#bib.bib21)\)88\.5789\.2940\.0057\.1475\.6459\.4067\.60MemoryOS\([2025](https://arxiv.org/html/2610.13348#bib.bib14)\)90\.0082\.1436\.6760\.1569\.2348\.8763\.80LightMem\([2026](https://arxiv.org/html/2610.13348#bib.bib17)\)91\.4325\.0076\.6778\.2087\.1885\.7177\.40EverMemOS\([2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)72\.6880\.3633\.3355\.6470\.5152\.6361\.00HiMem\([2026](https://arxiv.org/html/2610.13348#bib.bib22)\)75\.7150\.0033\.3354\.1470\.5156\.3958\.60xMemory\([2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)94\.2964\.2946\.6760\.9083\.3351\.6568\.80AnchorMem\([2026](https://arxiv.org/html/2610.13348#bib.bib16)\)95\.7198\.2140\.8757\.8982\.0544\.3664\.40LazyMem\([2026](https://arxiv.org/html/2610.13348#bib.bib31)\)92\.8691\.0763\.3352\.6394\.8763\.1672\.60T2Mem \(Ours\)92\.8698\.2183\.3370\.6892\.3184\.9684\.80Gemma4\-31B\-InstructNaive RAG\([2020](https://arxiv.org/html/2610.13348#bib.bib6)\)97\.1485\.7156\.6773\.6893\.5963\.1677\.60Search\-o1\([2025](https://arxiv.org/html/2610.13348#bib.bib21)\)94\.2994\.6433\.3362\.4173\.0862\.4170\.40MemoryOS\([2025](https://arxiv.org/html/2610.13348#bib.bib14)\)92\.8682\.1430\.0069\.1779\.4960\.1570\.80LightMem\([2026](https://arxiv.org/html/2610.13348#bib.bib17)\)92\.8610\.7190\.0079\.7087\.1887\.2277\.60EverMemOS\([2026a](https://arxiv.org/html/2610.13348#bib.bib26)\)88\.5778\.5760\.0070\.6888\.4662\.4174\.00HiMem\([2026](https://arxiv.org/html/2610.13348#bib.bib22)\)82\.8655\.3640\.0060\.1576\.9262\.4164\.80xMemory\([2026b](https://arxiv.org/html/2610.13348#bib.bib15)\)94\.2966\.0750\.0060\.9083\.3361\.6569\.20AnchorMem\([2026](https://arxiv.org/html/2610.13348#bib.bib16)\)95\.7198\.2136\.6769\.1794\.8763\.9176\.80LazyMem\([2026](https://arxiv.org/html/2610.13348#bib.bib31)\)95\.7196\.4373\.3355\.6491\.0369\.9276\.20T2Mem \(Ours\)94\.29100\.0083\.3369\.9292\.3185\.7185\.20

### 5\.1Overall Performance

In this subsection, we evaluate the overall performance of T2Mem against a range of representative baselines\. The results on LoCoMo are presented in Table[1](https://arxiv.org/html/2610.13348#S4.T1), with additional evaluation on LongMemEval reported in Table[2](https://arxiv.org/html/2610.13348#S5.T2)\. Overall, T2Mem outperforms all baselines across both benchmarks, demonstrating the effectiveness of our approach to dynamically constructing memory at test time\. Notably, T2Mem delivers consistent gains across different backbone models, indicating its robustness and generalizability across model architectures\.

Compared with retrieval\-based methods such as Naive RAG and Search\-o1, T2Mem achieves higher average performance on both benchmarks\. On LoCoMo, the gains are particularly evident on Multi\-Hop and Temporal questions, suggesting that dynamically constructing memory according to evolving information needs is more effective than relying on a fixed set of retrieved chunks or iterative retrieval alone\. T2Mem also exhibits more consistent performance across task categories than offline memory construction methods\. These methods compress and organize the interaction history into persistent memory representations to enable efficient access in future interactions, but the preconstructed memory may not align equally well with different information needs\. For example, on LongMemEval \(Table[2](https://arxiv.org/html/2610.13348#S5.T2)\), LightMem shows strong performance on several task categories but substantially lower accuracy on Single\-Assistant questions\. This suggests that such offline memory construction can lead to substantial performance variation across different task categories\.

Furthermore, T2Mem also outperforms LazyMem, which constructs memory from a one\-pass retrieval set of query\-relevant facts, making subsequent construction dependent on the quality and coverage of the initial retrieval\. In contrast, T2Mem unfolds memory construction along the reasoning process, progressively retrieving the evidence needed to construct and refine the memory\. This enables T2Mem to adaptively acquire missing evidence as reasoning unfolds, resulting in more comprehensive memory construction\. Moreover, by supplying the necessary evidence at the appropriate stages of reasoning, T2Mem avoids redundant reasoning and achieves stronger performance\.

Table 3:Ablation Study on the LoCoMo Dataset\.Method\# Token \(×103\\times 10^\{3\}\)Multi\-HopTemporalOpen\-DomainSingle\-HopAvg\.Qwen3\.5\-27BT2Mem \(Summary\)6,80957\.8071\.9651\.0473\.0168\.64T2Mem \(Graph\)7,94352\.1359\.1945\.8369\.9262\.92T2Mem8,76559\.2275\.7050\.0076\.8171\.69w/o Metadata11,79259\.9268\.8447\.9175\.8669\.74w/o Rawdata7,41556\.0377\.8856\.5268\.8567\.60w/o Rollout Construction5,17755\.6771\.3442\.7169\.0865\.45Gemma4\-31B\-InstructT2Mem \(Summary\)5,24554\.2679\.1348\.9675\.7470\.84T2Mem \(Graph\)7,13352\.4867\.9143\.7570\.0464\.74T2Mem7,27456\.7477\.2652\.0876\.1071\.30w/o Metadata11,83152\.4872\.9050\.0078\.4870\.84w/o Rawdata6,66854\.2679\.1350\.0066\.9466\.10w/o Rollout Construction3,64152\.8475\.3942\.7163\.8562\.92

### 5\.2Ablation Studies

This subsection conducts ablation studies on LoCoMo to examine the contributions of different components in T2Mem\. Additional results on LongMemEval are reported in Appendix[A\.4](https://arxiv.org/html/2610.13348#A1.SS4)\.

Specifically, we first examine the effectiveness of the lightweight episode\-level metadata proposed in Sec\.[3\.1](https://arxiv.org/html/2610.13348#S3.SS1)by comparing it with two alternative representations\. T2Mem \(Summary\) replaces the metadata for each session with a concise summary\([Tan et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib36)\), while T2Mem \(Graph\) represents the relations among entities and events within each session using a graph structure\([Wu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib35)\)\. We further investigate the roles of metadata and raw interactions during memory construction\. T2Mem \(w/o Metadata\) directly performs dynamic memory construction over the raw interaction sessions without using metadata, whereas T2Mem \(w/o Rawdata\) relies solely on the metadata\. Finally, T2Mem \(w/o Rollout Construction\) removes the rollout memory construction process and directly answers the user query using the initial retrieval results\. As shown in Table[3](https://arxiv.org/html/2610.13348#S5.T3), T2Mem consistently outperforms both T2Mem \(Summary\) and T2Mem \(Graph\), demonstrating the effectiveness of its semi\-structured metadata\. This advantage can be attributed to the complementary structural and semantic cues, such as timestamps, event information, and topics, which help LLMs capture dependencies among events during reasoning and identify relevant sessions for memory construction\. Furthermore, the performance degradation in T2Mem \(w/o Metadata\) and T2Mem \(w/o Rawdata\) highlights the complementary roles of these two knowledge sources\. The metadata provides cues for locating relevant interactions, while the raw sessions preserve fine\-grained events for recovering detailed evidence\. Removing the rollout memory construction process reduces token consumption, but leads to a clear performance degradation in T2Mem \(w/o Rollout Construction\)\. This suggests that progressively integrating retrieved knowledge according to evolving information needs enables more effective and tailored memory construction\.

\(a\)Quality of the Constructed Memory\.\(b\)Token Consumption for Memory Construction and Inference\.\(c\)QA Accuracy across Different Token Budgets\.
Figure 2:Analysis of T2Mem\. We examine \(a\) the quality of the constructed memory, \(b\) token consumption during offline memory construction and LLM inference, and \(c\) QA performance across different test\-time token budgets\.
### 5\.3Effectiveness of Test\-Time Computation for Memory Construction

In this subsection, we analyze T2Mem in terms of memory quality, token allocation, and test\-time scaling, as illustrated in Figure[2](https://arxiv.org/html/2610.13348#S5.F2)\. All experiments are conducted using Qwen3\.5\-27B on the LoCoMo dataset\. Additional experimental details are provided in Appendix[A\.3](https://arxiv.org/html/2610.13348#A1.SS3)\.

Quality of Constructed Memory\.As shown in Figure[2\(a\)](https://arxiv.org/html/2610.13348#S5.F2.sf1), we evaluate the quality of the memory constructed by T2Mem, LightMem, and Search\-o1 along five dimensions, with the evaluation criteria detailed in Appendix[A\.8](https://arxiv.org/html/2610.13348#A1.SS8)\. Specifically,Temporal AccuracyandEntity Coverageassess the ability to capture temporal dependencies and entity associations across interactions\.Content CompletenessandFactual Correctnessmeasure whether the constructed memory contains sufficient information to answer the query and remains consistent with the ground\-truth answer, respectively\. Finally,Detail Preservationevaluates how well the memory retains specific quantities and other details\. Across all five dimensions, T2Mem achieves the highest scores, indicating that it constructs more complete and reliable memory\. This advantage can be attributed to its ability to progressively capture episode dependencies, thereby helping retrieve more accurate evidence to facilitate the LLM in answering the query\. In particular, the improvement inDetail Preservationsuggests that T2Mem retains finer\-grained evidence beyond the core information needed to answer the query\. This benefit stems from its iterative construction process, which allows the model to read additional metadata or access linked source sessions when the accumulated memory is insufficient to support construction\. The higherFactual Correctnessfurther demonstrates that T2Mem can effectively incorporate supporting evidence, leading to better consistency with the ground\-truth answers\.

Association between Token Consumption and QA Accuracy\.As shown in Figure[2\(b\)](https://arxiv.org/html/2610.13348#S5.F2.sf2), T2Mem achieves the highest QA accuracy while consuming a comparable number of tokens to the three offline memory construction systems\. This efficiency stems from a different computation allocation strategy: rather than constructing comprehensive memories offline, T2Mem extracts only lightweight metadata in advance and shifts the remaining computation to test time, allowing memory construction to adapt to the information needs of each query\. To further investigate this property and its scaling behavior, we vary the token budget available to T2Mem and compare it with Naive RAG and Search\-o1\. As shown in Figure[2\(c\)](https://arxiv.org/html/2610.13348#S5.F2.sf3), T2Mem consistently improves with additional test\-time computation, whereas Search\-o1 exhibits a weaker scaling trend and Naive RAG shows no consistent benefit, with its performance even declining as the token budget increases\. These results indicate that effective test\-time scaling depends not merely on increasing the computation budget, but on effectively translating additional computation into useful evidence for memory evolution\.

## 6Conclusion

This paper presents T2Mem, a test\-time memory construction framework for long\-term conversational question answering\. T2Mem extracts lightweight episode\-level metadata offline as retrieval cues while retaining links to the original interactions, and adaptively retrieves and organizes metadata and raw interactions at test time to progressively construct query\-specific memory\. Experiments on LoCoMo and LongMemEval show that T2Mem consistently outperforms strong baselines across two backbone LLMs while substantially reducing memory construction overhead\. Further analysis demonstrates that deferring memory construction to inference enables the memory construction process to dynamically adapt to the information needs of individual queries\.

### AI use statement

Generative AI tools were used only for proofreading, including the correction of typographical and grammatical errors\. All methodological designs, experimental execution, interpretation of the results, manuscript content, references, and citations were prepared and verified by the authors\. The authors take full responsibility for the final content of this work\.

## References

- Chenet al\.\(2024\)J\. Chen, S\. Xiao, P\. Zhang, K\. Luo, D\. Lian, and Z\. LiuM3\-embedding: multi\-linguality, multi\-functionality, multi\-granularity text embeddings through self\-knowledge distillation\.InFindings of ACL,pp\. 2318–2335\.External Links:[Link](https://aclanthology.org/2024.findings-acl.137/)Cited by:[§A\.3](https://arxiv.org/html/2610.13348#A1.SS3.p1.1),[§4](https://arxiv.org/html/2610.13348#S4.p6.1)\.
- Chhikaraet al\.\(2025\)P\. Chhikara, D\. Khant, S\. Aryan, T\. Singh, and D\. YadavMem0: building production\-ready ai agents with scalable long\-term memory\.ArXiv preprintabs/2504\.19413\.External Links:[Link](https://arxiv.org/abs/2504.19413)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p2.1)\.
- Edgeet al\.\(2024\)D\. Edge, H\. Trinh, N\. Cheng, J\. Bradley, A\. Chao, A\. Mody, S\. Truitt, D\. Metropolitansky, R\. Osazuwa Ness, and J\. LarsonFrom local to global: a graph rag approach to query\-focused summarization\.ArXiv preprintabs/2404\.16130\.External Links:[Link](https://arxiv.org/abs/2404.16130)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1)\.
- Fanget al\.\(2026\)J\. Fang, X\. Deng, H\. Xu, Z\. Jiang, Y\. Tang, Z\. Xu, S\. Deng, Y\. Yao, M\. Wang, S\. Qiao, H\. Chen, and N\. ZhangLightMem: lightweight and efficient memory\-augmented generation\.InProceedings of ICLR,External Links:[Link](https://proceedings.iclr.cc/paper_files/paper/2026/hash/a05b72653ec5b473732129829ae04195-Abstract-Conference.html)Cited by:[§A\.2](https://arxiv.org/html/2610.13348#A1.SS2.p1.1),[§A\.7](https://arxiv.org/html/2610.13348#A1.SS7.p1.1),[§1](https://arxiv.org/html/2610.13348#S1.p2.1),[§2](https://arxiv.org/html/2610.13348#S2.p2.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p3.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.17.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.6.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[§4](https://arxiv.org/html/2610.13348#S4.p5.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.18.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.7.1)\.
- Guoet al\.\(2025\)D\. Guo, D\. Yang, H\. Zhang, J\. Song, P\. Wang, Q\. Zhu, R\. Xu, R\. Zhang, S\. Ma, X\. Bi, X\. Zhang, X\. Yu, Y\. Wu, Z\. F\. Wu, Z\. Gou, Z\. Shao, Z\. Li, Z\. Gao, A\. Liu, B\. Xue, B\. Wang, B\. Wu, B\. Feng, C\. Lu, C\. Zhao, C\. Deng, C\. Ruan, D\. Dai, D\. Chen, D\. Ji, E\. Li, F\. Lin, F\. Dai, F\. Luo, G\. Hao, G\. Chen, G\. Li, H\. Zhang, H\. Xu, H\. Ding, H\. Gao, H\. Qu, H\. Li, J\. Guo, J\. Li, J\. Chen, J\. Yuan, J\. Tu, J\. Qiu, J\. Li, J\. L\. Cai, J\. Ni, J\. Liang, J\. Chen, K\. Dong, K\. Hu, K\. You, K\. Gao, K\. Guan, K\. Huang, K\. Yu, L\. Wang, L\. Zhang, L\. Zhao, L\. Wang, L\. Zhang, L\. Xu, L\. Xia, M\. Zhang, M\. Zhang, M\. Tang, M\. Zhou, M\. Li, M\. Wang, M\. Li, N\. Tian, P\. Huang, P\. Zhang, Q\. Wang, Q\. Chen, Q\. Du, R\. Ge, R\. Zhang, R\. Pan, R\. Wang, R\. J\. Chen, R\. L\. Jin, R\. Chen, S\. Lu, S\. Zhou, S\. Chen, S\. Ye, S\. Wang, S\. Yu, S\. Zhou, S\. Pan, S\. S\. Li, S\. Zhou, S\. Wu, T\. Yun, T\. Pei, T\. Sun, T\. Wang, W\. Zeng, W\. Liu, W\. Liang, W\. Gao, W\. Yu, W\. Zhang, W\. L\. Xiao, W\. An, X\. Liu, X\. Wang, X\. Chen, X\. Nie, X\. Cheng, X\. Liu, X\. Xie, X\. Liu, X\. Yang, X\. Li, X\. Su, X\. Lin, X\. Q\. Li, X\. Jin, X\. Shen, X\. Chen, X\. Sun, X\. Wang, X\. Song, X\. Zhou, X\. Wang, X\. Shan, Y\. K\. Li, Y\. Q\. Wang, Y\. X\. Wei, Y\. Zhang, Y\. Xu, Y\. Li, Y\. Zhao, Y\. Sun, Y\. Wang, Y\. Yu, Y\. Zhang, Y\. Shi, Y\. Xiong, Y\. He, Y\. Piao, Y\. Wang, Y\. Tan, Y\. Ma, Y\. Liu, Y\. Guo, Y\. Ou, Y\. Wang, Y\. Gong, Y\. Zou, Y\. He, Y\. Xiong, Y\. Luo, Y\. You, Y\. Liu, Y\. Zhou, Y\. X\. Zhu, Y\. Huang, Y\. Li, Y\. Zheng, Y\. Zhu, Y\. Ma, Y\. Tang, Y\. Zha, Y\. Yan, Z\. Z\. Ren, Z\. Ren, Z\. Sha, Z\. Fu, Z\. Xu, Z\. Xie, Z\. Zhang, Z\. Hao, Z\. Ma, Z\. Yan, Z\. Wu, Z\. Gu, Z\. Zhu, Z\. Liu, Z\. Li, Z\. Xie, Z\. Song, Z\. Pan, Z\. Huang, Z\. Xu, Z\. Zhang, and Z\. ZhangDeepSeek\-r1 incentivizes reasoning in llms through reinforcement learning\.Nature645,pp\. 633–638\.External Links:[Link](https://www.nature.com/articles/s41586-025-09422-z)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p3.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1)\.
- Hanet al\.\(2025\)T\. Han, Z\. Wang, C\. Fang, S\. Zhao, S\. Ma, and Z\. ChenToken\-budget\-aware llm reasoning\.InFindings of ACL,pp\. 24842–24855\.External Links:[Link](https://aclanthology.org/2025.findings-acl.1274/)Cited by:[§A\.3](https://arxiv.org/html/2610.13348#A1.SS3.p2.1)\.
- Horneret al\.\(2015\)A\. J\. Horner, J\. A\. Bisby, D\. Bush, W\. Lin, and N\. BurgessEvidence for holistic episodic recollection via hippocampal pattern completion\.Nature communications,pp\. 7462\.External Links:[Link](https://www.nature.com/articles/ncomms8462)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p4.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p3.1)\.
- Hsiehet al\.\(2024\)C\. Hsieh, S\. Sun, S\. Kriman, S\. Acharya, D\. Rekesh, F\. Jia, Y\. Zhang, and B\. GinsburgRULER: what’s the real context size of your long\-context language models?\.InProceedings of COLM,External Links:[Link](https://openreview.net/forum?id=kIoBbc76Sy)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1)\.
- Huet al\.\(2026a\)C\. Hu, X\. Gao, Z\. Zhou, D\. Xu, Y\. Bai, X\. Li, H\. Zhang, T\. Li, C\. Zhang, L\. Bing, and Y\. DengEverMemOS: a self\-organizing memory operating system for structured long\-horizon reasoning\.InProceedings of ACL,pp\. 45836–45853\.External Links:[Link](https://aclanthology.org/2026.acl-long.2125/)Cited by:[§A\.2](https://arxiv.org/html/2610.13348#A1.SS2.p1.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p2.3),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.18.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.7.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.19.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.8.1)\.
- Huet al\.\(2025\)Y\. Hu, S\. Liu, Y\. Yue, G\. Zhang, B\. Liu, F\. Zhu, J\. Lin, H\. Guo, S\. Dou, Z\. Xi, S\. Jin, J\. Tan, Y\. Yin, J\. Liu, Z\. Zhang, Z\. Sun, Y\. Zhu, H\. Sun, B\. Peng, Z\. Cheng, X\. Fan, J\. Guo, X\. Yu, Z\. Zhou, Z\. Hu, J\. Huo, J\. Wang, Y\. Niu, Y\. Wang, Z\. Yin, X\. Hu, Y\. Liao, Q\. Li, K\. Wang, W\. Zhou, Y\. Liu, D\. Cheng, Q\. Zhang, T\. Gui, S\. Pan, Y\. Zhang, P\. Torr, Z\. Dou, J\. Wen, X\. Huang, Y\. Jiang, and S\. YanMemory in the age of ai agents\.ArXiv preprintabs/2512\.13564\.External Links:[Link](https://arxiv.org/abs/2512.13564)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1)\.
- Huet al\.\(2026b\)Z\. Hu, Q\. Zhu, R\. Zhao, D\. Liang, H\. Yan, Y\. He, and L\. GuiBeyond rag for agent memory: retrieval by decoupling and aggregation\.ArXiv preprintabs/2602\.02007\.External Links:[Link](https://arxiv.org/abs/2602.02007)Cited by:[§2](https://arxiv.org/html/2610.13348#S2.p2.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.20.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.9.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.10.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.21.1)\.
- Kanget al\.\(2025\)J\. Kang, M\. Ji, Z\. Zhao, and T\. BaiMemory OS of AI agent\.InProceedings of EMNLP,pp\. 25961–25970\.External Links:[Link](https://aclanthology.org/2025.emnlp-main.1318/)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p2.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p2.3),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.16.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.5.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.17.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.6.1)\.
- Leeet al\.\(2025\)A\. Lee, E\. Che, and T\. PengHow well do llms compress their own chain\-of\-thought? a token complexity approach\.ArXiv preprintabs/2503\.01141\.External Links:[Link](https://arxiv.org/abs/2503.01141)Cited by:[§A\.3](https://arxiv.org/html/2610.13348#A1.SS3.p2.1)\.
- Lewiset al\.\(2020\)P\. S\. H\. Lewis, E\. Perez, A\. Piktus, F\. Petroni, V\. Karpukhin, N\. Goyal, H\. Küttler, M\. Lewis, W\. Yih, T\. Rocktäschel, S\. Riedel, and D\. KielaRetrieval\-augmented generation for knowledge\-intensive NLP tasks\.InProceedings of NeurIPS,External Links:[Link](https://proceedings.neurips.cc/paper/2020/hash/6b493230205f780e1bc26945df7481e5-Abstract.html)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.14.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.3.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.15.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.4.1)\.
- Liet al\.\(2026a\)K\. Li, X\. Yu, Z\. Ni, Y\. Zeng, Y\. Xu, Z\. Zhang, X\. Li, J\. Sang, X\. Duan, X\. Wang, C\. Liu, and J\. TanTiMem: temporal\-hierarchical memory consolidation for long\-horizon conversational agents\.InFindings of ACL,pp\. 21700–21720\.External Links:[Link](https://aclanthology.org/2026.findings-acl.1091/)Cited by:[§2](https://arxiv.org/html/2610.13348#S2.p2.1)\.
- Liet al\.\(2025\)X\. Li, G\. Dong, J\. Jin, Y\. Zhang, Y\. Zhou, Y\. Zhu, P\. Zhang, and Z\. DouSearch\-o1: agentic search\-enhanced large reasoning models\.InProceedings of EMNLP,pp\. 5420–5438\.External Links:[Link](https://aclanthology.org/2025.emnlp-main.276/)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.15.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.4.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.16.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.5.1)\.
- Liet al\.\(2026b\)X\. Li, Y\. Lan, Z\. Liu, H\. Xin, Y\. Yan, S\. Wang, Z\. Zeng, S\. Mei, G\. Yu, and M\. SunSEEK: steering llm reasoning for rag via internal reasoning sketches\.ArXiv preprintabs/2601\.09402\.External Links:[Link](https://arxiv.org/abs/2601.09402)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1)\.
- Liuet al\.\(2024\)N\. F\. Liu, K\. Lin, J\. Hewitt, A\. Paranjape, M\. Bevilacqua, F\. Petroni, and P\. LiangLost in the middle: how language models use long contexts\.TACL,pp\. 157–173\.External Links:[Link](https://aclanthology.org/2024.tacl-1.9/)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1)\.
- Liuet al\.\(2026\)Z\. Liu, P\. Huang, Z\. Xu, X\. Li, S\. Liu, C\. Peng, H\. Xin, Y\. Yan, S\. Wang, X\. Han, Z\. Liu, M\. Sun, Y\. Gu, and G\. YuKnowledge intensive agents\.AI Open,pp\. 18–44\.External Links:[Link](https://www.sciencedirect.com/science/article/pii/S2666651026000033)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1)\.
- Maharanaet al\.\(2024\)A\. Maharana, D\. Lee, S\. Tulyakov, M\. Bansal, F\. Barbieri, and Y\. FangEvaluating very long\-term conversational memory of LLM agents\.InProceedings of ACL,pp\. 13851–13870\.External Links:[Link](https://aclanthology.org/2024.acl-long.747/)Cited by:[§A\.2](https://arxiv.org/html/2610.13348#A1.SS2.p1.1),[§4](https://arxiv.org/html/2610.13348#S4.p2.1)\.
- OpenAIet al\.\(2024\)OpenAI, A\. Jaech, A\. Kalai, A\. Lerer, A\. Richardson, A\. El\-Kishky, A\. Low, A\. Helyar, A\. Madry, A\. Beutel, A\. Carney, A\. Iftimie, A\. Karpenko, A\. T\. Passos, A\. Neitz, A\. Prokofiev, A\. Wei, A\. Tam, A\. Bennett, A\. Kumar, A\. Saraiva, A\. Vallone, A\. Duberstein, A\. Kondrich, A\. Mishchenko, A\. Applebaum, A\. Jiang, A\. Nair, B\. Zoph, B\. Ghorbani, B\. Zhang, B\. Rossen, B\. Sokolowsky, B\. Barak, B\. McGrew, B\. Minaiev, B\. Hao, B\. Baker, B\. Houghton, B\. McKinzie, B\. Eastman, C\. Lugaresi, C\. Bassin, C\. Hudson, C\. M\. Li, C\. de Bourcy, C\. Voss, C\. Shen, C\. Zhang, C\. Koch, C\. Orsinger, C\. Hesse, C\. Fischer, C\. Chan, D\. Roberts, D\. Kappler, D\. Levy, D\. Selsam, D\. Dohan, D\. Farhi, D\. Mely, D\. Robinson, D\. Tsipras, D\. Li, D\. Oprica, E\. Freeman, E\. Zhang, E\. Wong, E\. Proehl, E\. Cheung, E\. Mitchell, E\. Wallace, E\. Ritter, E\. Mays, F\. Wang, F\. P\. Such, F\. Raso, F\. Leoni, F\. Tsimpourlas, F\. Song, F\. von Lohmann, F\. Sulit, G\. Salmon, G\. Parascandolo, G\. Chabot, G\. Zhao, G\. Brockman, G\. Leclerc, H\. Salman, H\. Bao, H\. Sheng, H\. Andrin, H\. Bagherinezhad, H\. Ren, H\. Lightman, H\. W\. Chung, I\. Kivlichan, I\. O’Connell, I\. Osband, I\. C\. Gilaberte, I\. Akkaya, I\. Kostrikov, I\. Sutskever, I\. Kofman, J\. Pachocki, J\. Lennon, J\. Wei, J\. Harb, J\. Twore, J\. Feng, J\. Yu, J\. Weng, J\. Tang, J\. Yu, J\. Q\. Candela, J\. Palermo, J\. Parish, J\. Heidecke, J\. Hallman, J\. Rizzo, J\. Gordon, J\. Uesato, J\. Ward, J\. Huizinga, J\. Wang, K\. Chen, K\. Xiao, K\. Singhal, K\. Nguyen, K\. Cobbe, K\. Shi, K\. Wood, K\. Rimbach, K\. Gu\-Lemberg, K\. Liu, K\. Lu, K\. Stone, K\. Yu, L\. Ahmad, L\. Yang, L\. Liu, L\. Maksin, L\. Ho, L\. Fedus, L\. Weng, L\. Li, L\. McCallum, L\. Held, L\. Kuhn, L\. Kondraciuk, L\. Kaiser, L\. Metz, M\. Boyd, M\. Trebacz, M\. Joglekar, M\. Chen, M\. Tintor, M\. Meyer, M\. Jones, M\. Kaufer, M\. Schwarzer, M\. Shah, M\. Yatbaz, M\. Y\. Guan, M\. Xu, M\. Yan, M\. Glaese, M\. Chen, M\. Lampe, M\. Malek, M\. Wang, M\. Fradin, M\. McClay, M\. Pavlov, M\. Wang, M\. Wang, M\. Murati, M\. Bavarian, M\. Rohaninejad, N\. McAleese, N\. Chowdhury, N\. Chowdhury, N\. Ryder, N\. Tezak, N\. Brown, O\. Nachum, O\. Boiko, O\. Murk, O\. Watkins, P\. Chao, P\. Ashbourne, P\. Izmailov, P\. Zhokhov, R\. Dias, R\. Arora, R\. Lin, R\. G\. Lopes, R\. Gaon, R\. Miyara, R\. Leike, R\. Hwang, R\. Garg, R\. Brown, R\. James, R\. Shu, R\. Cheu, R\. Greene, S\. Jain, S\. Altman, S\. Toizer, S\. Toyer, S\. Miserendino, S\. Agarwal, S\. Hernandez, S\. Baker, S\. McKinney, S\. Yan, S\. Zhao, S\. Hu, S\. Santurkar, S\. R\. Chaudhuri, S\. Zhang, S\. Fu, S\. Papay, S\. Lin, S\. Balaji, S\. Sanjeev, S\. Sidor, T\. Broda, A\. Clark, T\. Wang, T\. Gordon, T\. Sanders, T\. Patwardhan, T\. Sottiaux, T\. Degry, T\. Dimson, T\. Zheng, T\. Garipov, T\. Stasi, T\. Bansal, T\. Creech, T\. Peterson, T\. Eloundou, V\. Qi, V\. Kosaraju, V\. Monaco, V\. Pong, V\. Fomenko, W\. Zheng, W\. Zhou, W\. Zhan, W\. McCabe, W\. Zaremba, Y\. Dubois, Y\. Lu, Y\. Chen, Y\. Cha, Y\. Bai, Y\. He, Y\. Zhang, Y\. Wang, Z\. Shao, and Z\. LiOpenai o1 system card\.ArXiv preprintabs/2412\.16720\.External Links:[Link](https://arxiv.org/abs/2412.16720)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p3.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1)\.
- Packeret al\.\(2023\)C\. Packer, S\. Wooders, K\. Lin, V\. Fang, S\. G\. Patil, I\. Stoica, and J\. E\. GonzalezMemgpt: towards llms as operating systems\.ArXiv preprintabs/2310\.08560\.External Links:[Link](https://arxiv.org/abs/2310.08560)Cited by:[§2](https://arxiv.org/html/2610.13348#S2.p1.1)\.
- Penget al\.\(2026\)C\. Peng, H\. Xin, X\. Sheng, X\. Dai, Z\. Liu, S\. Wang, Y\. Yan, Z\. Chen, Y\. Gu, and G\. YuMemory shot for long\-term dialogue\.ArXiv preprintabs/2606\.28338\.External Links:[Link](https://arxiv.org/abs/2606.28338)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p2.1),[§2](https://arxiv.org/html/2610.13348#S2.p2.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p2.2)\.
- Qwen Team \(2026\)Qwen TeamQwen3\.5: towards native multimodal agents\.External Links:[Link](https://qwen.ai/blog?id=qwen3.5)Cited by:[§4](https://arxiv.org/html/2610.13348#S4.p5.1),[§4](https://arxiv.org/html/2610.13348#S4.p6.1)\.
- Shenet al\.\(2026\)Z\. Shen, S\. Cheng, Z\. Guo, W\. Wang, Y\. Wang, and H\. HuangAnchorMem: anchored facts with associative contexts for building memory in large language models\.InFindings of ACL,pp\. 34784–34798\.External Links:[Link](https://aclanthology.org/2026.findings-acl.1736/)Cited by:[§2](https://arxiv.org/html/2610.13348#S2.p2.1),[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p4.2),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.10.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.21.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.11.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.22.1)\.
- Snellet al\.\(2025\)C\. Snell, J\. Lee, K\. Xu, and A\. KumarScaling llm test\-time compute optimally can be more effective than scaling parameters for reasoning\.InProceedings of ICLR,pp\. 10131–10165\.External Links:[Link](https://proceedings.iclr.cc/paper_files/paper/2025/file/1b623663fd9b874366f3ce019fdfdd44-Paper-Conference.pdf)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p3.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1)\.
- Sunet al\.\(2026\)J\. Sun, Y\. Xue, M\. Li, Z\. Yao, J\. Li, Y\. Cui, W\. Cai, H\. Liu, F\. Wang, M\. K\. Montgomery,et al\.TrajWiki: source\-grounded memory trajectories for long\-horizon dialogue agents\.ArXiv preprintabs/2608\.00967\.External Links:[Link](https://arxiv.org/abs/2608.00967)Cited by:[§3\.1](https://arxiv.org/html/2610.13348#S3.SS1.p4.2)\.
- Tanet al\.\(2025\)Z\. Tan, J\. Yan, I\. Hsu, R\. Han, Z\. Wang, L\. Le, Y\. Song, Y\. Chen, H\. Palangi, G\. Lee, A\. R\. Iyer, T\. Chen, H\. Liu, C\. Lee, and T\. PfisterIn prospect and retrospect: reflective memory management for long\-term personalized dialogue agents\.InProceedings of ACL,pp\. 8416–8439\.External Links:[Link](https://aclanthology.org/2025.acl-long.413/)Cited by:[§5\.2](https://arxiv.org/html/2610.13348#S5.SS2.p2.1)\.
- Teamet al\.\(2026\)G\. Team, S\. E\. Abd, V\. Aggarwal, R\. Algayres, A\. Andreev, O\. Bachem, I\. Ballantyne, C\. Brick, V\. Cărbune, M\. Casbon, M\. Chaturvedi, A\. Chawla, V\. Cotruta, A\. Coucke, P\. Culliton, R\. Dadashi, L\. Dixon, M\. Elhawaty, U\. Evci, C\. Farabet, J\. Ferret, F\. Galgani, S\. Girgin, J\. Grill, M\. Grootendorst, J\. Guo, C\. Hardin, Y\. He, S\. M\. Hernandez, O\. Homburger, L\. Hussenot, J\. Ji, A\. Joulin, A\. Kamath, P\. Kassraie, O\. Lacombe, P\. Lahoti, G\. Liu, G\. Martins, L\. Martins, T\. Matejovicova, R\. Merhej, N\. Momchev, S\. Mondal, R\. Mullins, S\. R\. Panyam, S\. Pathak, S\. Perrin, A\. S\. Pinto, E\. Pot, A\. Pouget, A\. Ramé, S\. Ramos, D\. Reid, D\. Rim, M\. Rivière, K\. Roth, L\. Rouillard, O\. Sanseviero, P\. G\. Sessa, S\. Settle, D\. Sinopalnikov, S\. Smoot, P\. Stanczyk, A\. Steiner, L\. Stewart, I\. Tolstikhin, M\. Tschannen, A\. Tsitsulin, N\. Vieillard, R\. Wu, P\. Xu, H\. Yang, E\. Yvinec, B\. Zhang, L\. Zhang, J\. Zou, N\. Aagnes, A\. Abdelhamed, J\. Adamek, S\. Agrawal, S\. Agrawal, I\. Alabdulmohsin, J\. B\. Alayrac, U\. Alon, C\. Amarnath, A\. Anand, C\. Anastasiou, S\. Ariafar, F\. Aubet, K\. Axiotis, F\. Barbero, J\. Barral, A\. Bendebury, U\. Bergmann, S\. Bileschi, K\. Black, M\. Blondel, S\. Borgeaud, A\. Bražinskas, R\. Burnell, R\. Busa\-Fekete, M\. Cai, D\. Calandriello, G\. Cameron, C\. Caucheteux, R\. Chaabouni, G\. Chadha, J\. Chan, B\. J\. Chen, J\. Chen, L\. Chen, X\. Chen, D\. Cheng, T\. Chien, N\. Chinaev, Y\. Chou, Z\. Chu, B\. Coleman, P\. Consul, S\. Conway\-Rahman, S\. Crowell, D\. Cutler, V\. Dani, S\. Daruki, A\. Das, D\. Deutsch, N\. Dikkala, L\. Ding, Q\. Ding, S\. Dodhia, K\. Donhauser, T\. Doshi, A\. Dragan, A\. Druinsky, S\. Dua, Z\. Egyed, D\. Eisenbud, D\. Eppens, C\. Fan, B\. Fatemi, Y\. Fathullah, V\. Feinberg, M\. Ferev, S\. Flennerhag, T\. Fujimoto, J\. G\. Oliveira, I\. Galatzer\-Levy, J\. Gante, S\. Geisler, S\. Ghosal, A\. M\. Girgis, T\. von Glehn, A\. Go, A\. Gokhale, A\. Grills, Y\. Gu, M\. Gupta, P\. Gupta, G\. Guruganesh, R\. Hadsell, H\. Harkous, J\. Harlalka, D\. Hassabis, A\. Hauth, J\. Heyward, A\. Hosseini, C\. Hsia, I\. Hsu, X\. Huang, Y\. Huang, K\. Hui, A\. Hutter, T\. I, F\. Iliopoulos, A\. Jain, G\. Jawahar, Z\. Ji, Q\. Jin, M\. Johnson, K\. Joshi, A\. Kandoor, W\. Kang, K\. Kavukcuoglu, M\. Kazemi, K\. Kenealy, A\. Khalifa, P\. Kirk, I\. Korotkov, S\. Kothawade, V\. Kovalev, N\. Kovelamudi, A\. Kraft, R\. Kumar, V\. Kumar, H\. Kuppam, J\. Lannin, C\. Lee, S\. Lee, D\. Lepikhin, A\. Levkovitch, D\. Li, Q\. Li, V\. Liévin, E\. Lin, Z\. Lin, C\. Liu, T\. Liu, T\. Liu, X\. Liu, I\. Lobov, M\. Lunayach, M\. Ma, G\. Madan, A\. Maksai, E\. Malmi, M\. Matuszak, D\. McDuff, G\. Menghani, M\. Mikuła, D\. Mirylenka, K\. Misiunas, V\. Misra, A\. Mitran, K\. Mohamed, M\. Mukha, E\. Noland, J\. O’Donnell, B\. O’Donoghue, K\. Olszewska, B\. Orlando, W\. Pan, R\. Panigrahy, U\. Parekh, N\. Perez\-Nieves, C\. Park, E\. Paskie, L\. Peng, B\. Petrini, S\. Petrov, J\. Pfeiffer, B\. Piot, M\. Plomecka, S\. Poder, O\. Ponce, A\. Pramanik, D\. Racz, A\. Rajan, M\. Ramanovich, A\. Rao, M\. Ritter, V\. Rodrigues, E\. Rosen, M\. Rybiński, N\. Sachdeva, M\. E\. Sander, R\. Sathyanarayana, S\. Savla, S\. Schmidgall, T\. Schuster, G\. Scrivener, B\. Seguin, A\. Sellergren, A\. Severyn, I\. Shafran, D\. Shah, B\. Shahriari, Y\. Shangguan, A\. Shenoy, P\. Shenoy, R\. Shivanna, P\. Sho, L\. Spangher, W\. Stokowiec, T\. Strother, Y\. Su, Y\. Sun, M\. Sundararajan, A\. Tacchetti, M\. H\. Taege, P\. Tafti, J\. Tarbouriech, C\. Tekur, S\. Thakoor, R\. Thapa, M\. Traverse, L\. Treven, T\. Tu, C\. T\. Tung, Ç\. Ünlü, P\. Veličković, M\. P\. Venkat, S\. G\. Venkatesh, V\. Venkiteswaran, F\. Visin, A\. Vitvitskyi, K\. Vodrahalli, W\. Wang, X\. Wang, T\. Warkentin, J\. Wassenberg, J\. Wieting, C\. Wu, L\. Xiao, H\. Xu, Y\. Xu, F\. Xue, A\. Yadav, J\. Yan, A\. Yang, L\. Yang, M\. Yang, Z\. Ying, J\. H\. Yoo, M\. Zadimoghaddam, S\. Zafar, F\. Zhang, J\. Zhang, J\. Zhang, X\. Zhang, C\. Zhao, D\. Zhou, and C\. ZouGemma 4 technical report\.ArXiv preprintabs/2607\.02770\.External Links:[Link](https://arxiv.org/abs/2607.02770)Cited by:[§4](https://arxiv.org/html/2610.13348#S4.p6.1)\.
- Teyler and Rudy \(2007\)T\. J\. Teyler and J\. W\. RudyThe hippocampal indexing theory and episodic memory: updating the index\.Hippocampus,pp\. 1158–1169\.External Links:[Link](https://pubmed.ncbi.nlm.nih.gov/17696170/)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p4.1)\.
- Wanget al\.\(2026\)Y\. Wang, R\. Geng, Y\. Chen, and J\. JiaAttnTrace: contextual attribution of prompt injection and knowledge corruption\.In2026 IEEE Symposium on Security and Privacy \(SP\),pp\. 4320–4338\.Cited by:[§A\.7](https://arxiv.org/html/2610.13348#A1.SS7.p2.1)\.
- Wuet al\.\(2025\)D\. Wu, H\. Wang, W\. Yu, Y\. Zhang, K\. Chang, and D\. YuLongMemEval: benchmarking chat assistants on long\-term interactive memory\.InProceedings of ICLR,pp\. 86809–86836\.External Links:[Link](https://proceedings.iclr.cc/paper_files/paper/2025/file/d813d324dbf0598bbdc9c8e79740ed01-Paper-Conference.pdf)Cited by:[§A\.2](https://arxiv.org/html/2610.13348#A1.SS2.p1.1),[§4](https://arxiv.org/html/2610.13348#S4.p2.1)\.
- Wuet al\.\(2026\)M\. Wu, Z\. Liu, X\. Li, Y\. Lan, Y\. Yan, S\. Wang, C\. Yang, M\. Yu, Z\. Zeng, and M\. SunFinding what matters: anchoring context knowledge with evolving indices for iterative retrieval\.ArXiv preprintabs/2601\.16462\.External Links:[Link](https://arxiv.org/abs/2601.16462)Cited by:[§5\.2](https://arxiv.org/html/2610.13348#S5.SS2.p2.1)\.
- Xinet al\.\(2026a\)H\. Xin, X\. Li, Z\. Liu, Y\. Yan, S\. Wang, C\. Yang, Y\. Gu, G\. Yu, and M\. SunMetaMem: evolving meta\-memory for knowledge utilization through self\-reflective symbolic optimization\.InFindings of ACL,pp\. 5473–5492\.External Links:[Link](https://aclanthology.org/2026.findings-acl.270/)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p1.1),[§4](https://arxiv.org/html/2610.13348#S4.p5.1)\.
- Xinet al\.\(2026b\)H\. Xin, Z\. Liu, S\. Mei, Y\. Yan, S\. Yu, S\. Wang, Z\. Chen, Y\. Gu, G\. Yu, and C\. XiongLISRec: modeling user preferences with learned item shortcuts for sequential recommendation\.InProceedings of KDD,pp\. 1650–1661\.External Links:[Link](https://doi.org/10.1145/3770854.3780337)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1)\.
- Yaoet al\.\(2023\)S\. Yao, J\. Zhao, D\. Yu, N\. Du, I\. Shafran, K\. R\. Narasimhan, and Y\. CaoReAct: synergizing reasoning and acting in language models\.InProceedings of ICLR,External Links:[Link](https://openreview.net/pdf?id=WE_vluYUL-X)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1)\.
- Yin and Tang \(2026\)J\. Yin and T\. TangDeferMem: query\-time evidence distillation via reinforcement learning for long\-term memory qa\.ArXiv preprintabs/2605\.22411\.External Links:[Link](https://arxiv.org/abs/2605.22411)Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p2.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1)\.
- Yuet al\.\(2026\)J\. Yu, Y\. Zhao, J\. Zhang, and X\. LiLazyMem: retrieve broadly, construct selectively for efficient long\-term agent memory\.ArXiv preprintabs/2607\.22690\.External Links:[Link](https://arxiv.org/abs/2607.22690)Cited by:[§A\.3](https://arxiv.org/html/2610.13348#A1.SS3.p1.1),[§1](https://arxiv.org/html/2610.13348#S1.p2.1),[§2](https://arxiv.org/html/2610.13348#S2.p3.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.11.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.22.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.12.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.23.1)\.
- Zhanget al\.\(2026\)N\. Zhang, X\. Yang, Z\. Tan, W\. Deng, and W\. WangHiMem: hierarchical long\-term memory for llm long\-horizon agents\.ArXiv preprintabs/2601\.06377\.External Links:[Link](https://arxiv.org/abs/2601.06377)Cited by:[§A\.3](https://arxiv.org/html/2610.13348#A1.SS3.p1.1),[§2](https://arxiv.org/html/2610.13348#S2.p2.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.19.1),[Table 1](https://arxiv.org/html/2610.13348#S4.T1.8.1.8.1),[§4](https://arxiv.org/html/2610.13348#S4.p4.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.20.1),[Table 2](https://arxiv.org/html/2610.13348#S5.T2.4.1.9.1)\.
- Zhanget al\.\(2025\)Z\. Zhang, Q\. Dai, X\. Bo, C\. Ma, R\. Li, X\. Chen, J\. Zhu, Z\. Dong, and J\. WenA survey on the memory mechanism of large language model\-based agents\.TOIS43\(6\),pp\. 1–47\.Cited by:[§1](https://arxiv.org/html/2610.13348#S1.p1.1)\.
- Zhenget al\.\(2023\)L\. Zheng, W\. Chiang, Y\. Sheng, S\. Zhuang, Z\. Wu, Y\. Zhuang, Z\. Lin, Z\. Li, D\. Li, E\. Xing, H\. Zhang, J\. Gonzalez, and I\. StoicaJudging llm\-as\-a\-judge with mt\-bench and chatbot arena\.InProceedings of NeurIPS,Vol\.36,pp\. 46595–46623\.External Links:[Link](https://proceedings.neurips.cc/paper_files/paper/2023/file/91f18a1287b398d378ef22505bf41832-Paper-Datasets_and_Benchmarks.pdf)Cited by:[§4](https://arxiv.org/html/2610.13348#S4.p5.1)\.
- Zhonget al\.\(2024\)W\. Zhong, L\. Guo, Q\. Gao, H\. Ye, and Y\. WangMemoryBank: enhancing large language models with long\-term memory\.InProceedings of AAAI,pp\. 19724–19731\.External Links:[Link](https://doi.org/10.1609/aaai.v38i17.29946)Cited by:[§2](https://arxiv.org/html/2610.13348#S2.p1.1)\.

## Appendix AAppendix

### A\.1License

All datasets used in this work are publicly available with licenses permitting academic research and non\-commercial use\. Specifically, LoCoMo is distributed under the Creative Commons Attribution\-NonCommercial 4\.0 International License \(CC BY\-NC 4\.0\), while LongMemEval is released under the MIT License\.

Table 4:Statistics of the LoCoMo and the LongMemEval Datasets\.LoCoMoLongMemEvalCategory\# QuestionsCategory\# QuestionsSingle\-Hop841Single\-Session User70Multi\-Hop282Single\-Session Assistant56Temporal321Single\-Session Preference30Open Domain96Multi\-Session133\-\-Knowledge\-Update78\-\-Temporal\-Reasoning133Total1,540Total500
### A\.2Additional Dataset Details

Table[4](https://arxiv.org/html/2610.13348#A1.T4)summarizes the statistics of the two long\-term memory benchmarks adopted in our experiments: LoCoMo\([Maharana et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib10)\)and LongMemEval\([Wu et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib12)\)\. Following prior studies\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17);[Hu et al\., 2026a](https://arxiv.org/html/2610.13348#bib.bib26)\), we exclude theadversarialcategory from LoCoMo for evaluation, and use the officiallongmemeval\_s\_cleanedsplit111[https://huggingface\.co/datasets/xiaowu0162/longmemeval](https://huggingface.co/datasets/xiaowu0162/longmemeval)for LongMemEval\.

### A\.3Additional Experimental Details

In all experiments, we employ vLLM222[https://vllm\.ai/](https://vllm.ai/)to serve both the backbone and retrieval models\. For generation, we set the temperature to 0\.0, top\-ppto 0\.95, and top\-kkto 20, with a maximum answer length of 1024 tokens\. For HiMem\([Zhang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib22)\), we follow the original implementation and adopt bge\-reranker\-v2\-m3\([Chen et al\., 2024](https://arxiv.org/html/2610.13348#bib.bib25)\)as the reranking model\. For LazyMem\([Yu et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib31)\), we replace the original memory\-processing model, LazyMem\-4B, with the corresponding backbone model, since LazyMem\-4B had not been publicly released when our experiments were conducted\. The reported LazyMem results therefore correspond to this backbone\-substituted implementation\.

For the token\-budget analysis, we adopt prompt\-based length control following prior work\([Han et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib41);[Lee et al\., 2025](https://arxiv.org/html/2610.13348#bib.bib42)\)\. Specifically, the model is instructed to generate at mostNNreasoning tokens before producing the final answer\. We override the default output limit by settingmax\_tokenstoN\+64N\+64, where the additional 64 tokens provide a fixed allowance for the final answer and output formatting\. This limit applies to the complete generated response and does not separately enforce the reasoning length\. The final\-answer instructions remain unchanged across all budget settings\. Native thinking mode is disabled, and reasoning is generated explicitly in the response\.

Table 5:Ablation Study on the LongMemEval Dataset\.MethodSingleSingleSingleMultiKnowledgeTemporalAvg\.UserAssistantPreferenceSessionUpdateReasoningQwen3\.5\-27BT2Mem \(Summary\)85\.7194\.6460\.0060\.9082\.0573\.6874\.80T2Mem \(Graph\)84\.29100\.0070\.0059\.4082\.0579\.7077\.00T2Mem92\.8698\.2183\.3370\.6892\.3184\.9684\.80w/o Metadata90\.0094\.6453\.3362\.4189\.7475\.1977\.00w/o Rawdata91\.4398\.2176\.6772\.9389\.7479\.7083\.00w/o Rollout Construction94\.2994\.6473\.3369\.1793\.5979\.7082\.40Gemma4\-31B\-InstructT2Mem \(Summary\)91\.43100\.0076\.6762\.4180\.7770\.6876\.60T2Mem \(Graph\)91\.43100\.0076\.6770\.6891\.0381\.9583\.40T2Mem94\.29100\.0083\.3369\.9292\.3185\.7185\.20w/o Metadata94\.2994\.6456\.6773\.6889\.7484\.9684\.00w/o Rawdata95\.7194\.6476\.6769\.1791\.0383\.4683\.40w/o Rollout Construction94\.2991\.0773\.3366\.9291\.0380\.4581\.20

### A\.4Ablation Studies on the LongMemEval Dataset

As shown in Table[5](https://arxiv.org/html/2610.13348#A1.T5), T2Mem achieves the highest average accuracy on LongMemEval with both backbone models\. Replacing episode\-level metadata with summaries or graphs reduces average performance, supporting the effectiveness of the proposed representation\. Removing either metadata or access to raw interactions also lowers average accuracy, highlighting their complementary roles in memory construction\. Removing rollout construction leads to clear declines on Temporal Reasoning and Single Preference questions\. These results further support progressively constructing memory according to the query’s evolving information needs\.

### A\.5Effectiveness of T2Mem at Different Memory Construction Steps

We conduct two analyses on LoCoMo to examine the effect of memory construction steps\. We first vary the maximum construction budgetTmaxT\_\{\\max\}to evaluate its effect on answer accuracy\. We then examine the actual number of stepsTTand compare T2Mem with Search\-o1 across observed stopping steps\. For T2Mem, each construction step generates\(rt,mt,at\)\(r\_\{t\},m\_\{t\},a\_\{t\}\)and appends the new memory cachemtm\_\{t\}to the accumulated memory\.

\(a\)Temporal\(b\)Multi\-Hop\(c\)Open\-Domain\(d\)Single\-Hop
Figure 3:Performance of T2Mem at Different Memory Construction Steps on the LoCoMo Dataset\.Effect of Construction Steps on Answer Performance\.As shown in Figure[3](https://arxiv.org/html/2610.13348#A1.F3), the answer accuracy generally improves as the maximum number of construction steps increases, indicating that additional test\-time computation benefits memory construction\. Specifically, Single\-Hop questions show clear gains when the number of steps increases from one to three, followed by a clear plateau, as their required evidence can often be recovered within relatively shallow construction\. Temporal and Open\-Domain questions exhibit a different trend, with performance continuing to improve as the construction depth increases to seven steps\. These questions typically require resolving temporal relations or recovering evidence distributed across interaction sessions, leaving more room for additional construction steps to contribute\. Beyond this depth, the gains become less pronounced, reflecting diminishing returns from further extending the construction process\.

\(a\)Temporal\(b\)Multi\-Hop\(c\)Open\-Domain\(d\)Single\-Hop
Figure 4:Performance Gains of T2Mem over Search\-o1 across Different Memory Construction Steps on the LoCoMo Dataset\.Performance Gains of T2Mem over Search\-o1 at Different Construction Steps\.Figure[4](https://arxiv.org/html/2610.13348#A1.F4)further compares T2Mem and Search\-o1 according to the number of construction steps taken before answering\. At the first step, the performance gap remains relatively small, particularly for Single\-Hop questions, where the initially retrieved evidence is often sufficient to answer\. However, as the process extends to two and three steps, T2Mem achieves substantially larger gains across all types of questions\. Although Search\-o1 performs iterative retrieval, its subsequent searches are directly driven by the current reasoning state, without an explicit structure for organizing previously encountered events, entities, and temporal cues\. In contrast, T2Mem uses the lightweight episode\-level metadata to provide structured cues for locating relevant sessions and selectively recovers fine\-grained details from the linked source interactions as construction proceeds\. This structured access allows successive steps to more effectively connect newly acquired evidence with information established earlier, which becomes increasingly beneficial when answering requires evidence scattered across multiple sessions\.

Figure 5:Case Study of T2Mem\.
### A\.6Case Studies

In Figure[5](https://arxiv.org/html/2610.13348#A1.F5), we present a qualitative case study to illustrate how T2Mem performs iterative memory construction to resolve temporal ambiguity across interaction sessions\.

The example involves a long\-horizon conversational query where relevant evidence is scattered over multiple interaction sessions\. The initial observationo0o\_\{0\}contains episode\-level metadata entries that mention a planned camping trip in June and a later report of camping\. These entries do not establish when the June trip actually occurred\. T2Mem therefore performs additional metadata retrieval and source\-session recovery to seek more specific temporal evidence\. A subsequently retrieved entry from the June 27 session states that Melanie went camping in the mountains during the preceding week\. The model distills this temporal information into a memory cache and appends it to the accumulated memory\. The resultingℳT\\mathcal\{M\}\_\{T\}supports the final answer, illustrating how iterative memory construction incorporates answer\-relevant information that is missing from the initial observation\.

![Refer to caption](https://arxiv.org/html/2610.13348v1/images/attn_lightmem.png)\(a\)LightMem with Retrieved Memory Units\.
![Refer to caption](https://arxiv.org/html/2610.13348v1/images/attn_ttmc.png)\(b\)T2Mem with Constructed Memory\.

Figure 6:Token Saliency and Answer Specificity for LightMem and T2Mem on the Same LoCoMo Query\.
### A\.7Saliency Analysis of Answer\-Supporting Evidence

As shown in Figure[6](https://arxiv.org/html/2610.13348#A1.F6), we compare the displayed contexts, token saliency maps, and answers of T2Mem and LightMem\([Fang et al\., 2026](https://arxiv.org/html/2610.13348#bib.bib17)\)on the same LoCoMo query\.

Following the token\-level attention aggregation described by[Wang et al\. \(2026\)](https://arxiv.org/html/2610.13348#bib.bib40), we compute saliency through a teacher\-forced forward pass over each input\-output sequence\. For an input tokenxix\_\{i\}, its saliency is:

S⁡\(xi\)=1\|ℒattn​‖ℋ‖​𝒪\|​∑ℓ∈ℒattn∑h∈ℋ∑j∈𝒪Aj,i\(ℓ,h\),S\(x\_\{i\}\)=\\frac\{1\}\{\|\\mathcal\{L\}\_\{\\mathrm\{attn\}\}\|\\,\|\\mathcal\{H\}\|\\,\|\\mathcal\{O\}\|\}\\sum\_\{\\ell\\in\\mathcal\{L\}\_\{\\mathrm\{attn\}\}\}\\sum\_\{h\\in\\mathcal\{H\}\}\\sum\_\{j\\in\\mathcal\{O\}\}A^\{\(\\ell,h\)\}\_\{j,i\},\(14\)whereAj,i\(ℓ,h\)A^\{\(\\ell,h\)\}\_\{j,i\}denotes attention from output positionjjto input tokenxix\_\{i\}\. We average over the 16 softmax\-attention layersℒattn\\mathcal\{L\}\_\{\\mathrm\{attn\}\}, their 24 query headsℋ\\mathcal\{H\}, and all output positions𝒪\\mathcal\{O\}\. The analyzed output is the recorded answer for LightMem and the controller JSON reconstructed from logs for the displayed T2Mem step\. Scores are normalized separately for visualization and interpreted within each input\.

In Figure[6\(a\)](https://arxiv.org/html/2610.13348#A1.F6.sf1), LightMem retrieves a preconstructed description of Caroline’s relocation\. Although this statement receives relatively high saliency, it identifies her origin only as “her home country,” and the answer repeats this unresolved reference\. The description preserves the relevant event but does not identify the country requested by the query\. Thus, a salient and relevant memory can still lack the specificity needed to support a complete answer\.

In contrast, T2Mem constructs memory according to the current query, selecting and accumulating relevant facts during reasoning and acquiring additional information when needed\. Figure[6\(b\)](https://arxiv.org/html/2610.13348#A1.F6.sf2)shows a salient metadata statement identifying Sweden as Caroline’s home country\. This explicit association supplies the relation needed to resolve the country reference, and the reported answer correctly names Sweden\. The comparison illustrates the value of organizing memory around the query’s specific evidence requirements rather than relying on a generally relevant event description alone\.

Figure 7:Prompt Template for Constructing Wiki\-style Metadata from Interaction Sessions\.Figure 8:Prompt Template for Iterative Reasoning and Information Access During Test\-time Memory Construction\.Figure 9:Prompt Template for Answering the User Question\.Figure 10:Prompt Template for Response Judgement on the LoCoMo Dataset\.Figure 11:Prompt Template for Response Judgement on the LongMemEval Dataset\.Figure 12:Prompt Template for Evaluating the Quality of Constructed Memory\.
### A\.8Prompt Templates

This section presents the prompt templates used throughout our experiments\. Figure[7](https://arxiv.org/html/2610.13348#A1.F7)presents the prompt for generating an entry in the lightweight episode\-level metadata from an interaction session\. Figure[8](https://arxiv.org/html/2610.13348#A1.F8)presents the prompt for producing the reasoning tracertr\_\{t\}, memory cachemtm\_\{t\}, and next actionata\_\{t\}at each construction step\. Figure[9](https://arxiv.org/html/2610.13348#A1.F9)presents the prompt for generating the final answer from the query and the constructed memoryℳT\\mathcal\{M\}\_\{T\}\. Figures[10](https://arxiv.org/html/2610.13348#A1.F10)and[11](https://arxiv.org/html/2610.13348#A1.F11)present the LLM\-judge prompts for evaluating answer accuracy\. Finally, Figure[12](https://arxiv.org/html/2610.13348#A1.F12)presents the prompt for evaluating the quality of the answer\-supporting evidence\.