Skip to main content
POST
Get the knowledge graph

Authorizations

Authorization
string
header
required

Use a JWT bearer token or a Veryfront API key in the Authorization header.

Path Parameters

project_reference
string
required

Project whose knowledge is selected. Ordinary callers require project.knowledge.read. A run-bound MCP service credential instead must match the persisted run's project and agent plus its actor or runtime transport binding; its effective sealed authority must grant the invoked tool and a knowledge selector. On project-scoped MCP endpoints, the scoped project supplies this value when omitted.

Body

application/json
lookup_target
object

Optional. Omit to search the main preview branch (the default). Set this to target another preview branch, a deployed environment, or a published release; unresolved targets are returned as not found.

caller_selector

Caller-selected document scope. Source membership and server-trusted knowledge policy are intersected with this selector before pagination; denied nodes, edges, broken-link labels and counts are filtered.

root_file_version_id
string<uuid>
root_path
string
Required string length: 1 - 1024
max_depth
integer

Link hops from the root, 0 to 3; omit the root to read the whole visible set. Responses over 512 KiB fail with a size limit (REST 413, MCP PAYLOAD_TOO_LARGE). Narrow the graph with root_path, max_depth, filters or pagination.limit (GraphQL rootPath, maxDepth, filters or pagination.limit).

Required range: 0 <= x <= 3
filters
object
pagination
object

Response

Authorized knowledge graph neighborhood.

nodes
object[]
required

Visible knowledge files as nodes. Markdown document links are edges; external and broken links are returned separately. Use the graph to find related files.

Maximum array length: 200
edges
object[]
required
Maximum array length: 2000
Maximum array length: 2000
Maximum array length: 2000
returned_nodes
integer
required
Required range: x >= 0
total_nodes
integer
required
Required range: x >= 0
partial
boolean
required

True when the combined link count or byte budget omits links. The graph is partial.

limit
integer
required
Required range: 1 <= x <= 200
page_info
object
required