{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:T7ZIIAEE5HDYJ3XXNIWFOMRHRK","short_pith_number":"pith:T7ZIIAEE","schema_version":"1.0","canonical_sha256":"9ff2840084e9c784eef76a2c5732278aa41698edcca6601aeb87995c178c1615","source":{"kind":"arxiv","id":"2305.06599","version":3},"attestation_state":"computed","paper":{"title":"Structured Chain-of-Thought Prompting for Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Ge Li, Jia Li, Yongmin Li, Zhi Jin","submitted_at":"2023-05-11T06:43:37Z","abstract_excerpt":"Large Language Models (LLMs) (e.g., ChatGPT) have shown impressive performance in code generation. LLMs take prompts as inputs, and Chain-of-Thought (CoT) prompting is the state-of-the-art prompting technique. CoT prompting asks LLMs first to generate CoTs (i.e., intermediate natural language reasoning steps) and then output the code. However, CoT prompting is designed for natural language generation and has low accuracy in code generation.\n  In this paper, we propose Structured CoTs (SCoTs) and present a novel prompting technique for code generation, named SCoT prompting. Our motivation is so"},"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":"2305.06599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2023-05-11T06:43:37Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"a6ec5f0318f8086d08c372952a4bc6a3c0add91bdca877d95ba0d44304fe461f","abstract_canon_sha256":"3b117b93211a45a886c3209916b81e20f05b967d3a7267a846ebf42f688b0350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:34.546012Z","signature_b64":"V8M8HIPWl7JAQrzPT4jK4vY8j4wRN/1OaIocxkPvuk5FywLsEMh7WMZ6Ez1T7mgGLhCLg/0qXeNm1/bnEKmMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ff2840084e9c784eef76a2c5732278aa41698edcca6601aeb87995c178c1615","last_reissued_at":"2026-07-05T06:48:34.545505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:34.545505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Chain-of-Thought Prompting for Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Ge Li, Jia Li, Yongmin Li, Zhi Jin","submitted_at":"2023-05-11T06:43:37Z","abstract_excerpt":"Large Language Models (LLMs) (e.g., ChatGPT) have shown impressive performance in code generation. LLMs take prompts as inputs, and Chain-of-Thought (CoT) prompting is the state-of-the-art prompting technique. CoT prompting asks LLMs first to generate CoTs (i.e., intermediate natural language reasoning steps) and then output the code. However, CoT prompting is designed for natural language generation and has low accuracy in code generation.\n  In this paper, we propose Structured CoTs (SCoTs) and present a novel prompting technique for code generation, named SCoT prompting. Our motivation is so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06599","kind":"arxiv","version":3},"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/2305.06599/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":"2305.06599","created_at":"2026-07-05T06:48:34.545560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06599v3","created_at":"2026-07-05T06:48:34.545560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06599","created_at":"2026-07-05T06:48:34.545560+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7ZIIAEE5HDY","created_at":"2026-07-05T06:48:34.545560+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7ZIIAEE5HDYJ3XX","created_at":"2026-07-05T06:48:34.545560+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7ZIIAEE","created_at":"2026-07-05T06:48:34.545560+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23931","citing_title":"BODHI: Precise OS Kernel Specification Inference","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08992","citing_title":"SpaceVLN: A Zero-Shot Vision-and-Language Navigation Agent with Online Spatial Cognitive Memory and Reasoning","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2404.01535","citing_title":"Assessing, Exploiting, and Mitigating Syntactic Robustness Failures in LLM-Based Code Generation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2603.08715","citing_title":"VeriInteresting: An Empirical Study of Model Prompt Interactions in Verilog Code Generation","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28653","citing_title":"BACE: LLM-based Code Generation through Bayesian Anchored Co-Evolution of Code and Test Populations","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2402.07927","citing_title":"A Systematic Survey of Prompt Engineering in Large Language Models: Techniques and Applications","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21598","citing_title":"You Don't Need Public Tests to Generate Correct Code","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK","json":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK.json","graph_json":"https://pith.science/api/pith-number/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/graph.json","events_json":"https://pith.science/api/pith-number/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/events.json","paper":"https://pith.science/paper/T7ZIIAEE"},"agent_actions":{"view_html":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK","download_json":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK.json","view_paper":"https://pith.science/paper/T7ZIIAEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06599&json=true","fetch_graph":"https://pith.science/api/pith-number/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/graph.json","fetch_events":"https://pith.science/api/pith-number/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/action/storage_attestation","attest_author":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/action/author_attestation","sign_citation":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/action/citation_signature","submit_replication":"https://pith.science/pith/T7ZIIAEE5HDYJ3XXNIWFOMRHRK/action/replication_record"}},"created_at":"2026-07-05T06:48:34.545560+00:00","updated_at":"2026-07-05T06:48:34.545560+00:00"}