{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5CUMJGXLXS6VOIU6UKESTL7ZAF","short_pith_number":"pith:5CUMJGXL","canonical_record":{"source":{"id":"1711.07019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-19T13:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"e387d5359260c9d523a0ef7b01367d8dc926ef0530f1f76bc48c8dee8937b3de","abstract_canon_sha256":"7b08edf3334a3f5de320206707b5588503201afb2e54f57b38d0708e55e0a7bd"},"schema_version":"1.0"},"canonical_sha256":"e8a8c49aebbcbd57229ea28929aff9014876e20bf8b3abf282bf7e71352db41e","source":{"kind":"arxiv","id":"1711.07019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07019","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07019v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07019","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"5CUMJGXLXS6V","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CUMJGXLXS6VOIU6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CUMJGXL","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5CUMJGXLXS6VOIU6UKESTL7ZAF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-19T13:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"e387d5359260c9d523a0ef7b01367d8dc926ef0530f1f76bc48c8dee8937b3de","abstract_canon_sha256":"7b08edf3334a3f5de320206707b5588503201afb2e54f57b38d0708e55e0a7bd"},"schema_version":"1.0"},"canonical_sha256":"e8a8c49aebbcbd57229ea28929aff9014876e20bf8b3abf282bf7e71352db41e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.148533Z","signature_b64":"83gvuNCJGHwShsj7l1SSW60v9YXeSKr0a+tWAaZWJ0HAa5YohOkinhwQLPgBRZhrpF0AByhpEQPrg+8kDgmKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a8c49aebbcbd57229ea28929aff9014876e20bf8b3abf282bf7e71352db41e","last_reissued_at":"2026-05-18T00:29:45.147570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.147570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07019","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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcu0WtvM5IwbU23r9ozgkTrWGZpTSXLJsUA7u1D6Q2EPQE40x7oWSCeMDY2fky/+wN0lG3CR5MdTMH4h6UDVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:40:38.460406Z"},"content_sha256":"1c6ab305e2327efd582f0e0b1c18173aefe77272dc2184aa9f4ff60ff69a00ca","schema_version":"1.0","event_id":"sha256:1c6ab305e2327efd582f0e0b1c18173aefe77272dc2184aa9f4ff60ff69a00ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5CUMJGXLXS6VOIU6UKESTL7ZAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incorporating Syntactic Uncertainty in Neural Machine Translation with Forest-to-Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gholamreza Haffari, Poorya Zaremoodi","submitted_at":"2017-11-19T13:57:30Z","abstract_excerpt":"Incorporating syntactic information in Neural Machine Translation models is a method to compensate their requirement for a large amount of parallel training text, especially for low-resource language pairs. Previous works on using syntactic information provided by (inevitably error-prone) parsers has been promising. In this paper, we propose a forest-to-sequence Attentional Neural Machine Translation model to make use of exponentially many parse trees of the source sentence to compensate for the parser errors. Our method represents the collection of parse trees as a packed forest, and learns a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07019","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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RqsbS5WpQCzAT04+AqVYy/U9Dt7KKkCCsQv8mtGglrnKk3TuAWhUjnzpe9R8aj/ofqZ83/RqA67lBBsnUJPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:40:38.460748Z"},"content_sha256":"4565551e9056360d248fde7a966911c6816cbc7dbb255833c430b4794735aa15","schema_version":"1.0","event_id":"sha256:4565551e9056360d248fde7a966911c6816cbc7dbb255833c430b4794735aa15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/bundle.json","state_url":"https://pith.science/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/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-27T15:40:38Z","links":{"resolver":"https://pith.science/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF","bundle":"https://pith.science/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/bundle.json","state":"https://pith.science/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CUMJGXLXS6VOIU6UKESTL7ZAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5CUMJGXLXS6VOIU6UKESTL7ZAF","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":"7b08edf3334a3f5de320206707b5588503201afb2e54f57b38d0708e55e0a7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-19T13:57:30Z","title_canon_sha256":"e387d5359260c9d523a0ef7b01367d8dc926ef0530f1f76bc48c8dee8937b3de"},"schema_version":"1.0","source":{"id":"1711.07019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07019","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07019v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07019","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"5CUMJGXLXS6V","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CUMJGXLXS6VOIU6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CUMJGXL","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4565551e9056360d248fde7a966911c6816cbc7dbb255833c430b4794735aa15","target":"graph","created_at":"2026-05-18T00:29:45Z","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":"Incorporating syntactic information in Neural Machine Translation models is a method to compensate their requirement for a large amount of parallel training text, especially for low-resource language pairs. Previous works on using syntactic information provided by (inevitably error-prone) parsers has been promising. In this paper, we propose a forest-to-sequence Attentional Neural Machine Translation model to make use of exponentially many parse trees of the source sentence to compensate for the parser errors. Our method represents the collection of parse trees as a packed forest, and learns a","authors_text":"Gholamreza Haffari, Poorya Zaremoodi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-19T13:57:30Z","title":"Incorporating Syntactic Uncertainty in Neural Machine Translation with Forest-to-Sequence Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07019","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:1c6ab305e2327efd582f0e0b1c18173aefe77272dc2184aa9f4ff60ff69a00ca","target":"record","created_at":"2026-05-18T00:29:45Z","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":"7b08edf3334a3f5de320206707b5588503201afb2e54f57b38d0708e55e0a7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-19T13:57:30Z","title_canon_sha256":"e387d5359260c9d523a0ef7b01367d8dc926ef0530f1f76bc48c8dee8937b3de"},"schema_version":"1.0","source":{"id":"1711.07019","kind":"arxiv","version":2}},"canonical_sha256":"e8a8c49aebbcbd57229ea28929aff9014876e20bf8b3abf282bf7e71352db41e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8a8c49aebbcbd57229ea28929aff9014876e20bf8b3abf282bf7e71352db41e","first_computed_at":"2026-05-18T00:29:45.147570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:45.147570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83gvuNCJGHwShsj7l1SSW60v9YXeSKr0a+tWAaZWJ0HAa5YohOkinhwQLPgBRZhrpF0AByhpEQPrg+8kDgmKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:45.148533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c6ab305e2327efd582f0e0b1c18173aefe77272dc2184aa9f4ff60ff69a00ca","sha256:4565551e9056360d248fde7a966911c6816cbc7dbb255833c430b4794735aa15"],"state_sha256":"d19b305a88f746170da38fde5f0a003679107abb8168260f019e4d9f9b490786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUwprdHdyARL6EQsaPU1KGD87KsL2XNGX4UMMFPt6aJrNDMGdlvzecIb+P8LlMTCx+S70LQ21Avfq4OUt6LLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:40:38.462631Z","bundle_sha256":"f51f006a918c69ba8554de80c7acfec69c033daa0cafd803eae7f6ffb63d5df3"}}