{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HW7B6FVO4AU2VLWHGO6MVMGOMU","short_pith_number":"pith:HW7B6FVO","schema_version":"1.0","canonical_sha256":"3dbe1f16aee029aaaec733bccab0ce6506f389164ddd9e6c0163631d5e39b2cd","source":{"kind":"arxiv","id":"1211.6181","version":2},"attestation_state":"computed","paper":{"title":"Exponential Bounds for Convergence of Entropy Rate Approximations in Hidden Markov Models Satisfying a Path-Mergeability Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Nicholas F. Travers","submitted_at":"2012-11-27T02:21:02Z","abstract_excerpt":"A hidden Markov model (HMM) is said to have path-mergeable states if for any two states i,j there exists a word w and state k such that it is possible to transition from both i and j to k while emitting w. We show that for a finite HMM with path-mergeable states the block estimates of the entropy rate converge exponentially fast. We also show that the path-mergeability property is asymptotically typical in the space of HMM topolgies and easily testable."},"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":"1211.6181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-27T02:21:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9ea8d4b4f791eb66e5e9db29d82b874dea9667218e467247435ad934326131e9","abstract_canon_sha256":"b0f6136944751825647e827119f90a50186993c8e8b891d3b83d2d862ca5a4d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:11.444572Z","signature_b64":"/H2nBLBuezI+wg4frhQywP93mUuBpM5hdjIl83oMjXln9fASnTNcenUKiDuVS4Rca01T+vROb2IFcPX/XCG9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dbe1f16aee029aaaec733bccab0ce6506f389164ddd9e6c0163631d5e39b2cd","last_reissued_at":"2026-05-18T03:00:11.443856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:11.443856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Bounds for Convergence of Entropy Rate Approximations in Hidden Markov Models Satisfying a Path-Mergeability Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Nicholas F. Travers","submitted_at":"2012-11-27T02:21:02Z","abstract_excerpt":"A hidden Markov model (HMM) is said to have path-mergeable states if for any two states i,j there exists a word w and state k such that it is possible to transition from both i and j to k while emitting w. We show that for a finite HMM with path-mergeable states the block estimates of the entropy rate converge exponentially fast. We also show that the path-mergeability property is asymptotically typical in the space of HMM topolgies and easily testable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6181","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":"1211.6181","created_at":"2026-05-18T03:00:11.443958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6181v2","created_at":"2026-05-18T03:00:11.443958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6181","created_at":"2026-05-18T03:00:11.443958+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW7B6FVO4AU2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW7B6FVO4AU2VLWH","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW7B6FVO","created_at":"2026-05-18T12:27:09.501522+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/HW7B6FVO4AU2VLWHGO6MVMGOMU","json":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU.json","graph_json":"https://pith.science/api/pith-number/HW7B6FVO4AU2VLWHGO6MVMGOMU/graph.json","events_json":"https://pith.science/api/pith-number/HW7B6FVO4AU2VLWHGO6MVMGOMU/events.json","paper":"https://pith.science/paper/HW7B6FVO"},"agent_actions":{"view_html":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU","download_json":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU.json","view_paper":"https://pith.science/paper/HW7B6FVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6181&json=true","fetch_graph":"https://pith.science/api/pith-number/HW7B6FVO4AU2VLWHGO6MVMGOMU/graph.json","fetch_events":"https://pith.science/api/pith-number/HW7B6FVO4AU2VLWHGO6MVMGOMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU/action/storage_attestation","attest_author":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU/action/author_attestation","sign_citation":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU/action/citation_signature","submit_replication":"https://pith.science/pith/HW7B6FVO4AU2VLWHGO6MVMGOMU/action/replication_record"}},"created_at":"2026-05-18T03:00:11.443958+00:00","updated_at":"2026-05-18T03:00:11.443958+00:00"}