memory_recall
Trace multi-hop knowledge graph paths to answer relational questions that single-step search cannot resolve. Fall back to basic search when no seed matches.
Instructions
Multi-hop retrieval over the knowledge graph, for RELATIONAL
questions whose answer is reached by following links — "what does X
ultimately run on?", "how does A reach C?" — which single-shot
memory_search can't chain. Read-only. low_confidence: true
means no seed entity matched — fall back to memory_search.
Args:
hops: Max graph hops (default 3, max 5).
verbose: Full fact/edge provenance (origin, confidence, derivation).
Default facts are {attribute, value}, edges
{src, relation, dst}.
Returns: {seeds, entities, edges, paths, texts, iterations}.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| hops | No | ||
| query | Yes | ||
| top_k | No | ||
| verbose | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||