why
Explain a decision by retrieving the best-matching memory and its connected subgraph of linked memories, revealing context that plain similarity search misses.
Instructions
Explain a decision: find the best-matching memory (optionally scoped by a metadata filter, e.g. the current project) and return the connected subgraph of related memories reachable through typed links — fusing vector, ColumnStore, and graph to surface context a plain similarity search misses.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| filter | No | Optional exact-match metadata filter to scope the seed (e.g. `{"project": "veles"}`). | |
| decision | Yes | The decision (or fact) to explain. | |
| max_hops | No | How many hops of typed links to follow (default 2). |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Typed edges connecting the nodes. | |
| nodes | Yes | Memories in the subgraph, seed first. |