{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TK3MBQIOGRQSJONR7WJAR6QNLX","short_pith_number":"pith:TK3MBQIO","schema_version":"1.0","canonical_sha256":"9ab6c0c10e346124b9b1fd9208fa0d5dee61c614770c15c1e3bc73d303a6245d","source":{"kind":"arxiv","id":"2505.13379","version":2},"attestation_state":"computed","paper":{"title":"Thinkless: LLM Learns When to Think","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gongfan Fang, Xinchao Wang, Xinyin Ma","submitted_at":"2025-05-19T17:24:16Z","abstract_excerpt":"Reasoning Language Models, capable of extended chain-of-thought reasoning, have demonstrated remarkable performance on tasks requiring complex logical inference. However, applying elaborate reasoning for all queries often results in substantial computational inefficiencies, particularly when many problems admit straightforward solutions. This motivates an open question: Can LLMs learn when to think? To answer this, we propose Thinkless, a learnable framework that empowers an LLM to adaptively select between short-form and long-form reasoning, based on both task complexity and the model's abili"},"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.13379","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-19T17:24:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4480196bc638294b26301b2604c7f28c82bcc39bec02475d30d013ddd9850f5b","abstract_canon_sha256":"05f831d7cb1883320d11ed7e4bca905b5e00178b890f6c490f90ce5f70b2fa1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:30.185488Z","signature_b64":"R41vfKmrn9GWlICJ7r+8kZPQxSVwCsHD+4cgtyLv7y3MSQ11sSCNdLlnby1p7njQUQwELGHbhIp865Zsgd2MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab6c0c10e346124b9b1fd9208fa0d5dee61c614770c15c1e3bc73d303a6245d","last_reissued_at":"2026-07-05T11:27:30.184983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:30.184983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thinkless: LLM Learns When to Think","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gongfan Fang, Xinchao Wang, Xinyin Ma","submitted_at":"2025-05-19T17:24:16Z","abstract_excerpt":"Reasoning Language Models, capable of extended chain-of-thought reasoning, have demonstrated remarkable performance on tasks requiring complex logical inference. However, applying elaborate reasoning for all queries often results in substantial computational inefficiencies, particularly when many problems admit straightforward solutions. This motivates an open question: Can LLMs learn when to think? To answer this, we propose Thinkless, a learnable framework that empowers an LLM to adaptively select between short-form and long-form reasoning, based on both task complexity and the model's abili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13379","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/2505.13379/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.13379","created_at":"2026-07-05T11:27:30.185036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13379v2","created_at":"2026-07-05T11:27:30.185036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13379","created_at":"2026-07-05T11:27:30.185036+00:00"},{"alias_kind":"pith_short_12","alias_value":"TK3MBQIOGRQS","created_at":"2026-07-05T11:27:30.185036+00:00"},{"alias_kind":"pith_short_16","alias_value":"TK3MBQIOGRQSJONR","created_at":"2026-07-05T11:27:30.185036+00:00"},{"alias_kind":"pith_short_8","alias_value":"TK3MBQIO","created_at":"2026-07-05T11:27:30.185036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26463","citing_title":"Finding the Time to Think: Learning Planning Budgets in Real-Time RL","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18089","citing_title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26463","citing_title":"Finding the Time to Think: Learning Planning Budgets in Real-Time RL","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22138","citing_title":"Efficient Agentic Reasoning Through Self-Regulated Simulative Planning","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2602.08324","citing_title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2509.21882","citing_title":"Position: The Hidden Costs and Measurement Gaps of Reinforcement Learning with Verifiable Rewards","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2509.21743","citing_title":"Retrieval-of-Thought: Efficient Reasoning via Reusing Thoughts","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2512.01925","citing_title":"Rectifying LLM Thought from Lens of Optimization","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04120","citing_title":"Shorter, but Still Trustworthy? An Empirical Study of Chain-of-Thought Compression","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01111","citing_title":"When Less is Enough: Efficient Inference via Collaborative Reasoning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06452","citing_title":"Learning to Interrupt in Language-based Multi-agent Communication","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX","json":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX.json","graph_json":"https://pith.science/api/pith-number/TK3MBQIOGRQSJONR7WJAR6QNLX/graph.json","events_json":"https://pith.science/api/pith-number/TK3MBQIOGRQSJONR7WJAR6QNLX/events.json","paper":"https://pith.science/paper/TK3MBQIO"},"agent_actions":{"view_html":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX","download_json":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX.json","view_paper":"https://pith.science/paper/TK3MBQIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13379&json=true","fetch_graph":"https://pith.science/api/pith-number/TK3MBQIOGRQSJONR7WJAR6QNLX/graph.json","fetch_events":"https://pith.science/api/pith-number/TK3MBQIOGRQSJONR7WJAR6QNLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX/action/storage_attestation","attest_author":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX/action/author_attestation","sign_citation":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX/action/citation_signature","submit_replication":"https://pith.science/pith/TK3MBQIOGRQSJONR7WJAR6QNLX/action/replication_record"}},"created_at":"2026-07-05T11:27:30.185036+00:00","updated_at":"2026-07-05T11:27:30.185036+00:00"}