{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4VK7VCRBOFNCYEBQERTDN3BY2E","short_pith_number":"pith:4VK7VCRB","schema_version":"1.0","canonical_sha256":"e555fa8a21715a2c1030246636ec38d128ca554ec742f2bd4a7cdaa33f9af648","source":{"kind":"arxiv","id":"2503.15341","version":1},"attestation_state":"computed","paper":{"title":"Uncertainty-Guided Chain-of-Thought for Code Generation with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ge Li, Hong Mei, Jia Li, Xue Jiang, Yihong Dong, Yuqi Zhu, Zhi Jin","submitted_at":"2025-03-19T15:40:45Z","abstract_excerpt":"Chain-of-Thought (CoT) reasoning has been demonstrated as an effective technique for improving the problem-solving capabilities of large language models (LLMs) in the context of code generation. However, existing CoT methods often exhibit a tendency toward \"overthinking\", where the LLM consistently applies reasoning strategies without adequately considering the task's underlying complexity. This results in the LLMs allocating excessive computational resources, in terms of tokens, to relatively simple tasks or problems where the correct answer is already evident. Additionally, this overthinking"},"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":"2503.15341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-19T15:40:45Z","cross_cats_sorted":[],"title_canon_sha256":"d392e0d1193a2161a644821fc02b78c35013af7040a2132eea0bce6e5f4d2d3c","abstract_canon_sha256":"2de9e712848608ead3b4e8d9c309b494bad60daf6a6c5daf6ceef1999fd80220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:35:24.430795Z","signature_b64":"/nGDEXLVHC9wm7ZxRWpVsbf0kJPAocv9xeTw7vq4sgRx9F5ynpMH7zXUO22Tx+9q9/VmodrHhW+hzWMIBxk1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e555fa8a21715a2c1030246636ec38d128ca554ec742f2bd4a7cdaa33f9af648","last_reissued_at":"2026-07-05T10:35:24.430145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:35:24.430145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty-Guided Chain-of-Thought for Code Generation with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ge Li, Hong Mei, Jia Li, Xue Jiang, Yihong Dong, Yuqi Zhu, Zhi Jin","submitted_at":"2025-03-19T15:40:45Z","abstract_excerpt":"Chain-of-Thought (CoT) reasoning has been demonstrated as an effective technique for improving the problem-solving capabilities of large language models (LLMs) in the context of code generation. However, existing CoT methods often exhibit a tendency toward \"overthinking\", where the LLM consistently applies reasoning strategies without adequately considering the task's underlying complexity. This results in the LLMs allocating excessive computational resources, in terms of tokens, to relatively simple tasks or problems where the correct answer is already evident. Additionally, this overthinking"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15341","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/2503.15341/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":"2503.15341","created_at":"2026-07-05T10:35:24.430212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15341v1","created_at":"2026-07-05T10:35:24.430212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15341","created_at":"2026-07-05T10:35:24.430212+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VK7VCRBOFNC","created_at":"2026-07-05T10:35:24.430212+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VK7VCRBOFNCYEBQ","created_at":"2026-07-05T10:35:24.430212+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VK7VCRB","created_at":"2026-07-05T10:35:24.430212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18089","citing_title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","ref_index":122,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28500","citing_title":"Functional Entropy: Predicting Functional Correctness in LLM-Generated Code with Uncertainty Quantification","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2505.11737","citing_title":"TokUR: Token-Level Uncertainty Estimation for Large Language Model Reasoning","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2506.08980","citing_title":"AdaDec: A Uncertainty-Guided Lookahead Decoding Framework for LLM-Based Code Generation","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08516","citing_title":"OracleTSC: Oracle-Informed Reward Hurdle and Uncertainty Regularization for Traffic Signal Control","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23505","citing_title":"Uncertainty Propagation in LLM-Based Systems","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00433","citing_title":"Improving LLM Code Generation via Requirement-Aware Curriculum Reinforcement Learning","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12214","citing_title":"Structural Anchors and Reasoning Fragility:Understanding CoT Robustness in LLM4Code","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E","json":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E.json","graph_json":"https://pith.science/api/pith-number/4VK7VCRBOFNCYEBQERTDN3BY2E/graph.json","events_json":"https://pith.science/api/pith-number/4VK7VCRBOFNCYEBQERTDN3BY2E/events.json","paper":"https://pith.science/paper/4VK7VCRB"},"agent_actions":{"view_html":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E","download_json":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E.json","view_paper":"https://pith.science/paper/4VK7VCRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15341&json=true","fetch_graph":"https://pith.science/api/pith-number/4VK7VCRBOFNCYEBQERTDN3BY2E/graph.json","fetch_events":"https://pith.science/api/pith-number/4VK7VCRBOFNCYEBQERTDN3BY2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E/action/storage_attestation","attest_author":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E/action/author_attestation","sign_citation":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E/action/citation_signature","submit_replication":"https://pith.science/pith/4VK7VCRBOFNCYEBQERTDN3BY2E/action/replication_record"}},"created_at":"2026-07-05T10:35:24.430212+00:00","updated_at":"2026-07-05T10:35:24.430212+00:00"}