Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles
A new paper introduces MemHop, a multi-hop memory benchmark, and ProGraph, a two-layer memory architecture that combines profile expansion and compression residuals to improve long-term memory for LLM agents. ProGraph achieves strong results on both MemHop and LoCoMo benchmarks, outperforming existing methods.
-->
[Submitted on 1 Jun 2026]
Title:Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles
View a PDF of the paper titled Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles, by Shengtong Zhu
View PDF HTML (experimental)
Abstract:Long-term memory is essential for LLM agents that interact across sessions, yet current memory benchmarks primarily evaluate single-hop recall, leaving multi-hop association largely unmeasured. We make three contributions. First, we introduce MemHop, a multi-hop memory benchmark of 1,000 questions at hop depths 1-5 across 10 social-network scenarios, with per-hop evidence annotations. Second, we present Profile-Graph Memory (ProGraph), a two-layer memory architecture combining (i) profile expansion -- substring-matched traversal of entity names that naturally appear in LLM-written profile narratives, a minimal alternative to explicit knowledge-graph construction -- and (ii) compression residuals -- exact dates, quantities, and named items co-extracted with each profile update at zero extra API cost. Third, a full-grid ablation shows cross-benchmark mechanism specialization: profile expansion drives multi-hop reasoning (-22.6pp on MemHop when removed) while compression residuals drive precision recall (-8.6pp on LoCoMo when not co-extracted), with cross-effects under 3pp within a single architecture. ProGraph averages 80.1% on MemHop (matching the FullContext reference) and 78.4% on LoCoMo (exceeding FullContext by 11.3pp), outperforming Mem0, A-Mem, HippoRAG, and RAG on both. We release MemHop, ProGraph, and baseline implementations.
Comments: 11 pages, 2 figures, 7 tables. Code and MemHop benchmark: this https URL
Subjects:
Artificial Intelligence (cs.AI)
ACM classes: I.2.7
Cite as: arXiv:2607.19359 [cs.AI]
(or arXiv:2607.19359v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2607.19359
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Shengtong Zhu [view email] [v1] Mon, 1 Jun 2026 09:48:16 UTC (56 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles, by Shengtong Zhu
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.AI
new | recent | 2026-07
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)