来源信息
- 仓库
- 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 patent-analysis-guide命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地?可下载 SkillsMP 当前能够提供的文件。
Route empirical-research requests through the Auto-Empirical Research Skills catalog when this whole repository is installed as one skill in Codex, CodeBuddy, Claude Code, or another IDE. Use to choose and load the right vendored AERS skill for causal inference, econometrics, replication, data acquisition, manuscript writing, peer review and referee responses, citation checking, de-AIGC editing, or full empirical-paper workflows without reading the entire repository at once.
中英双语学术降 AIGC / bilingual academic de-AIGC skill. Removes AI-generated writing signatures from empirical papers in economics, management, and the social sciences — in both English and Chinese. Covers Turnitin AI, GPTZero, Originality.ai on the English side and 知网 AMLC, 万方, 维普 on the Chinese side. Uses a six-step loop (intake → audit → claim-evidence check → differentiated rewrite → five-dimension self-score → cold-reader recheck) with two pattern libraries (22 English + 17 Chinese patterns), section-by-section strategies for empirical papers, and hard protections that keep every number, coefficient, and citation intact.
Use when a research task needs reproducible Kaggle discovery, metadata inspection, bounded public-data downloads, competition or kernel discovery, model discovery, or an explicitly approved Kaggle write/delete operation through the official CLI.
基于 SOC 职业分类
正在显示 SKILL.md
| name | patent-analysis-guide |
| description | Patent search, classification, landscape analysis, and prior art mining |
| metadata | {"openclaw":{"emoji":"📃","category":"domains","subcategory":"law","keywords":["patent","intellectual-property","prior-art","cpc","patent-landscape","citation-analysis"],"source":"wentor"}} |
A skill for conducting patent research, landscape analysis, and prior art searches. Covers patent database APIs, classification systems, citation network analysis, claim parsing, and technology trend mapping for intellectual property research.
| Database | Coverage | API | Cost |
|---|---|---|---|
| USPTO PatentsView | US patents and applications | REST API, bulk download | Free |
| EPO Open Patent Services | EP, WO, and 100+ offices | REST API (OPS) | Free (throttled) |
| Google Patents | 120M+ documents worldwide | BigQuery (Google Patents Public) | Free (BigQuery costs) |
| Lens.org | 130M+ patent records | REST API | Free for researchers |
| WIPO PATENTSCOPE | PCT applications + national | REST API | Free |
import requests
import xml.etree.ElementTree as ET
class EPOClient:
"""Client for the EPO Open Patent Services (OPS) API."""
BASE_URL = "https://ops.epo.org/3.2/rest-services"
def __init__(self, consumer_key: str, consumer_secret: str):
self.token = self._authenticate(consumer_key, consumer_secret)
def _authenticate(self, key: str, secret: str) -> str:
import base64
credentials = base64.b64encode(f"{key}:{secret}".encode()).decode()
resp = requests.post(
"https://ops.epo.org/3.2/auth/accesstoken",
headers={"Authorization": f"Basic {credentials}"},
data={"grant_type": "client_credentials"},
)
return resp.json()["access_token"]
def search(self, cql_query: str, max_results: int = 25) -> list[dict]:
"""
Search patents using CQL (Common Query Language).
Example queries:
ta="machine learning" AND cl="neural network"
pa="university" AND pd>=2020
"""
resp = requests.get(
f"{self.BASE_URL}/published-data/search",
headers={"Authorization": f"Bearer {self.token}",
"Accept": "application/json"},
params={"q": cql_query, "Range": f"1-{max_results}"},
)
return resp.json()
The CPC hierarchy has five levels: Section > Class > Subclass > Group > Subgroup.
Example: H04L 9/3247
H = Electricity (Section)
H04 = Electric communication technique (Class)
H04L = Transmission of digital information (Subclass)
H04L 9/ = Cryptographic mechanisms (Group)
H04L 9/3247 = Digital signatures (Subgroup)
def parse_cpc_code(code: str) -> dict:
"""Parse a CPC classification code into its hierarchical components."""
code = code.strip().replace(" ", "")
return {
"section": code[0],
"class": code[:3],
"subclass": code[:4],
"group": code.split("/")[0] if "/" in code else code[:4],
"subgroup": code if "/" in code else None,
"full": code,
}
# Technology domain mapping (top-level CPC sections)
CPC_SECTIONS = {
"A": "Human Necessities",
"B": "Performing Operations; Transporting",
"C": "Chemistry; Metallurgy",
"D": "Textiles; Paper",
"E": "Fixed Constructions",
"F": "Mechanical Engineering; Lighting; Heating",
"G": "Physics",
"H": "Electricity",
"Y": "General Tagging of New Technological Developments",
}
A patent landscape maps the technology and competitive environment in a domain:
import pandas as pd
import numpy as np
from collections import Counter
def patent_landscape_metrics(patents: pd.DataFrame) -> dict:
"""
Compute patent landscape metrics from a patent dataset.
Expected columns: patent_id, filing_date, grant_date,
assignee, cpc_codes (list), claims_count, citations_received
"""
# Filing trend (annual)
patents["filing_year"] = pd.to_datetime(patents.filing_date).dt.year
annual_filings = patents.groupby("filing_year").size()
# Top assignees
top_assignees = patents.assignee.value_counts().head(20)
# Technology distribution (CPC subclass level)
all_cpc = []
for codes in patents.cpc_codes:
all_cpc.extend([c[:4] for c in codes])
cpc_distribution = Counter(all_cpc).most_common(20)
# Citation impact
citation_stats = patents.citations_received.describe()
# Geographic distribution (from assignee country)
geo_dist = patents.assignee_country.value_counts()
return {
"total_patents": len(patents),
"annual_filings": annual_filings.to_dict(),
"top_assignees": top_assignees.to_dict(),
"technology_areas": cpc_distribution,
"citation_stats": citation_stats.to_dict(),
"geographic_distribution": geo_dist.head(10).to_dict(),
}
import networkx as nx
def build_citation_network(patents: pd.DataFrame,
citations: pd.DataFrame) -> nx.DiGraph:
"""
Build a patent citation network.
citations: DataFrame with columns [citing_patent, cited_patent]
"""
G = nx.DiGraph()
# Add patent nodes with attributes
for _, row in patents.iterrows():
G.add_node(row.patent_id, assignee=row.assignee,
year=row.filing_year, cpc=row.cpc_codes[0][:4])
# Add citation edges
for _, row in citations.iterrows():
if row.citing_patent in G and row.cited_patent in G:
G.add_edge(row.citing_patent, row.cited_patent)
return G
def identify_seminal_patents(G: nx.DiGraph, top_n: int = 20) -> list:
"""Find the most influential patents by various centrality measures."""
in_degree = dict(G.in_degree())
pagerank = nx.pagerank(G)
# Combine metrics
scores = {}
for node in G.nodes():
scores[node] = {
"citations_received": in_degree[node],
"pagerank": pagerank[node],
}
ranked = sorted(scores.items(), key=lambda x: x[1]["pagerank"], reverse=True)
return ranked[:top_n]
Patent claims define the legal scope of protection. Independent claims are the broadest; dependent claims narrow them:
def parse_claims(claims_text: str) -> list[dict]:
"""
Parse patent claims text into structured claim objects.
Identifies independent vs dependent claims and extracts dependencies.
"""
# Split on claim numbers
claim_pattern = re.compile(r"\n\s*(\d+)\.\s+", re.MULTILINE)
parts = claim_pattern.split(claims_text)
claims = []
for i in range(1, len(parts), 2):
claim_num = int(parts[i])
claim_text = parts[i + 1].strip()
# Detect dependency
dep_match = re.match(
r"(?:The|A)\s+\w+\s+(?:of|according to)\s+claim\s+(\d+)",
claim_text, re.IGNORECASE
)
is_independent = dep_match is None
depends_on = int(dep_match.group(1)) if dep_match else None
claims.append({
"number": claim_num,
"text": claim_text,
"independent": is_independent,
"depends_on": depends_on,
"word_count": len(claim_text.split()),
})
return claims
Systematic prior art search methodology: