{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WPL7IZL72ANFFQXWIJWNS6BMOY","short_pith_number":"pith:WPL7IZL7","schema_version":"1.0","canonical_sha256":"b3d7f4657fd01a52c2f6426cd9782c76289f66291965a6746747e088738412dd","source":{"kind":"arxiv","id":"1906.04908","version":1},"attestation_state":"computed","paper":{"title":"SPoC: Search-based Pseudocode to Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Aiken, Kartik Chandra, Mina Lee, Oded Padon, Panupong Pasupat, Percy Liang, Sumith Kulal","submitted_at":"2019-06-12T03:13:18Z","abstract_excerpt":"We consider the task of mapping pseudocode to long programs that are functionally correct. Given test cases as a mechanism to validate programs, we search over the space of possible translations of the pseudocode to find a program that passes the validation. However, without proper credit assignment to localize the sources of program failures, it is difficult to guide search toward more promising programs. We propose to perform credit assignment based on signals from compilation errors, which constitute 88.7% of program failures. Concretely, we treat the translation of each pseudocode line as "},"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":"1906.04908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T03:13:18Z","cross_cats_sorted":["cs.CL","cs.PL","stat.ML"],"title_canon_sha256":"ef50641ca7ffe39753a1769c737b0edad0681deab35c8920d82ce7a0b864c040","abstract_canon_sha256":"690dcfc8595b98f67fc51db67fe209b929fc78efb18a0f236a1a965d322436e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:30.151866Z","signature_b64":"tBYU1tPiO4hW5sE8EzIYJETgbefWT8dXn5di9dVi00F8v0MrUM630pxeR+F1QwxxyM7QmrcluIoOhwDYTkJHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d7f4657fd01a52c2f6426cd9782c76289f66291965a6746747e088738412dd","last_reissued_at":"2026-05-17T23:43:30.151331Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:30.151331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPoC: Search-based Pseudocode to Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Aiken, Kartik Chandra, Mina Lee, Oded Padon, Panupong Pasupat, Percy Liang, Sumith Kulal","submitted_at":"2019-06-12T03:13:18Z","abstract_excerpt":"We consider the task of mapping pseudocode to long programs that are functionally correct. Given test cases as a mechanism to validate programs, we search over the space of possible translations of the pseudocode to find a program that passes the validation. However, without proper credit assignment to localize the sources of program failures, it is difficult to guide search toward more promising programs. We propose to perform credit assignment based on signals from compilation errors, which constitute 88.7% of program failures. Concretely, we treat the translation of each pseudocode line as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04908","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":""},"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":"1906.04908","created_at":"2026-05-17T23:43:30.151409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04908v1","created_at":"2026-05-17T23:43:30.151409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04908","created_at":"2026-05-17T23:43:30.151409+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPL7IZL72ANF","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPL7IZL72ANFFQXW","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPL7IZL7","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2508.15503","citing_title":"Guidelines for Empirical Studies in Software Engineering involving Large Language Models","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2508.15503","citing_title":"Guidelines for Empirical Studies in Software Engineering involving Large Language Models","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2510.04265","citing_title":"Don't Pass@k: A Bayesian Framework for Large Language Model Evaluation","ref_index":78,"is_internal_anchor":true},{"citing_arxiv_id":"2104.08773","citing_title":"Cross-Task Generalization via Natural Language Crowdsourcing Instructions","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2407.21787","citing_title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY","json":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY.json","graph_json":"https://pith.science/api/pith-number/WPL7IZL72ANFFQXWIJWNS6BMOY/graph.json","events_json":"https://pith.science/api/pith-number/WPL7IZL72ANFFQXWIJWNS6BMOY/events.json","paper":"https://pith.science/paper/WPL7IZL7"},"agent_actions":{"view_html":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY","download_json":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY.json","view_paper":"https://pith.science/paper/WPL7IZL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04908&json=true","fetch_graph":"https://pith.science/api/pith-number/WPL7IZL72ANFFQXWIJWNS6BMOY/graph.json","fetch_events":"https://pith.science/api/pith-number/WPL7IZL72ANFFQXWIJWNS6BMOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY/action/storage_attestation","attest_author":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY/action/author_attestation","sign_citation":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY/action/citation_signature","submit_replication":"https://pith.science/pith/WPL7IZL72ANFFQXWIJWNS6BMOY/action/replication_record"}},"created_at":"2026-05-17T23:43:30.151409+00:00","updated_at":"2026-05-17T23:43:30.151409+00:00"}