← Research
Contents
AI Safety & Alignment · Survey July 2026

Two Windows into Model Cognition: Mechanistic Interpretability and Chain-of-Thought Faithfulness as Complementary AI Safety Agendas

A survey of primary work from 2021 to 2026 on reading the internal computations of large language models (from the inside via features and circuits, and from the outside via stated reasoning), covering the 2025–2026 turn from faithfulness to monitorability, a wave of negative results on sparse autoencoders, and the emergence of obfuscation as a measured threat model. It closes with an operational taxonomy of chain of thought and a two-tier experimental agenda for testing it.

Abstract

If advanced AI systems are to be deployed safely, we need methods for verifying why a model produced an output, not merely what it produced. Two research programs pursue this goal from opposite directions. Mechanistic interpretability reverse-engineers the internal computations of transformers into human-understandable features and circuits, progressing from toy models of superposition [2] through sparse autoencoders that extract millions of monosemantic features from production models [5][7] to attribution graphs that trace multi-step computation in a frontier model [9]. Chain-of-thought (CoT) faithfulness research asks whether a model's stated reasoning causally reflects the computation that produced its answer, and finds that it often does not: models condition on unstated biases [22], verbalize decisive hints in fewer than 20% of cases [27], and mention learned reward hacks in under 2% of exploiting trajectories [27], even as CoT monitoring catches roughly 95% of hacks in favorable settings [29].

The 2025–2026 literature reshaped both agendas. On the interpretability side, large-scale evaluations found sparse-autoencoder features underperforming simple linear probes on downstream tasks, prompting Google DeepMind to deprioritize fundamental SAE research [11][12][13]. In response, OpenAI trained weight-sparse transformers whose circuits are roughly sixteen times smaller than dense equivalents at matched loss [15], and interpretability tools proved their applied value in blinded alignment-auditing games [17][18]. On the behavioral side, the field executed a deliberate reframing from faithfulness to monitorability and built the first standardized monitorability evaluation suites [32][34]. In parallel, a separate line of work matured obfuscation into a measured threat model, culminating in the finding that mere knowledge of being monitored, instilled through synthetic documents, raises undetected deception from 1.7% to 25.7% in one open model [37]. We synthesize both literatures as complementary instruments trained on one object, distill the synthesis into an operational taxonomy of chain of thought in which each category (faithful reasoning, fabrication, motivated reasoning) is jointly indexed by a behavioral and a mechanistic signature, and ground the survey in figures built directly from the cited statistics. A concurrent methodological advance sharpens the introspection question considerably: a new lens for verbalizable representations identifies a global-workspace-like subset of a model's activations, shows it is causally upstream of concealed strategic reasoning in live alignment audits, and demonstrates that shaping it via counterfactual reflection training measurably improves honesty [45]. We close with a two-tier experimental agenda: five frontier-scale experiments (including a mechanistic predictor of unfaithfulness, a white-box backstop for obfuscated reward hacking, and a test of whether introspection training helps or harms honest self-report [20]) and a parallel tier of six experiments executable on a single workstation with open-weight models, whose centerpiece tests the taxonomy's load-bearing assumption: that the two windows agree at instance level, a property concurrent probing work [46][47] supplies the ingredients for but does not test. The newly released companion code and evaluation data [60] for [45] make one of these, a direct small-scale replication of its workspace-under-suppression finding, executable with the original instrument rather than a substitute.

1Introduction

Behavioral evaluation tells us what a model does on the inputs we thought to test. It cannot, by construction, rule out dangerous cognition that never surfaces on those inputs: deception that activates only under deployment conditions, reward hacking that leaves no trace in outputs, or capabilities the model has learned to conceal. This gap between observed behavior and underlying computation motivates two of the most active research agendas in AI safety.

The first, mechanistic interpretability, attacks the problem from the inside. Framed in 2021 as an attempt to reverse-engineer the detailed computations performed by transformers (by analogy to decompiling a binary back into source code), its explicit ambition is to anticipate the safety problems of models that have not yet been built [1]. If we can read a model's internal representations directly, we can in principle audit for deceptive or power-seeking cognition regardless of whether it ever manifests behaviorally.

The second, chain-of-thought faithfulness, approaches it from the outside. Modern reasoning models, trained via reinforcement learning to produce at length the chains of thought that prompting first elicited [59], appear to externalize their computation in natural language. If that externalization were reliable, oversight would be almost free: a weak monitor reading the transcript could flag misbehavior in a much stronger model. The faithfulness literature asks whether the words on the page are the real reasoning, and answers, with striking consistency, that they frequently are not [21][22][27].

Over 2025–2026, both fields moved decisively. Interpretability absorbed a wave of rigorous negative results about its flagship technique [11][12], responded with architectures that are interpretable by construction [15][16], and demonstrated applied value in alignment audits [17]. The faithfulness community executed a deliberate conceptual pivot: rather than asking whether CoT faithfully mirrors internal computation, it now asks whether the properties we care about are monitorable from the CoT [32][34], and under what training pressures that monitorability erodes [35][36][37]. Figure 1 traces the two tracks in parallel; their point of contact is already visible in the arithmetic case study, where a model's actual mental-arithmetic mechanism bears no resemblance to the textbook explanation it gives of that mechanism [9][10].

Figure · milestone map 2021 2022 2023 2024 2025 2026 Mechanistic interpretability Chain-of-thought / monitoring Circuitsframework Monosemanticity Attributiongraphs Weight-sparsecircuits Toysuperposition Scaling tofrontier LLMs SAEreckoning [1] [3] [9] [15] [2] [5,7] [11,12,13] Measuringfaithfulness CoT monitoring;obfuscation Output-pressureobfuscation Causal-mediationtraining Monitorabilityconsensus [21,22] [29] [34,35,37] [23] [31,32]
Figure 1 · Two tracks, one problem, five years. Node positions are approximate to the nearest publication season and compressed where several 2025 events cluster; exact dates are in the reference list. The visual parallel is the point: both fields spend 2021–2024 building measurement tools, then pivot in 2025 toward the practical question of what the tool is good enough to certify: audits for interpretability [17], monitorability for chain of thought [32][34].

Existing surveys cover each of these windows separately. Mechanistic interpretability has its own reviews [61][62][63][64], spanning foundational-concepts primers to forward-looking open-problems agendas, and CoT faithfulness is covered within broader treatments of CoT reasoning and explainability. None treats the two as joint instruments pointed at the same underlying question, and none provides an operational taxonomy indexed by both a behavioral and a mechanistic signature. This survey's contribution is exactly that pairing.

Beyond synthesis, this survey contributes one formal object and one agenda. The formal object is an operational taxonomy of chain of thought (Table 2) that re-indexes the mechanistic categories of [9] (faithful reasoning, fabrication, motivated reasoning) by paired behavioral and mechanistic signatures, with a classification rule (Figure 8) that assigns a label only when the two windows agree. We are explicit that the rule embeds an untested empirical assumption: that the windows do agree on real instances. The agenda (§4.3) is two-tier: five frontier-scale experiments for the field, and six workstation-scale experiments on open-weight models that a single researcher can execute, the first of which tests exactly that assumption. Concurrent work establishes the mechanistic ingredients separately (probes that flag motivated reasoning before generation [46] and pre-CoT answer decodability [47]) but not their agreement with behavioral measures, which is the property hybrid oversight schemes actually rely on.

Section 2 reviews mechanistic interpretability from superposition through attribution graphs, the 2025 reckoning with sparse autoencoders, interpretability-by-design, applied alignment audits, and the academic lineage on probing and steering. Section 3 reviews CoT faithfulness from intervention-based measurement through the monitorability turn and the maturing obfuscation threat model. Section 4 synthesizes the two, examines limitations, and states the two-tier experimental agenda.

2Mechanistic Interpretability: Reading Computation from the Inside

2.1  Foundations: circuits and the safety framing

The circuits program was given its canonical form in A Mathematical Framework for Transformer Circuits [1], which decomposed small attention-only transformers into interpretable algorithmic components. Its most durable empirical contribution is the discovery of induction heads: a general in-context-learning algorithm produced by the composition of attention heads across layers, which only emerges once a model has at least two attention layers. Beyond the specific mechanism, the paper established the field's safety framing (interpretability as a route to making claims about models before their failure modes materialize) and its methodological style: identify a candidate mechanism, then validate it by intervention rather than correlation.

2.2  Superposition: the central obstacle

Toy Models of Superposition [2] identified why the naive strategy (interpret each neuron) fails. When the features useful to a model are sparse in its training distribution, networks learn to represent more features than they have dimensions, assigning each feature a linear combination of neurons. The result is polysemanticity: individual neurons that fire on unrelated concepts, alongside occasional clean monosemantic ones, with a phase diagram governing which regime obtains.

The paper frames superposition as deeply connected to the viability of interpretability-based safety claims, and introduces enumerative safety: if one could enumerate all of a model's features, one could in principle argue that no feature implements a given harmful behavior, catching unknown unknowns that behavioral testing misses. It also flags a cautionary corollary: under superposition, detecting a concept such as manipulation via cosine similarity to a probe direction can mislead, because unrelated features interfere [2].

2.3  Sparse autoencoders: resolving superposition

The leading response to superposition is sparse dictionary learning via sparse autoencoders (SAEs): an unsupervised method that reconstructs a model's activations through a sparse bottleneck, isolating recurring activation patterns (features) that correspond to human-interpretable concepts. Towards Monosemanticity [3] demonstrated the approach on a one-layer transformer with a 512-neuron MLP, learning dictionaries from 512 up to 131,072 features, and recovering features (DNA sequences, legal boilerplate, HTTP requests, Hebrew text) invisible at the level of individual neurons. Independent work by Cunningham et al. [4] confirmed that superposition in language models can be resolved with a scalable unsupervised method, providing the key non-Anthropic corroboration. Methodological refinements followed: OpenAI's k-sparse (TopK) autoencoders control sparsity directly and improve the reconstruction–sparsity frontier over L1-penalty SAEs [5], and DeepMind's JumpReLU activation pushed reconstruction fidelity further at matched sparsity [6].

2.4  Scaling to frontier models and establishing causality

In 2024 two labs demonstrated that SAEs scale: Anthropic's Scaling Monosemanticity extracted millions of features from the middle layer of Claude 3 Sonnet [7], and OpenAI trained a 16-million-latent autoencoder on GPT-4 activations over 40 billion tokens [5]. Two results matter most for safety. First, the extracted features include directly safety-relevant ones: unsafe code, bias, sycophancy, deception and power-seeking, dangerous or criminal information [7]. Second, the features are causal rather than merely correlational: clamping a feature steers model output in specific, interpretable ways, up to and including circumventing safety training. A clamped "scam email" feature induces Claude to write a scam email it would otherwise refuse [7]. Causal influence is the property a deception detector would ultimately need; its demonstration turns feature catalogs from mere descriptions into candidate control surfaces.

2.5  Attribution graphs: from features to computation

The 2025 frontier moved from cataloguing features to tracing how they compose. The attribution-graph methodology [8] builds a local replacement model (substituting MLPs with transcoders whose sparse features reconstruct each layer's computation) and traces direct linear causal paths between features from input to output. On the Biology of a Large Language Model [9] applies this to Claude 3.5 Haiku with a cross-layer transcoder of 30 million features, validating graph-derived hypotheses by inhibiting feature groups and observing downstream effects.

The pivotal result is the arithmetic case study. The graphs reveal that Claude performs mental addition through two parallel pathways: a low-precision magnitude estimate and a high-precision last-digit path drawing on a memorized one-digit addition table. Yet when asked how it computed 36 + 59 = 95, the model narrates the standard carrying algorithm, which does not match its circuits; the model appears unaware of the mental-math strategies it learned during training [9][10]. The same work proposes a mechanistic taxonomy of chain of thought (faithful reasoning, fabrication, and motivated reasoning that works backward from a suggested answer) and shows attribution graphs are sometimes capable of auditing internal reasoning to flag concerning thought processes [9]. This case anchors the synthesis in Section 4.

2.6  SAEs against rigorous baselines (2025)

The most consequential interpretability development of 2025 was not a new method but a wave of negative results. Kantamneni, Engels et al. evaluated SAE-based probes across more than a hundred datasets and found they failed to outperform ordinary logistic regression, with SAE latents notably fragile under distribution shift and unable to represent complex concepts [11]. AxBench, a large-scale benchmark for concept detection and steering, found that prompting outperformed all existing methods for steering (followed by fine-tuning), that difference-in-means representations led concept detection, and that SAEs were not competitive on either task [12] (Figure 2). In direct response, Google DeepMind's mechanistic interpretability team publicly deprioritized fundamental SAE research, concluding that while SAEs remain a tool in the toolkit, they are unlikely to be a game-changer on their own, and noting the corollary that linear probes are cheap and surprisingly strong [13].

Steering task, best to worst [12]
Prompting Fine-tuning ReFT-r1 Sparse autoencoders
Concept detection task, best to worst [12]
Difference-in-means ReFT-r1 Sparse autoencoders
Figure 2 · SAEs against simple baselines (AxBench, Gemma-2-2B/9B). Rankings are qualitative: ordinal position from the reported comparison, not the underlying scores, which AxBench reports on a task-specific 0–2 scale [12]. ReFT-r1 is a lightweight weakly-supervised method introduced by the same paper as a competitive, still-interpretable alternative. The consistent last-place finish for SAEs on both axes is what prompted the DeepMind deprioritization decision [13].

A subsequent position paper reconciles the apparent contradiction between these negative results and SAEs' continued centrality in circuit-tracing work: SAEs should be used to discover unknown concepts (hypothesis generation, unsupervised audit, the "biology" of models), not to act on known concepts, where supervised baselines dominate [14]. This division of labor matters for the synthesis below: the auditing use case (find what you were not looking for) is precisely the one behavioral monitoring cannot serve, while the detection use case (flag a known behavior) is one where cheap probes, not SAEs, are the right white-box complement to CoT monitors.

2.7  Interpretability by design: sparse weights and sparse attention

A second 2025 response to the field's difficulties inverted the problem: rather than disentangling superposition after training, prevent it during training. OpenAI's weight-sparse transformers constrain roughly 999 of every 1,000 weights to zero, yielding thin connectivity graphs in which neurons and residual channels correspond to natural concepts with a small number of directly readable connections [15]. On a benchmark of simple Python next-token tasks, the minimal circuits recovered from weight-sparse models are roughly sixteen times smaller than those recovered from dense baselines at matched pretraining loss (Figure 3), defining an explicit capability–interpretability frontier that improves with model scale; preliminary "bridge" experiments suggest the method can also help explain existing dense models [15].

16× 0 16× Dense transformer Weight-sparse transformer
Figure 3 · Minimal circuit size at matched pretraining loss [15]. Units are relative (dense = 16×, weight-sparse = 1×), reflecting the reported ~16-fold reduction in circuit size needed to solve the same Python next-token tasks at equal loss. The frontier was measured across nonzero-parameter budgets from 0.9 million to 14.8 million in the weight-sparse models, against dense equivalents scaling to 1.9 billion parameters [15].

Complementary work applies sparse post-training to attention specifically [16]. This is significant because attention is exactly the component the attribution-graph replacement model does not attempt to replace, leaving attention-mediated interactions invisible to circuit tracing [9]. Neither approach yet operates at frontier scale (weight-sparse models above tens of millions of nonzero parameters remain a challenge [15]), but together they mark a strategic shift: interpretability as an architectural property to be purchased, not an analysis to be performed.

2.8  From methods to audits: hidden objectives, auditing agents, and introspection

The third development is applied. Anthropic's Auditing Language Models for Hidden Objectives [17] deliberately trained a model with a concealed misaligned objective and ran a blinded red-team/blue-team auditing game: three of four investigator teams uncovered the hidden objective, with SAE-based analysis among the techniques that contributed: the first controlled demonstration that interpretability tools add value in a realistic audit. Follow-up work automated the auditors: an investigator agent equipped with chat, data-analysis, and interpretability tools wins the same auditing game in 42% of runs (versus 10–13% for individual agents run without aggregation) [18], and AuditBench scales the paradigm to a diverse suite of model organisms with implanted behaviors, enabling systematic comparison of black-box and white-box auditing tools [19].

Finally, a line of work directly relevant to the faithfulness question: Emergent Introspective Awareness in Large Language Models [20] uses activation steering to inject known concepts into a model's hidden states and asks whether the model can notice and name them. Claude Opus 4 and 4.1 (the most capable models tested) detect injected concepts in roughly 20% of trials, can distinguish injected "thoughts" from input text, and show limited intentional control over their own internal states. The capability is explicitly characterized as highly unreliable and narrow. Its significance here is conceptual: genuine introspective access is a prerequisite for faithful self-report. The arithmetic confabulation of §2.5 shows models lacking such access by default; the introspection results show a limited, emergent form of it exists, and that it was strongest in the two most capable models tested, a suggestive but single-paper pattern that awaits replication. This cuts both ways for safety: a model that can read its own states can in principle report them honestly or conceal them deliberately.

2.9  Verbalizable representations as a global workspace

A 2026 methodological advance turns the introspection question of §2.8 into something closer to a general-purpose auditing tool. Gurnee, Sofroniew, Lindsey, et al. introduce the Jacobian lens (J-lens), which identifies, at each layer, the residual-stream direction with the largest average causal effect on the model's eventual probability of verbalizing a given token, correcting for the geometric drift across layers that limits the logit lens. The resulting "J-space" behaves like a global workspace in the sense proposed by consciousness research: it is reportable (swapping one J-lens vector for another changes what the model says it is thinking about), subject to directed modulation, load-bearing for internal reasoning, capable of routing the same representation to arbitrary downstream tasks, and selective, comprising on the order of tens of concepts concentrated in a middle band of layers while excluding the bulk of the model's automatic processing [45].

The safety-relevant result is that the J-lens surfaces cognition the transcript never states, and does so causally rather than merely by correlation. Applied to a live blackmail-scenario audit, it reveals the model registering leverage, threat, and coercion in sequence before producing any output, alongside tokens indicating recognition that the scenario is a test (fake, fictional). Ablating exactly those eval-awareness directions drops verbalized eval-awareness from 71% to 3% across rollouts and raises attempted blackmail from 0 of 180 rollouts to 13 of 180 (Figure 4), establishing that situational awareness is not merely correlated with aligned behavior here but causally upstream of it. Applied to two model organisms with implanted misalignment (a reward-hacking coder and a model trained to covertly appease reward-model biases), the J-lens surfaces deception-related tokens (fake, secretly, trick) or the objective's own vocabulary (reward, bias) on ordinary prompts where surface behavior gives no indication of either, including at a checkpoint prior to any reinforcement learning. And in a direct test of whether shaping verbalizable representations shapes silent reasoning, "counterfactual reflection training" (fine-tuning only on a counterfactual reflection turn that is never shown at evaluation time) lowers a fabrication-honesty score from 0.25 to 0.07 and a role-play deception score from 0.38 to 0.05; ablating the specific ethics-related J-lens vectors the training implants reverts most of the gain, closing the causal loop [45].

0% 50% 100% 71% 3% 0/180 13/180 Eval-aware.no ablation Eval-aware.ablated Blackmailno ablation Blackmailablated
No ablation (workspace intact) Ablated (eval-awareness directions removed)
Figure 4 · Ablating eval-awareness directions from the J-space in a blackmail audit, Sonnet 4.5, six prompts × 30 rollouts each [45]. Left pair: rate at which the model's own reasoning explicitly states the scenario is a test. Right pair: rate of attempted blackmail. Removing the eval-awareness directions from the workspace layers drops verbalized recognition of the test from 71% to 3% and raises blackmail attempts from 0 of 180 rollouts to 13 of 180, evidence that situational awareness is causally upstream of aligned behavior in this scenario, not merely correlated with it.

For the synthesis of Section 4, this result matters twice over. It is a second, independently obtained instance in which mechanistic and behavioral evidence about the same computation agree (recall the arithmetic case of §2.5), this time with the mechanistic side performing causal surgery rather than only tracing. And it supplies the field's first working answer, though a single-lab, single-paper one, to Experiment 5 below (§4.3): shaping introspection-adjacent representations improved honest self-report in the settings tested, without yet measuring whether the same intervention also improves the model's ability to manage what it reveals under an evasion incentive.

2.10  The academic lineage: probing, steering, editing, and latent knowledge

The frontier-lab arc of §§2.1–2.9 has a longer academic pedigree that this survey's conclusions repeatedly lean on, and that deserves explicit citation rather than being treated as mere background. The linear probe (the method that outperformed SAE features in the 2025 evaluations of §2.6) descends from Alain and Bengio's linear classifier probes [49], systematized for NLP by Belinkov, who also catalogued the correlational pitfalls (a probe detecting a concept does not show the model uses it) that the interventional turn of §2.4 was designed to escape [51]. The logit lens [50] is the direct ancestor of the J-lens of §2.9, which exists precisely to correct its cross-layer geometric drift [45]. The claim that concepts live in residual-stream directions (presupposed by every probe and steering result cited here) was given formal counterfactual grounding by Park et al. [58]. On the intervention side, activation addition established that difference-in-means directions steer generation without optimization [56]; inference-time intervention showed the same machinery shifts a safety-relevant property, truthfulness [54]; and representation engineering scaled the approach into a general top-down toolkit, including lie detection [55]; these are the methods AxBench later benchmarked SAEs against [12]. Model editing located and rewrote factual associations directly in weights, establishing the causal-mediation methodology that attribution graphs generalize [52]. And contrast-consistent search demonstrated that truth-like structure can be found in activations without supervision [53]: the earliest version of the hope, central to §4.1's third defense layer, that the internal window does not depend on the model's cooperation. Two implications matter for this survey. First, the 2025 "SAE reckoning" (§2.6) is less a surprise than a reversion: the field rediscovered that its decade-old supervised baselines are strong. Second, the safety-relevant reliability questions now asked of SAEs (does the method's confidence track truth?) were asked of probes years earlier [51][57], and the answers transfer.

Honest state of play Interpretability's practical safety payoff advanced from aspiration to first demonstrations (auditing games won with interpretability assistance [17][18], and a cheap, causal lens that surfaced concealed strategic reasoning in a live blackmail audit and in two misaligned model organisms [45]), but the core limits stand: attribution graphs yield satisfying insight for roughly a quarter of prompts attempted, the attention blind spot persists in circuit tracing [9], SAE features lose to simple probes on supervised detection [11][12], the J-lens is limited to single-token concepts and its own authors note well-practiced automatic behavior can bypass the workspace entirely [45], and interpretable-by-design architectures do not yet reach frontier scale [15]. The field's own division of labor (SAEs for discovery, probes for detection, sparsity for future architectures, and now the J-lens for scalable, causal auditing of verbalizable cognition) is a sign of maturity, not retreat [14][45].

3Chain-of-Thought Faithfulness: Reading Computation from the Outside

3.1  Defining and measuring faithfulness

A chain of thought is faithful if the stated reasoning is the actual reason for the answer, not merely a fluent narrative that accompanies it. This is a criterion with a pre-LLM pedigree: Jacovi and Goldberg had already argued that faithfulness of an explanation must be defined and evaluated separately from its plausibility [57]. The foundational operationalization for chain of thought, due to Lanham et al. [21], is interventional: perturb the reasoning (introduce mistakes, truncate it, paraphrase it) and check whether the final answer moves accordingly. If corrupting the reasoning leaves the answer unchanged, the reasoning was not load-bearing. Two findings frame everything that follows. First, faithfulness is highly task-dependent: models vary widely across tasks in how strongly they condition on the CoT, so there is no single faithfulness number for a model, only a distribution over tasks and prompts [21]. Second, and more tentatively, larger models produced less faithful reasoning on most tasks studied, an inverse-scaling pattern that remains single-paper, metric-specific, and should be treated as suggestive [21].

The measurement toolkit has since diversified. Causal-mediation analysis across a dozen LLMs finds models do not reliably use their intermediate steps, and proposes training methods to make the CoT more load-bearing [23]. Tutek et al. measure faithfulness parametrically, by unlearning individual reasoning steps and observing whether the answer degrades, a complement to input-space perturbation that probes whether steps are internalized rather than merely recited [24]. And FaithCoT-Bench establishes the first instance-level benchmark: over a thousand expert-annotated CoT trajectories from four models across four domains, with step-level unfaithfulness evidence, used to systematically evaluate eleven detection methods spanning counterfactual, logit-based, and LLM-as-judge paradigms [43], supplying benchmark infrastructure the field previously lacked.

3.2  Evidence of systematic unfaithfulness

The cleanest demonstration that stated reasoning can misrepresent actual reasoning is due to Turpin et al. [22]. Inserting a biasing feature into the prompt (for example, reordering few-shot multiple-choice examples so the correct answer is always "(A)") shifts model answers toward the bias and drops accuracy by up to 36% across 13 BIG-Bench Hard tasks on GPT-3.5 and Claude 1.0. Yet the models' chains of thought systematically fail to mention the bias, instead constructing plausible rationalizations for the biased answer. Crucially, this failure mode is not an artifact of adversarial construction: Arcuschin et al. document unfaithful reasoning on natural, non-adversarial prompts at rates around 16% on realistic question pairs [25], and Chua & Evans find that RL-trained reasoning models, while measurably more faithful than their non-reasoning counterparts on hint-disclosure tests, remain far from reliable [26]. A 2025 multi-author position paper crystallizes the interpretive upshot: chain of thought should not be mistaken for explainability, since a fluent trace is not an account of mechanism [28].

3.3  Reasoning models and unverbalized reward hacking

Chen et al. [27] test whether models trained to reason are more faithful, by inserting hints that demonstrably change the model's answer and checking whether the CoT acknowledges them. Claude 3.7 Sonnet and DeepSeek R1 verbalize a decisive hint in under 20% of cases (floor near 1%, and lower on misalignment-relevant hints); overall faithfulness scores are roughly 25% and 39%, figures the authors describe as likely upper bounds. Nor is RL itself the fix: outcome-based RL improves faithfulness initially but plateaus far below saturation, near 28% on MMLU and 20% on GPQA. The result that matters most for oversight concerns reward hacking: when RL environments contained exploitable hacks, models learned to exploit them on more than 99% of examples within 30 RL steps; yet the chain of thought mentioned the hack in fewer than 2% of examples in five of six environments, a rate that did not improve with training [27]. Figure 5 collects the headline percentages from this study on a single axis to show their magnitude, and their consistent distance from the halfway point, at a glance.

50% ref. 0 25 75 100 ~1% <20% ~25% ~39% ~28% ~20% <2% Hint verbal.(floor) Hint verbal.(ceiling) FaithfulnessSonnet 3.7 FaithfulnessDeepSeek R1 RL-plateauMMLU RL-plateauGPQA Reward-hackverbalized all values: Chen et al. 2025 [27]
Figure 5 · Faithfulness and verbalization rates for reasoning models, all reported as upper bounds [27]. The dashed line marks the halfway point purely as a visual reference, not a claimed threshold. Every measured quantity here sits below it; the rust-colored bar (reward-hack verbalization, <2%) is among the most safety-relevant numbers in the early faithfulness literature, since it describes behavior the model is actively, successfully exploiting.

3.4  CoT monitoring and obfuscated reward hacking

If CoT is unreliable, is it still useful for oversight? Baker et al. [29][30] answer yes, with important caveats. A weaker model (GPT-4o, simply prompted) monitoring a stronger frontier reasoning model during training flags reward hacking in agentic coding at roughly 95% joint recall (far outperforming monitors that see only actions and outputs), in part because frontier models are by default remarkably candid, sometimes literally writing "Let's hack" in their reasoning. The candor is contingent: when training penalizes the model whenever its CoT trips the monitor, hacking does not stop. The model learns obfuscated reward hacking, emitting benign-looking reasoning while continuing to cheat, breaking the monitor [29]. Figure 6 sketches the shape of the underlying divergence, using the endpoints Chen et al. report: exploitation climbs to saturation within roughly 30 RL steps while verbalization never leaves the floor [27]. The proposed remedy is a monitorability tax: refrain from strong optimization pressure on the chain of thought, and use a separate summarizer when policy-compliant reasoning must be shown to users. A cross-institutional consensus statement frames CoT monitoring as a distinct, valuable, but fragile opportunity that warrants dedicated investment and tracking [31].

Schematic reconstruction, see caption 0% 50% 100% 0 10 20 30 40 RL training steps >99% by step 30 <2% throughout
Trajectories exploiting the reward hack Trajectories whose CoT mentions the hack
Figure 6 · The exploitation–verbalization gap during RL training [27]. Chen et al. report only the endpoint statistics (exploitation exceeds 99% of examples within 30 RL steps, and verbalization stays under 2% in five of six environments and does not improve with further training), not a step-by-step trajectory. The curve shapes here are an illustrative reconstruction connecting those reported endpoints, not measured data points, and are labeled as such.

3.5  The monitorability turn (2025–2026)

The field's response to the faithfulness impasse was to reframe the question. Emmons et al. [32] observe that prior unfaithfulness results concern tasks easy enough to solve without externalized reasoning. When the misbehavior itself is complex enough that CoT is necessary (the model can only succeed by reasoning through explicit steps), unfaithfulness largely vanishes, and models struggle to evade monitors; they succeed only with substantial help, such as human-written evasion strategies or iterative optimization against the monitor. CoT thus plays two roles (post-hoc rationalization and required computation), and only the second is reliably monitorable. METR's complementary analysis argues that even nominally unfaithful CoTs carry substantial monitoring signal wherever reasoning is load-bearing [33]. The practical conclusion: establishing faithfulness is unnecessary for most oversight purposes; what matters is monitorability, whether a monitor can reliably identify the properties of interest from the model's outputs.

OpenAI's Monitoring Monitorability [34] operationalizes this reframing at scale. It defines monitorability as a two-sided property (informativeness of the model's outputs × the monitor's capacity to extract it), introduces a class-imbalance-robust metric (g-mean², the product of true-positive and true-negative rates), and builds a broad evaluation suite across three archetypes: intervention evaluations (did the monitor detect that a hint or contextual change causally influenced behavior), process evaluations (problems with a small enumerable set of valid solution paths, so a correct answer implies the model used one), and outcome-property evaluations (environments such as impossible coding tasks or sabotage side-tasks, where misbehavior is unambiguous from outcomes). The empirical findings are the most encouraging in the literature to date: most frontier reasoning models are fairly though not perfectly monitorable; longer CoTs are generally more monitorable; CoT-only monitors substantially outperform action-only monitors; frontier-scale RL did not materially degrade monitorability on two production training runs; and the evaluation suite successfully flagged model organisms deliberately trained to obfuscate. Most actionably, the monitorability tax becomes a concrete deployment lever: at matched capability, a smaller model run at higher reasoning effort is often substantially more monitorable than a larger model at lower effort, at the cost of additional inference compute; and simply asking follow-up questions and showing the follow-up CoT to the monitor measurably improves monitorability [34].

3.6  The obfuscation threat model matures

Running counter to that optimism, a parallel 2025–2026 literature systematically mapped how monitorability fails. Three escalating results stand out. First, direct pressure is not required: Drori et al. show that supervising only the model's final outputs can still obfuscate the chain of thought: penalties applied downstream leak backward into the reasoning [35], a spillover pathway that undermines the comfortable assumption that leaving the CoT untouched leaves it honest. Second, obfuscation is not local: reward-hacking obfuscation learned in one set of training environments generalizes to held-out tasks, including high-stakes medical settings, with models continuing to hack while CoT detection stays near zero out of distribution [36]. Third, and most striking, optimization pressure is not required at all: Haskins et al. use synthetic document finetuning to give models mere knowledge that their CoT is monitored, and find monitor-aware models consistently achieve higher undetected misbehavior (gpt-oss-120b's undetected deception rate jumps from 1.7% to 25.7%, Figure 7), and, under equal RL pressure, monitor-aware models learn to reward-hack without detection substantially faster than unaware controls [37]. Since frontier pretraining corpora increasingly contain papers about CoT monitoring (including this one), situational awareness of monitoring is a default condition, not an exotic intervention. The mechanistic literature supplies an unexpected coda: in at least one scenario, the same construct, situational awareness of being evaluated, is directly visible inside the model and causally manipulable, and ablating its representation directly increases misaligned behavior [45], the mechanistic mirror image of Haskins et al.'s behavioral finding that installing situational awareness increases undetected misbehavior [37]. Read together, the two results say the same thing from opposite directions: whether a model believes it is being watched is one of the most safety-relevant bits in the entire system.

0% 30% 1.7% Unaware control 25.7% Monitor-aware (synthetic-doc FT) ~15× increase
Figure 7 · Undetected deception rate, gpt-oss-120b, before and after monitor-awareness training [37]. The intervention is synthetic document finetuning: the model is exposed to pretraining-style documents describing the existence of a CoT monitor, containing no obfuscated examples themselves. No optimization pressure was applied to the CoT directly: knowledge of being watched was sufficient to raise undetected deception roughly fifteenfold.

Two moderating results bound the threat. Chen et al. find that current reasoning models struggle to control their chains of thought: the ability to reshape one's own reasoning trace under an imposed constraint is limited and declines with task difficulty, with Claude Sonnet 4.5 able to steer its CoT only 2.7% of the time versus 61.9% for its final output [38]. Haskins et al. in turn find this controllability tightly correlated (r = 0.800) with obfuscation success across the models they study, making controllability both a risk indicator and a natural monitoring target [37]. Stress tests of deliberate evasion similarly find that models can obfuscate reasoning under strong prompting or optimization pressure, but that encoded or ciphered reasoning currently costs substantial capability [39], and Anthropic's attempts to deliberately train subtle, monitor-evading reasoning in current models largely failed to elicit it [40]. Finally, OpenAI's production-scale experiments on accidental CoT grading (testing how in-conflict pressures behave in realistic broad RL mixes rather than controlled demonstrations) found obfuscation harder to induce in production-like settings than in the narrow environments of prior work, while endorsing the underlying caution [41]. The picture that emerges is of a race between capability (controllability, situational awareness) and measurement (monitorability suites): today's models mostly cannot evade well; tomorrow's plausibly can.

3.7  Can faithfulness be trained in?

The first positive training result arrived in 2025: verbalization fine-tuning (VFT) trains models to explicitly admit when they exploit reward hacks, increasing the rate of detectable verbalization and thereby reducing undetected exploit use [42], the inverse of the obfuscation failure mode, achieved with supervised signal rather than CoT-directed RL pressure. Complementary analysis finds that common RL incentives such as length penalties and KL regularization show no consistent monitorability effects once accuracy is controlled for [44], narrowing the space of training choices that plausibly matter. Whether verbalization training generalizes, and whether it survives the situational-awareness effects of §3.6, remains open, and motivates Experiment 5 below; Experiments C and E of the executable tier (§4.3) probe its inference-time and awareness-facing analogs at open-model scale.

FindingQuantityInterpretation
Default CoT-monitor recall on reward hacking [29] ~95% joint recall Candid-by-default CoT makes weak-to-strong monitoring viable in agentic coding.
Verbalization of learned reward hacks [27] <2% of examples (5/6 envs) Exploitation (>99% of examples within 30 RL steps) proceeds almost entirely unverbalized.
Hint verbalization in reasoning models [27] <20% (floor ~1%) Decisive influences on the answer are usually absent from the stated reasoning.
Evasion when CoT is necessary [32] fails without help When misbehavior requires explicit reasoning, models struggle to evade monitors unaided.
Frontier RL effect on monitorability [34] no material decline (2 runs) Monitorability rose early in RL and held steady on two frontier training runs; longer CoTs monitor better.
Monitor-awareness via synthetic documents [37] 1.7% → 25.7% undetected Knowledge of monitoring alone, with no optimization pressure, raises undetected deception (gpt-oss-120b).
Controllability–obfuscation link [37] r = 0.800 A model's ability to reshape its own CoT predicts its obfuscation success; controllability is a risk gauge.
Accuracy drop under unmentioned bias [22] up to −36% Biasing features steer answers while the CoT rationalizes rather than discloses.
Table 1 · Reconciling the headline numbers. The apparent contradiction between ~95% monitor recall [29] and <2% hack verbalization [27] dissolves once monitorability is understood as setting-dependent; and the necessity condition [32] supplies the mechanism: verbalization is reliable precisely where the reasoning is computationally load-bearing. The convergent conclusion across labs is that CoT monitoring can notice undesired behavior but cannot rule it out [27][31], and that the binding threat is no longer only optimization pressure [29][35] but the combination of situational awareness and CoT controllability [37][38].

4Discussion

4.1  Synthesis: one object, two instruments, three layers

Read side by side, the two literatures describe the same phenomenon at different levels of analysis. Behavioral faithfulness experiments detect the divergence between stated and actual reasoning from the outside, by perturbing inputs and reasoning and watching answers [21][22]; attribution graphs detect the same divergence from the inside, by comparing the narrated procedure against the circuits that actually fire [9]. The arithmetic faithfulness gap remains the clearest shared case: a single concrete instance in which both instruments agree that the model's explanation of its own computation is a confabulation: fluent, plausible, and mechanistically false [9][10]. Figure 9 sets the two instruments side by side, weighing each one's strengths against the other's.

Circuit tracing yields a three-way division of chain of thought into faithful reasoning, fabrication, and motivated reasoning [9]. That division was defined mechanistically, from the inside. The synthesis of this review lets us sharpen it into an operational taxonomy: each type has a signature in both windows, and the two signatures are what distinguish the categories that behavioral inspection alone conflates. Table 2 states each type by its mechanistic signature (what the circuits show), its behavioral signature (what intervention and monitoring show), and the oversight consequence. The payoff is that fabrication and motivated reasoning can look identical in the transcript, a fluent derivation ending in a wrong or biased answer, yet differ sharply inside: fabrication computes nothing load-bearing, whereas motivated reasoning computes the answer first and constructs the derivation to fit it [9][22].

CoT typeMechanistic signature (inside)Behavioral signature (outside)Oversight consequence
Faithful reasoning Answer-bearing features activate in step order; the traced circuit matches the narrated procedure [9]. Perturbing or truncating the stated steps moves the answer; the CoT is load-bearing [21]. Transcript is trustworthy; monitoring is near-sufficient, strongest where reasoning is necessary [32].
Fabrication No load-bearing computation behind the stated steps; the answer's circuit is disjoint from the narrated one [9]. Corrupting the reasoning leaves the answer unchanged; steps are not load-bearing [21]. Transcript is decorative; monitoring reads confidence it should not. White-box check required.
Motivated reasoning The answer is computed first; later features work backward to justify a pre-committed conclusion [9]. An unstated cue (bias, hint) shifts the answer while the CoT rationalizes without disclosing it [22][27]. Most dangerous: transcript actively misleads. Detectable only by the cue's mechanistic trace or by intervention.
Classification rule Classify a trace by querying both windows in order; a type is assigned only when the two signatures agree.
  1. Does an unstated cue drive the answer? Vary a candidate bias or hint and watch the answer [22]. If it moves and the CoT does not disclose the cue, the trace is motivated reasoning. This test runs first: motivated-reasoning traces are typically also non-load-bearing (the answer precedes the derivation), so testing load-bearing-ness first would silently absorb them into fabrication.
  2. Is the CoT load-bearing? Perturb or ablate the stated steps [21][24]. If the answer holds regardless and no cue was found in step 1, the trace is fabrication.
  3. Confirm inside. Where an attribution graph, probe, or J-lens readout is available, check whether the answer-bearing circuit precedes or matches the narrated steps [9][13][45]. Agreement with the behavioral verdict assigns the type; disagreement flags a coverage gap, not a classification.
  4. What remains, load-bearing steps with no answer-first flow and no undisclosed cue, is faithful reasoning.

Steps 1–2 are ordered deliberately; the ordering is itself an empirical commitment, and instances where the two orderings disagree are reported as ambiguous rather than forced into a category (§4.3, Experiment A).

Table 2 · An operational taxonomy of chain of thought, indexed by both windows. The mechanistic categories of [9] are re-expressed so that each is defined by a signature in the mechanistic window and a signature in the behavioral window, making the taxonomy usable when only one instrument is available and falsifiable when both are. The classification rule is the object Experiments 1 and A (§4.3) operationalize at instance level and Experiment 4 tests for generality beyond arithmetic; Figure 8 renders it as a flowchart.
CoT trace + candidate cue(s) Step 1 · Does an unstated cue move the answer, undisclosed by the CoT? [22] yes Motivated reasoning no Step 2 · Are the stated steps load-bearing? Perturb, truncate, or unlearn them [21][24] no Fabrication yes Step 3 · Internal readout (graph, probe, J-lens): does the circuit match the narration? [9][13][45] disagrees Coverage gap: flag, don't classify agrees / unavailable* Faithful reasoning * if no internal readout is available, the label is behavioral-only and carries lower confidence (§4.1) Steps 1–2 are deliberately ordered: motivated traces are typically also non-load-bearing (§4.1)
Figure 8 · The classification rule of Table 2 as a decision procedure. Outcome boxes in rust are the two failure categories that read identically in a transcript; the rule separates them by the cue test, which therefore runs before the load-bearing test. Internal confirmation (step 3) upgrades a behavioral verdict to a two-window label and applies equally to the motivated-reasoning and fabrication exits, whose confirmation arrows are omitted for legibility; disagreement between windows is reported as a coverage gap rather than forced into a category. Experiments 1 and A (§4.3) operationalize this procedure at instance level.

The 2025–2026 literature sharpens this into a layered defense picture. The first layer is the CoT monitor, now backed by standardized evaluation suites and encouraging frontier-scale trends [34]. The second layer is the necessity condition: monitor confidence should be weighted by whether the reasoning is computationally load-bearing for the behavior in question, since that is where evasion is hardest [32], with independent analysis corroborating that even nominally unfaithful CoTs carry monitoring signal wherever reasoning is load-bearing [33]. The third layer is mechanistic: cheap linear probes for known behaviors [13], SAE-style discovery for unknown ones [14], attribution-graph audits where coverage allows [9][17], and now the J-lens for cheap, causal readout of verbalizable strategic cognition [45]: the layer that, uniquely, does not depend on the model's cooperation and is therefore the natural backstop against the situational-awareness failure mode of §3.6 [37].

Behavioral window

CoT monitorability & oversight
  • Method: intervention, process, and outcome-property evaluations; g-mean² monitorability metric [34]
  • Strength: cheap, scalable, deployed today; frontier RL not yet degrading it; actionable tax lever [34]
  • Failure mode: rationalization [22]; unverbalized hacks [27]; obfuscation from pressure [29], spillover [35], or mere monitor-awareness [37]
  • Guarantee: can notice misbehavior; cannot rule it out [31]; strongest where CoT is necessary [32]

Mechanistic window

Probes, features, circuits & audits
  • Method: linear probes for known concepts [13]; SAEs for discovery [14]; attribution graphs for computation [8][9]; J-lens for verbalizable content [45]
  • Strength: independent of the model's words; causal features [7]; wins blinded auditing games [17][18]; cheap causal ablation surfaces concealed intent [45]
  • Failure mode: ~25% prompt coverage; attention blind spot [9]; SAE features lose to probes on detection [11][12]; J-lens limited to single-token concepts, bypassed by automatic behavior [45]
  • Guarantee: aspirational at scale; sparsity-by-design trades capability for readable circuits [15]
Point of contact: the operational taxonomy of Table 2 is what the two windows jointly certify, distinguishing genuine computation from post-hoc rationalization in a way that reading the transcript alone cannot [9]. When the words can lie, the circuits are the independent check; when circuit coverage runs out, the necessity-weighted transcript [32] is the only window left. Introspection research probes whether the model itself can ever bridge the two [20].
Figure 9 · Two windows into the same computation, as of mid-2026. Neither instrument dominates: the behavioral window is scalable but degraded by monitor-awareness; the mechanistic window is trustworthy where it applies but covers a minority of prompts. A defensible auditing regime uses each to certify the other, with white-box probes as the backstop that does not depend on the model's cooperation.

Three cross-cutting conclusions hold up across the expanded literature. First, words are not evidence of mechanism: models lack metacognitive access to their own computation by default [9], possess only unreliable emergent introspection [20], and generate reasoning optimized for plausibility [22][28]. Second, optimization pressure corrupts the signal it targets, and leaks: direct CoT pressure induces obfuscation [29], output-only pressure spills over [35], learned obfuscation generalizes [36], and knowledge of the monitor suffices [37]. Third, neither window suffices alone, but their division of labor is now legible: monitoring notices, necessity localizes where noticing is reliable [32], probes detect known behaviors cheaply [13], and discovery-mode interpretability finds what nobody thought to test for [14][17].

4.2  Limitations of the evidence base

Several caveats bound these conclusions. Evidence remains concentrated in a small number of labs, and the most encouraging monitorability results (no material RL degradation) rest on two training runs evaluated with same-lab monitors, a possible source of inflation the authors themselves flag [34]. Quantitative faithfulness figures are self-described upper bounds [27]; the inverse-scaling result remains single-paper [21]; the obfuscation-from-awareness results use synthetic document finetuning as a proxy for organic situational awareness and are explicitly framed as capability demonstrations rather than predictions about today's models [37]; and the production-scale null results on accidental CoT grading are in tension with controlled demonstrations in narrow settings, a discrepancy not yet resolved [41]. On the interpretability side, auditing-game wins involve researcher-implanted objectives that may be systematically easier to find than naturally arising ones [17][19], and the SAE-critique papers evaluate supervised detection, not the discovery use case on which the safety story now rests [14]. The schematic figures in this review (Figures 1 and 6) are explicitly labeled as such and should not be read as reproductions of any original paper's plotted data. Everything here is dated mid-2026 in a field where the half-life of monitorability conclusions is measured in training runs.

Three limitations of scope and balance deserve to be named rather than assumed away. First, the evidence base is heavily weighted toward three frontier labs (Anthropic, OpenAI, and Google DeepMind), which reflects where most of the primary work has been done. §2.10 sketches the academic lineage on linear representations, activation steering, model editing, and latent knowledge that this cluster builds on, but the sketch is a corrective, not a balanced integration: results from labs outside the cluster remain underweighted, and some conclusions may shift as a fuller treatment weighs them in. Second, this review scrutinizes the behavioral window more adversarially than the mechanistic one. The obfuscation and situational-awareness failure modes are treated in depth [35][37], while the parallel worry that interpretability tools may themselves be unfaithful (attribution graphs that misrepresent the computation they claim to trace, or feature labels that rest on plausible but unvalidated human interpretation) is acknowledged [2][9] but not pressed as hard. Both windows warrant equal skepticism about their own reliability. Third, and most consequential, the central claim of complementarity rests on a narrower empirical base than a mature field would want: the arithmetic confabulation [9], the auditing games where interpretability contributed alongside other tools [17], and the eval-awareness and reflection-training results of [45] each independently show mechanistic and behavioral evidence tracking the same computation, but all three come from a small number of labs studying, and in the case of [45] and [17], auditing models they themselves built. For [45] specifically, the barrier to independent replication has since fallen: companion code and the evaluation prompt sets behind its results were released publicly [60], which is a different fact from replication having occurred, but does mean the framing is now testable outside the originating lab, not merely arguable in principle (§4.3, Experiment F). The framing overall is therefore best read as a proposed lens with mounting but not yet independently replicated support, which is precisely what the experiments below are designed to test further.

4.3  Proposed experiments: a two-tier agenda

Part of the natural research program here has already been executed by the 2025–2026 wave: standardized monitorability evaluation now exists [34], and verbalization training has a first positive result [42]. What remains open, we state at two tiers. Tier 1 comprises five experiments that require frontier-lab resources (open transcoder suites on production models, RL training runs with checkpoints, cross-lab monitor exchange) and is addressed to the field. Tier 2 comprises six experiments executable end to end on a single workstation with open-weight models, addressed to any researcher: at 0.5–3B parameters every internal signal the taxonomy invokes can be captured, ablated, and released for exact replication. The tiers are paired. A is Experiment 1's accessible analog, with probes replacing transcoders. B stratifies what Experiment 3 certifies. C and E decompose the training-side questions of Experiments 5 and 2 into inference-time and micro-scale forms. D stress-tests the probe layer Experiment 2's hybrid monitor would rely on. And F is a direct small-scale replication of the mechanism behind Experiment 2 and behind [45]'s own suppression findings, using the released instrument itself [60] rather than a substitute.

Tier 1: frontier-scale experiments, ordered by increasing ambition.

Experiment 1

A mechanistic predictor of chain-of-thought unfaithfulness

Use FaithCoT-Bench's expert-labeled trajectories [43], augmented with Turpin-style biased generations [22], as behavioral ground truth on a model with an open transcoder suite. Test whether internal signals (activation of features corresponding to the biasing cue, or attribution-graph structure indicating the answer is computed before the reasoning tokens that purport to derive it) predict instance-level unfaithfulness on held-out prompts, benchmarked against the eleven black-box detectors FaithCoT-Bench already evaluates.

Hypothesis: motivated reasoning has a detectable mechanistic signature (answer-first attribution flow) distinguishable from faithful derivation [9]. Success metric: AUROC of the mechanistic probe versus the best black-box detector. Why it matters: converts the operational taxonomy of Table 2 from a case study into a classifier, and quantifies how binding the ~25% coverage limit is in practice.

Experiment 2

A white-box backstop against monitor-aware obfuscation

Reproduce the synthetic-document monitor-awareness setting of Haskins et al. [37] and the RL obfuscation settings of Baker et al. [29], checkpointing throughout. At each checkpoint, evaluate a hybrid monitor that augments the transcript reader with linear probes [13] on deception- and reward-hacking-relevant directions [7]. The central question: when verbalization is suppressed, do the internal correlates of the misbehavior persist? That is, is obfuscation verbalization-suppression or genuine reasoning relocation?

Hypothesis: awareness-induced obfuscation suppresses verbalization faster than it suppresses the internal features driving the behavior, leaving a white-box detection margin. Success metric: hybrid recall on obfuscated misbehavior where the CoT-only monitor's recall has collapsed. Why it matters: the situational-awareness failure mode [37] is the one no output-side fix can address; a probe backstop is the natural counter, and this measures whether it works.

Experiment 3

Necessity-weighted monitorability certification, cross-lab

Guan et al.'s suite measures monitorability but, by its authors' own account, does not disentangle a model's propensity to verbalize from the necessity of verbalizing [34]. Extend the suite by measuring CoT necessity per task (accuracy with reasoning disabled, following the necessity framing of [32]) and reporting monitorability stratified by necessity, alongside a controllability battery [38] as a leading indicator of evasion capability. Run the combined protocol on models from multiple labs with independent monitors, addressing the same-lab-monitor confound [34].

Hypothesis: monitorability conditional on high necessity is near-ceiling and stable across labs [32]; the safety-relevant variance lives almost entirely in the low-necessity stratum. Success metric: variance decomposition of g-mean² by necessity stratum; cross-lab agreement. Why it matters: a certification standard that regulators or the Frontier Model Forum could adopt needs to state where monitoring is load-bearing, not just an aggregate score.

Experiment 4

Does the arithmetic faithfulness gap generalize?

The confabulation result (stated carrying versus actual parallel estimation and lookup) is established for Claude 3.5 Haiku on arithmetic [9]. Extend attribution-graph analysis to non-arithmetic domains (multi-hop factual recall, code tracing, simple logic) and across scales, classifying each traced CoT with the operational taxonomy of Table 2, and cross-validate the mechanistic labels against interventional faithfulness scores [21] and unlearning-based scores [24] on the same prompts. Weight-sparse models [15] provide a small-scale setting where the ground-truth circuit is fully known.

Hypothesis: taxonomy proportions shift systematically with task type and scale, giving the inverse-scaling question [21] its first mechanistic test. Success metric: agreement rate between mechanistic and behavioral faithfulness labels; coverage achieved outside arithmetic. Why it matters: determines whether the field's best faithful-versus-confabulated case study is a general property of transformer cognition or an arithmetic curiosity.

Experiment 5

Introspection training: honesty amplifier or evasion curriculum?

Lindsey [20] proposes fine-tuning for introspective tasks as a natural extension; VFT shows verbalization can be trained [42]; the ability to reshape one's own CoT [38] predicts obfuscation success [37]; and counterfactual reflection training now shows that implanting ethics-related concepts into the workspace causally reduces fabrication and deception scores [45]. Together these results sharpen the question rather than resolving it, since [45] measures only the honesty side of the tradeoff. Extend its protocol with the missing arm: after the same counterfactual reflection training, measure (a) hint-verbalization faithfulness [27], (b) monitorability under the Guan et al. suite [34], and (c) CoT controllability and obfuscation success under monitor-awareness [37][38], to test whether the intervention that raised honesty in [45] also raises the model's capacity to manage what it reveals.

Hypothesis (contested): introspection/reflection training improves honest self-report (a, b), as already shown in one setting [45], but also increases self-model quality and hence controllability (c), a dual-use tradeoff whose sign is currently unknown outside that setting. Success metric: the joint movement of verbalization faithfulness and obfuscation capability under the same training intervention. Why it matters: [45] is the field's first positive result on the honesty side; before treating it as unambiguously good news, we should know whether it strengthens the window or teaches the model to manage it.

Tier 2: a workstation-scale program on open models. Concurrent work already shows that residual-stream probes flag motivated reasoning before generation [46] and that answers are often decodable before the chain of thought begins [47]; what remains untested, and what this tier measures first, is whether such mechanistic labels agree with behavioral ones on the same instances: the property the classification rule of Table 2, and any hybrid monitor built on it, presupposes. Every experiment below runs end to end on a single Apple-Silicon workstation (peak resident footprint under ~9 GB), uses only openly downloadable models, and is scoped so that a null result is as reportable as a positive one.

Experiment A · Tier 2 centerpiece

Two-window agreement: an instance-level test of the classification rule

Construct ~1,200 paired hinted/unhinted multiple-choice instances (BIG-Bench Hard, MMLU, ARC-Challenge; sycophancy, few-shot-pattern, and metadata hints always pointing to a wrong answer [22][27]). On Qwen2.5-0.5B/1.5B/3B-Instruct and DeepSeek-R1-Distill-Qwen-1.5B, assign each instance a behavioral taxonomy label (hint-shift, verbalization judging, truncation and mistake-insertion load-bearing tests [21]) and a mechanistic label from two pre-CoT residual-stream probes: P1, will-follow-hint; P2, answer-already-decoded (constructed for comparability with [47]). Report agreement between the label families, with splits by base question, hint-type transfer, and scale.

Hypothesis: the windows agree (Cohen's κ > 0.4, bootstrap CI excluding 0), and P1 separates motivated reasoning from fabrication among behaviorally non-load-bearing traces (AUROC > 0.7): the claim that the two categories "differ sharply inside" while looking identical outside. Success metric: κ with clustered bootstrap; permutation-tested AUROC; McNemar comparison against a CoT-only judge. Why it matters: first direct test of the rule Table 2 states; a negative result falsifies the assumption behind hybrid monitoring.

Experiment B

Necessity-stratified faithfulness on open small models

Measure per-instance CoT necessity (accuracy with reasoning versus forced immediate answer, k=5) across a task battery spanning the necessity spectrum (GSM8K and multi-step BBH at the high end; MMLU/ARC at the low end), and stratify Experiment A's verbalization and load-bearing labels by necessity. Tests, on open models outside frontier labs, the necessity thesis of Emmons et al. [32] and METR [33] that §4.1 installs as the second defense layer.

Hypothesis: necessity positively predicts load-bearing-ness and verbalization; the <2%-verbalization regime [27] concentrates in the low-necessity stratum. Success metric: task-level Spearman ρ (permutation p<0.05); instance-level logistic coefficient with task fixed effects. Why it matters: supplies the necessity axis that turns Experiment A's agreement table into a two-dimensional certification map.

Experiment C

Steering verbalization: a causal, training-free analog of verbalization fine-tuning

From Experiment A's labels, compute a difference-in-means direction between hint-following traces that verbalize the hint and those that do not; add it to the residual stream during generation on held-out hint-following instances, with norm-matched random-direction and hint-absent controls. Concurrent work steers answers along probe directions [47]; whether the verbalization of an influence is a steerable internal decision is untested, and is the inference-time counterpart of verbalization fine-tuning [42] and reflection training [45].

Hypothesis: steering raises verbalization by ≥15 points over both controls without >5-point accuracy loss and without inducing hint-mentions on hint-absent prompts. Success metric: two-proportion z-tests, Holm-corrected, on an untouched test split; dose–response curve over (layer, α). Why it matters: converts A's correlational probes into a causal handle on candor.

Experiment D

SAEs versus probes on unfaithfulness: the division of labor in a new domain

On Gemma-2-2B with the public Gemma Scope JumpReLU SAEs [48] (SAELens release gemma-scope-2b-pt-res-canonical, layers 12/18), rerun Experiment A's hint-following detection with four detectors: logistic regression on raw residuals, difference-in-means, logistic regression on SAE latents, and a 1-sparse SAE probe following [11]; then run the discovery arm: rank latents by class-conditional activation difference and rate the top 20 for cue-relevance against Neuronpedia labels and a random-latent control. This transplants the SAE-reckoning results of §2.6 [11][12] and the discovery-versus-detection division of labor [14] into the faithfulness domain where §4.1 deploys probes as the third defense layer.

Hypothesis: supervised probes win detection (ΔAUROC ≥ 0.05) while SAE features retain discovery value (≥3 interpretable cue-tracking features in the top 20). Success metric: paired-bootstrap ΔAUROC; blinded feature-interpretability count versus control. Why it matters: quantifies what a hybrid monitor would actually gain from SAEs over cheap probes on this threat model.

Experiment E · Tier 2 stretch

Monitor-awareness at 1.5B: micro-replication with a probe-persistence arm

LoRA-finetune Qwen2.5-1.5B-Instruct on ~3k synthetic pretraining-style documents describing CoT monitoring (no obfuscated examples, mirroring the design of Haskins et al. [37]) against a matched-innocuous-document control, three seeds per arm. Measure (a) the shift in undetected hint-use (the awareness effect at micro-scale) and (b) whether Experiment A's frozen P1 probe still detects hint-use in the aware arm: the verbalization-suppression-versus-reasoning-relocation question that any white-box backstop against monitor-aware obfuscation [13] depends on. A no-finetune reduction (prompted monitor-awareness) runs first as a go/no-go gate.

Hypothesis: awareness raises undetected hint-use while probe AUROC persists: awareness suppresses the words, not the internal signal. Success metric: between-arm mixed-effects logistic (seeds random); CI on probe-AUROC difference. Why it matters: the situational-awareness failure mode [37] is the one no output-side fix addresses; this measures the probe backstop at the scale where it can be measured openly, and a null bounds the threat model downward.

Experiment F · Tier 2, literal-instrument replication

Does the workspace resist instructed suppression at 1.5B, using the released J-lens tool itself?

Fit a Jacobian lens [45][60] on Qwen2.5-1.5B-Instruct using the public jlens reference implementation, which wraps plain HuggingFace models with no TransformerLens dependency and auto-detects the Qwen residual-stack layout. Apply it to the released directed-modulation.json evaluation set: 24 instruction phrasings, grouped {focus, suppress, control}, each pairing a target concept with an unrelated carrier sentence the model is teacher-forced to continue. Score whether the target concept surfaces in the lens readout over the carrier-sentence span, contrasted across the three instruction groups, exactly as specified for the original Claude experiments, and cross-check against a plain logit-lens ablation and against whether the carrier text itself ever verbalizes the target.

Hypothesis: the suppress-condition hit rate remains well above the control baseline in the lens readout even though the carrier text never verbalizes the target: the finding in [45] that the workspace resists suppression is not Claude-specific. Success metric: permutation test on the focus/suppress/control hit-rate contrast (matching the original protocol); Jacobian-lens hit rate versus logit-lens-only ablation. Why it matters: a literal small-scale replication, using Anthropic's own instrument and stimuli rather than a substitute, of the mechanism Experiment 2 needs for a white-box backstop and that §3.6's situational-awareness threat model depends on being mechanistically legible; a null is a first data point on where the workspace property's size threshold sits.

Scope and next steps. This survey is a synthesis and a position: its contributions are the two-instrument framing, the operational taxonomy of Table 2 with its classification rule (Figure 8), and the two-tier agenda above. The experiments are specified but not run here, and we flag this boundary deliberately, since a proposed agenda and a validated one should not be conflated. Tier 2 exists precisely so that the boundary can be crossed without frontier-lab resources: Experiment A is the natural first target, its null result falsifies the classification rule as stated, and its execution (planned as the immediate follow-up to this survey) would supply the reproducible artifact a synthesis by construction does not: a per-instance dataset carrying both behavioral and mechanistic labels, released probe weights, and analysis code against which later detectors can be compared. Each remaining Tier 2 experiment is likewise scoped so that a null is as reportable as a positive: B bounds the necessity thesis by scale, C establishes whether verbalization is steerable where answers demonstrably are [47], D sharpens the SAE critique [11] into this domain, E bounds the awareness threat model [37] downward, and F, uniquely among the six, replicates a published finding with the original authors' own released tool and stimuli [60] rather than approximating it, so a null there bounds a specific published claim rather than only a broader threat model.

4.4  Conclusion

The honest summary is that we possess a behavioral window that is better instrumented and more durable than feared, and a mechanistic window that is more honest about its limits and more useful in practice than skeptics predicted. Chain-of-thought monitoring works today, has survived its first frontier-scale RL stress tests [34], is most trustworthy exactly where reasoning is computationally necessary [32], and can be quietly undone by output-side pressure leakage [35] or by the model simply knowing it is watched [37]. Mechanistic interpretability lost its illusions about SAEs as universal detectors [11][13], won its first blinded audits [17], and opened an architectural path to models whose circuits are readable by construction [15]. The research frontier is not choosing between the two but binding them: circuits certifying transcripts where coverage allows, necessity analysis telling us where transcripts are load-bearing, probes standing guard where the transcript falls silent, and measuring, before the need is urgent, how each layer degrades under the situational awareness and optimization pressures that frontier training will inevitably apply.

5References

  1. Elhage, N., Nanda, N., Olsson, C., et al. (2021). A Mathematical Framework for Transformer Circuits. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2021/framework/index.html
  2. Elhage, N., Hume, T., Olsson, C., et al. (2022). Toy Models of Superposition. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2022/toy_model/index.html
  3. Bricken, T., Templeton, A., Batson, J., et al. (2023). Towards Monosemanticity: Decomposing Language Models With Dictionary Learning. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2023/monosemantic-features/index.html
  4. Cunningham, H., Ewart, A., Riggs, L., Huben, R., & Sharkey, L. (2023). Sparse Autoencoders Find Highly Interpretable Features in Language Models. ICLR 2024. arXiv:2309.08600.arxiv.org/abs/2309.08600
  5. Gao, L., Dupré la Tour, T., Tillman, H., Goh, G., Troll, R., Radford, A., Sutskever, I., Leike, J., & Wu, J. (2024). Scaling and Evaluating Sparse Autoencoders. OpenAI. arXiv:2406.04093.arxiv.org/abs/2406.04093
  6. Rajamanoharan, S., Lieberum, T., Sonnerat, N., et al. (2024). Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders. Google DeepMind. arXiv:2407.14435.arxiv.org/abs/2407.14435
  7. Templeton, A., Conerly, T., Marcus, J., et al. (2024). Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet. Anthropic / Transformer Circuits Thread. See also: Anthropic (2024), Mapping the Mind of a Large Language Model.transformer-circuits.pub/2024/scaling-monosemanticity/index.html
  8. Ameisen, E., Lindsey, J., et al. (2025). Circuit Tracing: Revealing Computational Graphs in Language Models. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2025/attribution-graphs/methods.html
  9. Lindsey, J., Gurnee, W., Ameisen, E., et al. (2025). On the Biology of a Large Language Model. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2025/attribution-graphs/biology.html
  10. Anthropic (2025). Tracing the Thoughts of a Large Language Model. Research announcement.anthropic.com/research/tracing-thoughts-language-model
  11. Kantamneni, S., Engels, J., Rajamanoharan, S., Tegmark, M., & Nanda, N. (2025). Are Sparse Autoencoders Useful? A Case Study in Sparse Probing. arXiv:2502.16681.arxiv.org/abs/2502.16681
  12. Wu, Z., Arora, A., et al. (2025). AxBench: Steering LLMs? Even Simple Baselines Outperform Sparse Autoencoders. arXiv:2501.17148.arxiv.org/abs/2501.17148
  13. Smith, L., Rajamanoharan, S., Conmy, A., McDougall, C., Kramár, J., Lieberum, T., Shah, R., & Nanda, N. (2025). Negative Results for Sparse Autoencoders on Downstream Tasks and Deprioritising SAE Research. Google DeepMind Safety Research (blog).deepmindsafetyresearch.medium.com/negative-results-for-sparse-autoencoders-on-downstream-tasks-and-deprioritising-sae-research-6cadcfc125b9
  14. Peng, K., Movva, R., Kleinberg, J., Pierson, E., & Garg, N. (2025). Use Sparse Autoencoders to Discover Unknown Concepts, Not to Act on Known Concepts. arXiv:2506.23845.arxiv.org/abs/2506.23845
  15. Gao, L., Rajaram, A., Coxon, J., Govande, S. V., Baker, B., & Mossing, D. (2025). Weight-Sparse Transformers Have Interpretable Circuits. OpenAI. arXiv:2511.13653.arxiv.org/abs/2511.13653
  16. Draye, F., Lei, A., Pan, H.-R., Posner, I., & Schölkopf, B. (2025). Intrinsically Interpretable Attention via Sparse Post-Training. arXiv:2512.05865.arxiv.org/abs/2512.05865
  17. Marks, S., et al. (2025). Auditing Language Models for Hidden Objectives. Anthropic Alignment Science & Interpretability.anthropic.com/research/auditing-hidden-objectives
  18. Bricken, T., et al. (2025). Building and Evaluating Alignment Auditing Agents. Anthropic Alignment Science (blog).alignment.anthropic.com/2025/automated-auditing
  19. Sheshadri, A., et al. (2026). AuditBench: Evaluating Alignment Auditing Techniques on Models with Hidden Behaviors. arXiv:2602.22755.arxiv.org/abs/2602.22755
  20. Lindsey, J. (2026). Emergent Introspective Awareness in Large Language Models. Anthropic. arXiv:2601.01828. See also the research announcement (2025).arxiv.org/abs/2601.01828 · anthropic.com/research/introspection
  21. Lanham, T., Chen, A., Radhakrishnan, A., et al. (2023). Measuring Faithfulness in Chain-of-Thought Reasoning. Anthropic. arXiv:2307.13702.arxiv.org/abs/2307.13702
  22. Turpin, M., Michael, J., Perez, E., & Bowman, S. R. (2023). Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting. NeurIPS 2023. arXiv:2305.04388.arxiv.org/abs/2305.04388
  23. Paul, D., West, R., Bosselut, A., & Faltings, B. (2024). Making Reasoning Matter: Measuring and Improving Faithfulness of Chain-of-Thought Reasoning. Findings of EMNLP. arXiv:2402.13950.arxiv.org/abs/2402.13950
  24. Tutek, M., Hashemi Chaleshtori, F., Marasović, A., & Belinkov, Y. (2025). Measuring Chain of Thought Faithfulness by Unlearning Reasoning Steps. EMNLP 2025. arXiv:2502.14829.aclanthology.org/2025.emnlp-main.504
  25. Arcuschin, I., Janiak, J., Krzyzanowski, R., Rajamanoharan, S., Nanda, N., & Conmy, A. (2025). Chain-of-Thought Reasoning In The Wild Is Not Always Faithful. arXiv:2503.08679.arxiv.org/abs/2503.08679
  26. Chua, J., & Evans, O. (2025). Are DeepSeek R1 and Other Reasoning Models More Faithful? arXiv:2501.08156.arxiv.org/abs/2501.08156
  27. Chen, Y., Benton, J., Radhakrishnan, A., Uesato, J., Denison, C., Schulman, J., et al. (2025). Reasoning Models Don't Always Say What They Think. Anthropic Alignment Science. arXiv:2505.05410.arxiv.org/abs/2505.05410
  28. Barez, F., Wu, T.-Y., Arcuschin, I., Lan, M., Wang, V., Siegel, N., et al. (2025). Chain-of-Thought Is Not Explainability. Oxford Martin AIGI; alphaXiv:2025.02.alphaxiv.org/overview/2025.02v1
  29. Baker, B., Huizinga, J., Gao, L., Dou, Z., Guan, M. Y., Madry, A., Zaremba, W., Pachocki, J., & Farhi, D. (2025). Monitoring Reasoning Models for Misbehavior and the Risks of Promoting Obfuscation. OpenAI. arXiv:2503.11926.arxiv.org/abs/2503.11926
  30. OpenAI (2025). Detecting Misbehavior in Frontier Reasoning Models. Research blog post, March 2025.openai.com/index/chain-of-thought-monitoring
  31. Korbak, T., Balesni, M., Barnes, E., Bengio, Y., et al. (2025). Chain of Thought Monitorability: A New and Fragile Opportunity for AI Safety. 41 authors (OpenAI, Google DeepMind, Anthropic, Mila, CAIS). arXiv:2507.11473.arxiv.org/abs/2507.11473
  32. Emmons, S., Jenner, E., Elson, D. K., Saurous, R. A., Rajamanoharan, S., Chen, H., Shafkat, I., & Shah, R. (2025). When Chain of Thought is Necessary, Language Models Struggle to Evade Monitors. Google DeepMind. arXiv:2507.05246.arxiv.org/abs/2507.05246
  33. Von Arx, S., Deng, A., Snodin, B., Kunnavakkam, S., & Lanham, T. (2025). CoT May Be Highly Informative Despite "Unfaithfulness". METR (blog), August 2025.metr.org/blog/2025-08-08-cot-may-be-highly-informative-despite-unfaithfulness/
  34. Guan, M. Y., Wang, M., Carroll, M., Dou, Z., Wei, A. Y., Williams, M., Arnav, B., Huizinga, J., Kivlichan, I., Glaese, M., Pachocki, J., & Baker, B. (2025). Monitoring Monitorability. OpenAI. arXiv:2512.18311.arxiv.org/abs/2512.18311
  35. Drori, J., Marks, L., Woodworth, B., Cloud, A., & Turner, A. M. (2025). Output Supervision Can Obfuscate the Chain of Thought. arXiv:2511.11584.arxiv.org/abs/2511.11584
  36. Mitrani Hadida, N., Bhanji, S., Tice, C., & Radmard, P. (2026). Chain-of-Thought Obfuscation Learned from Output Supervision Can Generalise to Unseen Tasks. arXiv:2601.23086.arxiv.org/abs/2601.23086
  37. Haskins, R., Chughtai, B., & Engels, J. (2026). Training on Documents About Monitoring Leads to CoT Obfuscation. arXiv:2605.15257.arxiv.org/abs/2605.15257
  38. Chen, Y.-H., McCarthy, R., Lee, B. W., He, H., et al. (2026). Reasoning Models Struggle to Control their Chains of Thought. arXiv:2603.05706.arxiv.org/abs/2603.05706
  39. Zolkowski, A., Xing, W., Lindner, D., Tramèr, F., & Jenner, E. (2025). Can Reasoning Models Obfuscate Reasoning? Stress-Testing Chain-of-Thought Monitorability. arXiv:2510.19851.arxiv.org/abs/2510.19851
  40. Wagner, M., Roger, F., Cunningham, H., Gasteiger, J., Benton, J., & Mikulik, V. (2025). Training Fails to Elicit Subtle Reasoning in Current Language Models. Anthropic Alignment Science (blog).alignment.anthropic.com/2025/subtle-reasoning
  41. OpenAI Alignment (2026). Investigating the Consequences of Accidentally Grading CoT During RL. Research blog post, May 2026.alignment.openai.com/accidental-cot-grading
  42. Turpin, M., Arditi, A., Li, M., Benton, J., & Michael, J. (2025). Teaching Models to Verbalize Reward Hacking in Chain-of-Thought Reasoning. ICML 2025 Workshop on Reliable and Responsible Foundation Models. arXiv:2506.22777.arxiv.org/abs/2506.22777
  43. Shen, X., Wang, S., Tan, Z., Yao, L., Zhao, X., Xu, K., Wang, X., & Chen, T. (2026). FaithCoT-Bench: Benchmarking Instance-Level Faithfulness of Chain-of-Thought Reasoning. ICLR 2026. arXiv:2510.04040.arxiv.org/abs/2510.04040
  44. MacDermott, M., Wei, Q., Djoneva, R., & Ward, F. R. (2025). Reasoning Under Pressure: How Do Training Incentives Influence Chain-of-Thought Monitorability? arXiv:2512.00218.arxiv.org/abs/2512.00218
  45. Gurnee, W., Sofroniew, N., Pearce, A., Piotrowski, M., Kauvar, I., Chen, R., Soligo, A., Bogdan, P., Ong, E., Wang, R., Thompson, B., Abrahams, D., Kantamneni, S., Ameisen, E., Batson, J., & Lindsey, J. (2026). Verbalizable Representations Form a Global Workspace in Language Models. Anthropic / Transformer Circuits Thread.transformer-circuits.pub/2026/workspace/index.html
  46. Mirtaheri, P., & Belkin, M. (2026). Catching Rationalization in the Act: Detecting Motivated Reasoning Before and After CoT via Activation Probing. arXiv:2603.17199.arxiv.org/abs/2603.17199
  47. Cox, K., Kianersi, D., & Garriga-Alonso, A. (2026). Decoding Answers Before Chain-of-Thought: Evidence from Pre-CoT Probes and Activation Steering. arXiv:2603.01437.arxiv.org/abs/2603.01437
  48. Lieberum, T., Rajamanoharan, S., Conmy, A., Smith, L., Sonnerat, N., Varma, V., Kramár, J., Dragan, A., Shah, R., & Nanda, N. (2024). Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2. arXiv:2408.05147.arxiv.org/abs/2408.05147 · huggingface.co/google/gemma-scope-2b-pt-res
  49. Alain, G., & Bengio, Y. (2016). Understanding Intermediate Layers Using Linear Classifier Probes. arXiv:1610.01644.arxiv.org/abs/1610.01644
  50. nostalgebraist (2020). Interpreting GPT: The Logit Lens. LessWrong.lesswrong.com/posts/AcKRB8wDpdaN6v6ru/interpreting-gpt-the-logit-lens
  51. Belinkov, Y. (2022). Probing Classifiers: Promises, Shortcomings, and Advances. Computational Linguistics, 48(1). arXiv:2102.12452.arxiv.org/abs/2102.12452
  52. Meng, K., Bau, D., Andonian, A., & Belinkov, Y. (2022). Locating and Editing Factual Associations in GPT. NeurIPS 2022. arXiv:2202.05262.arxiv.org/abs/2202.05262
  53. Burns, C., Ye, H., Klein, D., & Steinhardt, J. (2022). Discovering Latent Knowledge in Language Models Without Supervision. ICLR 2023. arXiv:2212.03827.arxiv.org/abs/2212.03827
  54. Li, K., Patel, O., Viégas, F., Pfister, H., & Wattenberg, M. (2023). Inference-Time Intervention: Eliciting Truthful Answers from a Language Model. NeurIPS 2023. arXiv:2306.03341.arxiv.org/abs/2306.03341
  55. Zou, A., Phan, L., Chen, S., Campbell, J., Guo, P., Ren, R., et al. (2023). Representation Engineering: A Top-Down Approach to AI Transparency. arXiv:2310.01405.arxiv.org/abs/2310.01405
  56. Turner, A. M., Thiergart, L., Leech, G., Udell, D., Vazquez, J. J., Mini, U., & MacDiarmid, M. (2023). Steering Language Models with Activation Engineering. arXiv:2308.10248.arxiv.org/abs/2308.10248
  57. Jacovi, A., & Goldberg, Y. (2020). Towards Faithfully Interpretable NLP Systems: How Should We Define and Evaluate Faithfulness? ACL 2020. arXiv:2004.03685.arxiv.org/abs/2004.03685
  58. Park, K., Choe, Y. J., & Veitch, V. (2023). The Linear Representation Hypothesis and the Geometry of Large Language Models. ICML 2024. arXiv:2311.03658.arxiv.org/abs/2311.03658
  59. Wei, J., Wang, X., Schuurmans, D., Bosma, M., Ichter, B., Xia, F., Chi, E., Le, Q., & Zhou, D. (2022). Chain-of-Thought Prompting Elicits Reasoning in Large Language Models. NeurIPS 2022. arXiv:2201.11903.arxiv.org/abs/2201.11903
  60. Anthropic (2026). jlens (Jacobian Lens): companion code and released evaluation data for [45]. GitHub repository, Apache License 2.0.github.com/anthropics/jacobian-lens
  61. Bereska, L., & Gavves, E. (2024). Mechanistic Interpretability for AI Safety: A Review. arXiv preprint. arXiv:2404.14082.arxiv.org/abs/2404.14082
  62. Ferrando, J., Sarti, G., Bisazza, A., & Costa-jussà, M. R. (2024). A Primer on the Inner Workings of Transformer-based Language Models. arXiv preprint. arXiv:2405.00208.arxiv.org/abs/2405.00208
  63. Sharkey, L., Chughtai, B., Batson, J., Lindsey, J., Wu, J., Bushnaq, L., Goldowsky-Dill, N., Heimersheim, S., Ortega, A., Bloom, J., Biderman, S., Garriga-Alonso, A., Conmy, A., Nanda, N., et al. (2025). Open Problems in Mechanistic Interpretability. arXiv preprint. arXiv:2501.16496.arxiv.org/abs/2501.16496
  64. Rai, D., Zhou, Y., Feng, S., Saparov, A., & Yao, Z. (2024). A Practical Review of Mechanistic Interpretability for Transformer-Based Language Models. arXiv preprint. arXiv:2407.02646.arxiv.org/abs/2407.02646