Get Citation Graph
get_citation_graphTraverse citation networks from one or more seed papers via breadth-first expansion to map connected works and citation or reference links within depth and node limits.
Instructions
Traverse the citation graph from one or more seed papers.
Performs BFS up to depth hops. Returns nodes (paper records) and directed edges. Hard-caps at max_nodes to prevent runaway expansion.
Traversal makes one rate-limited request per node, so anything past a
shallow, narrow graph runs long: expect a job handle to poll with
get_job_result rather than the graph itself.
A Semantic Scholar throttle defers the same walk. Poll the job handle; the resumed graph does not mark the throttled request as partial.
A failed upstream request does not abort the walk. When one happens,
stats.partial is true, stats.failed_requests counts them, and a
warning key explains what was not fetched. Treat such a graph as
incomplete: a missing node or edge is unknown, not absent. This is
distinct from stats.truncated, which means max_nodes stopped an
otherwise successful walk.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| depth | No | Number of hops (1-3). | |
| seed_ids | Yes | 1-10 paper identifiers to start from. | |
| year_end | No | Filter expanded papers to this year and earlier. | |
| direction | No | Expand via citations, references, or both. | citations |
| max_nodes | No | Hard cap on total nodes returned. | |
| year_start | No | Filter expanded papers to this year and later. | |
| min_citations | No | Minimum citation count of expanded papers. | |
| fields_of_study | No | Filter by field. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||