{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O3KPEDNPT3BA5L2NC7HNS3355G","short_pith_number":"pith:O3KPEDNP","canonical_record":{"source":{"id":"1704.07926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T22:51:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c38b99bab67e032ce5088a6147f9ce9839d72362a75112082d6b2bb724c44340","abstract_canon_sha256":"819faeb354fffc99334ec8603a9a7aceda6cbd9891565a4238edb1eac4836b92"},"schema_version":"1.0"},"canonical_sha256":"76d4f20daf9ec20eaf4d17ced96f7de984a853af4f1209e12cfd79dc50b1bcb2","source":{"kind":"arxiv","id":"1704.07926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07926","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07926v1","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07926","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"O3KPEDNPT3BA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3KPEDNPT3BA5L2N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3KPEDNP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O3KPEDNPT3BA5L2NC7HNS3355G","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T22:51:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c38b99bab67e032ce5088a6147f9ce9839d72362a75112082d6b2bb724c44340","abstract_canon_sha256":"819faeb354fffc99334ec8603a9a7aceda6cbd9891565a4238edb1eac4836b92"},"schema_version":"1.0"},"canonical_sha256":"76d4f20daf9ec20eaf4d17ced96f7de984a853af4f1209e12cfd79dc50b1bcb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.507649Z","signature_b64":"eJe/xiMxUdqvLZeogvrCdth7kr29V8Ls01Cuce6XWKBfN7dK7NdWi8tJSDP2Qpotj75PpdL6RykCi2v8a6AeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d4f20daf9ec20eaf4d17ced96f7de984a853af4f1209e12cfd79dc50b1bcb2","last_reissued_at":"2026-05-18T00:45:31.507200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.507200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07926","source_version":1,"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:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNh+G34LYPKGA6a/mtdAuCgerQd4sNpR9Ns2YyiCNz2x2jNJrvzKuuTwbTPdw7D1AXpLzeTLHmbFh9ovgq+0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:05:47.056392Z"},"content_sha256":"2573d4fa1c174a747edd0cf9d1eb5fa184155897af0206aff51a523394c7ab1d","schema_version":"1.0","event_id":"sha256:2573d4fa1c174a747edd0cf9d1eb5fa184155897af0206aff51a523394c7ab1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O3KPEDNPT3BA5L2NC7HNS3355G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Evan Zheran Liu, Kelvin Guu, Panupong Pasupat, Percy Liang","submitted_at":"2017-04-25T22:51:12Z","abstract_excerpt":"Our goal is to learn a semantic parser that maps natural language utterances into executable programs when only indirect supervision is available: examples are labeled with the correct execution result, but not the program itself. Consequently, we must search the space of programs for those that output the correct result, while not being misled by spurious programs: incorrect programs that coincidentally output the correct result. We connect two common learning paradigms, reinforcement learning (RL) and maximum marginal likelihood (MML), and then present a new learning algorithm that combines "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07926","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"},"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:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBEyY/XT1iHrN9kGpxVvEMqCMqmwhZnh4DLrkc3PwDiMwSCEooZykn6VzV5yTLVkr/RdwRkEWcHL08R/3pL9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:05:47.057279Z"},"content_sha256":"03edf006c397094fec0d1dac5af165c8e9cf22aec16b6818783fd4316f81de81","schema_version":"1.0","event_id":"sha256:03edf006c397094fec0d1dac5af165c8e9cf22aec16b6818783fd4316f81de81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3KPEDNPT3BA5L2NC7HNS3355G/bundle.json","state_url":"https://pith.science/pith/O3KPEDNPT3BA5L2NC7HNS3355G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3KPEDNPT3BA5L2NC7HNS3355G/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-22T00:05:47Z","links":{"resolver":"https://pith.science/pith/O3KPEDNPT3BA5L2NC7HNS3355G","bundle":"https://pith.science/pith/O3KPEDNPT3BA5L2NC7HNS3355G/bundle.json","state":"https://pith.science/pith/O3KPEDNPT3BA5L2NC7HNS3355G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3KPEDNPT3BA5L2NC7HNS3355G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O3KPEDNPT3BA5L2NC7HNS3355G","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":"819faeb354fffc99334ec8603a9a7aceda6cbd9891565a4238edb1eac4836b92","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T22:51:12Z","title_canon_sha256":"c38b99bab67e032ce5088a6147f9ce9839d72362a75112082d6b2bb724c44340"},"schema_version":"1.0","source":{"id":"1704.07926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07926","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07926v1","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07926","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"O3KPEDNPT3BA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3KPEDNPT3BA5L2N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3KPEDNP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:03edf006c397094fec0d1dac5af165c8e9cf22aec16b6818783fd4316f81de81","target":"graph","created_at":"2026-05-18T00:45:31Z","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":"Our goal is to learn a semantic parser that maps natural language utterances into executable programs when only indirect supervision is available: examples are labeled with the correct execution result, but not the program itself. Consequently, we must search the space of programs for those that output the correct result, while not being misled by spurious programs: incorrect programs that coincidentally output the correct result. We connect two common learning paradigms, reinforcement learning (RL) and maximum marginal likelihood (MML), and then present a new learning algorithm that combines ","authors_text":"Evan Zheran Liu, Kelvin Guu, Panupong Pasupat, Percy Liang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T22:51:12Z","title":"From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07926","kind":"arxiv","version":1},"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:2573d4fa1c174a747edd0cf9d1eb5fa184155897af0206aff51a523394c7ab1d","target":"record","created_at":"2026-05-18T00:45:31Z","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":"819faeb354fffc99334ec8603a9a7aceda6cbd9891565a4238edb1eac4836b92","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-25T22:51:12Z","title_canon_sha256":"c38b99bab67e032ce5088a6147f9ce9839d72362a75112082d6b2bb724c44340"},"schema_version":"1.0","source":{"id":"1704.07926","kind":"arxiv","version":1}},"canonical_sha256":"76d4f20daf9ec20eaf4d17ced96f7de984a853af4f1209e12cfd79dc50b1bcb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76d4f20daf9ec20eaf4d17ced96f7de984a853af4f1209e12cfd79dc50b1bcb2","first_computed_at":"2026-05-18T00:45:31.507200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:31.507200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eJe/xiMxUdqvLZeogvrCdth7kr29V8Ls01Cuce6XWKBfN7dK7NdWi8tJSDP2Qpotj75PpdL6RykCi2v8a6AeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:31.507649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2573d4fa1c174a747edd0cf9d1eb5fa184155897af0206aff51a523394c7ab1d","sha256:03edf006c397094fec0d1dac5af165c8e9cf22aec16b6818783fd4316f81de81"],"state_sha256":"a8ac726e9b89c5dd6b50fa0e4ea52df3f28960faa83a1cebe95b8d1a628712c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QD9UgBUuMDfCBA76H9EqDjwWlLek7ZJeOaf25AirPbRtkALa/jKD2uQMGtjVEO/iELPm/WWgY/7tE2a3A+ICBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:05:47.061301Z","bundle_sha256":"786dbdb20e5a32ddd660067ff38b66af87abd70a2d696ae0dbb392d19226c633"}}