{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:E2AYNOZNDRGYHYAWC5W72H3PBQ","short_pith_number":"pith:E2AYNOZN","schema_version":"1.0","canonical_sha256":"268186bb2d1c4d83e016176dfd1f6f0c1a51cb45d6f66ab036423b3070027dcf","source":{"kind":"arxiv","id":"0808.2833","version":5},"attestation_state":"computed","paper":{"title":"Efficient tests for equivalence of hidden Markov processes and quantum random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Sch\\\"onhuth, Ulrich Faigle","submitted_at":"2008-08-20T22:53:12Z","abstract_excerpt":"While two hidden Markov process (HMP) resp. quantum random walk (QRW) parametrizations can differ from one another, the stochastic processes arising from them can be equivalent. Here a polynomial-time algorithm is presented which can determine equivalence of two HMP parametrizations $\\cM_1,\\cM_2$ resp. two QRW parametrizations $\\cQ_1,\\cQ_2$ in time $O(|\\S|\\max(N_1,N_2)^{4})$, where $N_1,N_2$ are the number of hidden states in $\\cM_1,\\cM_2$ resp. the dimension of the state spaces associated with $\\cQ_1,\\cQ_2$, and $\\S$ is the set of output symbols. Previously available algorithms for testing eq"},"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":"0808.2833","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-20T22:53:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"999b2e2d4ec8aa3d4e6d0f9be0cdf498389592711452cb83f12d2102e4c72505","abstract_canon_sha256":"032496b87eb04342af1d46bb9432eb4d82a3ecc04ca08717d81ed9b024d641cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.443909Z","signature_b64":"VNELd0MELdfdIVM2kluRskfi4Hi/OBEnS8mN3KSbYkSPDbMG2AcesS+0W36ZuEli83/ZyICe5DSFq5WOnVUdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268186bb2d1c4d83e016176dfd1f6f0c1a51cb45d6f66ab036423b3070027dcf","last_reissued_at":"2026-05-18T00:58:25.443203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.443203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient tests for equivalence of hidden Markov processes and quantum random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Sch\\\"onhuth, Ulrich Faigle","submitted_at":"2008-08-20T22:53:12Z","abstract_excerpt":"While two hidden Markov process (HMP) resp. quantum random walk (QRW) parametrizations can differ from one another, the stochastic processes arising from them can be equivalent. Here a polynomial-time algorithm is presented which can determine equivalence of two HMP parametrizations $\\cM_1,\\cM_2$ resp. two QRW parametrizations $\\cQ_1,\\cQ_2$ in time $O(|\\S|\\max(N_1,N_2)^{4})$, where $N_1,N_2$ are the number of hidden states in $\\cM_1,\\cM_2$ resp. the dimension of the state spaces associated with $\\cQ_1,\\cQ_2$, and $\\S$ is the set of output symbols. Previously available algorithms for testing eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.2833","kind":"arxiv","version":5},"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":"0808.2833","created_at":"2026-05-18T00:58:25.443324+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.2833v5","created_at":"2026-05-18T00:58:25.443324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.2833","created_at":"2026-05-18T00:58:25.443324+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2AYNOZNDRGY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2AYNOZNDRGYHYAW","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2AYNOZN","created_at":"2026-05-18T12:25:57.157939+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/E2AYNOZNDRGYHYAWC5W72H3PBQ","json":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ.json","graph_json":"https://pith.science/api/pith-number/E2AYNOZNDRGYHYAWC5W72H3PBQ/graph.json","events_json":"https://pith.science/api/pith-number/E2AYNOZNDRGYHYAWC5W72H3PBQ/events.json","paper":"https://pith.science/paper/E2AYNOZN"},"agent_actions":{"view_html":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ","download_json":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ.json","view_paper":"https://pith.science/paper/E2AYNOZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.2833&json=true","fetch_graph":"https://pith.science/api/pith-number/E2AYNOZNDRGYHYAWC5W72H3PBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/E2AYNOZNDRGYHYAWC5W72H3PBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ/action/storage_attestation","attest_author":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ/action/author_attestation","sign_citation":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ/action/citation_signature","submit_replication":"https://pith.science/pith/E2AYNOZNDRGYHYAWC5W72H3PBQ/action/replication_record"}},"created_at":"2026-05-18T00:58:25.443324+00:00","updated_at":"2026-05-18T00:58:25.443324+00:00"}