{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KRGVJMJZZPQTGU7DOMVGZPABL5","short_pith_number":"pith:KRGVJMJZ","schema_version":"1.0","canonical_sha256":"544d54b139cbe13353e3732a6cbc015f75677cc81797984a6f06e7b293b0bc61","source":{"kind":"arxiv","id":"2508.11582","version":1},"attestation_state":"computed","paper":{"title":"Aware First, Think Less: Dynamic Boundary Self-Awareness Drives Extreme Reasoning Efficiency in Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dengyun Peng, HuiKang Su, Jiannan Guan, Jinhao Liu, Libo Qin, Qiguang Chen, Wanxiang Che","submitted_at":"2025-08-15T16:40:29Z","abstract_excerpt":"Recent advancements in large language models (LLMs) have greatly improved their capabilities on complex reasoning tasks through Long Chain-of-Thought (CoT). However, this approach often results in substantial redundancy, impairing computational efficiency and causing significant delays in real-time applications. To improve the efficiency, current methods often rely on human-defined difficulty priors, which do not align with the LLM's self-awared difficulty, leading to inefficiencies. In this paper, we introduce the Dynamic Reasoning-Boundary Self-Awareness Framework (DR. SAF), which enables mo"},"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":"2508.11582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-15T16:40:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8c51a6662041cb3e2705d4954a59e476ef30cb045a97d028e62e07dc7bcbb41e","abstract_canon_sha256":"85cfb2480c8dfce644abf68d95c047da8c56e57b8c8b59c05b51772cc0962d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:35.824024Z","signature_b64":"JoEMTMAGM3Z39l1FnvJADvSbLjiXlUu/9QgK+Swl8caF/AoLW1EGK1PCvGoJh24VIoI4yUM3xUyMK9Thhww3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544d54b139cbe13353e3732a6cbc015f75677cc81797984a6f06e7b293b0bc61","last_reissued_at":"2026-07-05T11:54:35.823557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:35.823557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aware First, Think Less: Dynamic Boundary Self-Awareness Drives Extreme Reasoning Efficiency in Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dengyun Peng, HuiKang Su, Jiannan Guan, Jinhao Liu, Libo Qin, Qiguang Chen, Wanxiang Che","submitted_at":"2025-08-15T16:40:29Z","abstract_excerpt":"Recent advancements in large language models (LLMs) have greatly improved their capabilities on complex reasoning tasks through Long Chain-of-Thought (CoT). However, this approach often results in substantial redundancy, impairing computational efficiency and causing significant delays in real-time applications. To improve the efficiency, current methods often rely on human-defined difficulty priors, which do not align with the LLM's self-awared difficulty, leading to inefficiencies. In this paper, we introduce the Dynamic Reasoning-Boundary Self-Awareness Framework (DR. SAF), which enables mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11582","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/2508.11582/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":"2508.11582","created_at":"2026-07-05T11:54:35.823615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11582v1","created_at":"2026-07-05T11:54:35.823615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11582","created_at":"2026-07-05T11:54:35.823615+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRGVJMJZZPQT","created_at":"2026-07-05T11:54:35.823615+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRGVJMJZZPQTGU7D","created_at":"2026-07-05T11:54:35.823615+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRGVJMJZ","created_at":"2026-07-05T11:54:35.823615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11625","citing_title":"Nice Fold or Hero Call: Learning Budget-Efficient Thinking for Adaptive Reasoning","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5","json":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5.json","graph_json":"https://pith.science/api/pith-number/KRGVJMJZZPQTGU7DOMVGZPABL5/graph.json","events_json":"https://pith.science/api/pith-number/KRGVJMJZZPQTGU7DOMVGZPABL5/events.json","paper":"https://pith.science/paper/KRGVJMJZ"},"agent_actions":{"view_html":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5","download_json":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5.json","view_paper":"https://pith.science/paper/KRGVJMJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11582&json=true","fetch_graph":"https://pith.science/api/pith-number/KRGVJMJZZPQTGU7DOMVGZPABL5/graph.json","fetch_events":"https://pith.science/api/pith-number/KRGVJMJZZPQTGU7DOMVGZPABL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5/action/storage_attestation","attest_author":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5/action/author_attestation","sign_citation":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5/action/citation_signature","submit_replication":"https://pith.science/pith/KRGVJMJZZPQTGU7DOMVGZPABL5/action/replication_record"}},"created_at":"2026-07-05T11:54:35.823615+00:00","updated_at":"2026-07-05T11:54:35.823615+00:00"}