{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BUEL2B5S4LO3UE2UAJZDFJQW2U","short_pith_number":"pith:BUEL2B5S","schema_version":"1.0","canonical_sha256":"0d08bd07b2e2ddba1354027232a616d5061314d788c7ad826eda5ab53b36b849","source":{"kind":"arxiv","id":"1808.04138","version":1},"attestation_state":"computed","paper":{"title":"Parsimonious HMMs for Offline Handwritten Chinese Text Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jun Du, Wenchao Wang, Zi-Rui Wang","submitted_at":"2018-08-13T10:26:56Z","abstract_excerpt":"Recently, hidden Markov models (HMMs) have achieved promising results for offline handwritten Chinese text recognition. However, due to the large vocabulary of Chinese characters with each modeled by a uniform and fixed number of hidden states, a high demand of memory and computation is required. In this study, to address this issue, we present parsimonious HMMs via the state tying which can fully utilize the similarities among different Chinese characters. Two-step algorithm with the data-driven question-set is adopted to generate the tied-state pool using the likelihood measure. The proposed"},"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":"1808.04138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-08-13T10:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"240a22fba8ce50a41acaa6619c246e13aa47956c9fffe37f40a10f794c1d6458","abstract_canon_sha256":"3b57f63f8d7df49b4ca635bfa9360b452c43e2c42fd07eadf4831c2702a9651b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:18.777695Z","signature_b64":"d9tfEMjmJdHrd6eG6YbaRzY7TFLujXelkQH+lBmy9Fj10gf4BqnLGIkRZeiZxZ1VQL8GGuKYmGKjmYEPT9dfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d08bd07b2e2ddba1354027232a616d5061314d788c7ad826eda5ab53b36b849","last_reissued_at":"2026-05-18T00:08:18.777287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:18.777287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parsimonious HMMs for Offline Handwritten Chinese Text Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jun Du, Wenchao Wang, Zi-Rui Wang","submitted_at":"2018-08-13T10:26:56Z","abstract_excerpt":"Recently, hidden Markov models (HMMs) have achieved promising results for offline handwritten Chinese text recognition. However, due to the large vocabulary of Chinese characters with each modeled by a uniform and fixed number of hidden states, a high demand of memory and computation is required. In this study, to address this issue, we present parsimonious HMMs via the state tying which can fully utilize the similarities among different Chinese characters. Two-step algorithm with the data-driven question-set is adopted to generate the tied-state pool using the likelihood measure. The proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04138","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":"1808.04138","created_at":"2026-05-18T00:08:18.777355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04138v1","created_at":"2026-05-18T00:08:18.777355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04138","created_at":"2026-05-18T00:08:18.777355+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUEL2B5S4LO3","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUEL2B5S4LO3UE2U","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUEL2B5S","created_at":"2026-05-18T12:32:16.446611+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/BUEL2B5S4LO3UE2UAJZDFJQW2U","json":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U.json","graph_json":"https://pith.science/api/pith-number/BUEL2B5S4LO3UE2UAJZDFJQW2U/graph.json","events_json":"https://pith.science/api/pith-number/BUEL2B5S4LO3UE2UAJZDFJQW2U/events.json","paper":"https://pith.science/paper/BUEL2B5S"},"agent_actions":{"view_html":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U","download_json":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U.json","view_paper":"https://pith.science/paper/BUEL2B5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04138&json=true","fetch_graph":"https://pith.science/api/pith-number/BUEL2B5S4LO3UE2UAJZDFJQW2U/graph.json","fetch_events":"https://pith.science/api/pith-number/BUEL2B5S4LO3UE2UAJZDFJQW2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U/action/storage_attestation","attest_author":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U/action/author_attestation","sign_citation":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U/action/citation_signature","submit_replication":"https://pith.science/pith/BUEL2B5S4LO3UE2UAJZDFJQW2U/action/replication_record"}},"created_at":"2026-05-18T00:08:18.777355+00:00","updated_at":"2026-05-18T00:08:18.777355+00:00"}