{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I6D57CITKY6UYE6CLZJXO2BGY5","short_pith_number":"pith:I6D57CIT","schema_version":"1.0","canonical_sha256":"4787df8913563d4c13c25e53776826c76b411c53a976c0c551baf3ab829f0e7d","source":{"kind":"arxiv","id":"2505.14183","version":1},"attestation_state":"computed","paper":{"title":"ThinkSwitcher: When to Think Hard, When to Think Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Guosheng Liang, Longguang Zhong, Xiaojun Quan, Ziyi Yang","submitted_at":"2025-05-20T10:40:41Z","abstract_excerpt":"Large reasoning models (LRMs) excel at solving complex tasks by leveraging long chain-of-thought (CoT) reasoning. However, this often leads to overthinking on simple tasks, resulting in unnecessary computational overhead. We observe that LRMs inherently possess the capability for efficient short CoT reasoning, which can be reliably elicited through prompt design. To leverage this capability, we propose ThinkSwitcher, a framework that enables a single LRM to dynamically switch between short and long CoT modes based on task complexity. ThinkSwitcher introduces a lightweight switching module trai"},"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":"2505.14183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-20T10:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"88ff54bc844c62be5c6437198b1dd3cb201228a0291e5d8c6e9423888888bbc5","abstract_canon_sha256":"fae853c04fdf209c5f197a11a69fb1e52c347fbcf0d81d5f53a660d6d0fbd0d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:57.388047Z","signature_b64":"pHdJgMIhj8ePfMieEtZpL2hrVZ1mH2H/TKB4da/IQGpubZFnlzdgzPnv+Dgt5WohARdc8dz74Xag1nSmnlVnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4787df8913563d4c13c25e53776826c76b411c53a976c0c551baf3ab829f0e7d","last_reissued_at":"2026-07-05T11:05:57.387579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:57.387579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ThinkSwitcher: When to Think Hard, When to Think Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Guosheng Liang, Longguang Zhong, Xiaojun Quan, Ziyi Yang","submitted_at":"2025-05-20T10:40:41Z","abstract_excerpt":"Large reasoning models (LRMs) excel at solving complex tasks by leveraging long chain-of-thought (CoT) reasoning. However, this often leads to overthinking on simple tasks, resulting in unnecessary computational overhead. We observe that LRMs inherently possess the capability for efficient short CoT reasoning, which can be reliably elicited through prompt design. To leverage this capability, we propose ThinkSwitcher, a framework that enables a single LRM to dynamically switch between short and long CoT modes based on task complexity. ThinkSwitcher introduces a lightweight switching module trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14183","kind":"arxiv","version":1},"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/2505.14183/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":"2505.14183","created_at":"2026-07-05T11:05:57.387637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14183v1","created_at":"2026-07-05T11:05:57.387637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14183","created_at":"2026-07-05T11:05:57.387637+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6D57CITKY6U","created_at":"2026-07-05T11:05:57.387637+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6D57CITKY6UYE6C","created_at":"2026-07-05T11:05:57.387637+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6D57CIT","created_at":"2026-07-05T11:05:57.387637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22716","citing_title":"Beyond Penalizing Mistakes: Stabilizing Efficiency Training in Large Reasoning Models via Adaptive Correct-Only Rewards","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01518","citing_title":"Overthink-Triggered Slowdown Attacks on LVLM-Based Robotic Systems","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30052","citing_title":"REPOT: Recoverable Program-of-Thought via Checkpoint Repair","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02967","citing_title":"FoE: Forest of Errors Makes the First Solution the Best in Large Reasoning Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10805","citing_title":"Reasoning Is Not Free: Robust Adaptive Cost-Efficient Routing for LLM-as-a-Judge","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5","json":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5.json","graph_json":"https://pith.science/api/pith-number/I6D57CITKY6UYE6CLZJXO2BGY5/graph.json","events_json":"https://pith.science/api/pith-number/I6D57CITKY6UYE6CLZJXO2BGY5/events.json","paper":"https://pith.science/paper/I6D57CIT"},"agent_actions":{"view_html":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5","download_json":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5.json","view_paper":"https://pith.science/paper/I6D57CIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14183&json=true","fetch_graph":"https://pith.science/api/pith-number/I6D57CITKY6UYE6CLZJXO2BGY5/graph.json","fetch_events":"https://pith.science/api/pith-number/I6D57CITKY6UYE6CLZJXO2BGY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5/action/storage_attestation","attest_author":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5/action/author_attestation","sign_citation":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5/action/citation_signature","submit_replication":"https://pith.science/pith/I6D57CITKY6UYE6CLZJXO2BGY5/action/replication_record"}},"created_at":"2026-07-05T11:05:57.387637+00:00","updated_at":"2026-07-05T11:05:57.387637+00:00"}