{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:E2AYNOZNDRGYHYAWC5W72H3PBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"032496b87eb04342af1d46bb9432eb4d82a3ecc04ca08717d81ed9b024d641cb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-20T22:53:12Z","title_canon_sha256":"999b2e2d4ec8aa3d4e6d0f9be0cdf498389592711452cb83f12d2102e4c72505"},"schema_version":"1.0","source":{"id":"0808.2833","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.2833","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0808.2833v5","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.2833","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"E2AYNOZNDRGY","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"E2AYNOZNDRGYHYAW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"E2AYNOZN","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:b2667457e7e240206a3e05838e210773efc7a5b3e615c012b95e44728f0c6146","target":"graph","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Sch\\\"onhuth, Ulrich Faigle","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-20T22:53:12Z","title":"Efficient tests for equivalence of hidden Markov processes and quantum random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.2833","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08fe114f79356effa90d901e84dd874a885e2e8fdd4ce461502510000fee6eb1","target":"record","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"032496b87eb04342af1d46bb9432eb4d82a3ecc04ca08717d81ed9b024d641cb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-20T22:53:12Z","title_canon_sha256":"999b2e2d4ec8aa3d4e6d0f9be0cdf498389592711452cb83f12d2102e4c72505"},"schema_version":"1.0","source":{"id":"0808.2833","kind":"arxiv","version":5}},"canonical_sha256":"268186bb2d1c4d83e016176dfd1f6f0c1a51cb45d6f66ab036423b3070027dcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"268186bb2d1c4d83e016176dfd1f6f0c1a51cb45d6f66ab036423b3070027dcf","first_computed_at":"2026-05-18T00:58:25.443203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.443203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNELd0MELdfdIVM2kluRskfi4Hi/OBEnS8mN3KSbYkSPDbMG2AcesS+0W36ZuEli83/ZyICe5DSFq5WOnVUdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.443909Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.2833","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08fe114f79356effa90d901e84dd874a885e2e8fdd4ce461502510000fee6eb1","sha256:b2667457e7e240206a3e05838e210773efc7a5b3e615c012b95e44728f0c6146"],"state_sha256":"e3739d855a83a4c04eb83de93762d633626f296fd1af70ca61fe2b052608066f"}