{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O3A7CDH6PUOEXNFEYKUKMEORUB","short_pith_number":"pith:O3A7CDH6","schema_version":"1.0","canonical_sha256":"76c1f10cfe7d1c4bb4a4c2a8a611d1a05d365c56067f0ea879eeffe487610e73","source":{"kind":"arxiv","id":"1811.04719","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jind\\v{r}ich Helcl, Jind\\v{r}ich Libovick\\'y","submitted_at":"2018-11-12T13:40:04Z","abstract_excerpt":"Autoregressive decoding is the only part of sequence-to-sequence models that prevents them from massive parallelization at inference time. Non-autoregressive models enable the decoder to generate all output symbols independently in parallel. We present a novel non-autoregressive architecture based on connectionist temporal classification and evaluate it on the task of neural machine translation. Unlike other non-autoregressive methods which operate in several steps, our model can be trained end-to-end. We conduct experiments on the WMT English-Romanian and English-German datasets. Our models a"},"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":"1811.04719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-12T13:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"fd86711989edec517d3a6bdf5b8dfeecf902510481b47d8ae81af92dd0eeb771","abstract_canon_sha256":"c771a2f94ce676a9e4438e0162bf7ee90730eb4f6e077ceb25d52db8ee360558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:04.252229Z","signature_b64":"q333Yqs4sQzEWaiBGhHw084In0oDUALGex7NJu6ZQJnBr4Pr7d80sq1l+cSSTLi8jqDmkSC0xegx6t4SL8COCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c1f10cfe7d1c4bb4a4c2a8a611d1a05d365c56067f0ea879eeffe487610e73","last_reissued_at":"2026-05-18T00:01:04.251605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:04.251605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jind\\v{r}ich Helcl, Jind\\v{r}ich Libovick\\'y","submitted_at":"2018-11-12T13:40:04Z","abstract_excerpt":"Autoregressive decoding is the only part of sequence-to-sequence models that prevents them from massive parallelization at inference time. Non-autoregressive models enable the decoder to generate all output symbols independently in parallel. We present a novel non-autoregressive architecture based on connectionist temporal classification and evaluate it on the task of neural machine translation. Unlike other non-autoregressive methods which operate in several steps, our model can be trained end-to-end. We conduct experiments on the WMT English-Romanian and English-German datasets. Our models a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04719","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.04719","created_at":"2026-05-18T00:01:04.251700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04719v1","created_at":"2026-05-18T00:01:04.251700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04719","created_at":"2026-05-18T00:01:04.251700+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3A7CDH6PUOE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3A7CDH6PUOEXNFE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3A7CDH6","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB","json":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB.json","graph_json":"https://pith.science/api/pith-number/O3A7CDH6PUOEXNFEYKUKMEORUB/graph.json","events_json":"https://pith.science/api/pith-number/O3A7CDH6PUOEXNFEYKUKMEORUB/events.json","paper":"https://pith.science/paper/O3A7CDH6"},"agent_actions":{"view_html":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB","download_json":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB.json","view_paper":"https://pith.science/paper/O3A7CDH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04719&json=true","fetch_graph":"https://pith.science/api/pith-number/O3A7CDH6PUOEXNFEYKUKMEORUB/graph.json","fetch_events":"https://pith.science/api/pith-number/O3A7CDH6PUOEXNFEYKUKMEORUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB/action/storage_attestation","attest_author":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB/action/author_attestation","sign_citation":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB/action/citation_signature","submit_replication":"https://pith.science/pith/O3A7CDH6PUOEXNFEYKUKMEORUB/action/replication_record"}},"created_at":"2026-05-18T00:01:04.251700+00:00","updated_at":"2026-05-18T00:01:04.251700+00:00"}