{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GEAFY4IECUXF5STCL6UJBNMHVY","short_pith_number":"pith:GEAFY4IE","canonical_record":{"source":{"id":"1808.08482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-25T23:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"78a25ae1f1f9ac5954e0e9e6265c8f2eaed6b98733d7928e68704f117185ddcb","abstract_canon_sha256":"abb0058213f0e5937753fc4da68236d5652e1a97506b0dd36f63bc2b9e36433b"},"schema_version":"1.0"},"canonical_sha256":"31005c7104152e5eca625fa890b587ae39a489867305ed135a740bcab6ef3967","source":{"kind":"arxiv","id":"1808.08482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08482","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08482v2","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08482","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"GEAFY4IECUXF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GEAFY4IECUXF5STC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GEAFY4IE","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GEAFY4IECUXF5STCL6UJBNMHVY","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-25T23:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"78a25ae1f1f9ac5954e0e9e6265c8f2eaed6b98733d7928e68704f117185ddcb","abstract_canon_sha256":"abb0058213f0e5937753fc4da68236d5652e1a97506b0dd36f63bc2b9e36433b"},"schema_version":"1.0"},"canonical_sha256":"31005c7104152e5eca625fa890b587ae39a489867305ed135a740bcab6ef3967","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.164613Z","signature_b64":"l+bR2yJoTf2lnoadIrDTBqE1r00bMvTNLqk7cfnSEwg5BUlj5tBxK8D1QwQJPJhXvYKp/O16QSLE9qcwx3x0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31005c7104152e5eca625fa890b587ae39a489867305ed135a740bcab6ef3967","last_reissued_at":"2026-05-18T00:03:24.163993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.163993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08482","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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GZTM4TWI4tTKqtuMunrCYsiT/IIWt6EED9n/kml49gljn5WTKv96lvlinz+7F9cM59hsuTiiHNL6ep+ERPqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:49:16.442051Z"},"content_sha256":"53bc2d95d800911d3cf39ff0de699a03b6873952e556794424bcc39a7e38df41","schema_version":"1.0","event_id":"sha256:53bc2d95d800911d3cf39ff0de699a03b6873952e556794424bcc39a7e38df41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GEAFY4IECUXF5STCL6UJBNMHVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Recombination for Efficient Decoding of Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eiichiro Sumita, Hai Zhao, Masao Utiyama, Rui Wang, Zhisong Zhang","submitted_at":"2018-08-25T23:26:10Z","abstract_excerpt":"In Neural Machine Translation (NMT), the decoder can capture the features of the entire prediction history with neural connections and representations. This means that partial hypotheses with different prefixes will be regarded differently no matter how similar they are. However, this might be inefficient since some partial hypotheses can contain only local differences that will not influence future predictions. In this work, we introduce recombination in NMT decoding based on the concept of the \"equivalence\" of partial hypotheses. Heuristically, we use a simple $n$-gram suffix based equivalen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08482","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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2OV0B3LIA/2ARCaSReU9+T0DLrvaNSWIxVtFt183OxdMyVFK01mme3MR7APH1/leTDhl3t1sGi0TQfvR2V+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:49:16.442791Z"},"content_sha256":"7605dae6c1a050738bef546f804542438a6170a7c25d2246c6494f4a3bba1ca2","schema_version":"1.0","event_id":"sha256:7605dae6c1a050738bef546f804542438a6170a7c25d2246c6494f4a3bba1ca2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEAFY4IECUXF5STCL6UJBNMHVY/bundle.json","state_url":"https://pith.science/pith/GEAFY4IECUXF5STCL6UJBNMHVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEAFY4IECUXF5STCL6UJBNMHVY/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-31T19:49:16Z","links":{"resolver":"https://pith.science/pith/GEAFY4IECUXF5STCL6UJBNMHVY","bundle":"https://pith.science/pith/GEAFY4IECUXF5STCL6UJBNMHVY/bundle.json","state":"https://pith.science/pith/GEAFY4IECUXF5STCL6UJBNMHVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEAFY4IECUXF5STCL6UJBNMHVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GEAFY4IECUXF5STCL6UJBNMHVY","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":"abb0058213f0e5937753fc4da68236d5652e1a97506b0dd36f63bc2b9e36433b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-25T23:26:10Z","title_canon_sha256":"78a25ae1f1f9ac5954e0e9e6265c8f2eaed6b98733d7928e68704f117185ddcb"},"schema_version":"1.0","source":{"id":"1808.08482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08482","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08482v2","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08482","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"GEAFY4IECUXF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GEAFY4IECUXF5STC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GEAFY4IE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:7605dae6c1a050738bef546f804542438a6170a7c25d2246c6494f4a3bba1ca2","target":"graph","created_at":"2026-05-18T00:03:24Z","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":"In Neural Machine Translation (NMT), the decoder can capture the features of the entire prediction history with neural connections and representations. This means that partial hypotheses with different prefixes will be regarded differently no matter how similar they are. However, this might be inefficient since some partial hypotheses can contain only local differences that will not influence future predictions. In this work, we introduce recombination in NMT decoding based on the concept of the \"equivalence\" of partial hypotheses. Heuristically, we use a simple $n$-gram suffix based equivalen","authors_text":"Eiichiro Sumita, Hai Zhao, Masao Utiyama, Rui Wang, Zhisong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-25T23:26:10Z","title":"Exploring Recombination for Efficient Decoding of Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08482","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:53bc2d95d800911d3cf39ff0de699a03b6873952e556794424bcc39a7e38df41","target":"record","created_at":"2026-05-18T00:03:24Z","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":"abb0058213f0e5937753fc4da68236d5652e1a97506b0dd36f63bc2b9e36433b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-25T23:26:10Z","title_canon_sha256":"78a25ae1f1f9ac5954e0e9e6265c8f2eaed6b98733d7928e68704f117185ddcb"},"schema_version":"1.0","source":{"id":"1808.08482","kind":"arxiv","version":2}},"canonical_sha256":"31005c7104152e5eca625fa890b587ae39a489867305ed135a740bcab6ef3967","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31005c7104152e5eca625fa890b587ae39a489867305ed135a740bcab6ef3967","first_computed_at":"2026-05-18T00:03:24.163993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.163993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l+bR2yJoTf2lnoadIrDTBqE1r00bMvTNLqk7cfnSEwg5BUlj5tBxK8D1QwQJPJhXvYKp/O16QSLE9qcwx3x0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.164613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53bc2d95d800911d3cf39ff0de699a03b6873952e556794424bcc39a7e38df41","sha256:7605dae6c1a050738bef546f804542438a6170a7c25d2246c6494f4a3bba1ca2"],"state_sha256":"3c225df8cade7f8678eb3d2d6866acd2726daff417eef835df888f994e6592e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3zdAaeZWwGavCMCdSmsFQVlnoZuJBcdN0QX/DjoSIJyfnGz1yGjYnc3UxUoZ3gUWpwEsrMmRLQAcLnQyV/hCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:49:16.446963Z","bundle_sha256":"37dca1647d4910ebb923b0ee43f8fbbeee0f861e89115d6c1a7a008b69ebfcc3"}}