{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WLSIJE5WKHSC7SFH6QFGFL4PJW","short_pith_number":"pith:WLSIJE5W","schema_version":"1.0","canonical_sha256":"b2e48493b651e42fc8a7f40a62af8f4da18d52aa68cbca48a694a96b8ea69c57","source":{"kind":"arxiv","id":"1804.06170","version":1},"attestation_state":"computed","paper":{"title":"On Computing the Total Variation Distance of Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Stefan Kiefer","submitted_at":"2018-04-17T11:28:52Z","abstract_excerpt":"We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between the distributions on words that two hidden Markov models induce. The main results are: (1) it is undecidable whether the distance is greater than a given threshold; (2) approximation is #P-hard and in PSPACE."},"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":"1804.06170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-17T11:28:52Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"affbc426a26e0e05eb4fab1afdd53379219dee43a94ca7400a4db6af0d75a231","abstract_canon_sha256":"740b0f9ad342539e4207a80b01536d8e2afb23aa20b888790436f485e336945f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.524845Z","signature_b64":"ap+go1XdO0+ZIwHL7xY2Pm93IIjOhujR2yDxOXnPVoGHKTx6T6YE14DWDvwtEi22aSq2hTbGpLqvfKN4UFqYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e48493b651e42fc8a7f40a62af8f4da18d52aa68cbca48a694a96b8ea69c57","last_reissued_at":"2026-05-18T00:18:21.524227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.524227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computing the Total Variation Distance of Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Stefan Kiefer","submitted_at":"2018-04-17T11:28:52Z","abstract_excerpt":"We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between the distributions on words that two hidden Markov models induce. The main results are: (1) it is undecidable whether the distance is greater than a given threshold; (2) approximation is #P-hard and in PSPACE."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06170","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":"1804.06170","created_at":"2026-05-18T00:18:21.524330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06170v1","created_at":"2026-05-18T00:18:21.524330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06170","created_at":"2026-05-18T00:18:21.524330+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLSIJE5WKHSC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLSIJE5WKHSC7SFH","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLSIJE5W","created_at":"2026-05-18T12:33:01.666342+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/WLSIJE5WKHSC7SFH6QFGFL4PJW","json":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW.json","graph_json":"https://pith.science/api/pith-number/WLSIJE5WKHSC7SFH6QFGFL4PJW/graph.json","events_json":"https://pith.science/api/pith-number/WLSIJE5WKHSC7SFH6QFGFL4PJW/events.json","paper":"https://pith.science/paper/WLSIJE5W"},"agent_actions":{"view_html":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW","download_json":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW.json","view_paper":"https://pith.science/paper/WLSIJE5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06170&json=true","fetch_graph":"https://pith.science/api/pith-number/WLSIJE5WKHSC7SFH6QFGFL4PJW/graph.json","fetch_events":"https://pith.science/api/pith-number/WLSIJE5WKHSC7SFH6QFGFL4PJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW/action/storage_attestation","attest_author":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW/action/author_attestation","sign_citation":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW/action/citation_signature","submit_replication":"https://pith.science/pith/WLSIJE5WKHSC7SFH6QFGFL4PJW/action/replication_record"}},"created_at":"2026-05-18T00:18:21.524330+00:00","updated_at":"2026-05-18T00:18:21.524330+00:00"}