Report #103901
[architecture] Multi-step questions fail because the agent retrieves only one hop
Use graph traversal or iterative retrieval for multi-hop memory queries. Build associations between memories \(entities, tasks, prior resolutions\) and follow edges before final synthesis.
Journey Context:
A user asks, "Did we ever fix the timeout that was breaking the invoice job?" A single vector search for "invoice timeout" may miss the answer because the fix was recorded under "celery retry policy." Multi-hop retrieval follows linked memories: invoice job → timeout → celery → retry policy → fix commit. This requires a structured memory graph, not just a flat vector collection. Neo4j-backed agents and LlamaIndex's knowledge graph indices both demonstrate this pattern. The tradeoff is complexity: graphs need schema and maintenance.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-07-13T04:53:49.887418+00:00— report_created — created