{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NTK7U6KYCLPIIKOWTVYYUZ5RS4","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":"c8eb9c9d33a3027a3a2855b378433989a7ae7312a6a2e16f230d008e3faef063","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-07-25T14:48:34Z","title_canon_sha256":"6c5f19ec58ede29238f616c312c67dcdea5e3d35caa930b7cb5a1fe5b2866a51"},"schema_version":"1.0","source":{"id":"2507.19338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19338","created_at":"2026-07-05T11:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19338v1","created_at":"2026-07-05T11:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19338","created_at":"2026-07-05T11:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"NTK7U6KYCLPI","created_at":"2026-07-05T11:43:23Z"},{"alias_kind":"pith_short_16","alias_value":"NTK7U6KYCLPIIKOW","created_at":"2026-07-05T11:43:23Z"},{"alias_kind":"pith_short_8","alias_value":"NTK7U6KY","created_at":"2026-07-05T11:43:23Z"}],"graph_snapshots":[{"event_id":"sha256:ff7008b44717171e7b42ee559aecf2fbfc93475d9b414ca16f4dd2d1c0a35666","target":"graph","created_at":"2026-07-05T11:43: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.19338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a bivariate, possibly non-homogeneous, finite-state Markov chain $(X,U)=\\{(X_t,U_t)\\}_{t=1}^n$. We are interested in the marginal process $X$, which typically is not a Markov chain. The goal is to find a realization (path) $x=(x_1,\\ldots,x_n)$ with maximal probability $P(X=x)$. If $X$ is Markov chain, then such path can be efficiently found using the celebrated Viterbi algorithm. However, when $X$ is not Markovian, identifying the most probable path -- hereafter referred to as the Viterbi path -- becomes computationally expensive. In this paper, we explore the branch-and-bound meth","authors_text":"J\\\"uri Lember, Oskar Soop","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19338","kind":"arxiv","version":1},"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:2110df6b9054600868bc864d3bd9f58abd6adfacadc86122537edc1dc45c74d9","target":"record","created_at":"2026-07-05T11:43: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":"c8eb9c9d33a3027a3a2855b378433989a7ae7312a6a2e16f230d008e3faef063","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-07-25T14:48:34Z","title_canon_sha256":"6c5f19ec58ede29238f616c312c67dcdea5e3d35caa930b7cb5a1fe5b2866a51"},"schema_version":"1.0","source":{"id":"2507.19338","kind":"arxiv","version":1}},"canonical_sha256":"6cd5fa795812de8429d69d718a67b19718d9f21d8b2d17bbdfb089557b107ed5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cd5fa795812de8429d69d718a67b19718d9f21d8b2d17bbdfb089557b107ed5","first_computed_at":"2026-07-05T11:43:23.734311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:23.734311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xoEXIo/AaFT4YUHUXkjPAQmYRMuUzzvg2YV5mqU0/+ljzUEf7PJy3LpNiwo8eF8yAQy0cIzsiA0p0X6BNNRWDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:23.734860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2110df6b9054600868bc864d3bd9f58abd6adfacadc86122537edc1dc45c74d9","sha256:ff7008b44717171e7b42ee559aecf2fbfc93475d9b414ca16f4dd2d1c0a35666"],"state_sha256":"57ff439d090ad53425c7a684399f96c110340d55d1c73928dc50ba73ff7fd71b"}