{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SV6JVX2WJDUKW2SOUSNZJXI4LQ","short_pith_number":"pith:SV6JVX2W","schema_version":"1.0","canonical_sha256":"957c9adf5648e8ab6a4ea49b94dd1c5c23c2939a1495f60def400265d2f5f12e","source":{"kind":"arxiv","id":"1509.00413","version":1},"attestation_state":"computed","paper":{"title":"Program Synthesis using Natural Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aditya Desai, Amey Karkare, Mark Marron, Nidhi Jain, Sailesh R, Subhajit Roy, Sumit Gulwani, Vineet Hingorani","submitted_at":"2015-09-01T17:42:49Z","abstract_excerpt":"Interacting with computers is a ubiquitous activity for millions of people. Repetitive or specialized tasks often require creation of small, often one-off, programs. End-users struggle with learning and using the myriad of domain-specific languages (DSLs) to effectively accomplish these tasks.\n  We present a general framework for constructing program synthesizers that take natural language (NL) inputs and produce expressions in a target DSL. The framework takes as input a DSL definition and training data consisting of NL/DSL pairs. From these it constructs a synthesizer by learning optimal wei"},"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":"1509.00413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-01T17:42:49Z","cross_cats_sorted":[],"title_canon_sha256":"bf748de4f053f625586a9b20da1b0fc6ac746e30941346f96243ea9774900191","abstract_canon_sha256":"c6e5be6f092379f8d4393543bdd43aacc3c20fb1e74d4c19863aabc14c04d7cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.150170Z","signature_b64":"KsElNlluPzfzBuHqlfYlEIvvyRcuBF2rJHQ/dkOnH9r46jO0YGHLE5NKX9fBFkfaLmZqTrTKDhv/SqsIyMuZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957c9adf5648e8ab6a4ea49b94dd1c5c23c2939a1495f60def400265d2f5f12e","last_reissued_at":"2026-05-18T01:34:14.149387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.149387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Synthesis using Natural Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aditya Desai, Amey Karkare, Mark Marron, Nidhi Jain, Sailesh R, Subhajit Roy, Sumit Gulwani, Vineet Hingorani","submitted_at":"2015-09-01T17:42:49Z","abstract_excerpt":"Interacting with computers is a ubiquitous activity for millions of people. Repetitive or specialized tasks often require creation of small, often one-off, programs. End-users struggle with learning and using the myriad of domain-specific languages (DSLs) to effectively accomplish these tasks.\n  We present a general framework for constructing program synthesizers that take natural language (NL) inputs and produce expressions in a target DSL. The framework takes as input a DSL definition and training data consisting of NL/DSL pairs. From these it constructs a synthesizer by learning optimal wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00413","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":"1509.00413","created_at":"2026-05-18T01:34:14.149518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00413v1","created_at":"2026-05-18T01:34:14.149518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00413","created_at":"2026-05-18T01:34:14.149518+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV6JVX2WJDUK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV6JVX2WJDUKW2SO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV6JVX2W","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21598","citing_title":"You Don't Need Public Tests to Generate Correct Code","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ","json":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ.json","graph_json":"https://pith.science/api/pith-number/SV6JVX2WJDUKW2SOUSNZJXI4LQ/graph.json","events_json":"https://pith.science/api/pith-number/SV6JVX2WJDUKW2SOUSNZJXI4LQ/events.json","paper":"https://pith.science/paper/SV6JVX2W"},"agent_actions":{"view_html":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ","download_json":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ.json","view_paper":"https://pith.science/paper/SV6JVX2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00413&json=true","fetch_graph":"https://pith.science/api/pith-number/SV6JVX2WJDUKW2SOUSNZJXI4LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SV6JVX2WJDUKW2SOUSNZJXI4LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ/action/storage_attestation","attest_author":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ/action/author_attestation","sign_citation":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ/action/citation_signature","submit_replication":"https://pith.science/pith/SV6JVX2WJDUKW2SOUSNZJXI4LQ/action/replication_record"}},"created_at":"2026-05-18T01:34:14.149518+00:00","updated_at":"2026-05-18T01:34:14.149518+00:00"}