{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WUA4ZGMAORX2ARAPVVMK4SB77C","short_pith_number":"pith:WUA4ZGMA","canonical_record":{"source":{"id":"1611.02344","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-07T23:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"78c550521521bde5ea4b9a84c91e51e12878df55d7cb95aa78718acf2d937af1","abstract_canon_sha256":"83f38e4f20599600e574354c6f53db14e74c646b479aa5bd0748d13a75022c2d"},"schema_version":"1.0"},"canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","source":{"kind":"arxiv","id":"1611.02344","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02344","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02344v3","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02344","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"WUA4ZGMAORX2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUA4ZGMAORX2ARAP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUA4ZGMA","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WUA4ZGMAORX2ARAPVVMK4SB77C","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02344","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-07T23:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"78c550521521bde5ea4b9a84c91e51e12878df55d7cb95aa78718acf2d937af1","abstract_canon_sha256":"83f38e4f20599600e574354c6f53db14e74c646b479aa5bd0748d13a75022c2d"},"schema_version":"1.0"},"canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:39.721751Z","signature_b64":"RmNHmsAdRVdwAT5GDYmO1zjR3iNDagt7ywQgqFUU5dV5jxG1aUq8zey/kHhCE1MLCxQ6WQ+1M+UQ1moH4SFzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","last_reissued_at":"2026-05-18T00:39:39.721384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:39.721384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02344","source_version":3,"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:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRxMH8eE1fmUCtb9T6cXgkPD6pH1Zu8nmPRoyeXJWIFQKmg4RxA8kganHIYOdRotnt/04sxsLDmt7F7ycbKVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:40:18.712172Z"},"content_sha256":"45cf760fd177a51b459a48c08615ff8dd0059d2b2ccba5d262b6fd99c096b90a","schema_version":"1.0","event_id":"sha256:45cf760fd177a51b459a48c08615ff8dd0059d2b2ccba5d262b6fd99c096b90a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WUA4ZGMAORX2ARAPVVMK4SB77C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Convolutional Encoder Model for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"David Grangier, Jonas Gehring, Michael Auli, Yann N. Dauphin","submitted_at":"2016-11-07T23:46:45Z","abstract_excerpt":"The prevalent approach to neural machine translation relies on bi-directional LSTMs to encode the source sentence. In this paper we present a faster and simpler architecture based on a succession of convolutional layers. This allows to encode the entire source sentence simultaneously compared to recurrent networks for which computation is constrained by temporal dependencies. On WMT'16 English-Romanian translation we achieve competitive accuracy to the state-of-the-art and we outperform several recently published results on the WMT'15 English-German task. Our models obtain almost the same accu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02344","kind":"arxiv","version":3},"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:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suBF/1jxgxtcFiSFkzPbrpdGYw9FaJnLnstJjxMQtHe+eDP8KLsWNhKSU4P6pTxQlRfNQKsrJaWjdDQ3BsF0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:40:18.712901Z"},"content_sha256":"24df4f64a88486413494f687d25a20813a527a8c0137d7929b3bc718d2bc12b0","schema_version":"1.0","event_id":"sha256:24df4f64a88486413494f687d25a20813a527a8c0137d7929b3bc718d2bc12b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/bundle.json","state_url":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/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-09T05:40:18Z","links":{"resolver":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C","bundle":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/bundle.json","state":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WUA4ZGMAORX2ARAPVVMK4SB77C","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":"83f38e4f20599600e574354c6f53db14e74c646b479aa5bd0748d13a75022c2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-07T23:46:45Z","title_canon_sha256":"78c550521521bde5ea4b9a84c91e51e12878df55d7cb95aa78718acf2d937af1"},"schema_version":"1.0","source":{"id":"1611.02344","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02344","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02344v3","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02344","created_at":"2026-05-18T00:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"WUA4ZGMAORX2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUA4ZGMAORX2ARAP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUA4ZGMA","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:24df4f64a88486413494f687d25a20813a527a8c0137d7929b3bc718d2bc12b0","target":"graph","created_at":"2026-05-18T00:39:39Z","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":"The prevalent approach to neural machine translation relies on bi-directional LSTMs to encode the source sentence. In this paper we present a faster and simpler architecture based on a succession of convolutional layers. This allows to encode the entire source sentence simultaneously compared to recurrent networks for which computation is constrained by temporal dependencies. On WMT'16 English-Romanian translation we achieve competitive accuracy to the state-of-the-art and we outperform several recently published results on the WMT'15 English-German task. Our models obtain almost the same accu","authors_text":"David Grangier, Jonas Gehring, Michael Auli, Yann N. Dauphin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-07T23:46:45Z","title":"A Convolutional Encoder Model for Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02344","kind":"arxiv","version":3},"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:45cf760fd177a51b459a48c08615ff8dd0059d2b2ccba5d262b6fd99c096b90a","target":"record","created_at":"2026-05-18T00:39:39Z","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":"83f38e4f20599600e574354c6f53db14e74c646b479aa5bd0748d13a75022c2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-07T23:46:45Z","title_canon_sha256":"78c550521521bde5ea4b9a84c91e51e12878df55d7cb95aa78718acf2d937af1"},"schema_version":"1.0","source":{"id":"1611.02344","kind":"arxiv","version":3}},"canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","first_computed_at":"2026-05-18T00:39:39.721384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:39.721384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RmNHmsAdRVdwAT5GDYmO1zjR3iNDagt7ywQgqFUU5dV5jxG1aUq8zey/kHhCE1MLCxQ6WQ+1M+UQ1moH4SFzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:39.721751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02344","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45cf760fd177a51b459a48c08615ff8dd0059d2b2ccba5d262b6fd99c096b90a","sha256:24df4f64a88486413494f687d25a20813a527a8c0137d7929b3bc718d2bc12b0"],"state_sha256":"ca7ab64ee879d1f1f3fe80ddebb7e61eaa71a033bb709963c7709dddd22e4117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoYxAgHMwgbIe7GPiX5RuHG7fm7+rO+RoKH28ZLEfKkVcMvZfJPxDCYS3i11j/DmBjcryQt66HIfAn8cec1/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:40:18.717097Z","bundle_sha256":"306a78a3c698af417a87ea519e8a54f6a5427bbe146b7cd505f9f7259d2abecc"}}