---
name: "citation-neighborhood-walker"
description: "Build a bounded citation neighborhood from identified papers and traceable links. Use when the user needs: Get a two-hop graph with edge evidence and relevance notes."
metadata: {"version": "2026-10-17.1", "category": "search-retrieval", "publisher": "AIDiveForge"}
---

# Citation Neighborhood Walker

Get a two-hop graph with edge evidence and relevance notes.

## Requirements

Requires stable paper identifiers and access to reference/citation records.

## Workflow

1. Resolve the seed paper to a stable identifier and state whether edges mean cites or is cited by.
2. Collect first-hop records from a named source and retain identifiers, direction and retrieval date.
3. Expand only the declared second hop, deduplicate identifiers and cap traversal to the requested budget.
4. Rank relevance using title/abstract evidence and the user’s thesis; citation count alone is not relevance.
5. Mark incomplete metadata and missing abstracts rather than inventing graph edges or summaries.

## Worked example

Read `examples/input.txt` and `examples/expected.txt` before adapting the workflow.

## Acceptance checks

Deduplicate D while retaining both incoming edges. Do not expand D or E into a third hop.

## Limits

Citation databases have incomplete and delayed coverage. The graph is not evidence that every cited work is relevant or correct.

Worked example included. Model-specific performance and vendor compatibility have not been benchmarked.