{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3RVH2JPXHEV3SITSGFW6FGWBPW","short_pith_number":"pith:3RVH2JPX","canonical_record":{"source":{"id":"1808.09374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-28T15:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"6a20f8c63b11055a4ad19b799c942c14b6d6f47e08c6858055aebb537ec87aa6","abstract_canon_sha256":"744c3380edf639988f56f89e63257bff54034cee7d2397e7a6013925593aa339"},"schema_version":"1.0"},"canonical_sha256":"dc6a7d25f7392bb92272316de29ac17d827d377bf443be93b4225220049fd54d","source":{"kind":"arxiv","id":"1808.09374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09374","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09374v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09374","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"3RVH2JPXHEV3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3RVH2JPXHEV3SITS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3RVH2JPX","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3RVH2JPXHEV3SITSGFW6FGWBPW","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-28T15:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"6a20f8c63b11055a4ad19b799c942c14b6d6f47e08c6858055aebb537ec87aa6","abstract_canon_sha256":"744c3380edf639988f56f89e63257bff54034cee7d2397e7a6013925593aa339"},"schema_version":"1.0"},"canonical_sha256":"dc6a7d25f7392bb92272316de29ac17d827d377bf443be93b4225220049fd54d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.549971Z","signature_b64":"SzWObWxeuzV4eHye3dS7duz7pqhUAoHLccZ21RFXx3ySRHSLUXU5hRCJEiES57GDKjD2S8/6dD+ePkESoW1tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6a7d25f7392bb92272316de29ac17d827d377bf443be93b4225220049fd54d","last_reissued_at":"2026-05-18T00:07:01.549393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.549393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09374","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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/8Fhp4uiXrvxkgYhdInnmRHtALYxzZ/itfodYfNF/WrIuObn/EsYbQgD2kFPJ9CGHrEfrgSfQBSauHYuc/LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:08:11.480639Z"},"content_sha256":"c45969ebfafbdd48f5be891e37dfef4942198b54b1608e1724e67c2ff4a20784","schema_version":"1.0","event_id":"sha256:c45969ebfafbdd48f5be891e37dfef4942198b54b1608e1724e67c2ff4a20784"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3RVH2JPXHEV3SITSGFW6FGWBPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tree-based Decoder for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Graham Neubig, Hieu Pham, Pengcheng Yin, Xinyi Wang","submitted_at":"2018-08-28T15:52:19Z","abstract_excerpt":"Recent advances in Neural Machine Translation (NMT) show that adding syntactic information to NMT systems can improve the quality of their translations. Most existing work utilizes some specific types of linguistically-inspired tree structures, like constituency and dependency parse trees. This is often done via a standard RNN decoder that operates on a linearized target tree structure. However, it is an open question of what specific linguistic formalism, if any, is the best structural representation for NMT. In this paper, we (1) propose an NMT model that can naturally generate the topology "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09374","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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7D4TxlGywh6H7IZ+dY1EMkVD1TVM2QchpMT2wDQAvPkqnAXI/7EoggEHG5YdLRQPsRcOilayz2oz6zeDC4VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:08:11.480978Z"},"content_sha256":"e8fa76a766de0628e7144fd8352c8c54a8803c6550c63aef87662ba0e80f56c6","schema_version":"1.0","event_id":"sha256:e8fa76a766de0628e7144fd8352c8c54a8803c6550c63aef87662ba0e80f56c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/bundle.json","state_url":"https://pith.science/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/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-06-04T17:08:11Z","links":{"resolver":"https://pith.science/pith/3RVH2JPXHEV3SITSGFW6FGWBPW","bundle":"https://pith.science/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/bundle.json","state":"https://pith.science/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RVH2JPXHEV3SITSGFW6FGWBPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3RVH2JPXHEV3SITSGFW6FGWBPW","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":"744c3380edf639988f56f89e63257bff54034cee7d2397e7a6013925593aa339","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-28T15:52:19Z","title_canon_sha256":"6a20f8c63b11055a4ad19b799c942c14b6d6f47e08c6858055aebb537ec87aa6"},"schema_version":"1.0","source":{"id":"1808.09374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09374","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09374v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09374","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"3RVH2JPXHEV3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3RVH2JPXHEV3SITS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3RVH2JPX","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:e8fa76a766de0628e7144fd8352c8c54a8803c6550c63aef87662ba0e80f56c6","target":"graph","created_at":"2026-05-18T00:07:01Z","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":"Recent advances in Neural Machine Translation (NMT) show that adding syntactic information to NMT systems can improve the quality of their translations. Most existing work utilizes some specific types of linguistically-inspired tree structures, like constituency and dependency parse trees. This is often done via a standard RNN decoder that operates on a linearized target tree structure. However, it is an open question of what specific linguistic formalism, if any, is the best structural representation for NMT. In this paper, we (1) propose an NMT model that can naturally generate the topology ","authors_text":"Graham Neubig, Hieu Pham, Pengcheng Yin, Xinyi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-28T15:52:19Z","title":"A Tree-based Decoder for Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09374","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:c45969ebfafbdd48f5be891e37dfef4942198b54b1608e1724e67c2ff4a20784","target":"record","created_at":"2026-05-18T00:07:01Z","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":"744c3380edf639988f56f89e63257bff54034cee7d2397e7a6013925593aa339","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-28T15:52:19Z","title_canon_sha256":"6a20f8c63b11055a4ad19b799c942c14b6d6f47e08c6858055aebb537ec87aa6"},"schema_version":"1.0","source":{"id":"1808.09374","kind":"arxiv","version":1}},"canonical_sha256":"dc6a7d25f7392bb92272316de29ac17d827d377bf443be93b4225220049fd54d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6a7d25f7392bb92272316de29ac17d827d377bf443be93b4225220049fd54d","first_computed_at":"2026-05-18T00:07:01.549393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:01.549393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SzWObWxeuzV4eHye3dS7duz7pqhUAoHLccZ21RFXx3ySRHSLUXU5hRCJEiES57GDKjD2S8/6dD+ePkESoW1tCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:01.549971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c45969ebfafbdd48f5be891e37dfef4942198b54b1608e1724e67c2ff4a20784","sha256:e8fa76a766de0628e7144fd8352c8c54a8803c6550c63aef87662ba0e80f56c6"],"state_sha256":"82f7d6e5d31d6a59826f1bc35f5da537d10735d1f8f9d44e536ab0e7d5374b75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVQcdwK7Ok0Pej0js/RBfsQ8RnLfLb2jATXJ3Y0d7UqlKCrjVuQ0UYxVtVwDztQdvPore2noRNW6Rp9gY/JVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:08:11.483344Z","bundle_sha256":"63b825c6de175fd3ac8095ae981e9fe32bcff5d87e95eca13b62fce7e7687b06"}}