{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:TPR6HP2ISRHEMWSMNO5H3HIKXQ","short_pith_number":"pith:TPR6HP2I","canonical_record":{"source":{"id":"0908.2359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-08-17T14:24:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"04f731e235b0dad9a8c95b875ccb8722f38ccdef2eec113d02d9235c778ff984","abstract_canon_sha256":"2d3ae2a611e104902c85dad159217151477a1c1e561fe8ee76cb616ce5abc869"},"schema_version":"1.0"},"canonical_sha256":"9be3e3bf48944e465a4c6bba7d9d0abc23ffe06e802c29d848c7bdc86045c0c5","source":{"kind":"arxiv","id":"0908.2359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2359","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2359v2","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2359","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"TPR6HP2ISRHE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"TPR6HP2ISRHEMWSM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"TPR6HP2I","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:TPR6HP2ISRHEMWSMNO5H3HIKXQ","target":"record","payload":{"canonical_record":{"source":{"id":"0908.2359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-08-17T14:24:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"04f731e235b0dad9a8c95b875ccb8722f38ccdef2eec113d02d9235c778ff984","abstract_canon_sha256":"2d3ae2a611e104902c85dad159217151477a1c1e561fe8ee76cb616ce5abc869"},"schema_version":"1.0"},"canonical_sha256":"9be3e3bf48944e465a4c6bba7d9d0abc23ffe06e802c29d848c7bdc86045c0c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:45.837932Z","signature_b64":"mqpNQGsU3KflmUUWKtRcSBZNnjfFu6XIXHnmkOPtcUwoSYC/Jsni1LmDfVTTbGcYbydkjfPIMJf2vl/HCZZSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be3e3bf48944e465a4c6bba7d9d0abc23ffe06e802c29d848c7bdc86045c0c5","last_reissued_at":"2026-05-18T04:28:45.837531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:45.837531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.2359","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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxAJkP2509i/ntpZYFTWBpkVTrMhw8P627Xhn9E7P77Uv1JlfN9nL3YSgCemtJ79+ADKHHKdOnRpTwEtW2uICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:02.856096Z"},"content_sha256":"5c9985beaa25a75c75f4efba993c48840407542132ec480d83121708025cc7af","schema_version":"1.0","event_id":"sha256:5c9985beaa25a75c75f4efba993c48840407542132ec480d83121708025cc7af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:TPR6HP2ISRHEMWSMNO5H3HIKXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online EM Algorithm for Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Olivier Capp\\'e (LTCI)","submitted_at":"2009-08-17T14:24:32Z","abstract_excerpt":"Online (also called \"recursive\" or \"adaptive\") estimation of fixed model parameters in hidden Markov models is a topic of much interest in times series modelling. In this work, we propose an online parameter estimation algorithm that combines two key ideas. The first one, which is deeply rooted in the Expectation-Maximization (EM) methodology consists in reparameterizing the problem using complete-data sufficient statistics. The second ingredient consists in exploiting a purely recursive form of smoothing in HMMs based on an auxiliary recursion. Although the proposed online EM algorithm resemb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2359","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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wJCMCjrndeCjmlfqf9+5j6ou/N16ytTOC2868oft74H48R9YXc3EbAzJzlcLSPTXrUpgETxZxyn/+KZeq1kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:02.856808Z"},"content_sha256":"4fc857f968730db2a25e01fe6310aa5e9848952b95d7cde28b7d43b06dc6facc","schema_version":"1.0","event_id":"sha256:4fc857f968730db2a25e01fe6310aa5e9848952b95d7cde28b7d43b06dc6facc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/bundle.json","state_url":"https://pith.science/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/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-27T22:40:02Z","links":{"resolver":"https://pith.science/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ","bundle":"https://pith.science/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/bundle.json","state":"https://pith.science/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPR6HP2ISRHEMWSMNO5H3HIKXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:TPR6HP2ISRHEMWSMNO5H3HIKXQ","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":"2d3ae2a611e104902c85dad159217151477a1c1e561fe8ee76cb616ce5abc869","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-08-17T14:24:32Z","title_canon_sha256":"04f731e235b0dad9a8c95b875ccb8722f38ccdef2eec113d02d9235c778ff984"},"schema_version":"1.0","source":{"id":"0908.2359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2359","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2359v2","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2359","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"TPR6HP2ISRHE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"TPR6HP2ISRHEMWSM","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"TPR6HP2I","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:4fc857f968730db2a25e01fe6310aa5e9848952b95d7cde28b7d43b06dc6facc","target":"graph","created_at":"2026-05-18T04:28:45Z","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":"Online (also called \"recursive\" or \"adaptive\") estimation of fixed model parameters in hidden Markov models is a topic of much interest in times series modelling. In this work, we propose an online parameter estimation algorithm that combines two key ideas. The first one, which is deeply rooted in the Expectation-Maximization (EM) methodology consists in reparameterizing the problem using complete-data sufficient statistics. The second ingredient consists in exploiting a purely recursive form of smoothing in HMMs based on an auxiliary recursion. Although the proposed online EM algorithm resemb","authors_text":"Olivier Capp\\'e (LTCI)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-08-17T14:24:32Z","title":"Online EM Algorithm for Hidden Markov Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2359","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:5c9985beaa25a75c75f4efba993c48840407542132ec480d83121708025cc7af","target":"record","created_at":"2026-05-18T04:28:45Z","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":"2d3ae2a611e104902c85dad159217151477a1c1e561fe8ee76cb616ce5abc869","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-08-17T14:24:32Z","title_canon_sha256":"04f731e235b0dad9a8c95b875ccb8722f38ccdef2eec113d02d9235c778ff984"},"schema_version":"1.0","source":{"id":"0908.2359","kind":"arxiv","version":2}},"canonical_sha256":"9be3e3bf48944e465a4c6bba7d9d0abc23ffe06e802c29d848c7bdc86045c0c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9be3e3bf48944e465a4c6bba7d9d0abc23ffe06e802c29d848c7bdc86045c0c5","first_computed_at":"2026-05-18T04:28:45.837531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:45.837531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqpNQGsU3KflmUUWKtRcSBZNnjfFu6XIXHnmkOPtcUwoSYC/Jsni1LmDfVTTbGcYbydkjfPIMJf2vl/HCZZSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:45.837932Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.2359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c9985beaa25a75c75f4efba993c48840407542132ec480d83121708025cc7af","sha256:4fc857f968730db2a25e01fe6310aa5e9848952b95d7cde28b7d43b06dc6facc"],"state_sha256":"2014b1f81664beeebd59081f60f8b6fc6857c1eee844a0c47f804c51fc49b079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWT/SbD224w3I0bqtFixlpW5CB7L9B4HpyHP1sF0CS2+Pr4PG3LdZyAEaeZdf3kShr4sqSOqVxnmW2yoYtmzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:40:02.860591Z","bundle_sha256":"fcee8bf569cce86bdca45058a863d8fbcb6376b5b770c4eb3d3cd613f685c765"}}