{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TNZYYOZVD5USTQMMK6MFHWIARC","short_pith_number":"pith:TNZYYOZV","canonical_record":{"source":{"id":"1612.06043","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-19T04:23:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a8bac412f721c12db297ae90109daf3b3872aabfc47e64e9e15e1c830da7e5d0","abstract_canon_sha256":"8b6bac83c1fff146bc17faed96f85b4c6584c9962d6ce16893ac360938df47ea"},"schema_version":"1.0"},"canonical_sha256":"9b738c3b351f6929c18c579853d90088a772447c8df30a1c89fe1bf668b46c73","source":{"kind":"arxiv","id":"1612.06043","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06043","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06043v4","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06043","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"TNZYYOZVD5US","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNZYYOZVD5USTQMM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNZYYOZV","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TNZYYOZVD5USTQMMK6MFHWIARC","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06043","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-19T04:23:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a8bac412f721c12db297ae90109daf3b3872aabfc47e64e9e15e1c830da7e5d0","abstract_canon_sha256":"8b6bac83c1fff146bc17faed96f85b4c6584c9962d6ce16893ac360938df47ea"},"schema_version":"1.0"},"canonical_sha256":"9b738c3b351f6929c18c579853d90088a772447c8df30a1c89fe1bf668b46c73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:46.318263Z","signature_b64":"NtA4prDMzvCQrGOpxDdGbyMwQQiIrduUoAYkuEzrgSYbEk2LZvSDrrLGO2ESVZA6/9WExt5YoRiDYSwi13I8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b738c3b351f6929c18c579853d90088a772447c8df30a1c89fe1bf668b46c73","last_reissued_at":"2026-05-18T00:42:46.317613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:46.317613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06043","source_version":4,"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:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34hEcZAXAGCh3x/oDZ/mkwKtcF7ODRdvso3UqkbvQ2gQGRKyTIDftqfECFc/gDL3k5VqH6xnwVnQ5Kg/f1sGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:05:34.426402Z"},"content_sha256":"e84866c54ce4043d7021783f9fdae3c5b73e843bbe40e27814cf3dc9a933a792","schema_version":"1.0","event_id":"sha256:e84866c54ce4043d7021783f9fdae3c5b73e843bbe40e27814cf3dc9a933a792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TNZYYOZVD5USTQMMK6MFHWIARC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Empirical Study of Adequate Vision Span for Attention-Based Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hideki Nakayama, Raphael Shu","submitted_at":"2016-12-19T04:23:22Z","abstract_excerpt":"Recently, the attention mechanism plays a key role to achieve high performance for Neural Machine Translation models. However, as it computes a score function for the encoder states in all positions at each decoding step, the attention model greatly increases the computational complexity. In this paper, we investigate the adequate vision span of attention models in the context of machine translation, by proposing a novel attention framework that is capable of reducing redundant score computation dynamically. The term \"vision span\" means a window of the encoder states considered by the attentio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06043","kind":"arxiv","version":4},"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:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3zhJX051OZDdXhKiCZcnFmYXBoxYXxT2ReWCSf0NeOpuU4uuTH/XTj/UHcS+hhYz2pszfZqqr2s1k1oj54IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:05:34.426768Z"},"content_sha256":"6515da4ace5fb454d1942cc0f44aaa495c78477e4cc85753652d8fe6331f7a48","schema_version":"1.0","event_id":"sha256:6515da4ace5fb454d1942cc0f44aaa495c78477e4cc85753652d8fe6331f7a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNZYYOZVD5USTQMMK6MFHWIARC/bundle.json","state_url":"https://pith.science/pith/TNZYYOZVD5USTQMMK6MFHWIARC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNZYYOZVD5USTQMMK6MFHWIARC/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-30T05:05:34Z","links":{"resolver":"https://pith.science/pith/TNZYYOZVD5USTQMMK6MFHWIARC","bundle":"https://pith.science/pith/TNZYYOZVD5USTQMMK6MFHWIARC/bundle.json","state":"https://pith.science/pith/TNZYYOZVD5USTQMMK6MFHWIARC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNZYYOZVD5USTQMMK6MFHWIARC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TNZYYOZVD5USTQMMK6MFHWIARC","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":"8b6bac83c1fff146bc17faed96f85b4c6584c9962d6ce16893ac360938df47ea","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-19T04:23:22Z","title_canon_sha256":"a8bac412f721c12db297ae90109daf3b3872aabfc47e64e9e15e1c830da7e5d0"},"schema_version":"1.0","source":{"id":"1612.06043","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06043","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06043v4","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06043","created_at":"2026-05-18T00:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"TNZYYOZVD5US","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNZYYOZVD5USTQMM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNZYYOZV","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:6515da4ace5fb454d1942cc0f44aaa495c78477e4cc85753652d8fe6331f7a48","target":"graph","created_at":"2026-05-18T00:42:46Z","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":"Recently, the attention mechanism plays a key role to achieve high performance for Neural Machine Translation models. However, as it computes a score function for the encoder states in all positions at each decoding step, the attention model greatly increases the computational complexity. In this paper, we investigate the adequate vision span of attention models in the context of machine translation, by proposing a novel attention framework that is capable of reducing redundant score computation dynamically. The term \"vision span\" means a window of the encoder states considered by the attentio","authors_text":"Hideki Nakayama, Raphael Shu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-19T04:23:22Z","title":"An Empirical Study of Adequate Vision Span for Attention-Based Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06043","kind":"arxiv","version":4},"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:e84866c54ce4043d7021783f9fdae3c5b73e843bbe40e27814cf3dc9a933a792","target":"record","created_at":"2026-05-18T00:42:46Z","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":"8b6bac83c1fff146bc17faed96f85b4c6584c9962d6ce16893ac360938df47ea","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-19T04:23:22Z","title_canon_sha256":"a8bac412f721c12db297ae90109daf3b3872aabfc47e64e9e15e1c830da7e5d0"},"schema_version":"1.0","source":{"id":"1612.06043","kind":"arxiv","version":4}},"canonical_sha256":"9b738c3b351f6929c18c579853d90088a772447c8df30a1c89fe1bf668b46c73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b738c3b351f6929c18c579853d90088a772447c8df30a1c89fe1bf668b46c73","first_computed_at":"2026-05-18T00:42:46.317613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:46.317613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NtA4prDMzvCQrGOpxDdGbyMwQQiIrduUoAYkuEzrgSYbEk2LZvSDrrLGO2ESVZA6/9WExt5YoRiDYSwi13I8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:46.318263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06043","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84866c54ce4043d7021783f9fdae3c5b73e843bbe40e27814cf3dc9a933a792","sha256:6515da4ace5fb454d1942cc0f44aaa495c78477e4cc85753652d8fe6331f7a48"],"state_sha256":"eb357947c0bb0025b9cc57133979ef5cf1820e60bd01feb9fdcfb07a6501861b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ztXjor4Td02lO4G+7G3qEqAIoOrrdTw3/E2rcxKx/gUnAB8jCKKsYdvGU8vBSrEhxAActVRZLXlz0ii90riDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:05:34.429047Z","bundle_sha256":"b3bc31482efbd07253061d3774856e90aae7726520ce369627eac9ffdef67d58"}}