A-Mem: Agentic Memory for LLM Agents
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index; 11 of the 17 sources its claims cite were checked for support.
Abstract
This paper proposes a novel agentic memory system for LLM agents that can dynamically organize memories in an agentic way following Zettelkasten note-taking principles with dynamic indexing and linking.
Overview
CoChat Summary
TL;DR
A-MEM is an agentic memory system for LLM agents that, inspired by the Zettelkasten method, builds structured notes with LLM-generated keywords, tags, and contextual descriptions, then autonomously links and evolves them as new memories arrive. Across six foundation models on LoCoMo and DialSim, it outperforms LoCoMo, ReadAgent, MemoryBank, and MemGPT while using far fewer tokens.
Key findings
- On LoCoMo with GPT-4o-mini, A-MEM reaches 27.02 F1 / 20.09 BLEU-1 on Multi Hop and 45.85 / 36.67 on Temporal, versus MemGPT's 26.65 / 17.72 and 25.52 / 19.44; A-MEM's average ranking is 1.2 versus 2.4 for both LoCoMo and MemGPT.
- On DialSim, A-MEM scores F1 3.45, BLEU-1 3.37, ROUGE-L 3.54, ROUGE-2 3.60, METEOR 2.05, SBERT 19.51, versus LoCoMo (2.55, 3.13, 2.75, 0.90, 1.64, 15.76) and MemGPT (1.18, 1.07, 0.96, 0.42, 0.95, 8.54) — a 35% F1 improvement over LoCoMo and 192% over MemGPT.
- Ablation with GPT-4o-mini: removing both link generation and memory evolution drops Multi Hop F1 to 9.65; removing only memory evolution gives 21.35; full A-MEM gives 27.02.
- Cost/scaling: ~1,200 tokens per memory operation (85–93% reduction vs. ~16,900 for LoCoMo/MemGPT), under $0.0003 per operation, 5.4 s average with GPT-4o-mini and 1.1 s with local Llama 3.2 1B; retrieval time grows only from 0.31 µs to 3.70 µs from 1,000 to 1,000,000 memories.
Methods
- Design: each memory note is `{content, timestamp, keywords, tags, context, embedding, links}`; an LLM generates keywords/tags/context, a text encoder (all-minilm-l6-v2) produces embeddings, top-k nearest neighbors are retrieved by cosine similarity, and an LLM decides link generation and memory evolution (updating neighbors' context, keywords, tags).
- Data: LoCoMo (7,512 QA pairs, dialogues averaging 9K tokens over up to 35 sessions; single-hop, multi-hop, temporal, open-domain, adversarial) and DialSim (multi-party dialogues from Friends, The Big Bang Theory, The Office; 1,300 sessions, ~350,000 tokens, >1,000 questions per session).
- Evaluation: F1 and BLEU-1 as primary metrics, plus ROUGE-L, ROUGE-2, METEOR, and SBERT similarity; baselines LoCoMo, ReadAgent, MemoryBank, MemGPT; six foundation models (GPT-4o-mini, GPT-4o, Qwen2.5-1.5B/3B, Llama 3.2 1B/3B) plus DeepSeek-R1-32B, Claude 3.0 Haiku, and Claude 3.5 Haiku in the appendix; top-k retrieval with k=10 default and category-specific tuning.
Limitations
- Stated by the paper: memory organization quality may still depend on the underlying LLM's capabilities, and different LLMs may generate different contextual descriptions or connections; the implementation is text-only, with multimodal (image/audio) extension left to future work.
- Evident from the text: no error bars or significance tests are reported (the checklist answers "No" to statistical significance, citing API cost); the main-text results are reported for a single dataset family of long-term conversation QA, and the paper's own checklist notes broader societal impacts are not discussed.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
5 Valid · 0 Not valid · 3 Not checked · 55 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“These systems require agent developers to predefine memory storage structures, specify storage points within the workflow, and establish retrieval timing.”
What the sources say
- Partly supportedcites [25] [25] Charles Packer, Sarah Wooders, Kevin Lin, Vivian Fang, Shishir G Patil, Ion Stoica, and Joseph E Gonzalez. Memgpt: Towards llms as operating systems. arXiv preprint arXiv:2310.08560, 2023. sourceExperimental — accuracy not yet measured
Section 3.2.1 (p. 6) says the fixed-context baselines fetch documents independently of LLM inference, supporting the idea that retrieval is set by the workflow rather than chosen by the agent. Section 2.3 (p. 3) contrasts this with MemGPT’s self-directed memory edits and retrieval. The paper does not establish that existing memory systems generally require developers to predefine storage structures or specify storage points. (LLM, conf=0.78)
- Could not verifycites [39] [39] Wanjun Zhong, Lianghong Guo, Qiqi Gao, He Ye, and Yanlin Wang. Memorybank: Enhancing large language models with long-term memory. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 19724–19731, 2024. 12 Contents sourceExperimental — accuracy not yet measured
Sections 2.1 and 2.2 describe MemoryBank’s storage structure and retrieval mechanism, but do not say that existing systems require agent developers to predefine structures, choose workflow storage points, or set retrieval timing. Searches for those developer requirements found no passage addressing them. (LLM, conf=0.73)
- Not matchedcites [28] [28] Aymeric Roucher, Albert Villanova del Moral, Thomas Wolf, Leandro von Werra, and Erik Kaunismäki. 'smolagents': a smol library to build great agentic systems. https://github. com/huggingface/smolagents, 2025.
Its entry has no title and year that we can search by.
- Could not verifycites [21] [21] Zhiwei Liu, Weiran Yao, Jianguo Zhang, Liangwei Yang, Zuxin Liu, Juntao Tan, Prafulla K Choubey, Tian Lan, Jason Wu, Huan Wang, et al. Agentlite: A lightweight library for building and advancing task-oriented llm agent system. arXiv preprint arXiv:2402.15538, 2024. sourceExperimental — accuracy not yet measured
Section 2.1 describes when AgentLite retrieves an action-observation history and stores an observation; the Figure 1 description in Section 6 also describes its memory workflow. Neither passage says that existing memory systems require developers to predefine storage structures, storage points, or retrieval timing. Searches for those requirements found no passage addressing them. (LLM, conf=0.72)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Existing memory systems [25, 39, 28, 21] for LLM agents provide basic memory storage functionality.”
What the sources say
- Supportedcites [25] [25] Charles Packer, Sarah Wooders, Kevin Lin, Vivian Fang, Shishir G Patil, Ion Stoica, and Joseph E Gonzalez. Memgpt: Towards llms as operating systems. arXiv preprint arXiv:2310.08560, 2023. source
MemGPT is an LLM-agent memory system that stores information outside the context window. Section 2 (p. 2) describes its external context and memory-management functions, and the Figure 3 description (p. 3) identifies archival and recall storage databases. The claim does not say these systems provide only basic storage. (LLM, conf=0.88)
- Supportedcites [39] [39] Wanjun Zhong, Lianghong Guo, Qiqi Gao, He Ye, and Yanlin Wang. Memorybank: Enhancing large language models with long-term memory. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 19724–19731, 2024. 12 Contents source
MemoryBank is an LLM memory system with a memory-storage component. Section 2 describes that component as its primary data repository, and §2.1 says it stores conversation records, event summaries, and user information. This supports citing MemoryBank as an example of a system that provides memory storage functionality. (LLM, conf=0.91)
- Not matchedcites [28] [28] Aymeric Roucher, Albert Villanova del Moral, Thomas Wolf, Leandro von Werra, and Erik Kaunismäki. 'smolagents': a smol library to build great agentic systems. https://github. com/huggingface/smolagents, 2025.
Its entry has no title and year that we can search by.
- Supportedcites [21] [21] Zhiwei Liu, Weiran Yao, Jianguo Zhang, Liangwei Yang, Zuxin Liu, Juntao Tan, Prafulla K Choubey, Tian Lan, Jason Wu, Huan Wang, et al. Agentlite: A lightweight library for building and advancing task-oriented llm agent system. arXiv preprint arXiv:2402.15538, 2024. source
Section 2.1, “Individual Agent” (page not available), describes AgentLite’s Memory component as storing an agent’s action-observation chains and saving new actions and observations during execution. This supports citing AgentLite as an example of an LLM-agent system with basic memory storage functionality. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“While previous datasets contain dialogues with around 1K tokens over 4-5 sessions, LoCoMo features much longer conversations averaging 9K tokens spanning up to 35 sessions”
§ 4 Experiment > 4.1 Dataset and Evaluation
What the sources say
- Supportedcites [22] [22] Adyasha Maharana, Dong-Ho Lee, Sergey Tulyakov, Mohit Bansal, Francesco Barbieri, and Yuwei Fang. Evaluating very long-term conversational memory of llm agents. arXiv preprint arXiv:2402.17753, 2024. source
The Introduction (p. 2) reports that LoCoMo conversations average 9K tokens and span up to 35 sessions. Its comparison table (p. 2) lists earlier multi-session datasets at about 1,055–1,226 tokens across four or five sessions, supporting the stated contrast. (LLM, conf=0.94)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“T-SNE Visualization of Memory Embeddings Showing More Organized Distribution with A-MEM (blue) Compared to Base Memory (red) Across Different Dialogues.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“with each memory operation costing less than $0.0003 when using commercial API services”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
25 more claims
Create a free account to see all 63 claims and every source verdict.
- Probably not a substantial claim. 16
- It may state two separate claims as one. 20
- The quote only partly states this claim. 2
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“Relative to the O (1) dictionary lookup used by all prior systems [4], [5], [6], [7], [8], [9], lineage-gated retrieval trades at most 13 . 82 µ s in absolute terms for the safety guarantee of Theorem 1-a tradeoff Experiments 1-2 show buys elimination of an 18 . 8 -25 . 5% structural leak rate at a 13 -14 percentage-point reuse cost.”
From Lineage-Aware Memory Governance: A Derivation-Gated Framework for Privacy-Preserving Column-Level Access Control in Enterprise AI Agents (2026) · cites this paper as [6]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This emerging class of systems extends the capabilities of traditional AI Agents by enabling multiple intelligent entities to collaboratively pursue goals through structured communication [144-146], shared memory [147,148], and dynamic role assignment [22].”
From AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges (2026) · cites this paper as [147]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“from Wang et al. [55], Xu et al. [45] build memory to improve long context performance for specific workflows which suggest that diverse evaluation workflows are needed for better testing of generalizable memory components.”
From MEMTRACK: Evaluating Long-Term Memory and State Tracking in Multi-Platform Dynamic Agent Environments (2025) · cites this paper as [45]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Some other approaches introduce external memory modules ( e.g., summarizers or retrievers) [63, 29, 13, 57], but these are typically trained separately and cannot be optimized end-to-end with the agent's policy. This also introduces additional engineering overhead, as engineers must manage and integrate two separate models.”
From MEM1: Learning to Synergize Memory and Reasoning for Efficient Long-Horizon Agents (2025) · cites this paper as [57]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Some others, such as HiAgent[5], A-Mem[23], MemAgent [28] use hierarchical designs to separate working buffers from episodic and long-term stores to relieve context pressure and improve persistence.”
From Learning Hierarchical Procedural Memory for LLM Agents through Bayesian Selection and Contrastive Refinement (2025) · cites this paper as [23]
Experimental — accuracy not yet measured
9 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ APPENDIX
“Using GPT-4o-mini, A-MEM achieves a ROUGE-L score of 44.27 in Multi-Hop tasks, more than doubling LoComo's 18.09.”
§ APPENDIX
“LOCOMO 9.64 23.92 2.01 18.09 3.40 11.58 26.48 40.20 60.46 69.59 READAGENT 2.47 9.45 0.95 13.12 0.55 5.76 2.99 9.92 6.66 9.79 MEMORYBANK 1.18 5.43 0.52 9.64 0.97 5.77 1.64 6.63 4.55 7.35 MEMGPT 10.58 25.60 4.76 25.22 0.76 9.14 28.44 42.24 36.62 43.75 A-MEM 10.61 25.86 21.39 44.27 3.42 12.09 29.50 45.18 42.62 50.04”
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ APPENDIX
“The Multi-Hop category showcases particularly striking results, where Qwen2.5-15b with A-MEM achieves a ROUGE-L score of 27.23, dramatically surpassing LoComo's 4.68 and ReadAgent's 2.81 - representing a nearly six-fold improvement.”
§ APPENDIX
“Multi Hop Temporal Open Domain Single Hop Adversial RGE-2 RGE-L RGE-2 RGE-L RGE-2 RGE-L RGE-2 RGE-L RGE-2 RGE-L”
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ APPENDIX
“This significant advantage maintains consistency across other metrics, with METEOR scores of 23.43 versus 7.61 and SBERT scores of 70.49 versus 52.30.”
§ APPENDIX
“Multi Hop Temporal Open Domain Single Hop Adversial ME SBERT ME SBERT ME SBERT ME SBERT ME SBERT”
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ 4 Experiment > 4.3 Empricial Results
“our A-MEM demonstrates superior performance in Multi-Hop tasks achieves at least two times better performance”
§ 4 Experiment > 4.1 Dataset and Evaluation
“MEMGPT 26.65 17.72 25.52 19.44 9.15 7.44 41.04 34.34 43.29 42.73 2.4 2.4 16,977 A-MEM 27.02 20.09 45.85 36.67 12.14 12.00 44.65 37.06 50.03 49.47 1.2 1.2 2,520”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 10 20 30 40 50
“44.55 25.43 28.31 32.12 34.32 37.02”
§ 4 Experiment > 4.1 Dataset and Evaluation
“A-MEM 27.02 20.09 45.85 36.67 12.14 12.00 44.65 37.06 50.03 49.47 1.2 1.2 2,520”
Citations
Cites
The publisher hasn’t deposited this paper’s reference list.
Research works printed but not linked: 4
- [1][1] Sönke Ahrens. How to Take Smart Notes: One Simple Technique to Boost Writing, Learning and Thinking. Amazon, 2017. Second Edition.
- [5][5] Satanjeev Banerjee and Alon Lavie. Meteor: An automatic metric for mt evaluation with improved correlation with human judgments. In Proceedings of the acl workshop on intrinsic and extrinsic evaluation measures for machine translation and/or summarization, pages 65–72, 2005.
- [18][18] Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Küttler, Mike Lewis, Wen-tau Yih, Tim Rocktäschel, et al. Retrieval-augmented generation for knowledge-intensive nlp tasks. Advances in Neural Information Processing Systems, 33:9459–9474, 2020.
- [19][19] Chin-Yew Lin. Rouge: A package for automatic evaluation of summaries. In Text summarization branches out, pages 74–81, 2004.
Cited by
Items 1,001–1,030 of 1,030
ORION: An Outcome-Driven LLM Advisor for RL-Based Multi-Domain 6G Slice PlacementPreprint
Mayaleh, M. S., Bannour, F., & Yellas, N.-E.-H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.41563
“General-purpose agentic-memory systems such as A-MEM [19] and Mem0 [20] supply lifecycle and extract-update pipelines for LLM-agent memory, but over conversational or task-completion traces.”
S-VEAM: A Shared Spectral Memory for Cross-Session Retrieval in Long-Horizon LLM Agents
Yi, J., & Geraci, J. R. (2026) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3799682.3840582
MemDTG: Dynamic Temporal Memory Graphs for Evidence-Admissible Agent Memory
Deng, Y., Qin, H., Gao, T., Zeng, G., & Li, R.-H. (2026) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3799682.3841052
H-Mem: Hawkes-driven Adaptive Forgetting for Long-Horizon Agent Memory
Wu, X., Qin, H., Zeng, G., Li, R.-H., & Zhao, K. (2026) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3799682.3840962
SelfImprove-Bench: Evaluating Generalization in Self-Improving AgentsPreprint
BangRui, X., Yang, J., Chen, S., Zhou, X., Qiu, J., Yang, Q., Wang, Z., Wu, F., & Wen, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02797 · Cited by 1
Agentic Context Management for Multi-Turn Human-AI ConversationsPreprint
Ho, M., Wang, C., Peng, B., Jojić, N., Laban, P., Galley, M., Gao, J., & Qin, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.00518
TrackMem: Tracking Evolving Beliefs in Long-Horizon Financial DialoguePreprint
Cheung, A. M. Y., Gupta, H. V., Lui, G. N., Chan, L. K., Wong, G. Y., & See, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02001
Chain on Demand: Deferred Evidence Organization for Long-Term Conversational MemoryPreprint
Lu, D., Li, Z., & Xue, H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02480
MemShift: Separating Detection from Repair in LLM-Derived Personal MemoryPreprint
Xu, Z., Zhang, H., Dong, Y., Onizuka, M., & Xiao, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02338
Guo, T., & Guo, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02361
MemHarmBench: Evaluating Cross-Session Prompt Injection in Memory-Persistent AI AgentsPreprint
Wang, Z., Feng, Y., Gao, Y., Pan, R., Zhao, B., Chen, Z., & Ma, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.01700
Wang, Y., Zhao, T., Zhang, J., Duan, Y., Wu, Z., Zheng, M., & Cai, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02912 · Cited by 1
Evolving Memory, Learning to Meta-Control: Test-Time Adaptation for Experience-augmented LLM AgentsPreprint
Zhao, Z., Shi, Y., Yu, P. F., Fu, L., Zhang, S., & Wen, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.01747
Who Schedules Agent Memory? A Sidecar Approach to Long-Horizon TasksPreprint
Zhuang, Q., Liu, R., & Ren, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.00779
CivicBench: A Benchmark and Memory Framework for Web-Based Civic Data AnalyticsPreprint
Wu, Y., Zhong, S.-R., Liang, H.-Y., & Liang, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.01145
DrawOffer: Evidence-Grounded Longitudinal User-State Modeling for Career SupportPreprint
Xu, L., Bian, Y., & Yuan, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02793
Pulse: Long-Horizon Tasks Need Streaming PersonalizationPreprint
Zhuang, Q., Liang, J., & Ren, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.00988
How Agent Skills Evolve: A Large-Scale Empirical Study of Skills on GitHubPreprint
Huang, J., Cao, J., Han, J., Jiang, Z., Cheung, S.-C., & Liu, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.04456
WASP-Mem: Let Agent Organize Procedural Memory. Human Spend Effort on DiagnosisPreprint
Niu, P., Shi, G., Gorde, V., Ghosh, S., Faloutsos, C., Cheng, M., & Chen, K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.04003
Wisdom From File Systems: Fast and Reliable Update for Graph-based Vector Search via Soft Insert
Pan, Y., Chen, J., Huang, H., Xia, W., Zou, X., Li, S., Wu, C., & Wang, J. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3845814.3850061
LiveCtx context selection at query time for long conversational histories
Liu, Y., & Wang, C. (2026) · Discover Computing · doi:10.1007/s10791-026-10807-5
An, Y., Feng, Y., & Yin, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.06876
Liu, H., Chen, Y., Qiu, Z., Zhang, Y., Zhong, J., Wang, W., Li, Y., & Wang, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.05953
Self-citationTwists and Turns: A Graph-Based Benchmark and Framework for Long-Term Memory in Exploration TasksPreprint
Dai, C., Shen, Y., Song, Z., Liao, J., Hu, J., & Chen, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.06414
Inference of Tacit Meeting Knowledge via LLMs: Toward Emotion-Enriched Organizational Memory
Raemy, M., & Hanne, T. (2026) · Information · doi:10.3390/info17111108
The Memory Trap: Language Agents Overgeneralize from Benign InteractionsPreprint
Liang, K., Fisac, J. F., Griffiths, T. L., & Lampinen, A. K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.07554 · Cited by 1
ReConMem: A Graph-Based Dual Memory System for Repository-Oriented ConversationsPreprint
Yang, Z., Zhang, L., Liu, Y., Yang, D., & Liu, F. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.07759
The Compaction Cliff in Long-Running AI Agent Memory
Zerhoudi, S., Mitrović, J., & Granitzer, M. (2026) · ACM · doi:10.1145/3799682.3840567 · Cited by 4
A Survey of Large Language Models
Zhao, W. X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z., et al. (2023) · arXiv · doi:10.48550/arxiv.2303.18223 · Cited by 2,090
MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents
Zhang, H., Yue, H., Long, Q., Bao, J., Liu, Q., Feng, T., Liu, B., Liang, W., & Wang, W. (2026) · arXiv
Metadata
- Authors
- Xu, W., Liang, Z., Mei, K., Gao, H., Tan, J., & Zhang, Y.
- Affiliations
- Rutgers, The State University of New Jersey (US)
- Ant Group (China) (CN)
- Salesforce (United States) (US)
- Venue
- Advances in Neural Information Processing Systems 38
- Published
- 2025
- Pages
- 20004-20031
- ISSN
- 1049-5258 (ISSN-L)
- OpenAlex
- W4407759090
- Cited by
- 51
- References
- 0
- Citations by year
- 2026: 48 · 2025: 3
- FWCI
- 48.02
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- neural information processing systems (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Keywords
- agentic memory, LLM agents, knowledge networks, memory organization, dynamic indexing, evolution of memory, knowledge representation, memory management
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-09-28, under version 3 of the claim definition (prompt extract-v3).
A second model labelled each claim on 2026-09-28 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.