{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FAWFZF2ENPY6NE64CGC7K34R4G","short_pith_number":"pith:FAWFZF2E","schema_version":"1.0","canonical_sha256":"282c5c97446bf1e693dc1185f56f91e19bf18791a8c321a231b71653cb220b98","source":{"kind":"arxiv","id":"2303.05510","version":1},"attestation_state":"computed","paper":{"title":"Planning with Large Language Models for Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.PL"],"primary_cat":"cs.LG","authors_text":"Chuang Gan, Joshua B. Tenenbaum, Mingyu Ding, Shun Zhang, Yikang Shen, Zhenfang Chen","submitted_at":"2023-03-09T18:59:47Z","abstract_excerpt":"Existing large language model-based code generation pipelines typically use beam search or sampling algorithms during the decoding process. Although the programs they generate achieve high token-matching-based scores, they often fail to compile or generate incorrect outputs. The main reason is that conventional Transformer decoding algorithms may not be the best choice for code generation. In this work, we propose a novel Transformer decoding algorithm, Planning-Guided Transformer Decoding (PG-TD), that uses a planning algorithm to do lookahead search and guide the Transformer to generate bett"},"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":"2303.05510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-09T18:59:47Z","cross_cats_sorted":["cs.AI","cs.CL","cs.PL"],"title_canon_sha256":"5c3926319bbfe31e0e2d576b4ec59a803902266583288eab64c81f940fe5aac2","abstract_canon_sha256":"8ebd683e99787888eeb4403ea79f9a454d11a02264240f873e3f36fe6ac89a8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:41.911502Z","signature_b64":"0740239YBAT/++oP3jurK8nvC96qbYAIvo49qUzwx/LpunNs5yC5ToUJDjUt9XXStVsSFYBj0XuxevGYQ8jUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"282c5c97446bf1e693dc1185f56f91e19bf18791a8c321a231b71653cb220b98","last_reissued_at":"2026-07-05T05:49:41.911039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:41.911039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning with Large Language Models for Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.PL"],"primary_cat":"cs.LG","authors_text":"Chuang Gan, Joshua B. Tenenbaum, Mingyu Ding, Shun Zhang, Yikang Shen, Zhenfang Chen","submitted_at":"2023-03-09T18:59:47Z","abstract_excerpt":"Existing large language model-based code generation pipelines typically use beam search or sampling algorithms during the decoding process. Although the programs they generate achieve high token-matching-based scores, they often fail to compile or generate incorrect outputs. The main reason is that conventional Transformer decoding algorithms may not be the best choice for code generation. In this work, we propose a novel Transformer decoding algorithm, Planning-Guided Transformer Decoding (PG-TD), that uses a planning algorithm to do lookahead search and guide the Transformer to generate bett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05510","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/2303.05510/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":"2303.05510","created_at":"2026-07-05T05:49:41.911090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.05510v1","created_at":"2026-07-05T05:49:41.911090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05510","created_at":"2026-07-05T05:49:41.911090+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAWFZF2ENPY6","created_at":"2026-07-05T05:49:41.911090+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAWFZF2ENPY6NE64","created_at":"2026-07-05T05:49:41.911090+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAWFZF2E","created_at":"2026-07-05T05:49:41.911090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05933","citing_title":"Beyond Greedy Chunking: SLO-Aware Sliding-Window Scheduling for LLM Inference","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2510.14703","citing_title":"ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03356","citing_title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24621","citing_title":"Evaluation of LLM-Based Software Engineering Tools: Practices, Challenges, and Future Directions","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18907","citing_title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10449","citing_title":"AdverMCTS: Combating Pseudo-Correctness in Code Generation via Adversarial Monte Carlo Tree Search","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2403.07974","citing_title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16198","citing_title":"Bridging the Gap between User Intent and LLM: A Requirement Alignment Approach for Code Generation","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G","json":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G.json","graph_json":"https://pith.science/api/pith-number/FAWFZF2ENPY6NE64CGC7K34R4G/graph.json","events_json":"https://pith.science/api/pith-number/FAWFZF2ENPY6NE64CGC7K34R4G/events.json","paper":"https://pith.science/paper/FAWFZF2E"},"agent_actions":{"view_html":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G","download_json":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G.json","view_paper":"https://pith.science/paper/FAWFZF2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.05510&json=true","fetch_graph":"https://pith.science/api/pith-number/FAWFZF2ENPY6NE64CGC7K34R4G/graph.json","fetch_events":"https://pith.science/api/pith-number/FAWFZF2ENPY6NE64CGC7K34R4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G/action/storage_attestation","attest_author":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G/action/author_attestation","sign_citation":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G/action/citation_signature","submit_replication":"https://pith.science/pith/FAWFZF2ENPY6NE64CGC7K34R4G/action/replication_record"}},"created_at":"2026-07-05T05:49:41.911090+00:00","updated_at":"2026-07-05T05:49:41.911090+00:00"}