{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/measuring-faithfulness-in-chain-of-thought","title":"Measuring Faithfulness in Chain-of-Thought Reasoning","arxiv_id":"2307.13702","date":"2023-07-17","proceeding":null,"authors":["Tamera Lanham","Anna Chen","Ansh Radhakrishnan","Benoit Steiner","Carson Denison","Danny Hernandez","Dustin Li","Esin Durmus","Evan Hubinger","Jackson Kernion","Kamilė Lukošiūtė","Karina Nguyen","Newton Cheng","Nicholas Joseph","Nicholas Schiefer","Oliver Rausch","Robin Larson","Sam McCandlish","Sandipan Kundu","Saurav Kadavath","Shannon Yang","Thomas Henighan","Timothy Maxwell","Timothy Telleen-Lawton","Tristan Hume","Zac Hatfield-Dodds","Jared Kaplan","Jan Brauner","Samuel R. Bowman","Ethan Perez"],"abstract":"Large language models (LLMs) perform better when they produce step-by-step, \"Chain-of-Thought\" (CoT) reasoning before answering a question, but it is unclear if the stated reasoning is a faithful explanation of the model's actual reasoning (i.e., its process for answering the question). We investigate hypotheses for how CoT reasoning may be unfaithful, by examining how the model predictions change when we intervene on the CoT (e.g., by adding mistakes or paraphrasing it). Models show large variation across tasks in how strongly they condition on the CoT when predicting their answer, sometimes relying heavily on the CoT and other times primarily ignoring it. CoT's performance boost does not seem to come from CoT's added test-time compute alone or from information encoded via the particular phrasing of the CoT. As models become larger and more capable, they produce less faithful reasoning on most tasks we study. Overall, our results suggest that CoT can be faithful if the circumstances such as the model size and task are carefully chosen.","url_abs":"https://arxiv.org/abs/2307.13702v1","url_pdf":"https://arxiv.org/pdf/2307.13702v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"measuring-faithfulness-in-chain-of-thought","repo_url":"https://github.com/technion-cs-nlp/parametric-faithfulness","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2307.13702","atlas_url":"https://app.syntology.ai/?focus=2307.13702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13702"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/technion-cs-nlp/parametric-faithfulness","reach":null}],"summary":{"ran_violates":1,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"listed":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"44dd25d964127b38","entry":"get_batch_loss","repo":"technion-cs-nlp/parametric-faithfulness","repo_kind":"listed","path":"unlearn.py","file_url":"https://github.com/technion-cs-nlp/parametric-faithfulness/blob/HEAD/unlearn.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"44dd25d964127b38"}},{"code_sha256_prefix":"5bf56e40b4301199","entry":"get_linear_schedule_with_warmup","repo":"technion-cs-nlp/parametric-faithfulness","repo_kind":"listed","path":"unlearn.py","file_url":"https://github.com/technion-cs-nlp/parametric-faithfulness/blob/HEAD/unlearn.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"5bf56e40b4301199"}},{"code_sha256_prefix":"2069990162e50256","entry":"run_lm_eval","repo":"technion-cs-nlp/parametric-faithfulness","repo_kind":"listed","path":"unlearn.py","file_url":"https://github.com/technion-cs-nlp/parametric-faithfulness/blob/HEAD/unlearn.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"2069990162e50256"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}