Individual skill

stoc-related-work

Use when positioning a STOC (ACM Symposium on Theory of Computing) paper against the theory literature — tracing bound-improvement lineages, citing conference/journal/preprint version pairs correctly, handling concurrent arXiv and ECCC work, and keeping self-citation double-blind-safe.

STOC-Skills/skills/stoc-related-work/SKILL.md

Read pinned source

Source commit 932eb23331721b16e967c59f093781be1928b498

What was checked

Matches the observed repository HEAD: Yes
Scanner rules are current: Yes
Repository scan complete: No
Skill scan complete: Yes
Observed behavior: Network or broad shell
Last checked: Nov 9, 2026

These are observations at the recorded commit, not a guarantee of safety. Review the source before running it.

Install this skill

Choose an agent in your Stack or copy a command below. Commands fetch the pinned commit and copy only this skill directory. Existing destinations are refused. Copying a command does not install anything.

An install command is unavailable: current rules, complete repository and skill scans, an eligible behavior level and a permitted license are required.

Repository context

Repository stars (not skill ratings): 1,404
Repository last updated: Sep 27, 2026
License: MIT

Observed agent integration: No specific integration evidence. Standard SKILL.md installation does not imply verified compatibility.

academic-writing Repository topic
agent-skills Repository topic
journal Repository topic
academic-research Repository topic
ai-agents Repository topic
anthropic Repository topic
awesome-list Repository topic
claude Repository topic
claude-code Repository topic
economics Repository topic
research Derived category

Files and excerpt

File metadata and permitted, redacted excerpts come from the recorded scan. Source links are pinned to that commit.

Browse files

SKILL.mdcore · 6,582 bytes

Read excerpt


# STOC Related Work

Theory positioning is quantitative: reviewers expect the paper to place its
bounds in an explicit lineage ("[A] gave $O(n^2)$; [B] improved to
$O(n \log n)$ under assumption X; we remove X and reach $O(n)$"), and they
check the lineage against their own memory of it. Errors here — a missed
improvement, a misquoted exponent, a result attributed to the journal version's
year instead of the conference announcement — are among the fastest credibility
losses available at this venue.

## The lanes a STOC reviewer checks

| Lane | What must be covered | Typical miss |
|---|---|---|