{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P5WH7LLJ43ZFVX6ZPJJPYFR6ML","short_pith_number":"pith:P5WH7LLJ","canonical_record":{"source":{"id":"1704.07138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T10:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"9b80c95c0200e1dec3a4a5b04a10e72ac9739436bdf2173e8582f29c745b5277","abstract_canon_sha256":"6ed4daae7f7cfdf1a2bd95c9a170231a5ec0dc6962057fda619a6b183a13978f"},"schema_version":"1.0"},"canonical_sha256":"7f6c7fad69e6f25adfd97a52fc163e62e43b3e24d01755b77a6bc85f8f2e0ac4","source":{"kind":"arxiv","id":"1704.07138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07138","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07138v2","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07138","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"P5WH7LLJ43ZF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5WH7LLJ43ZFVX6Z","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5WH7LLJ","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P5WH7LLJ43ZFVX6ZPJJPYFR6ML","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T10:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"9b80c95c0200e1dec3a4a5b04a10e72ac9739436bdf2173e8582f29c745b5277","abstract_canon_sha256":"6ed4daae7f7cfdf1a2bd95c9a170231a5ec0dc6962057fda619a6b183a13978f"},"schema_version":"1.0"},"canonical_sha256":"7f6c7fad69e6f25adfd97a52fc163e62e43b3e24d01755b77a6bc85f8f2e0ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:10.512996Z","signature_b64":"XAgDH3XAYIB0Z/sQVNJY4/bKX2VivgjyUHiu4gXTVgnMVEGMBxAGKJaJ7NRVXDr7uOdKIs+2irRbN0rJV2lwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6c7fad69e6f25adfd97a52fc163e62e43b3e24d01755b77a6bc85f8f2e0ac4","last_reissued_at":"2026-05-18T00:45:10.512374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:10.512374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07138","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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaeSItIqUmITes7FYX+SdWW3tz5PA3Q+OQzhp9vZB7NOL2Xi+rIwWlIz65De3oMyEeaXDR7w0ptPc9X7qT2ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:00:13.402062Z"},"content_sha256":"8d1a9e1b3c041510dcd853827ac240128c2f3ea1094df2ac2e1feaf3dd6e7dc8","schema_version":"1.0","event_id":"sha256:8d1a9e1b3c041510dcd853827ac240128c2f3ea1094df2ac2e1feaf3dd6e7dc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P5WH7LLJ43ZFVX6ZPJJPYFR6ML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chris Hokamp, Qun Liu","submitted_at":"2017-04-24T10:55:20Z","abstract_excerpt":"We present Grid Beam Search (GBS), an algorithm which extends beam search to allow the inclusion of pre-specified lexical constraints. The algorithm can be used with any model that generates a sequence $ \\mathbf{\\hat{y}} = \\{y_{0}\\ldots y_{T}\\} $, by maximizing $ p(\\mathbf{y} | \\mathbf{x}) = \\prod\\limits_{t}p(y_{t} | \\mathbf{x}; \\{y_{0} \\ldots y_{t-1}\\}) $. Lexical constraints take the form of phrases or words that must be present in the output sequence. This is a very general way to incorporate additional knowledge into a model's output without requiring any modification of the model paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07138","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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqUXG5F4nioi+4vWRZsB9EE1odbYna0baNqZZScbHM7Ktg7oBpIDYxLGNrgvk6JH1NU9SMcXLKdS0nj2fDizBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:00:13.402408Z"},"content_sha256":"547003a5d1fc1001b994894299478f871cf8f946cdac97cf0474a3584cfd647b","schema_version":"1.0","event_id":"sha256:547003a5d1fc1001b994894299478f871cf8f946cdac97cf0474a3584cfd647b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/bundle.json","state_url":"https://pith.science/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/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-06-04T18:00:13Z","links":{"resolver":"https://pith.science/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML","bundle":"https://pith.science/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/bundle.json","state":"https://pith.science/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5WH7LLJ43ZFVX6ZPJJPYFR6ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P5WH7LLJ43ZFVX6ZPJJPYFR6ML","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":"6ed4daae7f7cfdf1a2bd95c9a170231a5ec0dc6962057fda619a6b183a13978f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T10:55:20Z","title_canon_sha256":"9b80c95c0200e1dec3a4a5b04a10e72ac9739436bdf2173e8582f29c745b5277"},"schema_version":"1.0","source":{"id":"1704.07138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07138","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07138v2","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07138","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"P5WH7LLJ43ZF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5WH7LLJ43ZFVX6Z","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5WH7LLJ","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:547003a5d1fc1001b994894299478f871cf8f946cdac97cf0474a3584cfd647b","target":"graph","created_at":"2026-05-18T00:45:10Z","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":"We present Grid Beam Search (GBS), an algorithm which extends beam search to allow the inclusion of pre-specified lexical constraints. The algorithm can be used with any model that generates a sequence $ \\mathbf{\\hat{y}} = \\{y_{0}\\ldots y_{T}\\} $, by maximizing $ p(\\mathbf{y} | \\mathbf{x}) = \\prod\\limits_{t}p(y_{t} | \\mathbf{x}; \\{y_{0} \\ldots y_{t-1}\\}) $. Lexical constraints take the form of phrases or words that must be present in the output sequence. This is a very general way to incorporate additional knowledge into a model's output without requiring any modification of the model paramete","authors_text":"Chris Hokamp, Qun Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T10:55:20Z","title":"Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07138","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:8d1a9e1b3c041510dcd853827ac240128c2f3ea1094df2ac2e1feaf3dd6e7dc8","target":"record","created_at":"2026-05-18T00:45:10Z","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":"6ed4daae7f7cfdf1a2bd95c9a170231a5ec0dc6962057fda619a6b183a13978f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T10:55:20Z","title_canon_sha256":"9b80c95c0200e1dec3a4a5b04a10e72ac9739436bdf2173e8582f29c745b5277"},"schema_version":"1.0","source":{"id":"1704.07138","kind":"arxiv","version":2}},"canonical_sha256":"7f6c7fad69e6f25adfd97a52fc163e62e43b3e24d01755b77a6bc85f8f2e0ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6c7fad69e6f25adfd97a52fc163e62e43b3e24d01755b77a6bc85f8f2e0ac4","first_computed_at":"2026-05-18T00:45:10.512374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:10.512374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XAgDH3XAYIB0Z/sQVNJY4/bKX2VivgjyUHiu4gXTVgnMVEGMBxAGKJaJ7NRVXDr7uOdKIs+2irRbN0rJV2lwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:10.512996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d1a9e1b3c041510dcd853827ac240128c2f3ea1094df2ac2e1feaf3dd6e7dc8","sha256:547003a5d1fc1001b994894299478f871cf8f946cdac97cf0474a3584cfd647b"],"state_sha256":"d0d268c45e0f17133d7c11c587a14fec3b17455998d74563870a8f348c6421a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEYfYIz4tCqlcfqyRenHJi8QlHZn+PT6uVujYY3DI0z5US2jH+uTo/5/C4jOilFDjA6zqOTqNXMnQT9BWzhhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:00:13.404259Z","bundle_sha256":"f4c78eafb073ea1fffc4720320b95fb044797814db09dca16e190dee9b34e36e"}}