{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JTLESBYUWCSLAXLHC2PI5EX545","short_pith_number":"pith:JTLESBYU","canonical_record":{"source":{"id":"1808.09943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T17:46:50Z","cross_cats_sorted":[],"title_canon_sha256":"ad735c6b2f57851c6e4a6de5bcbd02c531ee40f4ceaf61c7e1388c6775f403c5","abstract_canon_sha256":"6733f54441d49e012b2a4264314abb580efca3a7541dfedd940daff9a5f61d2c"},"schema_version":"1.0"},"canonical_sha256":"4cd6490714b0a4b05d67169e8e92fde753f80820bde2f986eb9a36cd67d53164","source":{"kind":"arxiv","id":"1808.09943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09943","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09943v1","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09943","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"JTLESBYUWCSL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JTLESBYUWCSLAXLH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JTLESBYU","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JTLESBYUWCSLAXLHC2PI5EX545","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T17:46:50Z","cross_cats_sorted":[],"title_canon_sha256":"ad735c6b2f57851c6e4a6de5bcbd02c531ee40f4ceaf61c7e1388c6775f403c5","abstract_canon_sha256":"6733f54441d49e012b2a4264314abb580efca3a7541dfedd940daff9a5f61d2c"},"schema_version":"1.0"},"canonical_sha256":"4cd6490714b0a4b05d67169e8e92fde753f80820bde2f986eb9a36cd67d53164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:53.905254Z","signature_b64":"7bzoVpVNFWi5Pe6G+Qe9c4C7SfYhMqL4ji8vveJUjjEHsbhNyODKMu7PvJNWzu7AEmItyWo9jfG8wMSq4emYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cd6490714b0a4b05d67169e8e92fde753f80820bde2f986eb9a36cd67d53164","last_reissued_at":"2026-05-18T00:06:53.904621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:53.904621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09943","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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAXYFfnqqwYNE/+e1N6Qd26HwTd4cAF6aMbkCVOIM4Q6SSe0ytyCXKKrJN9pfZ3em+3NDmC53/Sq2KcI490ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:14:43.172583Z"},"content_sha256":"b919d4b5caffdf4b7061f42cdc8e56b73ed5574f32d805bad166a2b73c6c585c","schema_version":"1.0","event_id":"sha256:b919d4b5caffdf4b7061f42cdc8e56b73ed5574f32d805bad166a2b73c6c585c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JTLESBYUWCSLAXLHC2PI5EX545","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Character-Based Neural Machine Translation with Capacity and Compression","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ankur Bapna, Colin Cherry, George Foster, Orhan Firat, Wolfgang Macherey","submitted_at":"2018-08-29T17:46:50Z","abstract_excerpt":"Translating characters instead of words or word-fragments has the potential to simplify the processing pipeline for neural machine translation (NMT), and improve results by eliminating hyper-parameters and manual feature engineering. However, it results in longer sequences in which each symbol contains less information, creating both modeling and computational challenges. In this paper, we show that the modeling problem can be solved by standard sequence-to-sequence architectures of sufficient depth, and that deep models operating at the character level outperform identical models operating ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09943","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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BSCOM3ofZDPqn/B42/1YhT2606Dx0PYnGLbR64MoIkcwjzeUf0qSgRiHFuwsoNaID6TsyJDjROD2BfASnqyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:14:43.173277Z"},"content_sha256":"4463f9a8cb3775bd0ac696bf93fc78b75ba51fdf3818f970417eca779849e3b6","schema_version":"1.0","event_id":"sha256:4463f9a8cb3775bd0ac696bf93fc78b75ba51fdf3818f970417eca779849e3b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTLESBYUWCSLAXLHC2PI5EX545/bundle.json","state_url":"https://pith.science/pith/JTLESBYUWCSLAXLHC2PI5EX545/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTLESBYUWCSLAXLHC2PI5EX545/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-05-30T02:14:43Z","links":{"resolver":"https://pith.science/pith/JTLESBYUWCSLAXLHC2PI5EX545","bundle":"https://pith.science/pith/JTLESBYUWCSLAXLHC2PI5EX545/bundle.json","state":"https://pith.science/pith/JTLESBYUWCSLAXLHC2PI5EX545/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTLESBYUWCSLAXLHC2PI5EX545/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JTLESBYUWCSLAXLHC2PI5EX545","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":"6733f54441d49e012b2a4264314abb580efca3a7541dfedd940daff9a5f61d2c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T17:46:50Z","title_canon_sha256":"ad735c6b2f57851c6e4a6de5bcbd02c531ee40f4ceaf61c7e1388c6775f403c5"},"schema_version":"1.0","source":{"id":"1808.09943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09943","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09943v1","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09943","created_at":"2026-05-18T00:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"JTLESBYUWCSL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JTLESBYUWCSLAXLH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JTLESBYU","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:4463f9a8cb3775bd0ac696bf93fc78b75ba51fdf3818f970417eca779849e3b6","target":"graph","created_at":"2026-05-18T00:06:53Z","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":"Translating characters instead of words or word-fragments has the potential to simplify the processing pipeline for neural machine translation (NMT), and improve results by eliminating hyper-parameters and manual feature engineering. However, it results in longer sequences in which each symbol contains less information, creating both modeling and computational challenges. In this paper, we show that the modeling problem can be solved by standard sequence-to-sequence architectures of sufficient depth, and that deep models operating at the character level outperform identical models operating ov","authors_text":"Ankur Bapna, Colin Cherry, George Foster, Orhan Firat, Wolfgang Macherey","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T17:46:50Z","title":"Revisiting Character-Based Neural Machine Translation with Capacity and Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09943","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:b919d4b5caffdf4b7061f42cdc8e56b73ed5574f32d805bad166a2b73c6c585c","target":"record","created_at":"2026-05-18T00:06:53Z","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":"6733f54441d49e012b2a4264314abb580efca3a7541dfedd940daff9a5f61d2c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T17:46:50Z","title_canon_sha256":"ad735c6b2f57851c6e4a6de5bcbd02c531ee40f4ceaf61c7e1388c6775f403c5"},"schema_version":"1.0","source":{"id":"1808.09943","kind":"arxiv","version":1}},"canonical_sha256":"4cd6490714b0a4b05d67169e8e92fde753f80820bde2f986eb9a36cd67d53164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cd6490714b0a4b05d67169e8e92fde753f80820bde2f986eb9a36cd67d53164","first_computed_at":"2026-05-18T00:06:53.904621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:53.904621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bzoVpVNFWi5Pe6G+Qe9c4C7SfYhMqL4ji8vveJUjjEHsbhNyODKMu7PvJNWzu7AEmItyWo9jfG8wMSq4emYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:53.905254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b919d4b5caffdf4b7061f42cdc8e56b73ed5574f32d805bad166a2b73c6c585c","sha256:4463f9a8cb3775bd0ac696bf93fc78b75ba51fdf3818f970417eca779849e3b6"],"state_sha256":"a0c1530856c8190656019942b1e0f7e3440e311c05f8eb598ea2facc6912edf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY1mQSHykNkmJWVfxoWyUVzmFzUbhkw3DGm9eZR9Bnq3KkpNOvYo6iTijFcjHyVaQLh7zdTyRXn+mbH2be8zAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:14:43.176845Z","bundle_sha256":"9825fb015b5cf25861e12306bd2c65f73b711c7d2ec82f479719ef982dfc5606"}}