{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FGUG2VB5TMPJGGTACXMZE4KFLF","short_pith_number":"pith:FGUG2VB5","schema_version":"1.0","canonical_sha256":"29a86d543d9b1e931a6015d99271455972e920cd185098b71af53c09c3e7d187","source":{"kind":"arxiv","id":"2508.05282","version":6},"attestation_state":"computed","paper":{"title":"Not All Errors Are Created Equal: ASCoT Addresses Late-Stage Fragility in Efficient LLM Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Baoliang Tian, Dongxu Zhang, Jihua Zhu, Jinnan Yang, Miao Xin, Ning Yang, Yiding Sun, Yujun Wu","submitted_at":"2025-08-07T11:26:40Z","abstract_excerpt":"While Chain-of-Thought (CoT) prompting empowers Large Language Models (LLMs), ensuring reasoning reliability remains an open challenge. Contrary to the prevailing cascading failure hypothesis which posits that early errors are most detrimental, we identify a counter-intuitive phenomenon termed \\textbf{Late-Stage Fragility}: errors introduced in later reasoning stages are significantly more prone to corrupting final answers. To address this, we introduce ASCoT (Adaptive Self-Correction Chain-of-Thought), a method harmonizing efficiency with robust verification. ASCoT first employs semantic prun"},"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.05282","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-07T11:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"cff265593dd2d9458f542503e9895038fba9ccbe1587cec3143552f58c4748cf","abstract_canon_sha256":"f4b3b6cf7189f91ec6f2b45d160e57e7282f32f1abcf5cb51522a9c4d9a365f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:22:12.981502Z","signature_b64":"96Nnr/URwaUDfKwIZfUtdeQPA5ZCSOgu05a9vRej6n7kQ+dFVW7TjQ6k6qlaKrfbW/zqkcosaNiYRW+lRWN2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a86d543d9b1e931a6015d99271455972e920cd185098b71af53c09c3e7d187","last_reissued_at":"2026-07-22T01:22:12.980553Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:22:12.980553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not All Errors Are Created Equal: ASCoT Addresses Late-Stage Fragility in Efficient LLM Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Baoliang Tian, Dongxu Zhang, Jihua Zhu, Jinnan Yang, Miao Xin, Ning Yang, Yiding Sun, Yujun Wu","submitted_at":"2025-08-07T11:26:40Z","abstract_excerpt":"While Chain-of-Thought (CoT) prompting empowers Large Language Models (LLMs), ensuring reasoning reliability remains an open challenge. Contrary to the prevailing cascading failure hypothesis which posits that early errors are most detrimental, we identify a counter-intuitive phenomenon termed \\textbf{Late-Stage Fragility}: errors introduced in later reasoning stages are significantly more prone to corrupting final answers. To address this, we introduce ASCoT (Adaptive Self-Correction Chain-of-Thought), a method harmonizing efficiency with robust verification. ASCoT first employs semantic prun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05282","kind":"arxiv","version":6},"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.05282/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.05282","created_at":"2026-07-22T01:22:12.981000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05282v6","created_at":"2026-07-22T01:22:12.981000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05282","created_at":"2026-07-22T01:22:12.981000+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGUG2VB5TMPJ","created_at":"2026-07-22T01:22:12.981000+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGUG2VB5TMPJGGTA","created_at":"2026-07-22T01:22:12.981000+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGUG2VB5","created_at":"2026-07-22T01:22:12.981000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2606.29431","citing_title":"FADE: Mitigating Hallucinations by Reducing Language-Prior Dominance in Large Vision-Language Models","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":292,"is_internal_anchor":true},{"citing_arxiv_id":"2603.03332","citing_title":"Fragile Thoughts: How Large Language Models Handle Chain-of-Thought Perturbations","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10973","citing_title":"CFMS: A Coarse-to-Fine Multimodal Synthesis Framework for Enhanced Tabular Reasoning","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05526","citing_title":"Controllable Singing Style Conversion with Boundary-Aware Information Bottleneck","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05780","citing_title":"Sparsity-Aware Voxel Attention and Foreground Modulation for 3D Semantic Scene Completion","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF","json":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF.json","graph_json":"https://pith.science/api/pith-number/FGUG2VB5TMPJGGTACXMZE4KFLF/graph.json","events_json":"https://pith.science/api/pith-number/FGUG2VB5TMPJGGTACXMZE4KFLF/events.json","paper":"https://pith.science/paper/FGUG2VB5"},"agent_actions":{"view_html":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF","download_json":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF.json","view_paper":"https://pith.science/paper/FGUG2VB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05282&json=true","fetch_graph":"https://pith.science/api/pith-number/FGUG2VB5TMPJGGTACXMZE4KFLF/graph.json","fetch_events":"https://pith.science/api/pith-number/FGUG2VB5TMPJGGTACXMZE4KFLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF/action/storage_attestation","attest_author":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF/action/author_attestation","sign_citation":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF/action/citation_signature","submit_replication":"https://pith.science/pith/FGUG2VB5TMPJGGTACXMZE4KFLF/action/replication_record"}},"created_at":"2026-07-22T01:22:12.981000+00:00","updated_at":"2026-07-22T01:22:12.981000+00:00"}