{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LWOKTXLDIU3BFECVXB2YJ3FMNZ","short_pith_number":"pith:LWOKTXLD","schema_version":"1.0","canonical_sha256":"5d9ca9dd634536129055b87584ecac6e4a00f4ef520585ec24fb86c5a4121035","source":{"kind":"arxiv","id":"1703.05698","version":5},"attestation_state":"computed","paper":{"title":"Neural Sketch Learning for Conditional Program Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Chris Jermaine, Letao Qi, Swarat Chaudhuri, Vijayaraghavan Murali","submitted_at":"2017-03-16T16:23:30Z","abstract_excerpt":"We study the problem of generating source code in a strongly typed, Java-like programming language, given a label (for example a set of API calls or types) carrying a small amount of information about the code that is desired. The generated programs are expected to respect a \"realistic\" relationship between programs and labels, as exemplified by a corpus of labeled programs available during training.\n  Two challenges in such conditional program generation are that the generated programs must satisfy a rich set of syntactic and semantic constraints, and that source code contains many low-level "},"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":"1703.05698","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-16T16:23:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"38025249aa4ef0bf394ede735000992d09be7381dafaa727da4ae065bdc3731a","abstract_canon_sha256":"f2edb6e4f9f7a5a2024b0dbb762fbb2a7939f7314f575e72bbe46fbf5e3ec92d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:36.291564Z","signature_b64":"aeo/li40nyxPkCmAGMEEDuWBxLq9yi2IfIZxZ4CUyrSpsnPiEl97WH90iPEvO7NGw03X+tlnJGajDNLmhq/+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9ca9dd634536129055b87584ecac6e4a00f4ef520585ec24fb86c5a4121035","last_reissued_at":"2026-05-18T00:18:36.290959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:36.290959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Sketch Learning for Conditional Program Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Chris Jermaine, Letao Qi, Swarat Chaudhuri, Vijayaraghavan Murali","submitted_at":"2017-03-16T16:23:30Z","abstract_excerpt":"We study the problem of generating source code in a strongly typed, Java-like programming language, given a label (for example a set of API calls or types) carrying a small amount of information about the code that is desired. The generated programs are expected to respect a \"realistic\" relationship between programs and labels, as exemplified by a corpus of labeled programs available during training.\n  Two challenges in such conditional program generation are that the generated programs must satisfy a rich set of syntactic and semantic constraints, and that source code contains many low-level "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05698","kind":"arxiv","version":5},"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":"1703.05698","created_at":"2026-05-18T00:18:36.291052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05698v5","created_at":"2026-05-18T00:18:36.291052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05698","created_at":"2026-05-18T00:18:36.291052+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWOKTXLDIU3B","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWOKTXLDIU3BFECV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWOKTXLD","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2203.07814","citing_title":"Competition-Level Code Generation with AlphaCode","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2102.04664","citing_title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","ref_index":84,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18907","citing_title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ","json":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ.json","graph_json":"https://pith.science/api/pith-number/LWOKTXLDIU3BFECVXB2YJ3FMNZ/graph.json","events_json":"https://pith.science/api/pith-number/LWOKTXLDIU3BFECVXB2YJ3FMNZ/events.json","paper":"https://pith.science/paper/LWOKTXLD"},"agent_actions":{"view_html":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ","download_json":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ.json","view_paper":"https://pith.science/paper/LWOKTXLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05698&json=true","fetch_graph":"https://pith.science/api/pith-number/LWOKTXLDIU3BFECVXB2YJ3FMNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LWOKTXLDIU3BFECVXB2YJ3FMNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ/action/storage_attestation","attest_author":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ/action/author_attestation","sign_citation":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ/action/citation_signature","submit_replication":"https://pith.science/pith/LWOKTXLDIU3BFECVXB2YJ3FMNZ/action/replication_record"}},"created_at":"2026-05-18T00:18:36.291052+00:00","updated_at":"2026-05-18T00:18:36.291052+00:00"}