{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZHLAC6NHWW7ZV4FNAUCERUKPYW","short_pith_number":"pith:ZHLAC6NH","schema_version":"1.0","canonical_sha256":"c9d60179a7b5bf9af0ad050448d14fc59de12c3b00f7e79aeeacf50804a4bb0a","source":{"kind":"arxiv","id":"2305.18578","version":2},"attestation_state":"computed","paper":{"title":"Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Alexandre M\\\"osching, Axel Munk, Housen Li","submitted_at":"2023-05-29T19:37:48Z","abstract_excerpt":"Hidden Markov models (HMMs) are characterized by an unobservable Markov chain and an observable process -- a noisy version of the hidden chain. Decoding the original signal from the noisy observations is one of the main goals in nearly all HMM based data analyses. Existing decoding algorithms such as Viterbi and the pointwise maximum a posteriori (PMAP) algorithm have computational complexity at best linear in the length of the observed sequence, and sub-quadratic in the size of the state space of the hidden chain.\n  We present Quick Adaptive Ternary Segmentation (QATS), a divide-and-conquer p"},"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":"2305.18578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-05-29T19:37:48Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8886d705909804bb10b1527b4e7976a2acc2be72981e4bb583bb778fc801500c","abstract_canon_sha256":"87f170ab3f7478e11aeeced12fa2930fde53967c416f5bb3304fd0324a5a55ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:24.258535Z","signature_b64":"4ZqDR6OsqWC6FElVLfeTHFTPXLOE13kOCJjgAw6aL8iZ1ZN++P6sEXJvUSv770DuKS6hIWezynU730F5SB6KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9d60179a7b5bf9af0ad050448d14fc59de12c3b00f7e79aeeacf50804a4bb0a","last_reissued_at":"2026-05-20T00:05:24.257772Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:24.257772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Alexandre M\\\"osching, Axel Munk, Housen Li","submitted_at":"2023-05-29T19:37:48Z","abstract_excerpt":"Hidden Markov models (HMMs) are characterized by an unobservable Markov chain and an observable process -- a noisy version of the hidden chain. Decoding the original signal from the noisy observations is one of the main goals in nearly all HMM based data analyses. Existing decoding algorithms such as Viterbi and the pointwise maximum a posteriori (PMAP) algorithm have computational complexity at best linear in the length of the observed sequence, and sub-quadratic in the size of the state space of the hidden chain.\n  We present Quick Adaptive Ternary Segmentation (QATS), a divide-and-conquer p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18578","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.18578/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.18578","created_at":"2026-05-20T00:05:24.257894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18578v2","created_at":"2026-05-20T00:05:24.257894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18578","created_at":"2026-05-20T00:05:24.257894+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHLAC6NHWW7Z","created_at":"2026-05-20T00:05:24.257894+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHLAC6NHWW7ZV4FN","created_at":"2026-05-20T00:05:24.257894+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHLAC6NH","created_at":"2026-05-20T00:05:24.257894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2403.13197","citing_title":"Robust inference of cooperative behaviour of multiple ion channels in voltage-clamp recordings","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW","json":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW.json","graph_json":"https://pith.science/api/pith-number/ZHLAC6NHWW7ZV4FNAUCERUKPYW/graph.json","events_json":"https://pith.science/api/pith-number/ZHLAC6NHWW7ZV4FNAUCERUKPYW/events.json","paper":"https://pith.science/paper/ZHLAC6NH"},"agent_actions":{"view_html":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW","download_json":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW.json","view_paper":"https://pith.science/paper/ZHLAC6NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18578&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHLAC6NHWW7ZV4FNAUCERUKPYW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHLAC6NHWW7ZV4FNAUCERUKPYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW/action/storage_attestation","attest_author":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW/action/author_attestation","sign_citation":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW/action/citation_signature","submit_replication":"https://pith.science/pith/ZHLAC6NHWW7ZV4FNAUCERUKPYW/action/replication_record"}},"created_at":"2026-05-20T00:05:24.257894+00:00","updated_at":"2026-05-20T00:05:24.257894+00:00"}