{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P6UUUAYDXDSSCOMTTXXU52XH5K","short_pith_number":"pith:P6UUUAYD","canonical_record":{"source":{"id":"1806.04466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T12:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"367281de28addcd6705247638f45296bc781c53397ef6348c281911128bccbc4","abstract_canon_sha256":"ca0c15537204b11d48ae1184cf9b16430493e6bcd0fda27fb960e3487c2b6e98"},"schema_version":"1.0"},"canonical_sha256":"7fa94a0303b8e52139939def4eeae7eaa442fa73d434e3c5cc717ed6b0d2d6bf","source":{"kind":"arxiv","id":"1806.04466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04466","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04466v1","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04466","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6UUUAYDXDSS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6UUUAYDXDSSCOMT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6UUUAYD","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P6UUUAYDXDSSCOMTTXXU52XH5K","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T12:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"367281de28addcd6705247638f45296bc781c53397ef6348c281911128bccbc4","abstract_canon_sha256":"ca0c15537204b11d48ae1184cf9b16430493e6bcd0fda27fb960e3487c2b6e98"},"schema_version":"1.0"},"canonical_sha256":"7fa94a0303b8e52139939def4eeae7eaa442fa73d434e3c5cc717ed6b0d2d6bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:22.478973Z","signature_b64":"UHb9MzLqr4CIYUEUr0G48V0jK+La1NYFXF48/JgGHqygamzqrMMgiq6czUwZSDUkZ2tIIp91m/uz4aoTCVdVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fa94a0303b8e52139939def4eeae7eaa442fa73d434e3c5cc717ed6b0d2d6bf","last_reissued_at":"2026-05-18T00:13:22.478232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:22.478232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04466","source_version":1,"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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9eBToSLsvHtZf52G/q5jPL0cmgfMjLeMiqXUObRz0rBl/i44M6inVy45rvSnWCQ4nqu4KLZh0OAJ6cu59w4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:28:35.608647Z"},"content_sha256":"ea972b3096eff2a80b7d972c8fcc27a47679faaabc23f21308906b6aba755836","schema_version":"1.0","event_id":"sha256:ea972b3096eff2a80b7d972c8fcc27a47679faaabc23f21308906b6aba755836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P6UUUAYDXDSSCOMTTXXU52XH5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fusing Recency into Neural Machine Translation with an Inter-Sentence Gate Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Deyi Xiong, Shaohui Kuang","submitted_at":"2018-06-12T12:37:20Z","abstract_excerpt":"Neural machine translation (NMT) systems are usually trained on a large amount of bilingual sentence pairs and translate one sentence at a time, ignoring inter-sentence information. This may make the translation of a sentence ambiguous or even inconsistent with the translations of neighboring sentences. In order to handle this issue, we propose an inter-sentence gate model that uses the same encoder to encode two adjacent sentences and controls the amount of information flowing from the preceding sentence to the translation of the current sentence with an inter-sentence gate. In this way, our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04466","kind":"arxiv","version":1},"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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWT+UDTAaG6XK41M6M39XiwxMZa1bkQgITudLC1Xs5tQOV/tRRpYWbUNc7X1KLog7ss6GXkgrwi+664Cfl7yBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:28:35.609222Z"},"content_sha256":"66e4d1f2f3a4c4191c62169159aaac8a5905bd2313901e1a5d92763a533e8611","schema_version":"1.0","event_id":"sha256:66e4d1f2f3a4c4191c62169159aaac8a5905bd2313901e1a5d92763a533e8611"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/bundle.json","state_url":"https://pith.science/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/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-27T01:28:35Z","links":{"resolver":"https://pith.science/pith/P6UUUAYDXDSSCOMTTXXU52XH5K","bundle":"https://pith.science/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/bundle.json","state":"https://pith.science/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6UUUAYDXDSSCOMTTXXU52XH5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P6UUUAYDXDSSCOMTTXXU52XH5K","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":"ca0c15537204b11d48ae1184cf9b16430493e6bcd0fda27fb960e3487c2b6e98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T12:37:20Z","title_canon_sha256":"367281de28addcd6705247638f45296bc781c53397ef6348c281911128bccbc4"},"schema_version":"1.0","source":{"id":"1806.04466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04466","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04466v1","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04466","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6UUUAYDXDSS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6UUUAYDXDSSCOMT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6UUUAYD","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:66e4d1f2f3a4c4191c62169159aaac8a5905bd2313901e1a5d92763a533e8611","target":"graph","created_at":"2026-05-18T00:13:22Z","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 (NMT) systems are usually trained on a large amount of bilingual sentence pairs and translate one sentence at a time, ignoring inter-sentence information. This may make the translation of a sentence ambiguous or even inconsistent with the translations of neighboring sentences. In order to handle this issue, we propose an inter-sentence gate model that uses the same encoder to encode two adjacent sentences and controls the amount of information flowing from the preceding sentence to the translation of the current sentence with an inter-sentence gate. In this way, our ","authors_text":"Deyi Xiong, Shaohui Kuang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T12:37:20Z","title":"Fusing Recency into Neural Machine Translation with an Inter-Sentence Gate Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04466","kind":"arxiv","version":1},"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:ea972b3096eff2a80b7d972c8fcc27a47679faaabc23f21308906b6aba755836","target":"record","created_at":"2026-05-18T00:13:22Z","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":"ca0c15537204b11d48ae1184cf9b16430493e6bcd0fda27fb960e3487c2b6e98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T12:37:20Z","title_canon_sha256":"367281de28addcd6705247638f45296bc781c53397ef6348c281911128bccbc4"},"schema_version":"1.0","source":{"id":"1806.04466","kind":"arxiv","version":1}},"canonical_sha256":"7fa94a0303b8e52139939def4eeae7eaa442fa73d434e3c5cc717ed6b0d2d6bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fa94a0303b8e52139939def4eeae7eaa442fa73d434e3c5cc717ed6b0d2d6bf","first_computed_at":"2026-05-18T00:13:22.478232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:22.478232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UHb9MzLqr4CIYUEUr0G48V0jK+La1NYFXF48/JgGHqygamzqrMMgiq6czUwZSDUkZ2tIIp91m/uz4aoTCVdVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:22.478973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea972b3096eff2a80b7d972c8fcc27a47679faaabc23f21308906b6aba755836","sha256:66e4d1f2f3a4c4191c62169159aaac8a5905bd2313901e1a5d92763a533e8611"],"state_sha256":"29959978bac8e217848cee430d5c22d9fc73e1fe88f751793a35c0bc72df85df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooikH6Iusve62K2xbIIO+c2/AiwExFS+VNRvEoK4BDNkxnlMAmxaq62vOMPJx32LmcPTOBj46gr333Ufrg4LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:28:35.612830Z","bundle_sha256":"bbbed4f12441b5b019bc9eb3fef8c6cb2b1d603858df81d8a123390ea423a2b6"}}