academic-graphlookup

Crawls OpenAlex and Semantic Scholar citation graphs to expand and classify academic literature corpora.

Updated Sep 8, 2026
One-click install
npx skills add https://github.com/salomepoulain/makery-stations --skill academic-graphlookup-salomepoulain
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: academic-graphlookup
Source: https://github.com/salomepoulain/makery-stations/tree/main/stations/claude/workbench/pantry/skills/academic-graphlookup
Command: npx skills add https://github.com/salomepoulain/makery-stations --skill academic-graphlookup-salomepoulain

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires pyyaml, and includes scripts (resource) components.

What problem does it solve? Growing a literature review beyond its seed papers requires manually chasing citations and judging each new paper's relevance, which is slow and inconsistent. This Skill automates recursive citation-graph expansion and relevance screening so a corpus grows outward from real citation edges instead of guesswork. ## Core Features & Use Cases - Recursive citation crawling: Follows backward references and forward citations via OpenAlex, falling back to Semantic Scholar for unindexed works like new arXiv preprints, bounded by configurable hop, fanout, node-budget, and date-floor limits. - Batch relevance classification: Sends unclassified papers to free OpenRouter models in batches, producing a 5-point relevance verdict plus a strategy-family tag that is fuzzy-deduplicated against the existing vocabulary. - Graph export and review hand-off: Writes graph_data.json for citegraph.html, a ranked candidates_for_review.md for manual promotion into the bibliography, and a families.md tag vocabulary report. - Use Case: After an initial deep-research pass yields 7 seed papers, run the crawl to discover 300 related works, classify each for relevance to your research question, and review the top candidates for inclusion in your bibliography. ## Quick Start Ask the AI to expand the citation graph of the existing academic-research corpus and classify the newly discovered papers by relevance.

Frequently Asked Questions about academic-graphlookup

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I expand a literature review using citation graphs?

Run crawl.py to recursively follow backward references and forward citations from your seed papers via OpenAlex, then classify_relevance.py to score each discovery, and export_graph_data.py to generate the graph JSON and review candidates. Rerunning the crawl resumes from unexpanded papers, so widening the bounds picks up where the last run stopped.

What APIs does citation graph crawling use?

The crawl uses OpenAlex as the primary source because it offers generous rate limits and native bidirectional citation queries. Semantic Scholar serves as a fallback for works OpenAlex does not index, mainly brand-new arXiv preprints. Google Scholar has no API, so its counts are recorded manually via record_citation_count.py.

Does the citation crawler work without an OpenRouter API key?

The crawl and export scripts work without any API key since they only use OpenAlex and Semantic Scholar. However, classify_relevance.py requires OPENROUTER_API_KEY in the environment and fails loudly with an error if it is missing, rather than silently skipping classification.

Why are some papers missing citation counts after crawling?

A paper resolvable by neither OpenAlex nor Semantic Scholar, such as some SSRN working papers without a DOI or arXiv ID, gets no automatic citation count. It remains a node in the graph but stays a citation dead-end until you manually record a count from Google Scholar using record_citation_count.py.

How does relevance classification avoid duplicate category tags?

The classifier reuses the existing strategy-family vocabulary seeded from the project's research document. When the model proposes a new tag, a fuzzy-matching step compares it against all existing names and snaps near-duplicates onto the closest match, only creating a genuinely new family when nothing resembles it.