{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VUZQ77QES7KMOWD2CB3CBOONUY","short_pith_number":"pith:VUZQ77QE","schema_version":"1.0","canonical_sha256":"ad330ffe0497d4c7587a107620b9cda639bf3ee660709e17800e1aba0f9ea5f3","source":{"kind":"arxiv","id":"2402.18312","version":2},"attestation_state":"computed","paper":{"title":"How to think step-by-step: A mechanistic understanding of chain-of-thought reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Joykirat Singh, Soumen Chakrabarti, Subhabrata Dutta, Tanmoy Chakraborty","submitted_at":"2024-02-28T13:14:20Z","abstract_excerpt":"Despite superior reasoning prowess demonstrated by Large Language Models (LLMs) with Chain-of-Thought (CoT) prompting, a lack of understanding prevails around the internal mechanisms of the models that facilitate CoT generation. This work investigates the neural sub-structures within LLMs that manifest CoT reasoning from a mechanistic point of view. From an analysis of Llama-2 7B applied to multistep reasoning over fictional ontologies, we demonstrate that LLMs deploy multiple parallel pathways of answer generation for step-by-step reasoning. These parallel pathways provide sequential answers "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.18312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-02-28T13:14:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4093f9bb385b7ad316790cd52c2c1c0093dd42e677319d6bdf7e3c383dd8b215","abstract_canon_sha256":"4bf34d51de40b0b6eebc025b1e99cb4454dda56cf10849c5d2224323828829ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:45.876737Z","signature_b64":"lErEAdlhUOkFzsglPrXLfdkPiSb36CuelwO8w0qtJy5oHepRl4O8P4Vfns3cFL3/jb+9c0GEIA/auMxL3COfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad330ffe0497d4c7587a107620b9cda639bf3ee660709e17800e1aba0f9ea5f3","last_reissued_at":"2026-07-05T08:15:45.876297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:45.876297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to think step-by-step: A mechanistic understanding of chain-of-thought reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Joykirat Singh, Soumen Chakrabarti, Subhabrata Dutta, Tanmoy Chakraborty","submitted_at":"2024-02-28T13:14:20Z","abstract_excerpt":"Despite superior reasoning prowess demonstrated by Large Language Models (LLMs) with Chain-of-Thought (CoT) prompting, a lack of understanding prevails around the internal mechanisms of the models that facilitate CoT generation. This work investigates the neural sub-structures within LLMs that manifest CoT reasoning from a mechanistic point of view. From an analysis of Llama-2 7B applied to multistep reasoning over fictional ontologies, we demonstrate that LLMs deploy multiple parallel pathways of answer generation for step-by-step reasoning. These parallel pathways provide sequential answers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18312","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18312/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.18312","created_at":"2026-07-05T08:15:45.876354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18312v2","created_at":"2026-07-05T08:15:45.876354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18312","created_at":"2026-07-05T08:15:45.876354+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUZQ77QES7KM","created_at":"2026-07-05T08:15:45.876354+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUZQ77QES7KMOWD2","created_at":"2026-07-05T08:15:45.876354+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUZQ77QE","created_at":"2026-07-05T08:15:45.876354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00183","citing_title":"Agentic Transformers Provably Learn to Search via Reinforcement Learning","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06840","citing_title":"Characterize Then Distill: Mechanistic Reasoning in Large Output Spaces","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22870","citing_title":"The Readout Shortcut: Positional Number Copying Dominates Arithmetic CoT Readout in Small Language Models","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2504.05605","citing_title":"ShadowCoT: Cognitive Hijacking for Stealthy Reasoning Backdoors in LLMs","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09708","citing_title":"Beyond I'm Sorry, I Can't: Dissecting Large Language Model Refusal","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2509.23629","citing_title":"Emergent Slow Thinking in LLMs as Inverse Tree Freezing","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01048","citing_title":"Compared to What? Baselines and Metrics for Counterfactual Prompting","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY","json":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY.json","graph_json":"https://pith.science/api/pith-number/VUZQ77QES7KMOWD2CB3CBOONUY/graph.json","events_json":"https://pith.science/api/pith-number/VUZQ77QES7KMOWD2CB3CBOONUY/events.json","paper":"https://pith.science/paper/VUZQ77QE"},"agent_actions":{"view_html":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY","download_json":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY.json","view_paper":"https://pith.science/paper/VUZQ77QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18312&json=true","fetch_graph":"https://pith.science/api/pith-number/VUZQ77QES7KMOWD2CB3CBOONUY/graph.json","fetch_events":"https://pith.science/api/pith-number/VUZQ77QES7KMOWD2CB3CBOONUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY/action/storage_attestation","attest_author":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY/action/author_attestation","sign_citation":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY/action/citation_signature","submit_replication":"https://pith.science/pith/VUZQ77QES7KMOWD2CB3CBOONUY/action/replication_record"}},"created_at":"2026-07-05T08:15:45.876354+00:00","updated_at":"2026-07-05T08:15:45.876354+00:00"}