Graph retrieval
Adds the missing hop when the answer lives one relationship away, without replacing hybrid search.
Recall quality, consolidation safety, and read-surface security are research problems, not settled ones. Each track below started as a tracked issue, shipped behind a flag, and was measured against a benchmark before it changed a default. The claims carry receipts: an issue, a pull request, and an A/B result.
Adds the missing hop when the answer lives one relationship away, without replacing hybrid search.
Tracks whether recalled memories actually helped, then spends the recall budget on the ones that earn it.
Makes every split, merge, and update explain what changed and which source memories it came from.
A third path for ambiguous memories, so extraction can revisit them with more context instead of guessing.
Flushes the buffer on semantic novelty, so the moments worth remembering do not wait for the clock.
Preserves how the agent investigated and found the fix, not just the answer, so similar problems do not restart from zero.
Studies adaptive extraction attacks and the controls that keep recall useful without making bulk exfiltration trivial.
These tracks feed an in-repo paper that documents the methods and situates them against related work in agent memory. It is a working draft, not a published result, and this page will link the artifact as it firms up. For what is being built next, see the roadmap.