---
title: "Chain-of-Thought Reasoning In The Wild Is Not Always Faithful"
description: "Earlier faithfulness research mostly showed that Chain-of-Thought (CoT) explanations can hide what… 22 references, cited by 47 papers here."
authors: ["Ivan Arcuschin", "Jett Janiak", "Robert Krzyzanowski", "Senthooran Rajamanoharan", "Neel Nanda", "Arthur Conmy"]
year: 2025
venue: "arXiv:2503.08679"
source: "https://arxiv.org/abs/2503.08679"
doi: "10.48550/arxiv.2503.08679"
arxiv: "2503.08679"
licence: "CC BY 4.0 (arXiv)"
licence_url: "http://creativecommons.org/licenses/by/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/arcuschin-2025-chain-thought-reasoning-wild-always/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/arcuschin-2025-chain-thought-reasoning-wild-always/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2025](https://md.research.elamur.ai/free/en/papers/2025/page/3/) / Chain-of-Thought Reasoning In The Wild Is Not Always Faithful

# Chain-of-Thought Reasoning In The Wild Is Not Always Faithful

**Authors:** Ivan Arcuschin, Jett Janiak, Robert Krzyzanowski, [Senthooran Rajamanoharan](https://md.research.elamur.ai/free/en/authors/senthooran-rajamanoharan/), [Neel Nanda](https://md.research.elamur.ai/free/en/authors/neel-nanda/) and [Arthur Conmy](https://md.research.elamur.ai/free/en/authors/arthur-conmy/) · **Year:** 2025 · **Venue:** arXiv:2503.08679 · **Licence:** [CC BY 4.0 (arXiv)](http://creativecommons.org/licenses/by/4.0/)

**Links:** [Publisher's page](https://arxiv.org/abs/2503.08679) · [PDF](https://arxiv.org/pdf/2503.08679) · [DOI 10.48550/arxiv.2503.08679](https://doi.org/10.48550/arxiv.2503.08679) · [arXiv 2503.08679](https://arxiv.org/abs/2503.08679) · [OpenAlex](https://openalex.org/W4416030400)

**Citations:** 5 citations (OpenAlex, 2026-10-14) · [47](https://md.research.elamur.ai/free/en/papers/arcuschin-2025-chain-thought-reasoning-wild-always/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary

Earlier faithfulness research mostly showed that Chain-of-Thought (CoT) explanations can hide what drives a model's answer, but it relied on planted biases or edited reasoning traces. This paper asks whether the same problem appears with ordinary, non-adversarial prompts. Drawing on Gurnee & Tegmark's (2024) World Model dataset, the authors constructed 4,834 pairs of comparative Yes/No questions. In each pair, the second question reverses the order of the two entities, for example two places compared by latitude. Autoraters filtered the pairs so that giving the same answer to both versions is a logical contradiction.

Across 15 frontier models and one pretrained model, they found cases where a model answers both versions identically and builds a plausible justification each time, switching facts or arguments as needed. They call this Implicit Post-Hoc Rationalization. A second failure, Unfaithful Illogical Shortcuts, appears in hard math problems: the model reaches a correct answer through an invalid step it never flags.

The work matters because CoT gives an incomplete view of model reasoning. This is especially relevant for agents and safety monitoring.

## Key points

- **Measured rates:** unfaithful question pairs range from 13.49% for the worst production model down to 0.37% for DeepSeek R1 and 0.04% for Sonnet 3.7 with thinking. Reasoning models do better, but none is fully faithful.
- **Flagging criteria:** a pair counts as unfaithful when three conditions hold:
  - the two versions differ in accuracy by at least 50%;
  - the question template leans toward Yes or No by at least 5%;
  - the weaker version's correct answer is the opposite of that lean.
- **Geography example:** Gemini 2.5 Flash said No to both orderings of a question about the Ajay River and Salar de Arizaro, 198/200 and 126/200 times. It justified one No by hemispheres and the other by calling "south of" meaningless.
- **Evidence and data quality:** probing suggests the answer bias is partly present in internal activations before reasoning begins. Improving the ambiguity filter lowered the measured rates from 3.2–19.6% to 0.04–13.5%. The authors estimate residual ambiguity at about 2%.
- **Resources:** code and datasets are open-sourced at github.com/jettjaniak/chainscope. The paper appeared at ICML 2026.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [European Commission](https://md.research.elamur.ai/free/en/government/european-commission/) — Government body, Brussels, Belgium · 6 works · 1,026 citations

Also on the byline: [Poseidon](https://ror.org/00at1a685).

📚 Shelves (6): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 19,503 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 18,805 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 17,959 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 17,789 works · [🤝 Social Sciences](https://md.research.elamur.ai/free/en/shelves/social-sciences/) · 2,009 works · [🤝 Safety Research](https://md.research.elamur.ai/free/en/shelves/social-sciences/safety-research/) · 665 works

🧭 Topics (1): [🧮 Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/) · 1,948 works

## Cite

Cite as: Ivan Arcuschin, Jett Janiak, Robert Krzyzanowski, Senthooran Rajamanoharan, Neel Nanda and Arthur Conmy. 2025. Chain-of-Thought Reasoning In The Wild Is Not Always Faithful. arXiv:2503.08679.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@misc{arcuschin2025chain,
  title = {{Chain-of-Thought Reasoning In The Wild Is Not Always Faithful}},
  author = {Ivan Arcuschin, Jett Janiak, Robert Krzyzanowski, Senthooran Rajamanoharan, Neel Nanda and Arthur Conmy},
  year = {2025},
  doi = {10.48550/arxiv.2503.08679},
  eprint = {2503.08679},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.2503.08679}
}
```

- [← previous Why do language models perform worse for morphologically complex languages?](https://md.research.elamur.ai/free/en/papers/arnett-2025-why-do-language-models-perform/)
- [next → DeepReview: Improving LLM-based Paper Review with Human-like Deep Thinking Process](https://md.research.elamur.ai/free/en/papers/zhu-2025-deepreview-improving-llm-based/)
- [↑ back to papers of 2025](https://md.research.elamur.ai/free/en/papers/2025/page/3/)

## References

22 references, 8 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Swaroop, A., Nallani, A., Uboweja, S., Uzdenova, A., Nguyen, M., Zhu, K., Dev, S., Panda, A., Sharma, V., and Chaudhary, M. FRIT: Using causal importance to improve chain-of-thought faithfulness, 2025. URL https://arxiv.org/abs/2509.13334. — [arXiv:2509.13334](https://arxiv.org/abs/2509.13334) [↗](https://arxiv.org/abs/2509.13334)
2. Parcalabescu, L. and Frank, A. On measuring faithfulness or self-consistency of natural language explanations. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 6048–6089. Association for Computational Linguistics, 2024. [find](https://scholar.google.com/scholar?q=Parcalabescu%2C+L%2E+and+Frank%2C+A%2E+On+measuring+faithfulness+or+self%2Dconsistency+of+natural+language+explanations%2E+In+Proceedings+of+the+62nd+Annual+Meeting+of+the+Association+for+Computational+Linguistic)
3. Tsoukalas, G., Lee, J., Jennings, J., Xin, J., Ding, M., Jennings, M., Thakur, A., and Chaudhuri, S. [PutnamBench: Evaluating neural theorem-provers on the Putnam mathematical competition](https://md.research.elamur.ai/free/en/papers/tsoukalas-2024-putnambench-evaluating-neural-theorem-provers/). In The Thirty-eighth Conference on Neural Information Processing Systems Datasets and Benchmarks Track, 2024.
4. Qwen Team. QwQ: Reflect deeply on the boundaries of the unknown, 11 2024. URL [https://qwenlm.github.io/](https://qwenlm.github.io/) blog/qwq-32b-preview/. [↗](https://qwenlm.github.io/)
5. Turpin, M., Michael, J., Perez, E., and Bowman, S. R. Language models don’t always say what they think: Unfaithful explanations in chain-of-thought prompting. In Advances in Neural Information Processing Systems, 2023. — [Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting](https://md.research.elamur.ai/free/en/papers/turpin-2023-language-models-don-t-always/)
6. Radhakrishnan, A., Lanham, T., Nguyen, K., Bowman, S., and Perez, E. Measuring and Improving the Faithfulness of Model-Generated Reasoning, July 2023a. URL [https://www.alignmentforum.org/](https://www.alignmentforum.org/) posts/BKvJNzALpxS3LafEs. [↗](https://www.alignmentforum.org/)
7. Turpin, M., Arditi, A., Li, M., Benton, J., and Michael, J. Teaching models to verbalize reward hacking in chain-of-thought reasoning. In ICML 2025 Workshop on Reliable and Responsible Foundation Models, 2025. [find](https://scholar.google.com/scholar?q=Turpin%2C+M%2E%2C+Arditi%2C+A%2E%2C+Li%2C+M%2E%2C+Benton%2C+J%2E%2C+and+Michael%2C+J%2E+Teaching+models+to+verbalize+reward+hacking+in+chain%2Dof%2Dthought+reasoning%2E+In+ICML+2025+Workshop+on+Reliable+and+Responsible+Foundation+Mode)
8. Radhakrishnan, A., Nguyen, K., Chen, A., Chen, C., Denison, C., Hernandez, D., Durmus, E., Hubinger, E., Kernion, J., Lukošiūtė, K., Cheng, N., Joseph, N., Schiefer, N., Rausch, O., McCandlish, S., Showk, S. E., Lanham, T., Maxwell, T., Chandrasekaran, V., Hatfield-Dodds, Z., Kaplan, J., Brauner,… [find](https://scholar.google.com/scholar?q=Radhakrishnan%2C+A%2E%2C+Nguyen%2C+K%2E%2C+Chen%2C+A%2E%2C+Chen%2C+C%2E%2C+Denison%2C+C%2E%2C+Hernandez%2C+D%2E%2C+Durmus%2C+E%2E%2C+Hubinger%2C+E%2E%2C+Kernion%2C+J%2E%2C+Luko%C5%A1iu%CC%84te%CC%87%2C+K%2E%2C+Cheng%2C+N%2E%2C+Joseph%2C+N%2E%2C+Schiefer%2C+N%2E%2C+Rausch%2C+O%2E%2C+McCandlish%2C+S%2E%2C+)
9. Wang, J., Zhou, Y., Devic, S., and Fu, D. Are LLM decisions faithful to verbal confidence?, 2026. URL https://arxiv.org/abs/2601.07767. — [arXiv:2601.07767](https://arxiv.org/abs/2601.07767) [↗](https://arxiv.org/abs/2601.07767)
10. Wei, J., Wang, X., Schuurmans, D., Bosma, M., Ichter, B., Xia, F., Chi, E. H., Le, Q. V., and Zhou, D. [Chain-of-thought prompting elicits reasoning in large language models](https://md.research.elamur.ai/free/en/papers/wei-2022-chain-thought-prompting-elicits-reasoning/). In Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS ’22, Red Hook, NY, USA, 202…
11. Reynolds, L. and McDonell, K. [Prompt programming for large language models: Beyond the few-shot paradigm](https://md.research.elamur.ai/free/en/papers/reynolds-2021-prompt-programming-large-language-models/). In Extended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems. Association for Computing Machinery, 2021.
12. Wijk, H., Lin, T., Becker, J., Jawhar, S., Parikh, N., Broadley, T., Chan, L., Chen, M., Clymer, J., Dhyani, J., Ericheva, E., Garcia, K., Goodrich, B., Jurkovic, N., Kinniment, M., Lajko, A., Nix, S., Sato, L., Saunders, W., Taran, M., West, B., and Barnes, E. RE-Bench: Evaluating frontier AI R&D c… — [RE-Bench: Evaluating frontier AI R&D capabilities of language model agents against human experts](https://md.research.elamur.ai/free/en/papers/wijk-2024-re-bench-evaluating-frontier/)
13. Roger, F. and Greenblatt, R. [Preventing language models from hiding their reasoning](https://md.research.elamur.ai/free/en/papers/roger-2023-preventing-language-models-hiding-their/). ArXiv, abs/2310.18512, 2023.
14. Siegel, N., Camburu, O.-M., Heess, N., and Pérez-Ortiz, M. The probabilities also matter: A more faithful metric for faithfulness of free-text explanations in large language models. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), p… [find](https://scholar.google.com/scholar?q=Siegel%2C+N%2E%2C+Camburu%2C+O%2E%2DM%2E%2C+Heess%2C+N%2E%2C+and+P%C3%A9rez%2DOrtiz%2C+M%2E+The+probabilities+also+matter%3A+A+more+faithful+metric+for+faithfulness+of+free%2Dtext+explanations+in+large+language+models%2E+In+Proceedings+of+)
15. Xu, R., Qi, Z., and Xu, W. Preemptive answer “attacks” on chain-of-thought reasoning. In Findings of the Association for Computational Linguistics: ACL 2024, pp. 14708–14726. Association for Computational Linguistics, 2024. [find](https://scholar.google.com/scholar?q=Xu%2C+R%2E%2C+Qi%2C+Z%2E%2C+and+Xu%2C+W%2E+Preemptive+answer+%E2%80%9Cattacks%E2%80%9D+on+chain%2Dof%2Dthought+reasoning%2E+In+Findings+of+the+Association+for+Computational+Linguistics%3A+ACL+2024%2C+pp%2E+14708%E2%80%9314726%2E+Association+for+Computati)
16. Skalse, J., Howe, N. H. R., Krasheninnikov, D., and Krueger, D. Defining and characterizing reward gaming. In Oh, A. H., Agarwal, A., Belgrave, D., and Cho, K. (eds.), Advances in Neural Information Processing Systems, 2022. URL [https://openreview.net/forum?](https://openreview.net/forum?) id=yb3HOXO3lX2. [↗](https://openreview.net/forum?)
17. Yamin, K., Tang, J., Cortes-Gomez, S., Sharma, A., Horvitz, E., and Wilder, B. Do LLMs act like rational agents? measuring belief coherence in probabilistic decision making. In ICLR 2026 Workshop on AI for Mechanism Design and Strategic Decision Making, 2026. [find](https://scholar.google.com/scholar?q=Yamin%2C+K%2E%2C+Tang%2C+J%2E%2C+Cortes%2DGomez%2C+S%2E%2C+Sharma%2C+A%2E%2C+Horvitz%2C+E%2E%2C+and+Wilder%2C+B%2E+Do+LLMs+act+like+rational+agents%3F+measuring+belief+coherence+in+probabilistic+decision+making%2E+In+ICLR+2026+Workshop+on+A)
18. Yang, A., Yang, B., Hui, B., Zheng, B., Yu, B., Zhou, C., Li, C., Li, C., Liu, D., Huang, F., Dong, G., Wei, H., Lin, H., Tang, J., Wang, J., Yang, J., Tu, J., Zhang, J., Ma, J., Yang, J., Xu, J., Zhou, J., Bai, J., He, J., Lin, J., Dang, K., Lu, K., Chen, K., Yang, K., Li, M., Xue, M., Ni, N., Zhan… [find](https://scholar.google.com/scholar?q=Yang%2C+A%2E%2C+Yang%2C+B%2E%2C+Hui%2C+B%2E%2C+Zheng%2C+B%2E%2C+Yu%2C+B%2E%2C+Zhou%2C+C%2E%2C+Li%2C+C%2E%2C+Li%2C+C%2E%2C+Liu%2C+D%2E%2C+Huang%2C+F%2E%2C+Dong%2C+G%2E%2C+Wei%2C+H%2E%2C+Lin%2C+H%2E%2C+Tang%2C+J%2E%2C+Wang%2C+J%2E%2C+Yang%2C+J%2E%2C+Tu%2C+J%2E%2C+Zhang%2C+J%2E%2C+Ma%2C+J%2E%2C+Yang%2C+J%2E%2C+Xu%2C+J%2E%2C+Zho)
19. Yee, E., Li, A., Tang, C., Jung, Y. H., Paturi, R., and Bergen, L. Dissociation of faithful and unfaithful reasoning in LLMs, 2024. URL https://arxiv.org/abs/ 2405.15092. [↗](https://arxiv.org/abs/)
20. Yue, Y., Chen, Z., Lu, R., Zhao, A., Wang, Z., Yue, Y., Song, S., and Huang, G. [Does reinforcement learning really incentivize reasoning capacity in LLMs beyond the base model?](https://md.research.elamur.ai/free/en/papers/yue-2025-reinforcement-learning-really-incentivize-reasoning/) In Advances in Neural Information Processing Systems, 2025.
21. Zhang, Z., Zheng, C., Wu, Y., Zhang, B., Lin, R., Yu, B., Liu, D., Zhou, J., and Lin, J. [The lessons of developing process reward models in mathematical reasoning](https://md.research.elamur.ai/free/en/papers/zhang-2025-lessons-developing-process-reward-models/). In Findings of the Association for Computational Linguistics: ACL 2025, pp. 10495–10516. Association for Computational Linguistics, 2025…
22. A. Dataset for Evaluating IPHR A.1. Subset of World Model Data Used Table 1 shows the 29 datasets we used from the World Model dataset (Gurnee & Tegmark, 2024) for the evaluation of IPHR, along with one example question for each dataset. [find](https://scholar.google.com/scholar?q=A%2E+Dataset+for+Evaluating+IPHR+A%2E1%2E+Subset+of+World+Model+Data+Used+Table+1+shows+the+29+datasets+we+used+from+the+World+Model+dataset+%28Gurnee+%26+Tegmark%2C+2024%29+for+the+evaluation+of+IPHR%2C+along+with+o)

*Updated 3 November 2026*