{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3RRIYOI4F7RMYQZAVDZ54WWQWT","short_pith_number":"pith:3RRIYOI4","schema_version":"1.0","canonical_sha256":"dc628c391c2fe2cc4320a8f3de5ad0b4f5dd055fab09218252526b8104003141","source":{"kind":"arxiv","id":"2504.15156","version":1},"attestation_state":"computed","paper":{"title":"Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Asger Hobolth, Laurits Skov, Mois\\`es Coll Maci\\`a, Zenia Elise Damgaard B{\\ae}k","submitted_at":"2025-04-21T14:58:35Z","abstract_excerpt":"Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI) and hybrid decoding to solve each of these two tasks. In the first part of our paper we use FMCI to compute posterior distributions of summary statistics such as the number of visits to a hidden state, the total time spent in a hidden state, the dwell time in a hidden state, and the longest run length. We use simulations from the hidden state sequence, conditional "},"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":"2504.15156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-21T14:58:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0669efd8f098c8228e0874e7c330d4de8552b9f9b4c181bd29a3470be828dede","abstract_canon_sha256":"c823c9bbecce2eb12141303bdfa741f29307f58790b32e2db92d688f1cae5baa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:57.020225Z","signature_b64":"H45Kch/U2vMJ6ko1yZcxyNQTpigcZOiuGMogt+skVdHXgzk8ZWcacCfaLzBgBJdKNzqG1IVlmLke27W6U0g8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc628c391c2fe2cc4320a8f3de5ad0b4f5dd055fab09218252526b8104003141","last_reissued_at":"2026-07-05T10:51:57.019834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:57.019834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Asger Hobolth, Laurits Skov, Mois\\`es Coll Maci\\`a, Zenia Elise Damgaard B{\\ae}k","submitted_at":"2025-04-21T14:58:35Z","abstract_excerpt":"Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI) and hybrid decoding to solve each of these two tasks. In the first part of our paper we use FMCI to compute posterior distributions of summary statistics such as the number of visits to a hidden state, the total time spent in a hidden state, the dwell time in a hidden state, and the longest run length. We use simulations from the hidden state sequence, conditional "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15156","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.15156/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":"2504.15156","created_at":"2026-07-05T10:51:57.019889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15156v1","created_at":"2026-07-05T10:51:57.019889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15156","created_at":"2026-07-05T10:51:57.019889+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RRIYOI4F7RM","created_at":"2026-07-05T10:51:57.019889+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RRIYOI4F7RMYQZA","created_at":"2026-07-05T10:51:57.019889+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RRIYOI4","created_at":"2026-07-05T10:51:57.019889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19338","citing_title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT","json":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT.json","graph_json":"https://pith.science/api/pith-number/3RRIYOI4F7RMYQZAVDZ54WWQWT/graph.json","events_json":"https://pith.science/api/pith-number/3RRIYOI4F7RMYQZAVDZ54WWQWT/events.json","paper":"https://pith.science/paper/3RRIYOI4"},"agent_actions":{"view_html":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT","download_json":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT.json","view_paper":"https://pith.science/paper/3RRIYOI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15156&json=true","fetch_graph":"https://pith.science/api/pith-number/3RRIYOI4F7RMYQZAVDZ54WWQWT/graph.json","fetch_events":"https://pith.science/api/pith-number/3RRIYOI4F7RMYQZAVDZ54WWQWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT/action/storage_attestation","attest_author":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT/action/author_attestation","sign_citation":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT/action/citation_signature","submit_replication":"https://pith.science/pith/3RRIYOI4F7RMYQZAVDZ54WWQWT/action/replication_record"}},"created_at":"2026-07-05T10:51:57.019889+00:00","updated_at":"2026-07-05T10:51:57.019889+00:00"}