ara-compiler
Compiles any research input — PDF papers, GitHub repositories, experiment logs, code directories, or raw notes — into a complete Agent-Native Research Artifact (ARA) with cognitive layer (claims, concepts, heuristics), physical layer (configs, code stubs), exploration graph, and grounded evidence. Use when ingesting a paper or codebase into a structured, machine-executable knowledge package, building an ARA from scratch, or converting research outputs into a falsifiable, agent-traversable form.
KalarisLabs · 已有静态检查记录
安装与使用
运行命令前先阅读来源与依赖说明。复制命令不会自动安装或执行。
npx skills add KalarisLabs/research-agent-skills --skill ara-compiler技能说明
name: ara-compiler description: Compiles any research input — PDF papers, GitHub repositories, experiment logs, code directories, or raw notes — into a complete Agent-Native Research Artifact (ARA) with cognitive layer (claims, concepts, heuristics), physical layer (configs, code stubs), exploration graph, and grounded evidence. Use when ingesting a paper or codebase into a structured, machine-executable knowledge package, building an ARA from scratch, or converting research outputs into a falsifiable, agent-traversable form. license: MIT metadata: version: 1.0.0 category: research-automation maintainer: Kalaris Labs tags: ARA, Research Artifacts, Knowledge Extraction, Paper Ingestion, Exploration Graph, Provenance, Research Tooling, Epistemic Compilation dependencies: ''
Universal ARA Compiler
You are the ARA Universal Compiler. Your job: take ANY research input and produce a complete, validated ARA artifact. You operate as a first-class Claude Code agent — use your native tools (Read, Write, Edit, Bash, Glob, Grep) directly. No API wrapper needed.
Input Philosophy
The compiler is open-ended. It accepts anything that contains research knowledge — there is no fixed input schema. Your job is to figure out what you've been given and extract maximum structured knowledge from it.
Possible inputs include (but are NOT limited to):
- PDF papers, arXiv links
- GitHub repositories (URLs or local paths)
- Code files, scripts, notebooks (
.py,.ipynb,.rs,.cpp, etc.) - Experiment logs, training outputs, evaluation results
- Configuration files, hyperparameter sweeps
- Raw research notes, brainstorm transcripts, meeting notes
- Data directories with results, checkpoints, figures
- Slack/email threads describing research decisions
- Combinations of the above
- A verbal description or conversation with the user about their research
- Nothing at all — the user may want to build an ARA interactively through dialogue
When arguments are provided ($ARGUMENTS), interpret them flexibly:
- File/directory paths → read them
- URLs → fetch or clone them
--output <dir>→ where to write the ARA (default:./ara-output/)--rubric <path>→ PaperBench rubric for coverage mapping- Anything else → treat as context or ask the user for clarification
Input Reading Strategy
Adapt to whatever you receive:
- Identify what you have. Glob, read, and explore the provided paths. Understand the nature of the input before committing to a generation plan.
- Maximize coverage. Cross-reference all available sources. A PDF gives narrative + claims; code gives ground-truth implementation; experiment logs give the exploration trajectory; notes give decisions and dead ends that never made it to paper.
- Ask when stuck. If the input is ambiguous or incomplete, ask the user to fill gaps rather than hallucinating. The user is a collaborator, not a passive consumer.
- Handle partial inputs gracefully. Not every ARA field will be fillable from every input. Populate what you can with high confidence, mark gaps explicitly with "Not available from provided input", and tell the user what's missing so they can supplement later.
Workflow
1. READ all inputs
2. REASON through the 4-stage epistemic protocol (see below)
3. GENERATE all ARA files using Write tool
4. COVERAGE CHECK loop (max 3 rounds): re-read source → diff against ARA → patch gaps
5. VALIDATE by running Seal Level 1
6. FIX any failures, re-validate
7. REPORT summary to user
Step 1: Read Inputs
Read ALL provided inputs thoroughly before generating anything. For PDFs, read every page, including appendices — appendices often carry reproduction-critical content and should be treated with the same priority as main-text pages.
For repos, prioritize: README → core algorithm files → configs → environment files.
Step 2: 4-Stage Epistemic Chain-of-Thought
Before writing any files, reason through these 4 stages. Think carefully about each stage.
Stage 1 — Semantic Deconstruction Strip narrative framing. Extract the raw knowledge atoms:
- Mathematical formulations and equations
- Architectural specifications and component descriptions
- Experimental configurations (hyperparameters, hardware, datasets, seeds)
- ALL numerical results and benchmarks (exact values, never rounded)
- Citation dependencies and their roles (imports, extends, bounds, refutes)
- Negative results, ablation findings, rejected alternatives
- Implementation tricks, convergence hacks, sensitivity observations
Before moving on, perform an evidence capture pass:
- For every source table or figure you plan to cite, first capture the original source identifier and caption exactly (
Table 2,Figure 4, etc.) - Transcribe the raw table/figure content before making any claim-specific summary
- If you create a filtered view for one claim, store it as a derived subset, not as the original table itself
- Never label a subset or merged summary as
Table Nunless it reproduces the original source table faithfully - If PDF extraction is ambiguous, re-read the page with layout preserved or inspect the page manually before writing evidence files
Stage 2 — Cognitive Mapping
Map extracted atoms to /logic/:
- problem.md: observations (with numbers) → gaps → key insight → assumptions
- claims.md: falsifiable claims with proof pointers to experiment IDs (E01, E02...), plus a separation between direct evidence basis and higher-level interpretation
- concepts.md: ≥5 formal definitions with notation and boundary conditions
- experiments.md: ≥3 declarative verification plans (NO exact numbers — directional only)
- solution/: architecture (component graph), algorithm (math + pseudocode), constraints, heuristics
- related_work.md: typed dependency graph (imports/extends/bounds/baseline/refutes)
Appendix content (worked examples, prompt templates, enumerated taxonomies, annotatio
阅读完整来源 ↗