Claude Skills by curiositech

Hypertree decomposition approach to planning problems for reduced computational complexity

Author or revise Beamer slide decks, including frames, overlays, fragile content, aspect ratio, handout mode, and slide readability. Use for a .tex presentation. NOT for articles, books, whitepaper publication, generic compile failures, or standalone TikZ figures.

Compile and troubleshoot a LaTeX document or project: select the available compiler, read the first log error, resolve references and citations, and verify rendered output. Use for build, render, install-status, or TeX log questions. NOT for source writing, Beamer composition, figure semantics, or a repository's committed-PDF registry and publication process.

Design the typography and page grammar of a standalone LaTeX paper or whitepaper: type hierarchy, restrained color, callouts, figure consistency, and rendered-page review. Use when a PDF looks visually weak or a new paper needs a coherent visual system. NOT for the argument or proof, Book-specific edition styles, TikZ figure engineering, compilation, or a committed-PDF registry workflow.

Standing planning doctrine for the port-daddy pilot: every plan is executed as a hypertree of context clusters. Structure phase before content phase, cluster-to-agent assignment by file-disjointness, spawn discipline capped at the merge-queue digest bound, and manager-driven orchestration with worktree isolation and pointer-based digests. Activate whenever the pilot (or any planner lane) decomposes work into parallel agents: 'plan this wave', 'partition this work', 'how many agents', 'hypertr...

Find and verify the closest prior work when a research result crosses disciplinary vocabularies. Use before a novelty claim, coined term, contribution paragraph, or related-work section. NOT for doing the proof or experiment, choosing a venue, formatting a submission, or general technical writing.

Run the ordinary Rust edit, compile, lint, and test loop; diagnose ownership and lifetime errors with intent and surrounding code; choose basic error and async test patterns. Use for day-to-day Rust changes in any crate. For library API invariants use advanced-rust-patterns; for structure selection use rust-data-structures-advanced; for measured optimization use rust-performance-and-idioms; for runtime failures use rust-debugging-mastery; for a pd-console pane or GPUI executor boundary use gp...

Turn a stated outcome into a reviewable task graph with deliverables, decision/unknown nodes, typed dependency reasons, and authority gates. It plans work; it does not execute, schedule, or prove that a DAG can run concurrently. NOT for runtime orchestration or granting effect authority.

Expert technical documentation specialist for developer docs, API references, and runbooks. Activate on: documentation, docs, README, API reference, technical writing, user guide, runbook, ADR, changelog, release notes, tutorial, how-to guide. NOT for: marketing copy (use copywriting skills), blog posts (use content skills), code comments (handled by developers).

First-party three-pass planning protocol that converts a ProblemUnderstanding into a revisioned decomposition proposal: typed nodes, reasoned edges, uncertainty records, candidate skills, and topological waves. A DAG is not an execution proof; confidence values are not probabilities without calibration. NOT for execution, runtime admission, or formal HTN proofs.