来源信息
- 仓库
- brycewang-stanford/Auto-Empirical-Research-Skills
- 最近来源活动
- 2026年4月3日 02:07
- 检测到的 SKILL.md 语言
- 英语
- 星标
- 3,291
- 分支
- 432
安装方式
默认使用会先检查来源的 Prompt;你也可以切换为直接命令,或下载本地副本。
检查来源文件
决定是否安装前,请先阅读 SKILL.md,以及 SkillsMP 当前展示的配套文件。
菜单
默认使用会先检查来源的 Prompt;你也可以切换为直接命令,或下载本地副本。
决定是否安装前,请先阅读 SKILL.md,以及 SkillsMP 当前展示的配套文件。
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
直接命令不会经过审查 Prompt;运行前请先检查来源。
npx skills add https://github.com/brycewang-stanford/Auto-Empirical-Research-Skills --skill citation-chaining-guide命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地?可下载 SkillsMP 当前能够提供的文件。
基于 SOC 职业分类
正在显示 SKILL.md
| name | citation-chaining-guide |
| description | Forward and backward citation chaining techniques for literature search |
| metadata | {"openclaw":{"emoji":"🔗","category":"literature","subcategory":"search","keywords":["citation tracking","advanced search","search strategy","literature search"],"source":"wentor-research-plugins"}} |
Master forward and backward citation chaining to systematically discover relevant literature by following the threads of scholarly communication.
Citation chaining (also called citation tracking, pearl growing, or snowball searching) exploits the connections between papers through their references and citations. Starting from one or more "seed" papers, you trace connections in two directions:
This approach is especially powerful when keyword searches fail (e.g., when terminology varies across subfields or when concepts predate standardized vocabulary).
Select 3-5 highly relevant papers that are central to your research question. Good seed papers are:
Examine the reference list of each seed paper and identify which cited works are relevant.
import requests
HEADERS = {"User-Agent": "ResearchPlugins/1.0 (https://wentor.ai)"}
def get_references(work_id):
"""Get all references of a paper via OpenAlex."""
url = f"https://api.openalex.org/works/{work_id}"
response = requests.get(url, headers=HEADERS)
paper = response.json()
ref_ids = paper.get("referenced_works", [])
references = []
for ref_id in ref_ids:
ref = requests.get(f"https://api.openalex.org/works/{ref_id.split('/')[-1]}", headers=HEADERS).json()
if ref.get("title"):
references.append(ref)
return references
# Get references of a seed paper
seed_id = "W2741809807"
references = get_references(seed_id)
# Sort by citation count to find the most influential foundations
references.sort(key=lambda p: p.get("cited_by_count", 0), reverse=True)
for ref in references[:15]:
print(f"[{ref.get('publication_year', '?')}] {ref['title']} ({ref.get('cited_by_count', 0)} citations)")
Find all papers that have cited your seed paper.
def get_citations(work_id, limit=200):
"""Get papers citing a given paper via OpenAlex."""
all_citations = []
page = 1
while len(all_citations) < limit:
response = requests.get(
"https://api.openalex.org/works",
params={
"filter": f"cites:{work_id}",
"sort": "cited_by_count:desc",
"per_page": min(200, limit - len(all_citations)),
"page": page
},
headers=HEADERS
)
results = response.json().get("results", [])
if not results:
break
all_citations.extend(results)
page += 1
return all_citations
citations = get_citations(seed_id)
# Filter for recent, well-cited papers
recent_impactful = [c for c in citations if c.get("publication_year", 0) >= 2022 and c.get("cited_by_count", 0) >= 5]
recent_impactful.sort(key=lambda p: p.get("cited_by_count", 0), reverse=True)
Two advanced techniques extend basic citation chaining:
| Technique | Definition | What It Reveals |
|---|---|---|
| Co-citation | Two papers are frequently cited together by the same set of subsequent papers | Conceptual proximity: these works form a shared intellectual foundation |
| Bibliographic coupling | Two papers share many of the same references | Methodological or topical similarity at the time of writing |
def find_co_cited_papers(paper_ids, min_co_citation_count=3):
"""Find papers frequently co-cited with the given papers."""
from collections import Counter
reference_counts = Counter()
for pid in paper_ids:
refs = get_references(pid)
for ref in refs:
ref_id = ref.get("paperId")
if ref_id and ref_id not in paper_ids:
reference_counts[ref_id] += 1
# Papers cited by multiple seeds are co-cited candidates
co_cited = [(pid, count) for pid, count in reference_counts.items()
if count >= min_co_citation_count]
co_cited.sort(key=lambda x: x[1], reverse=True)
return co_cited
Repeat the process with the most relevant papers discovered in each round:
| Tool | Method | Cost |
|---|---|---|
| Google Scholar "Cited by" | Forward chaining | Free |
| Web of Science "Cited References" / "Times Cited" | Both directions | Subscription |
| Scopus "References" / "Cited by" | Both directions | Subscription |
| OpenAlex API | Programmatic, both directions | Free |
| Connected Papers (connectedpapers.com) | Visual co-citation graph | Free (limited) |
| Litmaps (litmaps.com) | Visual citation network | Free tier |
| CoCites (cocites.com) | Co-citation analysis | Free |
| Citation Gecko | Seed-based discovery | Free |