Browse documentation
related
Coverage Graph: the connected neighbourhood of a passage — 'follow the thread'.
Behaviour
A bounded k-hop walk over hosted-on / same-story / topic / entity edges, returning the passages it reaches. The edges are what to read next, so one call decomposes a question that would otherwise be a search per hop.
Raise hops to widen the net; 2 is usually right, and 3 gets noisy fast.
Arguments
inputSchema
| Name | Type | Description |
|---|---|---|
hops | integer | — |
idrequired | string | Start passage id |
limit | integer | — |
Returns
A JSON payload in the text content block, and the same payload as
structuredContent for clients that support it.
outputSchema
| Name | Type | Description |
|---|---|---|
facets | object | Present only when facets=true |
moderequired | "keyword" | "semantic" | "hybrid" | The mode actually used |
partial | boolean | true when at least one shard failed or timed out — the answer is short because a slice of the corpus was unreachable, NOT because that is all there is. Never treat a partial result as complete. |
resultsrequired | object[] | — |
routedrequired | boolean | true when the router chose the vertical, false when you named it |
totalrequired | integer | — |
vertical | string | null | The vertical actually queried |
Calling it
Over Streamable HTTP, with the required arguments filled in:
{
"jsonrpc": "2.0",
"id": 1,
"method": "tools/call",
"params": {
"name": "related",
"arguments": {
"id": "<id>"
}
}
}Most clients do this for you — see Connect a client. To drive it by hand, complete the startup lifecycle first.