{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F2AORO5QWFCUQMIVJYB3HO6KGB","short_pith_number":"pith:F2AORO5Q","schema_version":"1.0","canonical_sha256":"2e80e8bbb0b1454831154e03b3bbca3055f547c21d781966b7df7f150c261eda","source":{"kind":"arxiv","id":"1703.07469","version":1},"attestation_state":"computed","paper":{"title":"RobustFill: Neural Program Learning under Noisy I/O","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdel-rahman Mohamed, Jacob Devlin, Jonathan Uesato, Pushmeet Kohli, Rishabh Singh, Surya Bhupatiraju","submitted_at":"2017-03-21T23:29:47Z","abstract_excerpt":"The problem of automatically generating a computer program from some specification has been studied since the early days of AI. Recently, two competing approaches for automatic program learning have received significant attention: (1) neural program synthesis, where a neural network is conditioned on input/output (I/O) examples and learns to generate a program, and (2) neural program induction, where a neural network generates new outputs directly using a latent program representation.\n  Here, for the first time, we directly compare both approaches on a large-scale, real-world learning task. W"},"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.07469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-21T23:29:47Z","cross_cats_sorted":[],"title_canon_sha256":"f9504d27a8247d3910ab7219a95f5dfa15a67a7ae5de515297c95f7440931a4c","abstract_canon_sha256":"d387cd0d6b3ec947c728c5039ea0f4fc13cbd747f056c50ac42f7ee4b6cacbd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:08.736732Z","signature_b64":"2rLFA0CBXem3oEVl8Po8un2la9ixXVZRXvQbMgi7Cg08ycDWsCh7KXu4TMN/ahQj1HLOB70JmIvLEdqweyYfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e80e8bbb0b1454831154e03b3bbca3055f547c21d781966b7df7f150c261eda","last_reissued_at":"2026-05-18T00:48:08.736266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:08.736266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RobustFill: Neural Program Learning under Noisy I/O","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdel-rahman Mohamed, Jacob Devlin, Jonathan Uesato, Pushmeet Kohli, Rishabh Singh, Surya Bhupatiraju","submitted_at":"2017-03-21T23:29:47Z","abstract_excerpt":"The problem of automatically generating a computer program from some specification has been studied since the early days of AI. Recently, two competing approaches for automatic program learning have received significant attention: (1) neural program synthesis, where a neural network is conditioned on input/output (I/O) examples and learns to generate a program, and (2) neural program induction, where a neural network generates new outputs directly using a latent program representation.\n  Here, for the first time, we directly compare both approaches on a large-scale, real-world learning task. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07469","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":"1703.07469","created_at":"2026-05-18T00:48:08.736340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07469v1","created_at":"2026-05-18T00:48:08.736340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07469","created_at":"2026-05-18T00:48:08.736340+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2AORO5QWFCU","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2AORO5QWFCUQMIV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2AORO5Q","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2112.00114","citing_title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB","json":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB.json","graph_json":"https://pith.science/api/pith-number/F2AORO5QWFCUQMIVJYB3HO6KGB/graph.json","events_json":"https://pith.science/api/pith-number/F2AORO5QWFCUQMIVJYB3HO6KGB/events.json","paper":"https://pith.science/paper/F2AORO5Q"},"agent_actions":{"view_html":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB","download_json":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB.json","view_paper":"https://pith.science/paper/F2AORO5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07469&json=true","fetch_graph":"https://pith.science/api/pith-number/F2AORO5QWFCUQMIVJYB3HO6KGB/graph.json","fetch_events":"https://pith.science/api/pith-number/F2AORO5QWFCUQMIVJYB3HO6KGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB/action/storage_attestation","attest_author":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB/action/author_attestation","sign_citation":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB/action/citation_signature","submit_replication":"https://pith.science/pith/F2AORO5QWFCUQMIVJYB3HO6KGB/action/replication_record"}},"created_at":"2026-05-18T00:48:08.736340+00:00","updated_at":"2026-05-18T00:48:08.736340+00:00"}