{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2SORW7GSCOKGM7W37MYZOB3YV7","short_pith_number":"pith:2SORW7GS","canonical_record":{"source":{"id":"1805.04276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-11T08:45:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0ddd14097f9cb4d78a50e7115c77e856b61a196d4f2e450acef00afe4cd92bc3","abstract_canon_sha256":"c73468eec9dfe727bbb948329364652e70dd39769d95dd80de5429de95936a3f"},"schema_version":"1.0"},"canonical_sha256":"d49d1b7cd21394667edbfb31970778affce7a0487cb2e0eb8ca4c6646837485f","source":{"kind":"arxiv","id":"1805.04276","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04276","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04276v2","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04276","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"2SORW7GSCOKG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SORW7GSCOKGM7W3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SORW7GS","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2SORW7GSCOKGM7W37MYZOB3YV7","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-11T08:45:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0ddd14097f9cb4d78a50e7115c77e856b61a196d4f2e450acef00afe4cd92bc3","abstract_canon_sha256":"c73468eec9dfe727bbb948329364652e70dd39769d95dd80de5429de95936a3f"},"schema_version":"1.0"},"canonical_sha256":"d49d1b7cd21394667edbfb31970778affce7a0487cb2e0eb8ca4c6646837485f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:27.485419Z","signature_b64":"z5pnWxqftpSwBucuBxv20W75/aeyt54iLZlSECtPp3E8jOw2o46rAsok8CuulAS5MtnpaJxJMBUx6L0KJh6XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49d1b7cd21394667edbfb31970778affce7a0487cb2e0eb8ca4c6646837485f","last_reissued_at":"2026-05-18T00:15:27.484750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:27.484750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04276","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJsbrhCBJZPMEzcNlHhkFQhGOwXEFt8CnBL0KjqiD03jT3q6CHHq8p/CDD4anE/EITu28ra8FD/ubGI9BK7sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:43:41.946752Z"},"content_sha256":"01959c7b6aadd12b3a39f15e02466d17b553993b6b1d6f097c2253a97e2b78c2","schema_version":"1.0","event_id":"sha256:01959c7b6aadd12b3a39f15e02466d17b553993b6b1d6f097c2253a97e2b78c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2SORW7GSCOKGM7W37MYZOB3YV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Grammar and Reinforcement Learning for Neural Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacob Devlin, Matthew Hausknecht, Pushmeet Kohli, Rishabh Singh, Rudy Bunel","submitted_at":"2018-05-11T08:45:24Z","abstract_excerpt":"Program synthesis is the task of automatically generating a program consistent with a specification. Recent years have seen proposal of a number of neural approaches for program synthesis, many of which adopt a sequence generation paradigm similar to neural machine translation, in which sequence-to-sequence models are trained to maximize the likelihood of known reference programs. While achieving impressive results, this strategy has two key limitations. First, it ignores Program Aliasing: the fact that many different programs may satisfy a given specification (especially with incomplete speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04276","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2s5L2JbzKujsUzfmx4CU05BZn4cfIbC1RNltpRMZXaNtGyzNk1hGt+GTycEnPrz6iQVjAdCLQOGFBkVvb9rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:43:41.947483Z"},"content_sha256":"ada67ae57cec7f49c40e0fd6b1f88f720b9c54226722b0f05677a7149912ef3a","schema_version":"1.0","event_id":"sha256:ada67ae57cec7f49c40e0fd6b1f88f720b9c54226722b0f05677a7149912ef3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SORW7GSCOKGM7W37MYZOB3YV7/bundle.json","state_url":"https://pith.science/pith/2SORW7GSCOKGM7W37MYZOB3YV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SORW7GSCOKGM7W37MYZOB3YV7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T19:43:41Z","links":{"resolver":"https://pith.science/pith/2SORW7GSCOKGM7W37MYZOB3YV7","bundle":"https://pith.science/pith/2SORW7GSCOKGM7W37MYZOB3YV7/bundle.json","state":"https://pith.science/pith/2SORW7GSCOKGM7W37MYZOB3YV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SORW7GSCOKGM7W37MYZOB3YV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2SORW7GSCOKGM7W37MYZOB3YV7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c73468eec9dfe727bbb948329364652e70dd39769d95dd80de5429de95936a3f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-11T08:45:24Z","title_canon_sha256":"0ddd14097f9cb4d78a50e7115c77e856b61a196d4f2e450acef00afe4cd92bc3"},"schema_version":"1.0","source":{"id":"1805.04276","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04276","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04276v2","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04276","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"2SORW7GSCOKG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SORW7GSCOKGM7W3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SORW7GS","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:ada67ae57cec7f49c40e0fd6b1f88f720b9c54226722b0f05677a7149912ef3a","target":"graph","created_at":"2026-05-18T00:15:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Program synthesis is the task of automatically generating a program consistent with a specification. Recent years have seen proposal of a number of neural approaches for program synthesis, many of which adopt a sequence generation paradigm similar to neural machine translation, in which sequence-to-sequence models are trained to maximize the likelihood of known reference programs. While achieving impressive results, this strategy has two key limitations. First, it ignores Program Aliasing: the fact that many different programs may satisfy a given specification (especially with incomplete speci","authors_text":"Jacob Devlin, Matthew Hausknecht, Pushmeet Kohli, Rishabh Singh, Rudy Bunel","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-11T08:45:24Z","title":"Leveraging Grammar and Reinforcement Learning for Neural Program Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04276","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:01959c7b6aadd12b3a39f15e02466d17b553993b6b1d6f097c2253a97e2b78c2","target":"record","created_at":"2026-05-18T00:15:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c73468eec9dfe727bbb948329364652e70dd39769d95dd80de5429de95936a3f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-11T08:45:24Z","title_canon_sha256":"0ddd14097f9cb4d78a50e7115c77e856b61a196d4f2e450acef00afe4cd92bc3"},"schema_version":"1.0","source":{"id":"1805.04276","kind":"arxiv","version":2}},"canonical_sha256":"d49d1b7cd21394667edbfb31970778affce7a0487cb2e0eb8ca4c6646837485f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d49d1b7cd21394667edbfb31970778affce7a0487cb2e0eb8ca4c6646837485f","first_computed_at":"2026-05-18T00:15:27.484750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:27.484750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z5pnWxqftpSwBucuBxv20W75/aeyt54iLZlSECtPp3E8jOw2o46rAsok8CuulAS5MtnpaJxJMBUx6L0KJh6XBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:27.485419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04276","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01959c7b6aadd12b3a39f15e02466d17b553993b6b1d6f097c2253a97e2b78c2","sha256:ada67ae57cec7f49c40e0fd6b1f88f720b9c54226722b0f05677a7149912ef3a"],"state_sha256":"f5902e5f39c1dfe29c243625c9acdff0084e606f6088b80eec1f5e318748236a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBi3wpEvQx4Dphb+7cUspwdO/QUJTz1SZLwgdutpVlbFDoiZ4pfJ4HB3jabALWdcg8EnI3AM47bWTJ+fkTMRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T19:43:41.951634Z","bundle_sha256":"76e180f63a9feb7b4df71f5d2624c19872dde33886efc696ee4cc46ab3d89752"}}