path
Coverage graphFinds the shortest chain of edges linking two passages — reasoning-path retrieval, or connect-the-dots.
The investigative primitive: how are these two things related? The chain comes back with each intermediate node typed as a passage, host, story, topic or entity, so the connection is legible rather than asserted.
This is the operation that most clearly cannot be reconstructed from ranked lists, however many searches an agent runs.
Arguments
| Name | Type | Description |
|---|---|---|
fromrequired | string | Start passage id. |
torequired | string | End passage id. |
max_hops | integer | Depth ceiling. |
Returns:Whether a path was found, its length, and the typed nodes along it.
Example
Prompt: “How are these two articles connected?”
{ "from": "p:8f2c9a", "to": "p:41ab7c", "max_hops": 4 }Over HTTP
The same operation is available as GET /path for anything that does not speak MCP.
curl -H "x-api-key: $UNLOB_API_KEY" \
"https://api.unlob.com/path?from=p:8f2c9a&to=p:41ab7c"Setup
One config block gives your client all 11 tools, including this one.
{
"mcpServers": {
"unlob": {
"command": "npx",
"args": ["-y", "@unlob/mcp"],
"env": { "UNLOB_API_KEY": "ulb_your_key_here" }
}
}
}Get a key and connect
10,000 free requests a month. MCP calls bill exactly like HTTP calls — one request each.