finding
active
finding:pruning-reduces-14-turn-graph-from-7-239-nodes-and-10-4m-edges-to-1-300-nodes-and-110k-edgesPruning reduces 14-turn graph from 7,239 nodes and 10.4M edges to ~1,300 nodes and ~110K edges
Circuit-tracer pruning.
Source paper
extracted_from(2026) · Kevin Der · Harish Kamath · Thompson, Ben
Neighborhood — ranked by edge-count
Papers (1)
paper
Claims (1)
claim
- Abstract.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Remarkably minimal circuit discovered for checkerboard pattern generation
- Fisher-effectiveness pruning at 30% density.
- Related work.
- Evidence for language-independent representation.
- Turn-level attribution graphs give compact, interpretable explanations of multi-turn model behaviorclaim0.687Case study conclusion.
- Limitation.
- Fig 1.
- Condition for hierarchical order with locally coherent but globally varying phases