CSP-Atlas: Concept-Specific Neural Circuits in a Sparse Python Transformer
On the map: Mechanistic interpretability → Circuits and mechanistic analysis
Abstract (arXiv)
A sparse 8-layer code transformer develops dedicated neural circuitry for every Python construct tested, and that circuitry is organised by a clean computational principle rather than by semantic category. We extract neural circuits for 106 concepts (43 AST node types, 63 builtin objects) by marginalising across 63,800 controlled prompts, and decompose each circuit into concept-specific and token-driven components using contrastive checker prompts that present a keyword token without its associated syntactic structure. Three findings emerge. First, all 106 concepts produce non-empty universal circuits at every one of nine parameter settings, and the ranking of concept-specificity across constructs is stable across the sweep - survival is not an artifact of a permissive threshold. Second, AST circuits contain a genuine concept component distinct from token activation: concept-only neurons constitute up to 62.5% of the loudest-firing neurons at mid-to-late layers, while builtin circuits are almost entirely token-driven. Third, six computationally atomic constructs - Import, ImportFrom, Break, Continue, Pass, Assert - cluster together despite being semantically unrelated, sharing only the property of being single-statement constructs requiring no nested body; this atomicity super-cluster, together with a four-tier hierarchy organised by token ambiguity and structural distinctiveness, shows that the model's internal organisation tracks computational structure rather than meaning. The methodology, full decomposition data, and analysis code are released.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 7 of its 7 references that are in the map. First posted on arXiv 23 May 2026.
Builds on
7 of 7 references.
Closest ancestors · 1
Same direction, newest first
Other references · 6
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
- 2022Toy Models of Superpositioncited by 971
- 2024How to use and interpret activation patchingcited by 214
- 2023Linearity of Relation Decoding in Transformer Language Modelscited by 200
- 2022What Do They Capture? -- A Structural Analysis of Pre-Trained Language Models for Source Codecited by 50
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models
- 2026Language Model Circuits Are Sparse in the Neuron Basis
- 2024Transcoders Find Interpretable LLM Feature Circuits
- 2024Sparse Autoencoders Enable Scalable and Reliable Circuit Identification in Language Models
- 2025Beyond Components: Singular Vector-Based Interpretability of Transformer Circuits
- 2025K-MSHC: Unmasking Minimally Sufficient Head Circuits in Large Language Models with Experiments on Syntactic Classification Tasks
- 2023Towards Interpretable Sequence Continuation: Analyzing Shared Circuits in Large Language Models
- 2024The Computational Complexity of Circuit Discovery for Inner Interpretability