{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PLSGVRNRF52B7AWYQB3IETNPEQ","short_pith_number":"pith:PLSGVRNR","canonical_record":{"source":{"id":"1810.12546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-30T06:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"24151c56f0b32efc9bf87d4b473e140477cc703f85e4b790f8cd47333d45059b","abstract_canon_sha256":"d838581b0a8c597d81339d43756d714bfd39de6c937a3e54baed2b854e992410"},"schema_version":"1.0"},"canonical_sha256":"7ae46ac5b12f741f82d88076824daf2421ea5f6ab09b0abe06c761d450bdd2c4","source":{"kind":"arxiv","id":"1810.12546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12546","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12546v1","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12546","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"pith_short_12","alias_value":"PLSGVRNRF52B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PLSGVRNRF52B7AWY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PLSGVRNR","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PLSGVRNRF52B7AWYQB3IETNPEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-30T06:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"24151c56f0b32efc9bf87d4b473e140477cc703f85e4b790f8cd47333d45059b","abstract_canon_sha256":"d838581b0a8c597d81339d43756d714bfd39de6c937a3e54baed2b854e992410"},"schema_version":"1.0"},"canonical_sha256":"7ae46ac5b12f741f82d88076824daf2421ea5f6ab09b0abe06c761d450bdd2c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:56.765471Z","signature_b64":"hnMBl0XdgjSdn4ulXsbfa5G/VKBSkVqeb3TPqjI1u24eaM6DVq0y+WAsi2Nw/uoyLaMn/vzXn/7YJ2bRNEf5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae46ac5b12f741f82d88076824daf2421ea5f6ab09b0abe06c761d450bdd2c4","last_reissued_at":"2026-05-18T00:01:56.764876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:56.764876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12546","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:01:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x857uzBfLbAI694rcv2u0S5waeIeBrnoWi7efDvBtdyCJHjreTqfOhVtr+1eFa9LtEoQy9mJEngR68qDUB7HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:19:00.605566Z"},"content_sha256":"fa717d7657bb5f402e91565993a03a8114948c153390489e22f8b9fc79176fe7","schema_version":"1.0","event_id":"sha256:fa717d7657bb5f402e91565993a03a8114948c153390489e22f8b9fc79176fe7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PLSGVRNRF52B7AWYQB3IETNPEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplifying Neural Machine Translation with Addition-Subtraction Twin-Gated Recurrent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Biao Zhang, Deyi Xiong, Huiji Zhang, Jinsong Su, Qian Lin","submitted_at":"2018-10-30T06:55:23Z","abstract_excerpt":"In this paper, we propose an additionsubtraction twin-gated recurrent network (ATR) to simplify neural machine translation. The recurrent units of ATR are heavily simplified to have the smallest number of weight matrices among units of all existing gated RNNs. With the simple addition and subtraction operation, we introduce a twin-gated mechanism to build input and forget gates which are highly correlated. Despite this simplification, the essential non-linearities and capability of modeling long-distance dependencies are preserved. Additionally, the proposed ATR is more transparent than LSTM/G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12546","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:01:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUbNKPDIiUzQ8Gn8jmcfhDStV4FE6UZ25EJjw6XyFc19iuGTu9Russz2Z1XSm7JGONZ/ICcgh8s7bvnxI+IQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:19:00.605966Z"},"content_sha256":"4a469367c1a26a8a8c93f4e0c9882603c9391f33fd9afdf8ceb6d3f27d720aa8","schema_version":"1.0","event_id":"sha256:4a469367c1a26a8a8c93f4e0c9882603c9391f33fd9afdf8ceb6d3f27d720aa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/bundle.json","state_url":"https://pith.science/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/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-26T23:19:00Z","links":{"resolver":"https://pith.science/pith/PLSGVRNRF52B7AWYQB3IETNPEQ","bundle":"https://pith.science/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/bundle.json","state":"https://pith.science/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLSGVRNRF52B7AWYQB3IETNPEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PLSGVRNRF52B7AWYQB3IETNPEQ","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":"d838581b0a8c597d81339d43756d714bfd39de6c937a3e54baed2b854e992410","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-30T06:55:23Z","title_canon_sha256":"24151c56f0b32efc9bf87d4b473e140477cc703f85e4b790f8cd47333d45059b"},"schema_version":"1.0","source":{"id":"1810.12546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12546","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12546v1","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12546","created_at":"2026-05-18T00:01:56Z"},{"alias_kind":"pith_short_12","alias_value":"PLSGVRNRF52B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PLSGVRNRF52B7AWY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PLSGVRNR","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:4a469367c1a26a8a8c93f4e0c9882603c9391f33fd9afdf8ceb6d3f27d720aa8","target":"graph","created_at":"2026-05-18T00:01:56Z","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 this paper, we propose an additionsubtraction twin-gated recurrent network (ATR) to simplify neural machine translation. The recurrent units of ATR are heavily simplified to have the smallest number of weight matrices among units of all existing gated RNNs. With the simple addition and subtraction operation, we introduce a twin-gated mechanism to build input and forget gates which are highly correlated. Despite this simplification, the essential non-linearities and capability of modeling long-distance dependencies are preserved. Additionally, the proposed ATR is more transparent than LSTM/G","authors_text":"Biao Zhang, Deyi Xiong, Huiji Zhang, Jinsong Su, Qian Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-30T06:55:23Z","title":"Simplifying Neural Machine Translation with Addition-Subtraction Twin-Gated Recurrent Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12546","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:fa717d7657bb5f402e91565993a03a8114948c153390489e22f8b9fc79176fe7","target":"record","created_at":"2026-05-18T00:01:56Z","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":"d838581b0a8c597d81339d43756d714bfd39de6c937a3e54baed2b854e992410","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-30T06:55:23Z","title_canon_sha256":"24151c56f0b32efc9bf87d4b473e140477cc703f85e4b790f8cd47333d45059b"},"schema_version":"1.0","source":{"id":"1810.12546","kind":"arxiv","version":1}},"canonical_sha256":"7ae46ac5b12f741f82d88076824daf2421ea5f6ab09b0abe06c761d450bdd2c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ae46ac5b12f741f82d88076824daf2421ea5f6ab09b0abe06c761d450bdd2c4","first_computed_at":"2026-05-18T00:01:56.764876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:56.764876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hnMBl0XdgjSdn4ulXsbfa5G/VKBSkVqeb3TPqjI1u24eaM6DVq0y+WAsi2Nw/uoyLaMn/vzXn/7YJ2bRNEf5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:56.765471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa717d7657bb5f402e91565993a03a8114948c153390489e22f8b9fc79176fe7","sha256:4a469367c1a26a8a8c93f4e0c9882603c9391f33fd9afdf8ceb6d3f27d720aa8"],"state_sha256":"17d68a08b2620dcac12cca0c54d8f8a5b1dbdf3a7577f89073b5433a86545a3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znU7bQaeKFh4ty2FD/MaJyEEpDs6VSa6Ms9Sh/RJRuFabWM3UJTZ3tflUVDDO1y8MZHwCnxX/JbNaDc+1J6jBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:19:00.608816Z","bundle_sha256":"da0457a20e0e1a1bf08f151650a1063baa9852a41d252ff6308b68c429b4cd02"}}