graph_neighbors
Evaluate a memory graph node by viewing its edges, type, and viability score derived from connection freshness.
Instructions
Inspect a node in the memory knowledge graph: its kind, typed edges, and viability.
Edges are grounds / relies_on / applies_to / contradicts / corroborates. Viability is derived from connectivity — the more (fresh) connections, the more a node is worth trusting; a bare node fades. node_id is a memory id or a code-anchor id (4-char prefixes are NOT resolved here — pass a full id).
Args: node_id: The graph node id (memory or code anchor).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| node_id | Yes | The graph node id (memory or code anchor). |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |