memory_recall
Answer relational questions by walking the knowledge graph across linked entities, chaining hops that single-shot searches cannot. Read-only, with confidence and truncation signals.
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.
Returns: {seeds, entities, edges, paths, texts, iterations}.
entities/edges/texts are capped (currently 10/15/6) with a
per-hop reservation, so a hub seed's own 1-hop ring can't crowd out
the deeper hops the walk exists to reach; edges prefers links
between surviving entities; each entity's facts is capped
(currently 5). A fact carrying re_verify stands on a memory that
has since been corrected — the value still stands, but check it before
acting. A seed entity's constraint facts come first, marked
pinned. truncated: true (with searches_issued) means a
search ceiling or time budget stopped the walk early: some re-queries,
and possibly deeper hops, were skipped, so supporting texts and deeper
entities may be missing — narrow the question or lower hops.
Details: docs/guide/retrieval.md.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| hops | No | Max graph hops. Clamped to 1..5. | |
| query | Yes | Natural-language relational question; its top hits seed the graph walk. | |
| top_k | No | Bounds only the SEED search (the initial hits that name the walk's start entities), not the result, which is capped separately; up to 3 ``texts`` slots go to seed hits. | |
| verbose | No | Full fact/edge provenance and untruncated texts. Default facts are ``{attribute, value}``, edges ``{src, relation, dst}``, texts truncated to a preview. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||