{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HZ4BEJCPD43C5U4PHGJDL7G2N2","short_pith_number":"pith:HZ4BEJCP","canonical_record":{"source":{"id":"1811.00512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-01T17:31:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"73ef63925d3eade60f7b680de6945cdff38cebac22ce2f46f4c48c842eecf7bd","abstract_canon_sha256":"6d65f9a6e1bfe6ba8c05bb8216d034cddc8d27dc3ab961a077168004f74e7ec7"},"schema_version":"1.0"},"canonical_sha256":"3e7812244f1f362ed38f399235fcda6ea7c2d527a29b0851dd9059687de339db","source":{"kind":"arxiv","id":"1811.00512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00512","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00512v2","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00512","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"pith_short_12","alias_value":"HZ4BEJCPD43C","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZ4BEJCPD43C5U4P","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZ4BEJCP","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HZ4BEJCPD43C5U4PHGJDL7G2N2","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-01T17:31:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"73ef63925d3eade60f7b680de6945cdff38cebac22ce2f46f4c48c842eecf7bd","abstract_canon_sha256":"6d65f9a6e1bfe6ba8c05bb8216d034cddc8d27dc3ab961a077168004f74e7ec7"},"schema_version":"1.0"},"canonical_sha256":"3e7812244f1f362ed38f399235fcda6ea7c2d527a29b0851dd9059687de339db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:26.712386Z","signature_b64":"Gz6s3hHpz47ThqtAg+g8pOJ5i8U+yUcp28PrH1am3QJ11YwBUTNtnpDd0Qtu4K2C0OKspWvlf57LxE2eKQ03BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e7812244f1f362ed38f399235fcda6ea7c2d527a29b0851dd9059687de339db","last_reissued_at":"2026-05-17T23:42:26.711612Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:26.711612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00512","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-17T23:42:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qshq+Z86CylrW9GhcrC9B1ScdPD6ZShYLLmR9Im8B2owl6Nt8RGwGgGjt7XHmaykmZLJnbNirOEyh3Wr2nf6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:30:07.009116Z"},"content_sha256":"1102b757784f815fcc8263fcc4cd63e25bc361b9128e0d579d49df4bcb438ce5","schema_version":"1.0","event_id":"sha256:1102b757784f815fcc8263fcc4cd63e25bc361b9128e0d579d49df4bcb438ce5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HZ4BEJCPD43C5U4PHGJDL7G2N2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Beam Search Policies via Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Geoffrey J. Gordon, Matthew R. Gormley, Renato Negrinho","submitted_at":"2018-11-01T17:31:10Z","abstract_excerpt":"Beam search is widely used for approximate decoding in structured prediction problems. Models often use a beam at test time but ignore its existence at train time, and therefore do not explicitly learn how to use the beam. We develop an unifying meta-algorithm for learning beam search policies using imitation learning. In our setting, the beam is part of the model, and not just an artifact of approximate decoding. Our meta-algorithm captures existing learning algorithms and suggests new ones. It also lets us show novel no-regret guarantees for learning beam search policies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00512","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-17T23:42:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fn0Djx+0FYs0JnBqqR82OwandVd4yTn6RsnUtfIH6fvX5QKQWDhF4ZKfAa+5PyR/FvqTN73g+XpypTEwiACDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:30:07.009754Z"},"content_sha256":"10ceff8d29d778adf5381bfbeb9dea60dcb4c264ecf2529297d7e8075bb043b8","schema_version":"1.0","event_id":"sha256:10ceff8d29d778adf5381bfbeb9dea60dcb4c264ecf2529297d7e8075bb043b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/bundle.json","state_url":"https://pith.science/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/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-24T04:30:07Z","links":{"resolver":"https://pith.science/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2","bundle":"https://pith.science/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/bundle.json","state":"https://pith.science/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZ4BEJCPD43C5U4PHGJDL7G2N2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HZ4BEJCPD43C5U4PHGJDL7G2N2","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":"6d65f9a6e1bfe6ba8c05bb8216d034cddc8d27dc3ab961a077168004f74e7ec7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-01T17:31:10Z","title_canon_sha256":"73ef63925d3eade60f7b680de6945cdff38cebac22ce2f46f4c48c842eecf7bd"},"schema_version":"1.0","source":{"id":"1811.00512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00512","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00512v2","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00512","created_at":"2026-05-17T23:42:26Z"},{"alias_kind":"pith_short_12","alias_value":"HZ4BEJCPD43C","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZ4BEJCPD43C5U4P","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZ4BEJCP","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:10ceff8d29d778adf5381bfbeb9dea60dcb4c264ecf2529297d7e8075bb043b8","target":"graph","created_at":"2026-05-17T23:42:26Z","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":"Beam search is widely used for approximate decoding in structured prediction problems. Models often use a beam at test time but ignore its existence at train time, and therefore do not explicitly learn how to use the beam. We develop an unifying meta-algorithm for learning beam search policies using imitation learning. In our setting, the beam is part of the model, and not just an artifact of approximate decoding. Our meta-algorithm captures existing learning algorithms and suggests new ones. It also lets us show novel no-regret guarantees for learning beam search policies.","authors_text":"Geoffrey J. Gordon, Matthew R. Gormley, Renato Negrinho","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-01T17:31:10Z","title":"Learning Beam Search Policies via Imitation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00512","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:1102b757784f815fcc8263fcc4cd63e25bc361b9128e0d579d49df4bcb438ce5","target":"record","created_at":"2026-05-17T23:42:26Z","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":"6d65f9a6e1bfe6ba8c05bb8216d034cddc8d27dc3ab961a077168004f74e7ec7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-01T17:31:10Z","title_canon_sha256":"73ef63925d3eade60f7b680de6945cdff38cebac22ce2f46f4c48c842eecf7bd"},"schema_version":"1.0","source":{"id":"1811.00512","kind":"arxiv","version":2}},"canonical_sha256":"3e7812244f1f362ed38f399235fcda6ea7c2d527a29b0851dd9059687de339db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e7812244f1f362ed38f399235fcda6ea7c2d527a29b0851dd9059687de339db","first_computed_at":"2026-05-17T23:42:26.711612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:26.711612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gz6s3hHpz47ThqtAg+g8pOJ5i8U+yUcp28PrH1am3QJ11YwBUTNtnpDd0Qtu4K2C0OKspWvlf57LxE2eKQ03BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:26.712386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1102b757784f815fcc8263fcc4cd63e25bc361b9128e0d579d49df4bcb438ce5","sha256:10ceff8d29d778adf5381bfbeb9dea60dcb4c264ecf2529297d7e8075bb043b8"],"state_sha256":"4083f1ad219a9a1bdda580017dd717b3a60015c8512884df582e9f530e6db043"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEdsWrrc+disNtJD3ymenfg4Ihc0YdoCt0FYsbH/Qa1nlbYwZgPgwrKJGeZTm0mXm1DboQPe980du0nW9QetBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:30:07.012902Z","bundle_sha256":"160db073c5258b8ad8ee593f4b7ce2c79f1d2eb113af9ad2021f4ea983829064"}}