@research-copilot/plugin 1.1.17 → 1.1.19

package/dist/skills/dse-loop/SKILL.md

@@ -0,0 +1,277 @@
+---
+name: "dse-loop"
+description: "Autonomous design space exploration loop for computer architecture and EDA. Runs a program, analyzes results, tunes parameters, and iterates until objective is met or timeout. Use when user says \\\"DSE\\\", \\\"design space exploration\\\", \\\"sweep parameters\\\", \\\"optimize\\\", \\\"find best config\\\", or wants iterative parameter tuning."
+---
+
+# DSE Loop: Autonomous Design Space Exploration
+
+Autonomously explore a design space: run → analyze → pick next parameters → repeat, until the objective is met or timeout is reached. Designed for computer architecture and EDA problems.
+
+## Context: $ARGUMENTS
+
+## Safety Rules — READ FIRST
+
+**NEVER do any of the following:**
+- `sudo` anything
+- `rm -rf`, `rm -r`, or any recursive deletion
+- `rm` any file you did not create in this session
+- Overwrite existing source files without reading them first
+- `git push`, `git reset --hard`, or any destructive git operation
+- Kill processes you did not start
+
+**If a step requires any of the above, STOP and report to the user.**
+
+## Constants (override via $ARGUMENTS)
+
+| Constant | Default | Description |
+|----------|---------|-------------|
+| `TIMEOUT` | 2h | Total wall-clock budget. Stop exploring after this. |
+| `MAX_ITERATIONS` | 50 | Hard cap on number of design points evaluated. |
+| `PATIENCE` | 10 | Stop early if no improvement for this many consecutive iterations. |
+| `OBJECTIVE` | minimize | `minimize` or `maximize` the target metric. |
+
+Override inline: `/dse-loop "task desc — timeout: 4h, max_iterations: 100, patience: 15"`
+
+## Typical Use Cases
+
+| Problem | Program | Parameters | Objective |
+|---------|---------|-----------|-----------|
+| Microarch DSE | gem5 simulation | cache size, assoc, pipeline width, ROB size, branch predictor | maximize IPC or minimize area×delay |
+| Synthesis tuning | yosys/DC script | optimization passes, target freq, effort level | minimize area at timing closure |
+| RTL parameterization | verilator sim | data width, FIFO depth, pipeline stages, buffer sizes | meet throughput target at min area |
+| Compiler flags | gcc/llvm build + benchmark | -O levels, unroll factor, vectorization, scheduling | minimize runtime or code size |
+| Placement/routing | openroad/innovus | utilization, aspect ratio, layer config | minimize wirelength / timing |
+| Formal verification | abc/sby | bound depth, engine, timeout per property | maximize coverage in time budget |
+| Memory subsystem | cacti / ramulator | bank count, row buffer policy, scheduling | optimize bandwidth/energy |
+
+## Workflow
+
+### Phase 0: Parse Task & Setup
+
+1. **Parse $ARGUMENTS** to extract:
+   - **Program**: what to run (command, script, or Makefile target)
+   - **Parameter space**: which knobs to tune and their ranges/options (may be incomplete — see step 2)
+   - **Objective metric**: what to optimize (and how to extract it from output)
+   - **Constraints**: hard limits that must not be violated (e.g., timing must close)
+   - **Timeout**: wall-clock budget
+   - **Success criteria**: when is the result "good enough" to stop early?
+
+2. **Infer missing parameter ranges** — If the user provides parameter names but NOT ranges/options, you MUST infer them before exploring:
+
+   a. **Read the source code** — search for the parameter names in the codebase:
+      - Look for argparse/click definitions, config files, Makefile variables, module parameters, `#define`, `parameter` (SystemVerilog), `localparam`, etc.
+      - Extract defaults, types, and any comments hinting at valid values
+
+   b. **Apply domain knowledge** to set reasonable ranges:
+      | Parameter type | Inference strategy |
+      |---------------|-------------------|
+      | Cache/memory sizes | Powers of 2, typically 1KB–16MB |
+      | Associativity | Powers of 2: 1, 2, 4, 8, 16 |
+      | Pipeline width / issue width | Small integers: 1, 2, 4, 8 |
+      | Buffer/queue/FIFO depth | Powers of 2: 4, 8, 16, 32, 64 |
+      | Clock period / frequency | Based on technology node; try ±50% from default |
+      | Bound depth (BMC/formal) | Geometric: 5, 10, 20, 50, 100 |
+      | Timeout values | Geometric: 10s, 30s, 60s, 120s, 300s |
+      | Boolean/enum flags | Enumerate all options found in source |
+      | Continuous (learning rate, threshold) | Log-scale sweep: 5 points spanning 2 orders of magnitude around default |
+      | Integer counts (threads, cores) | Linear: from 1 to hardware max |
+
+   c. **Start conservative** — begin with 3-5 values per parameter. Expand range later if the best result is at a boundary.
+
+   d. **Log inferred ranges** — write the inferred parameter space to `dse_results/inferred_params.md` so the user can review:
+      ```markdown
+      # Inferred Parameter Space
+
+      | Parameter | Source | Default | Inferred Range | Reasoning |
+      |-----------|--------|---------|---------------|-----------|
+      | CACHE_SIZE | config.py:42 | 32768 | [8192, 16384, 32768, 65536, 131072] | powers of 2, ±2x from default |
+      | ASSOC | config.py:43 | 4 | [1, 2, 4, 8] | standard associativities |
+      | BMC_DEPTH | run_bmc.py:15 | 10 | [5, 10, 20, 50] | geometric, common BMC depths |
+      ```
+
+   e. **Boundary expansion** — during the search, if the best result is at the min or max of a range, automatically extend that range by one step in that direction (but log the extension).
+
+3. **Read the project** to understand:
+   - How to run the program
+   - Where results are produced (stdout, log files, reports)
+   - How to parse the objective metric from output
+   - Current/baseline configuration (if any)
+
+4. **Create working directory**: `dse_results/` in project root
+   - `dse_results/dse_log.csv` — one row per design point
+   - `dse_results/DSE_REPORT.md` — final report
+   - `dse_results/DSE_STATE.json` — state for recovery
+   - `dse_results/inferred_params.md` — inferred parameter space (if ranges were not provided)
+   - `dse_results/configs/` — config files for each run
+   - `dse_results/outputs/` — raw output for each run
+
+5. **Write a parameter extraction script** (`dse_results/parse_result.py` or similar) that takes a run's output and returns the objective metric as a number. Test it on a baseline run first.
+
+6. **Run baseline** (iteration 0): run the program with default/current parameters. Record the baseline metric. This is the point to beat.
+
+### Phase 1: Initial Exploration
+
+**Goal**: Quickly survey the space to understand which parameters matter most.
+
+**Strategy**: Latin Hypercube Sampling or structured sweep of key parameters.
+
+1. Pick 5-10 diverse design points that span the parameter ranges
+2. Run them (in parallel if independent, via background processes or sequential)
+3. Record all results in `dse_log.csv`:
+   ```
+   iteration,param1,param2,...,metric,constraint_met,timestamp,notes
+   0,default,default,...,baseline_val,yes,2026-03-13T10:00:00,baseline
+   1,val1a,val2a,...,result1,yes,2026-03-13T10:05:00,initial sweep
+   ...
+   ```
+4. Analyze: which parameters have the most impact on the objective?
+5. Narrow the search to the most sensitive parameters
+
+### Phase 2: Directed Search
+
+**Goal**: Converge toward the optimum by making informed choices.
+
+**Strategy**: Adaptive — pick the approach that fits the problem:
+
+- **Few parameters (≤3)**: Fine-grained grid search around the best region from Phase 1
+- **Many parameters (>3)**: Coordinate descent — optimize one parameter at a time, holding others at current best
+- **Binary/categorical params**: Enumerate promising combinations
+- **Continuous params**: Binary search or golden section between best neighbors
+- **Multi-objective**: Track Pareto frontier, explore along the front
+
+For each iteration:
+
+1. **Select next design point** based on results so far:
+   - Look at the trend: which direction improves the metric?
+   - Avoid re-running configurations already evaluated
+   - Balance exploration (untested regions) vs exploitation (near current best)
+
+2. **Modify parameters**: edit config file, command-line args, or source constants
+
+3. **Run the program**: execute and capture output
+
+4. **Parse results**: extract the objective metric and check constraints
+
+5. **Log to `dse_log.csv`**: append the new row
+
+6. **Check stopping conditions**:
+   - Timeout reached? → stop
+   - Max iterations reached? → stop
+   - Patience exhausted (no improvement in N iterations)? → stop
+   - Success criteria met (metric is "good enough")? → stop
+   - Constraint violation pattern detected? → adjust search bounds
+
+7. **Update `DSE_STATE.json`**:
+   ```json
+   {
+     "iteration": 15,
+     "status": "in_progress",
+     "best_metric": 1.23,
+     "best_params": {"cache_size": 32768, "assoc": 4, "pipeline_width": 2},
+     "total_iterations": 15,
+     "start_time": "2026-03-13T10:00:00",
+     "timeout": "2h",
+     "patience_counter": 3
+   }
+   ```
+
+8. **Decide next step** → back to step 1
+
+### Phase 3: Refinement (if time allows)
+
+If the search converged and there's still time budget:
+
+1. **Local perturbation**: try ±1 step on each parameter from the best point
+2. **Sensitivity analysis**: which parameters can be relaxed without hurting the metric?
+3. **Constraint boundary**: if a constraint is nearly binding, explore near-feasible points
+
+### Phase 4: Report
+
+Write `dse_results/DSE_REPORT.md`:
+
+```markdown
+# Design Space Exploration Report
+
+**Task**: [description]
+**Date**: [start] → [end]
+**Total iterations**: N
+**Wall-clock time**: X hours Y minutes
+
+## Objective
+- **Metric**: [what was optimized]
+- **Direction**: minimize / maximize
+- **Baseline**: [value]
+- **Best found**: [value] ([improvement]% better than baseline)
+
+## Best Configuration
+| Parameter | Baseline | Best |
+|-----------|----------|------|
+| param1    | default  | best_val |
+| param2    | default  | best_val |
+| ...       | ...      | ... |
+
+## Search Trajectory
+| Iteration | param1 | param2 | ... | Metric | Notes |
+|-----------|--------|--------|-----|--------|-------|
+| 0 (baseline) | ... | ... | ... | ... | baseline |
+| 1 | ... | ... | ... | ... | initial sweep |
+| ... | ... | ... | ... | ... | ... |
+| N (best) | ... | ... | ... | ... | ★ best |
+
+## Parameter Sensitivity
+- **param1**: [high/medium/low impact] — [brief explanation]
+- **param2**: [high/medium/low impact] — [brief explanation]
+
+## Pareto Frontier (if multi-objective)
+[Table or description of non-dominated points]
+
+## Stopping Reason
+[timeout / max_iterations / patience / success_criteria_met]
+
+## Recommendations
+- [actionable insights from the exploration]
+- [which parameters matter most]
+- [suggested follow-up explorations]
+```
+
+Also generate a summary plot if matplotlib is available:
+- Convergence curve (metric vs iteration)
+- Parameter sensitivity bar chart
+- Pareto frontier scatter (if multi-objective)
+
+## State Recovery
+
+If the context window compacts mid-run, the loop recovers from `DSE_STATE.json` + `dse_log.csv`:
+
+1. Read `DSE_STATE.json` for current iteration, best params, patience counter
+2. Read `dse_log.csv` for full history
+3. Resume from next iteration
+
+## Key Rules
+
+- Work AUTONOMOUSLY — do not ask the user for permission at each iteration
+- **Every run must be logged** — even failed runs, constraint violations, errors. The log is the ground truth.
+- **Never re-run an identical configuration** — check `dse_log.csv` before each run
+- **Respect the timeout** — check elapsed time before starting a new iteration. If the next run is likely to exceed the timeout, stop and report.
+- **Parse metrics programmatically** — write a parsing script, don't eyeball logs
+- **Keep raw outputs** — save each run's full output in `dse_results/outputs/iter_N/`
+- **Constraint violations are not improvements** — a design point that violates constraints is never "best", regardless of the metric
+- If a run crashes, log the error, skip that point, and continue with the next
+- If the same crash repeats 3 times with different configs, stop and report the issue
+
+## Example Invocations
+
+```
+# Minimal — just name the parameters, let the agent figure out ranges
+/dse-loop "Run gem5 mcf benchmark. Tune: L1D_SIZE, L2_SIZE, ROB_ENTRIES. Objective: maximize IPC. Timeout: 3h"
+
+# Partial — some ranges given, some not
+/dse-loop "Run make synth. Tune: CLOCK_PERIOD [5ns, 4ns, 3ns, 2ns], FLATTEN, ABC_SCRIPT. Objective: minimize area at timing closure. Timeout: 1h"
+
+# Fully specified — explicit ranges for everything
+/dse-loop "Simulate processor with FIFO_DEPTH [4,8,16,32], ISSUE_WIDTH [1,2,4], PREFETCH [on,off]. Run: make sim. Objective: max throughput/area. Timeout: 2h"
+
+# Real-world: PDAG-SFA formal verification tuning
+/dse-loop "Run python run_bmc.py. Tune: BMC_DEPTH, ENGINE, TIMEOUT_PER_PROP. Objective: maximize properties proved. Timeout: 2h"
+```
+

package/dist/skills/embodiment-description/SKILL.md

@@ -0,0 +1,129 @@
+---
+name: embodiment-description
+description: "Write detailed embodiment descriptions for patent specifications. Use when user says \"撰写实施例\", \"write embodiment\", \"实施例描述\", \"detailed description\", or wants to describe how to practice an invention."
+argument-hint: [claims-path-or-embodiment-details]
+allowed-tools: Bash(*), Read, Write, Edit, Grep, Glob
+---
+
+# Embodiment Description
+
+Write detailed embodiments for: **$ARGUMENTS**
+
+Embodiments describe HOW to make and use the invention -- they are the patent equivalent of experiment sections, but describe the invention rather than evaluating it empirically.
+
+## Constants
+
+- `MIN_EMBODIMENTS = 1` — At least one complete embodiment required
+- `MAX_EMBODIMENTS = 3` — Practical limit; more embodiments strengthen enablement
+- `EMBODIMENT_STYLE = detailed` — `detailed` (full working example) or `outline` (sketch)
+- `REFERENCE_NUMERAL_PREFIX = 100` — Starting reference numeral for first figure's components
+
+## Inputs
+
+1. `patent/INVENTION_DISCLOSURE.md` — invention decomposition (core/supporting/optional features)
+2. `patent/CLAIMS.md` — drafted claims that the embodiments must support
+3. User-provided figures (if any) in any directory
+4. `patent/figures/numeral_index.md` if it exists (from `/figure-description`)
+
+## Workflow
+
+### Step 1: Plan Embodiments
+
+For each claim category (method, system, etc.), plan at least one embodiment:
+
+| Embodiment | Covers Claims | Type | Key Variations |
+|-----------|--------------|------|----------------|
+| 1 | Claims 1, X | Best mode / preferred | [primary implementation] |
+| 2 | Claims 2, 3 | Alternative | [different parameters/materials] |
+| 3 | Claims 4, 5 | Additional alternative | [different configuration] |
+
+### Step 2: Write Each Embodiment
+
+For each embodiment, write a detailed description following this structure:
+
+**Opening paragraph**:
+"In one embodiment, [invention summary with reference to what is being described]."
+
+**Component/step-by-step description**:
+
+For method embodiments:
+- Describe each step in order
+- Reference figure numerals: "As shown in FIG. 1, at step 202, the processor 102 receives the input data 104..."
+- Include specific parameters, ranges, and conditions
+- Describe what happens at each decision point
+
+For system/apparatus embodiments:
+- Describe each component
+- Reference figure numerals: "Referring to FIG. 1, the system 100 comprises a processor 102, a memory 104, and a communication interface 106..."
+- Describe interconnections between components
+- Describe operation of the system step-by-step
+
+**Variations and alternatives**:
+- "In some embodiments, the processor 102 may be a GPU, an FPGA, or an ASIC."
+- "In another embodiment, the memory 104 may be replaced with a distributed storage system."
+- "The parameters described above are exemplary; other values within the range [X, Y] are also contemplated."
+
+These variations are critical -- they support broader claim interpretation.
+
+### Step 3: Reference Numeral Integration
+
+Ensure consistent reference numeral usage:
+
+1. Every component mentioned must have a numeral
+2. Numeral must appear first in parentheses after the component name: "the processor (102)"
+3. Subsequent references: "the processor 102" (no parentheses)
+4. Numbering follows figure series: 100-series for FIG. 1, 200-series for FIG. 2
+
+**Format**:
+- First mention: "the processor (102)"
+- Later in same embodiment: "the processor 102"
+- Cross-figure: "the processor 102 (shown in both FIG. 1 and FIG. 2)"
+
+### Step 4: Claim Support Verification
+
+For each claim element, verify it appears in at least one embodiment:
+
+| Claim Element | Embodiment | Reference Numeral | Description Paragraph |
+|---------------|-----------|-------------------|----------------------|
+| [element] | [which] | [numeral] | [paragraph reference] |
+
+If any claim element lacks embodiment support, add the necessary description.
+
+### Step 5: Software/Algorithm Embodiments (if applicable)
+
+For method/software inventions, include:
+- Pseudocode or algorithmic description (NOT actual code)
+- Flowchart description tied to figures
+- Data structure descriptions
+- Interface specifications
+
+Example:
+```
+In one embodiment, the method comprises the following steps:
+At step 202, the processor 102 receives input data from the input device 108.
+At step 204, the processor 102 extracts feature vectors from the input data using a convolutional neural network.
+At step 206, the processor 102 applies the attention mechanism 110 to the feature vectors...
+```
+
+### Step 6: Output
+
+Embodiment sections are written to `patent/specification/detailed_description.md` (or appended to the specification structure).
+
+Each embodiment section should be self-contained but cross-reference other embodiments when describing alternatives.
+
+## Key Rules
+
+- Embodiments must teach a POSITA to make and use the invention without undue experimentation.
+- Include at least one "best mode" embodiment (US requirement).
+- Multiple embodiments strengthen the specification against enablement challenges.
+- Describe the invention, do NOT evaluate it empirically ("The embodiment achieves 95% accuracy" is wrong; "The processor classifies the input data" is correct).
+- **CRITICAL — NO experimental data, test results, accuracy percentages, detection rates, precision values, or comparative performance data.** These belong in papers, not patents. The embodiment teaches HOW to make and use, not HOW WELL it performs.
+- WRONG: "传感器对直径超过150μm的金属颗粒实现了100%的检测精度，即使在检测限处仍保持94%的高精度。"
+- RIGHT: "当不锈钢颗粒通过间隙传感区域时，谐振频率下降。颗粒直径越大，频率偏移幅度越大。"
+- Do NOT include tables of experimental results, graphs of measurement data, or comparisons with prior art performance.
+- **CRITICAL — An embodiment is NOT an experiment.** Do NOT describe "repeated experiments", "accuracy evaluation", "precision testing", "calibration experiments", or "comparison with reference methods". An embodiment describes ONE way to make and use the invention — it is a recipe, not a test report.
+- Do NOT copy experimental sections from source papers verbatim. Transform the experimental setup into a manufacturing/operation description.
+- If the source material is a paper, extract ONLY: (1) what was built, (2) what materials/parameters were used, (3) how it operates. Ignore all test methodology, results, and performance metrics.
+- Include specific parameters where possible, but frame them as exemplary, not limiting.
+- Reference numerals must be consistent with the figures.
+- Do NOT use subjective language ("excellent", "surprising", "superior").

package/dist/skills/exa-search/SKILL.md

@@ -0,0 +1,192 @@
+---
+name: exa-search
+description: AI-powered web search via Exa with content extraction. Use when user says "exa search", "web search with content", "find similar pages", or needs broad web results beyond academic databases (arXiv, Semantic Scholar).
+argument-hint: [search-query-or-url]
+allowed-tools: Bash(*), Read, Write
+---
+
+# Exa AI-Powered Web Search
+
+Search query: $ARGUMENTS
+
+## Role & Positioning
+
+Exa is the **broad web search** source with built-in content extraction:
+
+| Skill | Best for |
+|------|----------|
+| `/arxiv` | Direct preprint search and PDF download |
+| `/semantic-scholar` | Published venue papers (IEEE, ACM, Springer), citation counts |
+| `/deepxiv` | Layered reading: search, brief, section map, section reads |
+| `/exa-search` | Broad web search: blogs, docs, news, companies, research papers — with content extraction |
+
+Use Exa when you need results beyond academic databases, or when you want content (highlights, full text, summaries) extracted alongside search results.
+
+## Constants
+
+- **EXA_FETCHER** — canonical name `exa_search.py`, resolved per
+  [`shared-references/integration-contract.md`](../shared-references/integration-contract.md) §2
+  (Codex-side chain: `$ARIS_REPO/tools/` → `tools/` → `~/.codex/skills/exa-search/`).
+  Policy D1 — standalone `/exa-search` has no documented fallback,
+  so unresolved helper terminates with an explicit error.
+- **MAX_RESULTS = 10** — Default number of results to return.
+
+> Overrides (append to arguments):
+> - `/exa-search "RAG pipelines" — max: 5` — top 5 results
+> - `/exa-search "diffusion models" — category: research paper` — research papers only
+> - `/exa-search "startup funding" — category: news, start date: 2025-01-01` — recent news
+> - `/exa-search "transformer" — content: text, max chars: 8000` — full text mode
+> - `/exa-search "transformer" — content: summary` — LLM-generated summaries
+> - `/exa-search "transformer" — domains: arxiv.org,huggingface.co` — domain filter
+> - `/exa-search "https://arxiv.org/abs/2301.07041" — similar` — find similar pages
+
+## Setup
+
+Exa requires the `exa-py` SDK and an API key:
+
+```bash
+pip install exa-py
+```
+
+Set your API key:
+```bash
+export EXA_API_KEY=your-key-here
+```
+
+Get a key from [exa.ai](https://exa.ai).
+
+## Workflow
+
+### Step 1: Parse Arguments
+
+Parse `$ARGUMENTS` for:
+- **query**: The search query (required) or a URL (for `find-similar` mode)
+- **similar**: If present, use `find-similar` mode instead of search
+- **max**: Override MAX_RESULTS
+- **category**: `research paper`, `news`, `company`, `personal site`, `financial report`, `people`
+- **content**: `highlights` (default), `text`, `summary`, `none`
+- **max chars**: Max characters for content extraction
+- **type**: Search type — `auto` (default), `neural`, `fast`, `instant`
+- **domains**: Comma-separated include domains
+- **exclude domains**: Comma-separated exclude domains
+- **include text**: Phrase that must appear in results
+- **exclude text**: Phrase to exclude from results
+- **start date**: ISO 8601 date — only results after this
+- **end date**: ISO 8601 date — only results before this
+- **location**: Two-letter ISO country code
+
+### Step 2: Locate Script
+
+```bash
+# Resolve $EXA_FETCHER via the canonical strict-safe Codex chain.
+if [ -z "${ARIS_REPO:-}" ] && [ -f .aris/installed-skills-codex.txt ]; then
+    ARIS_REPO=$(awk -F'\t' '$1=="repo_root"{print $2; exit}' .aris/installed-skills-codex.txt 2>/dev/null) || true
+fi
+EXA_FETCHER=""
+[ -n "${ARIS_REPO:-}" ] && [ -f "$ARIS_REPO/tools/exa_search.py" ] && EXA_FETCHER="$ARIS_REPO/tools/exa_search.py"
+[ -z "$EXA_FETCHER" ] && [ -f tools/exa_search.py ] && EXA_FETCHER="tools/exa_search.py"
+[ -z "$EXA_FETCHER" ] && [ -f ~/.codex/skills/exa-search/exa_search.py ] && EXA_FETCHER="$HOME/.codex/skills/exa-search/exa_search.py"
+[ -z "$EXA_FETCHER" ] && {
+  echo "ERROR: exa_search.py not resolved at \$ARIS_REPO/tools/, tools/, or ~/.codex/skills/exa-search/." >&2
+  echo "       Fix: rerun tools/install_aris_codex.sh, export ARIS_REPO, or copy the helper to ~/.codex/skills/exa-search/." >&2
+  echo "       Also ensure 'exa-py' is installed: pip install exa-py" >&2
+  exit 1
+}
+```
+
+If not found, tell the user:
+```
+exa_search.py not found. Run install_aris_codex.sh, set ARIS_REPO to your ARIS repo root, or install/copy the helper into the project/global Codex skill path; then install exa-py:
+pip install exa-py
+```
+
+### Step 3: Execute Search
+
+**Standard search:**
+```bash
+python3 "$EXA_FETCHER" search "QUERY" --max 10 --content highlights
+```
+
+**With filters:**
+```bash
+python3 "$EXA_FETCHER" search "QUERY" --max 10 \
+  --category "research paper" \
+  --start-date 2025-01-01 \
+  --content text --max-chars 8000
+```
+
+**Find similar pages:**
+```bash
+python3 "$EXA_FETCHER" find-similar "URL" --max 5 --content highlights
+```
+
+**Get content for known URLs:**
+```bash
+python3 "$EXA_FETCHER" get-contents "URL1" "URL2" --content text
+```
+
+### Step 4: Present Results
+
+Format results as a structured table:
+
+```
+| # | Title | Authors | Venue/Publisher | URL | Date | Key Content |
+|---|-------|---------|-----------------|-----|------|-------------|
+```
+
+For each result:
+- Show title and URL
+- Show published date if available
+- Show highlights, text excerpt, or summary depending on content mode
+- Flag particularly relevant results
+- **For `category: "research paper"` hits only** — also record authors
+  (from Exa's `author`/`authors` fields, or fallback: parse from the
+  result snippet) and venue/publisher (from `publisher`, `source`, or
+  the domain hosting the paper). These are needed by Step 6's wiki
+  hook; if either is unavailable for a given hit, skip wiki ingest
+  for that one hit and log a note.
+
+### Step 5: Offer Follow-up
+
+After presenting results, suggest:
+- **Deepen**: "I can fetch full text for any of these results"
+- **Find similar**: "I can find pages similar to any result"
+- **Narrow**: "I can re-search with domain/date/text filters"
+
+### Step 6: Update Research Wiki (if active, research-paper results only)
+
+**Required when `research-wiki/` exists AND the search returned
+results of `category: "research paper"`**; skip silently otherwise.
+General web results (blog posts, docs, news) are **not** ingested —
+the wiki is for papers only.
+
+For each research paper hit, try to recover an arXiv ID from the URL
+(`arxiv.org/abs/<id>`); if present, use `--arxiv-id`. Otherwise fall
+back to manual metadata:
+
+```
+if [ -d research-wiki/ ] and query category was "research paper":
+    WIKI_SCRIPT=""
+    [ -n "$ARIS_REPO" ] && [ -f "$ARIS_REPO/tools/research_wiki.py" ] && WIKI_SCRIPT="$ARIS_REPO/tools/research_wiki.py"
+    [ -z "$WIKI_SCRIPT" ] && [ -f tools/research_wiki.py ] && WIKI_SCRIPT="tools/research_wiki.py"
+    [ -z "$WIKI_SCRIPT" ] && [ -f ~/.codex/skills/research-wiki/research_wiki.py ] && WIKI_SCRIPT="$HOME/.codex/skills/research-wiki/research_wiki.py"
+    for each research-paper hit in results:
+        if URL matches arxiv.org/abs/<id>:
+            [ -n "$WIKI_SCRIPT" ] && python3 "$WIKI_SCRIPT" ingest_paper research-wiki/ \
+                --arxiv-id "<id>"
+        else:
+            [ -n "$WIKI_SCRIPT" ] && python3 "$WIKI_SCRIPT" ingest_paper research-wiki/ \
+                --title "<title>" --authors "<authors joined by , >" \
+                --year <year> --venue "<venue or publisher>"
+```
+
+The helper handles slug / dedup / page / index / log — **do not
+handwrite `papers/<slug>.md`**. See
+[`shared-references/integration-contract.md`](../shared-references/integration-contract.md).
+
+## Key Rules
+- Always check that `EXA_API_KEY` is set before searching
+- Default to `highlights` content mode for a good balance of speed and context
+- Use `category: "research paper"` when the user is clearly looking for academic content
+- Use `text` content mode when the user needs full page content
+- Combine with `/arxiv` or `/semantic-scholar` for comprehensive literature coverage