{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:66BG2GRBQ3HOPEMGQJFCJHRYPM","short_pith_number":"pith:66BG2GRB","schema_version":"1.0","canonical_sha256":"f7826d1a2186cee79186824a249e387b1d30405fe8624892eb385b68dcf40a7c","source":{"kind":"arxiv","id":"2411.14503","version":3},"attestation_state":"computed","paper":{"title":"Planning-Driven Programming: A Large Language Model Programming Workflow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Chao Lei, Krista A. Ehinger, Nir Lipovetzky, Yanchuan Chang","submitted_at":"2024-11-21T08:31:06Z","abstract_excerpt":"The strong performance of large language models (LLMs) raises extensive discussion on their application to code generation. Recent research suggests continuous program refinements through visible tests to improve code generation accuracy in LLMs. However, these methods suffer from LLMs' inefficiency and limited reasoning capacity. In this work, we propose an LLM programming workflow (LPW) designed to improve both initial code generation and subsequent refinements within a structured two-phase workflow. Specifically, the solution generation phase formulates a solution plan, which is then verifi"},"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":"2411.14503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-11-21T08:31:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b8fc6298ef65f8dab7f743772671ddd9e8cece75b05781ddf66d270b3535d5db","abstract_canon_sha256":"1448108da85827774b6dddb78a49c483b1f3a57176f565be89a07ca3cd801b8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:13.208068Z","signature_b64":"A58KeM5TkX6s4eiTwKeXKIF4Ls4F0mzcPHWREZVkS126VryuN94ZQI3NVsM9qby9oNeJkbJ/qF152ULGoDBTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7826d1a2186cee79186824a249e387b1d30405fe8624892eb385b68dcf40a7c","last_reissued_at":"2026-07-05T11:08:13.207534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:13.207534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning-Driven Programming: A Large Language Model Programming Workflow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Chao Lei, Krista A. Ehinger, Nir Lipovetzky, Yanchuan Chang","submitted_at":"2024-11-21T08:31:06Z","abstract_excerpt":"The strong performance of large language models (LLMs) raises extensive discussion on their application to code generation. Recent research suggests continuous program refinements through visible tests to improve code generation accuracy in LLMs. However, these methods suffer from LLMs' inefficiency and limited reasoning capacity. In this work, we propose an LLM programming workflow (LPW) designed to improve both initial code generation and subsequent refinements within a structured two-phase workflow. Specifically, the solution generation phase formulates a solution plan, which is then verifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14503","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/2411.14503/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":"2411.14503","created_at":"2026-07-05T11:08:13.207600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14503v3","created_at":"2026-07-05T11:08:13.207600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14503","created_at":"2026-07-05T11:08:13.207600+00:00"},{"alias_kind":"pith_short_12","alias_value":"66BG2GRBQ3HO","created_at":"2026-07-05T11:08:13.207600+00:00"},{"alias_kind":"pith_short_16","alias_value":"66BG2GRBQ3HOPEMG","created_at":"2026-07-05T11:08:13.207600+00:00"},{"alias_kind":"pith_short_8","alias_value":"66BG2GRB","created_at":"2026-07-05T11:08:13.207600+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10481","citing_title":"OIBench: Benchmarking Strong Reasoning Models with Olympiad in Informatics","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM","json":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM.json","graph_json":"https://pith.science/api/pith-number/66BG2GRBQ3HOPEMGQJFCJHRYPM/graph.json","events_json":"https://pith.science/api/pith-number/66BG2GRBQ3HOPEMGQJFCJHRYPM/events.json","paper":"https://pith.science/paper/66BG2GRB"},"agent_actions":{"view_html":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM","download_json":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM.json","view_paper":"https://pith.science/paper/66BG2GRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14503&json=true","fetch_graph":"https://pith.science/api/pith-number/66BG2GRBQ3HOPEMGQJFCJHRYPM/graph.json","fetch_events":"https://pith.science/api/pith-number/66BG2GRBQ3HOPEMGQJFCJHRYPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM/action/storage_attestation","attest_author":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM/action/author_attestation","sign_citation":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM/action/citation_signature","submit_replication":"https://pith.science/pith/66BG2GRBQ3HOPEMGQJFCJHRYPM/action/replication_record"}},"created_at":"2026-07-05T11:08:13.207600+00:00","updated_at":"2026-07-05T11:08:13.207600+00:00"}