{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TI76AIXYSP7J5MQYJVZAHTG6SL","short_pith_number":"pith:TI76AIXY","schema_version":"1.0","canonical_sha256":"9a3fe022f893fe9eb2184d7203ccde92e76c69c1aa2d88a695a2caf9756bac99","source":{"kind":"arxiv","id":"2505.20101","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Deep Reasoning: Triggering Deep Thinking When Needed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Can Xu, Feng Zhang, Fengzong Lian, Tinghao Yu, Yuhao Zhang, Yunhao Wang","submitted_at":"2025-05-26T15:08:51Z","abstract_excerpt":"Large language models (LLMs) have shown impressive capabilities in handling complex tasks through long-chain reasoning. However, the extensive reasoning steps involved can significantly increase computational costs, posing challenges for real-world deployment. Recent efforts have focused on optimizing reasoning efficiency by shortening the Chain-of-Thought (CoT) reasoning processes through various approaches, such as length-aware prompt engineering, supervised fine-tuning on CoT data with variable lengths, and reinforcement learning with length penalties. Although these methods effectively red"},"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.20101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-26T15:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"b601fd0fe5c562ef5e772b77143611aacdb72725ae80fc1e945e3855c984984c","abstract_canon_sha256":"57041e4b7420ba211edf02551d65a1beee969543a2507b9ba58ddc698cb1f7e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:10.708549Z","signature_b64":"C/vJAIs1Oqqv7h5hILlOO5BQxqqY+EtgI3YketXY9ykAiK8oimaV9Oj+fwvZV6aojUnPZ3VkIIjz4qisBMJ8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3fe022f893fe9eb2184d7203ccde92e76c69c1aa2d88a695a2caf9756bac99","last_reissued_at":"2026-07-05T11:10:10.708028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:10.708028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Deep Reasoning: Triggering Deep Thinking When Needed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Can Xu, Feng Zhang, Fengzong Lian, Tinghao Yu, Yuhao Zhang, Yunhao Wang","submitted_at":"2025-05-26T15:08:51Z","abstract_excerpt":"Large language models (LLMs) have shown impressive capabilities in handling complex tasks through long-chain reasoning. However, the extensive reasoning steps involved can significantly increase computational costs, posing challenges for real-world deployment. Recent efforts have focused on optimizing reasoning efficiency by shortening the Chain-of-Thought (CoT) reasoning processes through various approaches, such as length-aware prompt engineering, supervised fine-tuning on CoT data with variable lengths, and reinforcement learning with length penalties. Although these methods effectively red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20101","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.20101/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.20101","created_at":"2026-07-05T11:10:10.708087+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20101v2","created_at":"2026-07-05T11:10:10.708087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20101","created_at":"2026-07-05T11:10:10.708087+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI76AIXYSP7J","created_at":"2026-07-05T11:10:10.708087+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI76AIXYSP7J5MQY","created_at":"2026-07-05T11:10:10.708087+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI76AIXY","created_at":"2026-07-05T11:10:10.708087+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10195","citing_title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10195","citing_title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08232","citing_title":"HiRO-Nav: Hybrid ReasOning Enables Efficient Embodied Navigation","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL","json":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL.json","graph_json":"https://pith.science/api/pith-number/TI76AIXYSP7J5MQYJVZAHTG6SL/graph.json","events_json":"https://pith.science/api/pith-number/TI76AIXYSP7J5MQYJVZAHTG6SL/events.json","paper":"https://pith.science/paper/TI76AIXY"},"agent_actions":{"view_html":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL","download_json":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL.json","view_paper":"https://pith.science/paper/TI76AIXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20101&json=true","fetch_graph":"https://pith.science/api/pith-number/TI76AIXYSP7J5MQYJVZAHTG6SL/graph.json","fetch_events":"https://pith.science/api/pith-number/TI76AIXYSP7J5MQYJVZAHTG6SL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL/action/storage_attestation","attest_author":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL/action/author_attestation","sign_citation":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL/action/citation_signature","submit_replication":"https://pith.science/pith/TI76AIXYSP7J5MQYJVZAHTG6SL/action/replication_record"}},"created_at":"2026-07-05T11:10:10.708087+00:00","updated_at":"2026-07-05T11:10:10.708087+00:00"}