search_relationships
Find how named entities like people, systems, or concepts connect in a channel's knowledge graph. Explore relationships between entities to understand their connections.
Instructions
Find how named ENTITIES connect in a channel's knowledge graph.
Call this to answer "how is X related to Y?" or "what touches the
billing service?" by returning the subgraph of nodes and edges
around the given entities. This explores the KNOWLEDGE graph of
entities/relationships — distinct from get_wiki_graph, which
returns the wiki PAGE-LINK graph (which wiki pages reference which).
Use find_experts to rank people and trace_decision_history
to follow decision supersession.
Prerequisite: a channel_id from list_channels and at least
one entity name. Names should match how the channel refers to the
entity; unknown names simply yield an empty subgraph.
Returns (instant for small hop counts, read-only, no side effects):
{"nodes": [...], "edges": [...], "text": str, "entities_searched": [...]}. Each node has name and type
(e.g. 'person', 'system', 'concept'); each edge has source,
target, type (relationship label), confidence (0–1,
extraction confidence), and context (snippet explaining the
edge). text is a human-readable summary. Empty nodes/
edges means no connections were found — not an error.
Error modes: {"error": "authentication_missing"} if
unauthenticated; {"error": "channel_access_denied", "channel_id": ...} if the channel is not readable; {"error": "invalid_parameter", ...} for a malformed channel_id. Other
backend failures degrade to {"nodes": [], "edges": [], "channel_id": ...}.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| channel_id | Yes | Required. The channel id to search within, obtained from list_channels (e.g. 'ch-eng'). Not a human channel name. | |
| entities | Yes | Required. One or more entity NAMES to connect, e.g. ['Postgres', 'billing-service'] or ['Dana']. These are knowledge-graph node names (people, systems, concepts), not channel ids. Provide at least one; provide two+ to find paths between them. | |
| hops | No | How many graph edges to traverse out from the entities. Range 1–4, default 2. Larger values return wider but noisier subgraphs and are slower. Out-of-range values are silently clamped (e.g. 9 -> 4). |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||