{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WUA4ZGMAORX2ARAPVVMK4SB77C","short_pith_number":"pith:WUA4ZGMA","schema_version":"1.0","canonical_sha256":"b501cc9980746fa0440fad58ae483ff88d1bc8701de7d379be30bad62f182d9d","source":{"kind":"arxiv","id":"1611.02344","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.02344","created_at":"2026-05-18T00:39:39.721445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02344v3","created_at":"2026-05-18T00:39:39.721445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02344","created_at":"2026-05-18T00:39:39.721445+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUA4ZGMAORX2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUA4ZGMAORX2ARAP","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUA4ZGMA","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05572","citing_title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"1710.10903","citing_title":"Graph Attention Networks","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C","json":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C.json","graph_json":"https://pith.science/api/pith-number/WUA4ZGMAORX2ARAPVVMK4SB77C/graph.json","events_json":"https://pith.science/api/pith-number/WUA4ZGMAORX2ARAPVVMK4SB77C/events.json","paper":"https://pith.science/paper/WUA4ZGMA"},"agent_actions":{"view_html":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C","download_json":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C.json","view_paper":"https://pith.science/paper/WUA4ZGMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02344&json=true","fetch_graph":"https://pith.science/api/pith-number/WUA4ZGMAORX2ARAPVVMK4SB77C/graph.json","fetch_events":"https://pith.science/api/pith-number/WUA4ZGMAORX2ARAPVVMK4SB77C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/action/storage_attestation","attest_author":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/action/author_attestation","sign_citation":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/action/citation_signature","submit_replication":"https://pith.science/pith/WUA4ZGMAORX2ARAPVVMK4SB77C/action/replication_record"}},"created_at":"2026-05-18T00:39:39.721445+00:00","updated_at":"2026-05-18T00:39:39.721445+00:00"}