{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L3WNVL6DGIFM4EKI6INSCLE63R","short_pith_number":"pith:L3WNVL6D","schema_version":"1.0","canonical_sha256":"5eecdaafc3320ace1148f21b212c9edc4f1265440d71219a2faffaf6102a6e27","source":{"kind":"arxiv","id":"1712.08841","version":2},"attestation_state":"computed","paper":{"title":"Dual Long Short-Term Memory Networks for Sub-Character Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"George Townsend, Han He, Hua Yan, Lei Wu, Xiaokun Yang, Yi Feng, Zhimin Gao","submitted_at":"2017-12-23T21:12:23Z","abstract_excerpt":"Characters have commonly been regarded as the minimal processing unit in Natural Language Processing (NLP). But many non-latin languages have hieroglyphic writing systems, involving a big alphabet with thousands or millions of characters. Each character is composed of even smaller parts, which are often ignored by the previous work. In this paper, we propose a novel architecture employing two stacked Long Short-Term Memory Networks (LSTMs) to learn sub-character level representation and capture deeper level of semantic meanings. To build a concrete study and substantiate the efficiency of our "},"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":"1712.08841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-23T21:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"37399f0e58d7de62942009e8e8d75687fae952fc3c09ea8b40f450cea9e9ede3","abstract_canon_sha256":"3f2c8a7246487c0d8a780f4921e879b0c931b1f17cf480508a7cef1ced9f7aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:43.147785Z","signature_b64":"yu6ITUyAY8YG+Fh7AfeyN52Rsg1FSbUwrQfRXbmieXV48zOEFpjPFA7Ox8EYa6dDvzoHgUBLdk5YKV6LxbZmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eecdaafc3320ace1148f21b212c9edc4f1265440d71219a2faffaf6102a6e27","last_reissued_at":"2026-05-18T00:26:43.147259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:43.147259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Long Short-Term Memory Networks for Sub-Character Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"George Townsend, Han He, Hua Yan, Lei Wu, Xiaokun Yang, Yi Feng, Zhimin Gao","submitted_at":"2017-12-23T21:12:23Z","abstract_excerpt":"Characters have commonly been regarded as the minimal processing unit in Natural Language Processing (NLP). But many non-latin languages have hieroglyphic writing systems, involving a big alphabet with thousands or millions of characters. Each character is composed of even smaller parts, which are often ignored by the previous work. In this paper, we propose a novel architecture employing two stacked Long Short-Term Memory Networks (LSTMs) to learn sub-character level representation and capture deeper level of semantic meanings. To build a concrete study and substantiate the efficiency of our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08841","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.08841","created_at":"2026-05-18T00:26:43.147330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08841v2","created_at":"2026-05-18T00:26:43.147330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08841","created_at":"2026-05-18T00:26:43.147330+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3WNVL6DGIFM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3WNVL6DGIFM4EKI","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3WNVL6D","created_at":"2026-05-18T12:31:28.150371+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/L3WNVL6DGIFM4EKI6INSCLE63R","json":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R.json","graph_json":"https://pith.science/api/pith-number/L3WNVL6DGIFM4EKI6INSCLE63R/graph.json","events_json":"https://pith.science/api/pith-number/L3WNVL6DGIFM4EKI6INSCLE63R/events.json","paper":"https://pith.science/paper/L3WNVL6D"},"agent_actions":{"view_html":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R","download_json":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R.json","view_paper":"https://pith.science/paper/L3WNVL6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08841&json=true","fetch_graph":"https://pith.science/api/pith-number/L3WNVL6DGIFM4EKI6INSCLE63R/graph.json","fetch_events":"https://pith.science/api/pith-number/L3WNVL6DGIFM4EKI6INSCLE63R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R/action/storage_attestation","attest_author":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R/action/author_attestation","sign_citation":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R/action/citation_signature","submit_replication":"https://pith.science/pith/L3WNVL6DGIFM4EKI6INSCLE63R/action/replication_record"}},"created_at":"2026-05-18T00:26:43.147330+00:00","updated_at":"2026-05-18T00:26:43.147330+00:00"}