{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GQJWJHNFAT64IVJGZMX6SN5YYY","short_pith_number":"pith:GQJWJHNF","canonical_record":{"source":{"id":"1507.02314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:14:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"375fbd15e38c6d06ba9897e4db829e821db72c660ad964589940227d2f82f87a","abstract_canon_sha256":"697f53d1dc6ba641567c82e15c43e04a627a1ad6aa50165142c83f1b3c3ad86e"},"schema_version":"1.0"},"canonical_sha256":"3413649da504fdc45526cb2fe937b8c637cddd95430838d48069829ed60ea871","source":{"kind":"arxiv","id":"1507.02314","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02314","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02314v2","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02314","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"GQJWJHNFAT64","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GQJWJHNFAT64IVJG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GQJWJHNF","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GQJWJHNFAT64IVJGZMX6SN5YYY","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:14:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"375fbd15e38c6d06ba9897e4db829e821db72c660ad964589940227d2f82f87a","abstract_canon_sha256":"697f53d1dc6ba641567c82e15c43e04a627a1ad6aa50165142c83f1b3c3ad86e"},"schema_version":"1.0"},"canonical_sha256":"3413649da504fdc45526cb2fe937b8c637cddd95430838d48069829ed60ea871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:23.513262Z","signature_b64":"AtbIdaf/Y4XJi59doOjP7gAYSv00cvj98zrFG4YzCprcd1x4IeDuwCix3D++cGxi1Pm2lXBSmX/N4WqJhNT4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3413649da504fdc45526cb2fe937b8c637cddd95430838d48069829ed60ea871","last_reissued_at":"2026-05-18T01:15:23.512677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:23.512677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02314","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uD7HH9rOXtAdPOAN4hAmYndqcgdty2+jywna8/Pz3meDj98C0wOkrUwi0xsjCQGCGfBwxy8IXyQC4H286obACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:36:16.196599Z"},"content_sha256":"b9525905ed81bcd902c50241da29a36254d15f7f4dcbbb9390190081b599cde4","schema_version":"1.0","event_id":"sha256:b9525905ed81bcd902c50241da29a36254d15f7f4dcbbb9390190081b599cde4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GQJWJHNFAT64IVJGZMX6SN5YYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishing Hidden Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"A. Prasad Sistla, Stefan Kiefer","submitted_at":"2015-07-08T21:14:14Z","abstract_excerpt":"Hidden Markov Chains (HMCs) are commonly used mathematical models of probabilistic systems. They are employed in various fields such as speech recognition, signal processing, and biological sequence analysis. We consider the problem of distinguishing two given HMCs based on an observation sequence that one of the HMCs generates. More precisely, given two HMCs and an observation sequence, a distinguishing algorithm is expected to identify the HMC that generates the observation sequence. Two HMCs are called distinguishable if for every $\\varepsilon > 0$ there is a distinguishing algorithm whose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02314","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXAYPIu6iWoOtXfnLsWNictTgxqdJdoHXOXofy5EKVNMrnjC6tRHGx2uEjK3GuWtVH+sTPGoO7F+9wqcm2bOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:36:16.197276Z"},"content_sha256":"623d449b7457ae212b5695a7ef6627ffda10c8f60d56b91ecfbf1febe68f1759","schema_version":"1.0","event_id":"sha256:623d449b7457ae212b5695a7ef6627ffda10c8f60d56b91ecfbf1febe68f1759"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/bundle.json","state_url":"https://pith.science/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T00:36:16Z","links":{"resolver":"https://pith.science/pith/GQJWJHNFAT64IVJGZMX6SN5YYY","bundle":"https://pith.science/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/bundle.json","state":"https://pith.science/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQJWJHNFAT64IVJGZMX6SN5YYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GQJWJHNFAT64IVJGZMX6SN5YYY","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":"697f53d1dc6ba641567c82e15c43e04a627a1ad6aa50165142c83f1b3c3ad86e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:14:14Z","title_canon_sha256":"375fbd15e38c6d06ba9897e4db829e821db72c660ad964589940227d2f82f87a"},"schema_version":"1.0","source":{"id":"1507.02314","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02314","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02314v2","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02314","created_at":"2026-05-18T01:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"GQJWJHNFAT64","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GQJWJHNFAT64IVJG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GQJWJHNF","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:623d449b7457ae212b5695a7ef6627ffda10c8f60d56b91ecfbf1febe68f1759","target":"graph","created_at":"2026-05-18T01:15:23Z","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":"Hidden Markov Chains (HMCs) are commonly used mathematical models of probabilistic systems. They are employed in various fields such as speech recognition, signal processing, and biological sequence analysis. We consider the problem of distinguishing two given HMCs based on an observation sequence that one of the HMCs generates. More precisely, given two HMCs and an observation sequence, a distinguishing algorithm is expected to identify the HMC that generates the observation sequence. Two HMCs are called distinguishable if for every $\\varepsilon > 0$ there is a distinguishing algorithm whose ","authors_text":"A. Prasad Sistla, Stefan Kiefer","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:14:14Z","title":"Distinguishing Hidden Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02314","kind":"arxiv","version":2},"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:b9525905ed81bcd902c50241da29a36254d15f7f4dcbbb9390190081b599cde4","target":"record","created_at":"2026-05-18T01:15:23Z","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":"697f53d1dc6ba641567c82e15c43e04a627a1ad6aa50165142c83f1b3c3ad86e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:14:14Z","title_canon_sha256":"375fbd15e38c6d06ba9897e4db829e821db72c660ad964589940227d2f82f87a"},"schema_version":"1.0","source":{"id":"1507.02314","kind":"arxiv","version":2}},"canonical_sha256":"3413649da504fdc45526cb2fe937b8c637cddd95430838d48069829ed60ea871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3413649da504fdc45526cb2fe937b8c637cddd95430838d48069829ed60ea871","first_computed_at":"2026-05-18T01:15:23.512677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:23.512677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AtbIdaf/Y4XJi59doOjP7gAYSv00cvj98zrFG4YzCprcd1x4IeDuwCix3D++cGxi1Pm2lXBSmX/N4WqJhNT4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:23.513262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02314","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9525905ed81bcd902c50241da29a36254d15f7f4dcbbb9390190081b599cde4","sha256:623d449b7457ae212b5695a7ef6627ffda10c8f60d56b91ecfbf1febe68f1759"],"state_sha256":"a317c3d41fc0b4ede2cec7a5b19e25f27e965991411bb065cdd86330e6dcdd87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdWnUOSXp62ZrDAaXtpGLca4SphUoVZgaqhaNBZDWYZVvlzhPfsMsrdrYr06EBHHVrfR1MUw+nlZtxbGxw3CCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:36:16.201159Z","bundle_sha256":"46e27c923821bbda074265099ec661881cc0517fb06f0d83f400c567d2566e07"}}