{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JRB6HNXZI7B7NKBKM26VA25R5K","short_pith_number":"pith:JRB6HNXZ","schema_version":"1.0","canonical_sha256":"4c43e3b6f947c3f6a82a66bd506bb1eaa5dfa52b2c64a5bcb1d84f70fdaf15b3","source":{"kind":"arxiv","id":"2312.05562","version":2},"attestation_state":"computed","paper":{"title":"Chain-of-Thought in Neural Code Generation: From and For Lightweight Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Guang Yang, Taolue Chen, Terry Yue Zhuo, Xiang Chen, Xiangyu Zhang, Yu Zhou","submitted_at":"2023-12-09T12:20:50Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable potential in code generation. The integration of Chain of Thought (CoT) reasoning can further boost their performance. However, current CoT methods often require manual writing or LLMs with over 100 billion parameters to generate, impeding their applicability in resource-constrained scenarios. In this study, we investigate lightweight Language Models (lLMs), which are defined to have fewer than 10 billion parameters. Empirically, we find that most lLMs cannot generate high-quality CoTs when prompted by the few-shot method, but can take "},"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":"2312.05562","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-12-09T12:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"af8960b916dd3deca69d9f062f68d2f0f10850789c3f782d173b01397160cf29","abstract_canon_sha256":"a5060aea5762144cecee0a116b4190ab6d438c235ecd3c57b99a72b41713703d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:45.143613Z","signature_b64":"4UsOVd2y7cN9+gcbI3DuP2BgLr8VqxpcHVxsv4MyE5JTrpsr5b/nZc3OciWVdNfjqb0IblqO3q/SsxMw448HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c43e3b6f947c3f6a82a66bd506bb1eaa5dfa52b2c64a5bcb1d84f70fdaf15b3","last_reissued_at":"2026-07-05T08:51:45.143045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:45.143045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chain-of-Thought in Neural Code Generation: From and For Lightweight Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Guang Yang, Taolue Chen, Terry Yue Zhuo, Xiang Chen, Xiangyu Zhang, Yu Zhou","submitted_at":"2023-12-09T12:20:50Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable potential in code generation. The integration of Chain of Thought (CoT) reasoning can further boost their performance. However, current CoT methods often require manual writing or LLMs with over 100 billion parameters to generate, impeding their applicability in resource-constrained scenarios. In this study, we investigate lightweight Language Models (lLMs), which are defined to have fewer than 10 billion parameters. Empirically, we find that most lLMs cannot generate high-quality CoTs when prompted by the few-shot method, but can take "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05562","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/2312.05562/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":"2312.05562","created_at":"2026-07-05T08:51:45.143107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05562v2","created_at":"2026-07-05T08:51:45.143107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05562","created_at":"2026-07-05T08:51:45.143107+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRB6HNXZI7B7","created_at":"2026-07-05T08:51:45.143107+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRB6HNXZI7B7NKBK","created_at":"2026-07-05T08:51:45.143107+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRB6HNXZ","created_at":"2026-07-05T08:51:45.143107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.13008","citing_title":"Adversarial Reasoning for Repair Based on Inferred Program Intent","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K","json":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K.json","graph_json":"https://pith.science/api/pith-number/JRB6HNXZI7B7NKBKM26VA25R5K/graph.json","events_json":"https://pith.science/api/pith-number/JRB6HNXZI7B7NKBKM26VA25R5K/events.json","paper":"https://pith.science/paper/JRB6HNXZ"},"agent_actions":{"view_html":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K","download_json":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K.json","view_paper":"https://pith.science/paper/JRB6HNXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05562&json=true","fetch_graph":"https://pith.science/api/pith-number/JRB6HNXZI7B7NKBKM26VA25R5K/graph.json","fetch_events":"https://pith.science/api/pith-number/JRB6HNXZI7B7NKBKM26VA25R5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K/action/storage_attestation","attest_author":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K/action/author_attestation","sign_citation":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K/action/citation_signature","submit_replication":"https://pith.science/pith/JRB6HNXZI7B7NKBKM26VA25R5K/action/replication_record"}},"created_at":"2026-07-05T08:51:45.143107+00:00","updated_at":"2026-07-05T08:51:45.143107+00:00"}