{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6XQAD74MN4HNQX4TFKCWBBABSL","short_pith_number":"pith:6XQAD74M","canonical_record":{"source":{"id":"1412.2007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-05T14:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"8f788f31ffbd00d8bf74528c0ff46fd93b00e1017b63b3a07fd7ed1222b9d047","abstract_canon_sha256":"553eaa85d51bb837faae92735086b7f1a803970bea8131642d4de1ea35d46f66"},"schema_version":"1.0"},"canonical_sha256":"f5e001ff8c6f0ed85f932a8560840192cb015366920b89a0a19cd47ab745cc5a","source":{"kind":"arxiv","id":"1412.2007","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2007","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2007v2","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2007","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"6XQAD74MN4HN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6XQAD74MN4HNQX4T","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6XQAD74M","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6XQAD74MN4HNQX4TFKCWBBABSL","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-05T14:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"8f788f31ffbd00d8bf74528c0ff46fd93b00e1017b63b3a07fd7ed1222b9d047","abstract_canon_sha256":"553eaa85d51bb837faae92735086b7f1a803970bea8131642d4de1ea35d46f66"},"schema_version":"1.0"},"canonical_sha256":"f5e001ff8c6f0ed85f932a8560840192cb015366920b89a0a19cd47ab745cc5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.433870Z","signature_b64":"s9keuP8hrd0uUg6B8hztzqBHsl4TBVGh7qQBIda+MSV+dMZu1zdFEQ9X4GPDoRFAC/WjUGpBdDLq88sV0axkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e001ff8c6f0ed85f932a8560840192cb015366920b89a0a19cd47ab745cc5a","last_reissued_at":"2026-05-18T02:21:26.433143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.433143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2007","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-18T02:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgJH9B9tw6bc2TuXNzoeBrFjuOotDQw4Szc13U4l7W89l5YYltJtjxv27sn6T//zwgQ9rrePvuRftO1SyQ73AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:40.923439Z"},"content_sha256":"25f74a838da1867657cf51f0ee47153f9a8a442cf3d9265f2d787d7f7a5ec37c","schema_version":"1.0","event_id":"sha256:25f74a838da1867657cf51f0ee47153f9a8a442cf3d9265f2d787d7f7a5ec37c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6XQAD74MN4HNQX4TFKCWBBABSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Using Very Large Target Vocabulary for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kyunghyun Cho, Roland Memisevic, S\\'ebastien Jean, Yoshua Bengio","submitted_at":"2014-12-05T14:26:27Z","abstract_excerpt":"Neural machine translation, a recently proposed approach to machine translation based purely on neural networks, has shown promising results compared to the existing approaches such as phrase-based statistical machine translation. Despite its recent success, neural machine translation has its limitation in handling a larger vocabulary, as training complexity as well as decoding complexity increase proportionally to the number of target words. In this paper, we propose a method that allows us to use a very large target vocabulary without increasing training complexity, based on importance sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2007","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-18T02:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C8D9ytTJikV8nIH4DJ3eiKVFEA3/y0mQcnTah9bcqQvsVCASVjGatQ8cKavHqaGoHdoxVEdmiliidrhXlYiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:40.924133Z"},"content_sha256":"adcc43cbe01e635f15a555978cb95a9c5bcf4c369262cf1ab72018e74225a422","schema_version":"1.0","event_id":"sha256:adcc43cbe01e635f15a555978cb95a9c5bcf4c369262cf1ab72018e74225a422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XQAD74MN4HNQX4TFKCWBBABSL/bundle.json","state_url":"https://pith.science/pith/6XQAD74MN4HNQX4TFKCWBBABSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XQAD74MN4HNQX4TFKCWBBABSL/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-31T04:13:40Z","links":{"resolver":"https://pith.science/pith/6XQAD74MN4HNQX4TFKCWBBABSL","bundle":"https://pith.science/pith/6XQAD74MN4HNQX4TFKCWBBABSL/bundle.json","state":"https://pith.science/pith/6XQAD74MN4HNQX4TFKCWBBABSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XQAD74MN4HNQX4TFKCWBBABSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6XQAD74MN4HNQX4TFKCWBBABSL","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":"553eaa85d51bb837faae92735086b7f1a803970bea8131642d4de1ea35d46f66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-05T14:26:27Z","title_canon_sha256":"8f788f31ffbd00d8bf74528c0ff46fd93b00e1017b63b3a07fd7ed1222b9d047"},"schema_version":"1.0","source":{"id":"1412.2007","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2007","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2007v2","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2007","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"6XQAD74MN4HN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6XQAD74MN4HNQX4T","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6XQAD74M","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:adcc43cbe01e635f15a555978cb95a9c5bcf4c369262cf1ab72018e74225a422","target":"graph","created_at":"2026-05-18T02:21: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":"Neural machine translation, a recently proposed approach to machine translation based purely on neural networks, has shown promising results compared to the existing approaches such as phrase-based statistical machine translation. Despite its recent success, neural machine translation has its limitation in handling a larger vocabulary, as training complexity as well as decoding complexity increase proportionally to the number of target words. In this paper, we propose a method that allows us to use a very large target vocabulary without increasing training complexity, based on importance sampl","authors_text":"Kyunghyun Cho, Roland Memisevic, S\\'ebastien Jean, Yoshua Bengio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-05T14:26:27Z","title":"On Using Very Large Target Vocabulary for Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2007","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:25f74a838da1867657cf51f0ee47153f9a8a442cf3d9265f2d787d7f7a5ec37c","target":"record","created_at":"2026-05-18T02:21: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":"553eaa85d51bb837faae92735086b7f1a803970bea8131642d4de1ea35d46f66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-05T14:26:27Z","title_canon_sha256":"8f788f31ffbd00d8bf74528c0ff46fd93b00e1017b63b3a07fd7ed1222b9d047"},"schema_version":"1.0","source":{"id":"1412.2007","kind":"arxiv","version":2}},"canonical_sha256":"f5e001ff8c6f0ed85f932a8560840192cb015366920b89a0a19cd47ab745cc5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e001ff8c6f0ed85f932a8560840192cb015366920b89a0a19cd47ab745cc5a","first_computed_at":"2026-05-18T02:21:26.433143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:26.433143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9keuP8hrd0uUg6B8hztzqBHsl4TBVGh7qQBIda+MSV+dMZu1zdFEQ9X4GPDoRFAC/WjUGpBdDLq88sV0axkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:26.433870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2007","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25f74a838da1867657cf51f0ee47153f9a8a442cf3d9265f2d787d7f7a5ec37c","sha256:adcc43cbe01e635f15a555978cb95a9c5bcf4c369262cf1ab72018e74225a422"],"state_sha256":"f80b7e7ebe6f2d5fd099c56076e689cba81fc4f7c376eaecc82c6d818e619951"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMFAWnKsgu/ablFedcuXj7kYWFuoP43eN1ZPeU7IB7GaF9pc66kfyjA2UXY50LNOVqyVDJ3f5+0iKmK6I7c3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:13:40.927680Z","bundle_sha256":"3f2fb1486abd10b7914f86595fe19f2b300c2e6846902752dc4efbbd430f0b30"}}