{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6QGEIBIIJEXYBLU7EBK654RT4A","short_pith_number":"pith:6QGEIBII","canonical_record":{"source":{"id":"1108.3968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-08-19T14:03:36Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e0c71a0c512c0e2eeb1b86110cc91b5896d20164a112c01d1169e4e392c9dc18","abstract_canon_sha256":"bef033ee081fa491f787e5103bb8b822d9189a23e0b12f9ab08966d2473b5203"},"schema_version":"1.0"},"canonical_sha256":"f40c440508492f80ae9f2055eef233e02357202a4cf49212a0dcf1e6acb2dd3a","source":{"kind":"arxiv","id":"1108.3968","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3968","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3968v3","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3968","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"pith_short_12","alias_value":"6QGEIBIIJEXY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6QGEIBIIJEXYBLU7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6QGEIBII","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6QGEIBIIJEXYBLU7EBK654RT4A","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-08-19T14:03:36Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e0c71a0c512c0e2eeb1b86110cc91b5896d20164a112c01d1169e4e392c9dc18","abstract_canon_sha256":"bef033ee081fa491f787e5103bb8b822d9189a23e0b12f9ab08966d2473b5203"},"schema_version":"1.0"},"canonical_sha256":"f40c440508492f80ae9f2055eef233e02357202a4cf49212a0dcf1e6acb2dd3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:05.346717Z","signature_b64":"4flNfKnXmIs+AEsOCegcWjdFjp0QpkwKjUKGRvq87MavE+9eKyn12OfFS/E9gBs4Pt13q6BHAfYIjXN8MImACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f40c440508492f80ae9f2055eef233e02357202a4cf49212a0dcf1e6acb2dd3a","last_reissued_at":"2026-05-18T03:43:05.346160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:05.346160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3968","source_version":3,"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-18T03:43:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltu2kKJ6gbevcy6CGUGOfW2n5V3EPCNuV4IaiGECJdCbLjyTx9+X+AD/FrUyoXM60wgHnEFzvQYGc/3/lvJ9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:59:44.509833Z"},"content_sha256":"03dcf8e8913bc24db87b069844fb8f4d36c273a146aeccaa35d3fe9554265616","schema_version":"1.0","event_id":"sha256:03dcf8e8913bc24db87b069844fb8f4d36c273a146aeccaa35d3fe9554265616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6QGEIBIIJEXYBLU7EBK654RT4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Expectation Maximization based algorithms for inference in hidden Markov models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Gersende Fort (LTCI), Sylvain Le Corff (LTCI)","submitted_at":"2011-08-19T14:03:36Z","abstract_excerpt":"The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be available at each iteration of the algorithm. In this contribution, a new generic online EM algorithm for model parameter inference in general Hidden Markov Model is proposed. This new algorithm updates the parameter estimate after a block of observations is processed (online). The convergence of this new algorithm is established, and the rate of convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3968","kind":"arxiv","version":3},"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-18T03:43:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRknmfn98q9bMX20gtYqkEjmP8fShP2mrLTY+Yi8DWyfHWStCpuPWCKTUJYccTOULV51YRR7yt8sPojclC3PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:59:44.510493Z"},"content_sha256":"c6b43afe37bcfb334292428e74f7f3ff8ec92f697d6ebf67b0858f0d22235e4b","schema_version":"1.0","event_id":"sha256:c6b43afe37bcfb334292428e74f7f3ff8ec92f697d6ebf67b0858f0d22235e4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QGEIBIIJEXYBLU7EBK654RT4A/bundle.json","state_url":"https://pith.science/pith/6QGEIBIIJEXYBLU7EBK654RT4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QGEIBIIJEXYBLU7EBK654RT4A/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-06-05T22:59:44Z","links":{"resolver":"https://pith.science/pith/6QGEIBIIJEXYBLU7EBK654RT4A","bundle":"https://pith.science/pith/6QGEIBIIJEXYBLU7EBK654RT4A/bundle.json","state":"https://pith.science/pith/6QGEIBIIJEXYBLU7EBK654RT4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QGEIBIIJEXYBLU7EBK654RT4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6QGEIBIIJEXYBLU7EBK654RT4A","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":"bef033ee081fa491f787e5103bb8b822d9189a23e0b12f9ab08966d2473b5203","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-08-19T14:03:36Z","title_canon_sha256":"e0c71a0c512c0e2eeb1b86110cc91b5896d20164a112c01d1169e4e392c9dc18"},"schema_version":"1.0","source":{"id":"1108.3968","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3968","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3968v3","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3968","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"pith_short_12","alias_value":"6QGEIBIIJEXY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6QGEIBIIJEXYBLU7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6QGEIBII","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:c6b43afe37bcfb334292428e74f7f3ff8ec92f697d6ebf67b0858f0d22235e4b","target":"graph","created_at":"2026-05-18T03:43:05Z","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":"The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be available at each iteration of the algorithm. In this contribution, a new generic online EM algorithm for model parameter inference in general Hidden Markov Model is proposed. This new algorithm updates the parameter estimate after a block of observations is processed (online). The convergence of this new algorithm is established, and the rate of convergence","authors_text":"Gersende Fort (LTCI), Sylvain Le Corff (LTCI)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-08-19T14:03:36Z","title":"Online Expectation Maximization based algorithms for inference in hidden Markov models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3968","kind":"arxiv","version":3},"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:03dcf8e8913bc24db87b069844fb8f4d36c273a146aeccaa35d3fe9554265616","target":"record","created_at":"2026-05-18T03:43:05Z","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":"bef033ee081fa491f787e5103bb8b822d9189a23e0b12f9ab08966d2473b5203","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-08-19T14:03:36Z","title_canon_sha256":"e0c71a0c512c0e2eeb1b86110cc91b5896d20164a112c01d1169e4e392c9dc18"},"schema_version":"1.0","source":{"id":"1108.3968","kind":"arxiv","version":3}},"canonical_sha256":"f40c440508492f80ae9f2055eef233e02357202a4cf49212a0dcf1e6acb2dd3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f40c440508492f80ae9f2055eef233e02357202a4cf49212a0dcf1e6acb2dd3a","first_computed_at":"2026-05-18T03:43:05.346160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:05.346160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4flNfKnXmIs+AEsOCegcWjdFjp0QpkwKjUKGRvq87MavE+9eKyn12OfFS/E9gBs4Pt13q6BHAfYIjXN8MImACA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:05.346717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3968","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03dcf8e8913bc24db87b069844fb8f4d36c273a146aeccaa35d3fe9554265616","sha256:c6b43afe37bcfb334292428e74f7f3ff8ec92f697d6ebf67b0858f0d22235e4b"],"state_sha256":"4f1f914cd0f1b8dff0df5c210068a0cfcfdf79c9c9880333106c1ffd8f61fcf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8Z79Ec3G+TIQkCVLcoD7SgsZbPwdUkyr2vfMfVB0fC7bRnmt9qqnoMiYDUhP9ROlNNX0P536+NL044cfu5tBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:59:44.514690Z","bundle_sha256":"3fb5016fe6ca7a9a0a686ca4e53354e58f42665a1f1f0b54d8c6ec10023479c1"}}