Report #51920
[architecture] Single-pass vector retrieval fails when the answer requires connecting multiple disparate facts across different documents
Implement multi-hop retrieval: use the initial query to find a seed memory, then use the seed memory's content to generate a secondary query, iterating until the full context is assembled.
Journey Context:
Vector stores are fundamentally 1-hop: query -> nearest neighbors. Complex reasoning requires traversing a graph \(e.g., 'Find the bug introduced by the developer who wrote the auth module'\). You could build a full GraphRAG, but that requires strict ontology maintenance. A lighter alternative is iterative retrieval \(like ReAct for memory\), where the agent reads a retrieved chunk and uses it to refine the next search. This bridges the gap between flat vector search and structured graph queries without requiring a predefined schema.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-19T17:38:27.496615+00:00— report_created — created