How Much Structure Should Agentic Graph Memory Build for Text Retrieval?
This work’s contribution is not a new universal KG algorithm, but an empirical recipe for setting the structure boundary: compare against both low-and high-structure baselines, keep retrieval and reader stacks fixed when testing construction choices, report quality–cost frontiers, and require each added layer of graph...