{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CB6LK7KVYAA445V4XZKDDGMLKS","short_pith_number":"pith:CB6LK7KV","schema_version":"1.0","canonical_sha256":"107cb57d55c001ce76bcbe5431998b5491d87e7a2ab81b3a5ece8836e43f30de","source":{"kind":"arxiv","id":"2502.07266","version":3},"attestation_state":"computed","paper":{"title":"When More is Less: Understanding Chain-of-Thought Length in LLMs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Stefanie Jegelka, Tianqi Du, Yifei Wang, Yisen Wang, Yuyang Wu, Ziyu Ye","submitted_at":"2025-02-11T05:28:59Z","abstract_excerpt":"Large Language Models (LLMs) employ Chain-of-Thought (CoT) reasoning to deconstruct complex problems. While longer CoTs are often presumed superior, this paper challenges that notion, arguing that longer is not always better. Drawing on combined evidence from real-world observations, controlled experiments, and theoretical analysis, we demonstrate that task accuracy typically follows an inverted U-shaped curve with CoT length, where performance initially improves but eventually decreases as the number of CoT steps increases. With controlled experiments, we further uncover the scaling behaviors"},"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":"2502.07266","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-11T05:28:59Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"a1bb606dcb2fd60302bb6a3a34584f1eb358e24384d9c8fdf04d976913fadd42","abstract_canon_sha256":"75971a079b8c0988f6ebe778d498793622e4225ae0da7c8c49cc2284b3be3bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:04.690004Z","signature_b64":"bcY2Urf1pEKYLfoHUe2J7FO4InewIUr8Mq45LaydsgUSEnkpfLGIDfAihIGCFmLRKeQ6xXFrtYucbre6Yy/CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"107cb57d55c001ce76bcbe5431998b5491d87e7a2ab81b3a5ece8836e43f30de","last_reissued_at":"2026-07-05T11:10:04.689497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:04.689497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When More is Less: Understanding Chain-of-Thought Length in LLMs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Stefanie Jegelka, Tianqi Du, Yifei Wang, Yisen Wang, Yuyang Wu, Ziyu Ye","submitted_at":"2025-02-11T05:28:59Z","abstract_excerpt":"Large Language Models (LLMs) employ Chain-of-Thought (CoT) reasoning to deconstruct complex problems. While longer CoTs are often presumed superior, this paper challenges that notion, arguing that longer is not always better. Drawing on combined evidence from real-world observations, controlled experiments, and theoretical analysis, we demonstrate that task accuracy typically follows an inverted U-shaped curve with CoT length, where performance initially improves but eventually decreases as the number of CoT steps increases. With controlled experiments, we further uncover the scaling behaviors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07266","kind":"arxiv","version":3},"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/2502.07266/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":"2502.07266","created_at":"2026-07-05T11:10:04.689558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07266v3","created_at":"2026-07-05T11:10:04.689558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07266","created_at":"2026-07-05T11:10:04.689558+00:00"},{"alias_kind":"pith_short_12","alias_value":"CB6LK7KVYAA4","created_at":"2026-07-05T11:10:04.689558+00:00"},{"alias_kind":"pith_short_16","alias_value":"CB6LK7KVYAA445V4","created_at":"2026-07-05T11:10:04.689558+00:00"},{"alias_kind":"pith_short_8","alias_value":"CB6LK7KV","created_at":"2026-07-05T11:10:04.689558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08572","citing_title":"Switch-Reasoner: Learn When to Think in Multitask Mixtures via Reinforcement Learning","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18089","citing_title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","ref_index":139,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13316","citing_title":"ReSum: Synergizing LLM Reasoning and Summarization with Reinforcement Learning","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09248","citing_title":"Temporal-Aware Reasoning Optimization for Video Temporal Grounding","ref_index":114,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00862","citing_title":"CAT: Confidence-Adaptive Thinking for Efficient Reasoning of Large Reasoning Models","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01682","citing_title":"Off-the-Shelf LLMs as Process Scorers: Training-Free Alternative to PRMs for Mathematical Reasoning","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01532","citing_title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22211","citing_title":"CLORE: Content-Level Optimization for Reasoning Efficiency","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14457","citing_title":"Stateful Reasoning via Insight Replay","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15764","citing_title":"GRASP: Learning to Ground Social Reasoning in Multi-Person Non-Verbal Interactions","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13045","citing_title":"Draft-Refine-Optimize: Self-Evolved Learning for Natural Language to MongoDB Query Generation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14457","citing_title":"Stateful Reasoning via Insight Replay","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13290","citing_title":"What properties of reasoning supervision are associated with improved downstream model quality?","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16419","citing_title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","ref_index":193,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11625","citing_title":"Nice Fold or Hero Call: Learning Budget-Efficient Thinking for Adaptive Reasoning","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06165","citing_title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06040","citing_title":"Novelty-based Tree-of-Thought Search for LLM Reasoning and Planning","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02290","citing_title":"Distilling Long-CoT Reasoning through Collaborative Step-wise Multi-Teacher Decoding","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01853","citing_title":"Spatiotemporal Hidden-State Dynamics as a Signature of Internal Reasoning in Large Language Models","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS","json":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS.json","graph_json":"https://pith.science/api/pith-number/CB6LK7KVYAA445V4XZKDDGMLKS/graph.json","events_json":"https://pith.science/api/pith-number/CB6LK7KVYAA445V4XZKDDGMLKS/events.json","paper":"https://pith.science/paper/CB6LK7KV"},"agent_actions":{"view_html":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS","download_json":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS.json","view_paper":"https://pith.science/paper/CB6LK7KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07266&json=true","fetch_graph":"https://pith.science/api/pith-number/CB6LK7KVYAA445V4XZKDDGMLKS/graph.json","fetch_events":"https://pith.science/api/pith-number/CB6LK7KVYAA445V4XZKDDGMLKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS/action/storage_attestation","attest_author":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS/action/author_attestation","sign_citation":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS/action/citation_signature","submit_replication":"https://pith.science/pith/CB6LK7KVYAA445V4XZKDDGMLKS/action/replication_record"}},"created_at":"2026-07-05T11:10:04.689558+00:00","updated_at":"2026-07-05T11:10:04.689558+00:00"}