Research / Evaluation and verification

ScrubID: Identifiability-Aware Auditing for Mechanistic Interpretability

Introduces ScrubID, an identifiability-aware auditing framework whose redundancy, stability and contradiction diagnostics flag non-identifiable circuit explanations, validated with planted redundancy and applied to GPT-2 case studies.

Published
21 January 2026
Author
Ali Uyar
DOI
10.5281/zenodo.18330419
Code
github.com/aliuyar1234/ScrubID

Abstract

Mechanistic interpretability often claims that a specific circuit explains a model behavior, but multiple distinct circuits can reproduce the same behavior under common intervention protocols. We introduce ScrubID, an identifiability-aware auditing framework that treats circuit explanations as estimators whose uniqueness depends on the intervention family. ScrubID defines scrubbed models that preserve a candidate circuit while resampling the rest of the network under a specified intervention family, and evaluates ε-faithfulness relative to a task-specific tolerance. To detect non-identifiability in practice, ScrubID introduces three diagnostics computed from discovered candidate sets: RR, a redundancy ratio measuring worst-case disagreement among near-optimal faithful circuits; SSS, a stability score measuring how consistent recovered circuits are across replicate discovery runs; and CC, a contradiction score measuring how inconsistent component necessity is across near-optimal faithful circuits. We validate these diagnostics on a deterministic synthetic suite with ground-truth equivalence class sizes and planted redundancy, and we apply ScrubID to real transformer case studies on indirect object identification, year-span greater-than comparison (yes/no), and induction-style next-token prediction. Our results motivate reporting identifiability diagnostics alongside mechanistic circuit claims and provide standardized artifacts for reproducible audits.

On the synthetic suite, RR and CC jump from 0 at planted redundancy factor 1 to RR ≈ 0.67 and CC ≈ 0.67–0.82 for redundancy factors ≥ 2, and audit certificates are emitted at rate 1.0 in these redundant regimes (Table T1). In GPT-2 case studies under activation patching, across N=5 suite seeds we compare three candidate generators (G_ATTR_PATCH, G_MANUAL_SEED, G_RANDOM_K). On the ID split, G_ATTR_PATCH recovers smaller ε-faithful circuits for IOI (mean 124.0/156) and induction (mean 92.8/156); IOI exhibits moderate redundancy/contradiction signals (RR_mean ≈ 0.36, CC_mean ≈ 0.10) while induction shows both redundancy and discovery instability (RR_mean ≈ 0.59, SSS_mean ≈ 0.41), producing WARN/FAIL verdicts (Table T2). On the OOD split, induction becomes highly unstable (SSS_mean ≈ 0.13) and exhibits RR non-identifiability in some seeds (e.g. RR=0.93 with |S_near|=2), producing audit certificates (Table T4).

Why it matters

Several distinct circuits can reproduce the same behavior under common intervention protocols. Reporting redundancy, stability and contradiction diagnostics next to a circuit claim shows whether the evidence singles that circuit out.

Cite

@misc{uyar2026scrubid,
  title     = {ScrubID: Identifiability-Aware Auditing for Mechanistic Interpretability},
  author    = {Uyar, Ali},
  year      = {2026},
  doi       = {10.5281/zenodo.18330419},
  publisher = {Zenodo},
  url       = {https://doi.org/10.5281/zenodo.18330419}
}
AU-17
Float: |m|, the mean absolute task metric of the scrubbed model, read against the ε band S0 ± 0.10Valves r0–r7: lever up keeps the node on the supply header, lever down resamples it from the reference header, lever level to the right is shut (not in the planted model)aggr, the valve under the meter: up passes the collected flow, middle shuts the meter off while the GPT-2 rows are readWithin ε, or every diagnostic passesOutside ε, or a certificate is issuedScrubID audits a circuit explanation by scrubbing: the circuit's components stay on the live model (the supply header), every other component is resampled from a reference distribution (the reference header), and the circuit is ε-faithful when the scrubbed model's task metric differs from the full model's by at most ε = 0.10·S0 on average. Across the near-optimal faithful circuits it finds, it measures how far apart they lie (RR), how stable 5 replicate discovery runs are (SSS) and what share of components are necessary in one of those circuits but not in another (CC), and it issues a certificate when any of them crosses its threshold. On the synthetic suite, planted redundancy factor 1 gives RR 0 and CC 0, and factors 2, 4 and 8 give RR 0.67, CC 0.67 to 0.82 and a certificate in every run. On GPT-2 small (144 heads, 12 MLPs), with activation patching, the attribution-patching generator and in-distribution prompts, the IOI circuit keeps 124.0 of 156 components (RR 0.36, SSS 0.68, CC 0.10) and the induction circuit 92.8 (RR 0.59, SSS 0.41), mean of 5 seeds.