{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FWUDY4QWBSI3KQ33Y7QSQY57KI","short_pith_number":"pith:FWUDY4QW","canonical_record":{"source":{"id":"1111.1307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-05T13:49:51Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2f79a33fdf94b81b70a7a5476dd164db07988fc7330fa98fa6f55c464fb72617","abstract_canon_sha256":"f5ceb5d54c17c92f0d273f657ba697f58b380e3f4c5a92d19794a4989abc1ccd"},"schema_version":"1.0"},"canonical_sha256":"2da83c72160c91b5437bc7e12863bf523d70c91e099422f063552250a58f6324","source":{"kind":"arxiv","id":"1111.1307","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1307","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1307v3","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1307","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"FWUDY4QWBSI3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FWUDY4QWBSI3KQ33","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FWUDY4QW","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FWUDY4QWBSI3KQ33Y7QSQY57KI","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-05T13:49:51Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2f79a33fdf94b81b70a7a5476dd164db07988fc7330fa98fa6f55c464fb72617","abstract_canon_sha256":"f5ceb5d54c17c92f0d273f657ba697f58b380e3f4c5a92d19794a4989abc1ccd"},"schema_version":"1.0"},"canonical_sha256":"2da83c72160c91b5437bc7e12863bf523d70c91e099422f063552250a58f6324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:37.490823Z","signature_b64":"2kVsa+P8Q+C+Wlpn+e2/eez3GvORMzmO2tgtDfW0E0rYD5LGMjE+B1RW/f3GFvFkG2vNGfxXoK82HlBtCd6VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2da83c72160c91b5437bc7e12863bf523d70c91e099422f063552250a58f6324","last_reissued_at":"2026-05-18T03:54:37.490276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:37.490276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1307","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:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMYtd4RyDeVtcpjsZcRWw/uiwwu/UCak8wlQCH185RVGhGdlgUQ7+OJ2sNj8mXw699noY6W5uAlfhpZDwxCNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:44:38.549877Z"},"content_sha256":"82ec81635550dde491b8094b583a93a8e177f233d5711ef08a45bb2ddbe904c9","schema_version":"1.0","event_id":"sha256:82ec81635550dde491b8094b583a93a8e177f233d5711ef08a45bb2ddbe904c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FWUDY4QWBSI3KQ33Y7QSQY57KI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm","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-11-05T13:49:51Z","abstract_excerpt":"Online variants of the Expectation Maximization (EM) algorithm have recently been proposed to perform parameter inference with large data sets or data streams, in independent latent models and in hidden Markov models. Nevertheless, the convergence properties of these algorithms remain an open problem at least in the hidden Markov case. This contribution deals with a new online EM algorithm which updates the parameter at some deterministic times. Some convergence results have been derived even in general latent models such as hidden Markov models. These properties rely on the assumption that so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1307","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:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kB0VsuC2IPnLl1osGx/Kvz17uHvm1AOUhcXJzF1YYvsKwwcgEAtXbWxFpIB9JhCk2nBdp+DvXAQ5BoPhJnnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:44:38.550547Z"},"content_sha256":"6c2b758a39b433617d2f7ad5e25a1e41885e960c1c1d73edc21e07b4010a30c5","schema_version":"1.0","event_id":"sha256:6c2b758a39b433617d2f7ad5e25a1e41885e960c1c1d73edc21e07b4010a30c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/bundle.json","state_url":"https://pith.science/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/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:44:38Z","links":{"resolver":"https://pith.science/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI","bundle":"https://pith.science/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/bundle.json","state":"https://pith.science/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWUDY4QWBSI3KQ33Y7QSQY57KI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FWUDY4QWBSI3KQ33Y7QSQY57KI","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":"f5ceb5d54c17c92f0d273f657ba697f58b380e3f4c5a92d19794a4989abc1ccd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-05T13:49:51Z","title_canon_sha256":"2f79a33fdf94b81b70a7a5476dd164db07988fc7330fa98fa6f55c464fb72617"},"schema_version":"1.0","source":{"id":"1111.1307","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1307","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1307v3","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1307","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"FWUDY4QWBSI3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FWUDY4QWBSI3KQ33","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FWUDY4QW","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:6c2b758a39b433617d2f7ad5e25a1e41885e960c1c1d73edc21e07b4010a30c5","target":"graph","created_at":"2026-05-18T03:54:37Z","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 variants of the Expectation Maximization (EM) algorithm have recently been proposed to perform parameter inference with large data sets or data streams, in independent latent models and in hidden Markov models. Nevertheless, the convergence properties of these algorithms remain an open problem at least in the hidden Markov case. This contribution deals with a new online EM algorithm which updates the parameter at some deterministic times. Some convergence results have been derived even in general latent models such as hidden Markov models. These properties rely on the assumption that so","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-11-05T13:49:51Z","title":"Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1307","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:82ec81635550dde491b8094b583a93a8e177f233d5711ef08a45bb2ddbe904c9","target":"record","created_at":"2026-05-18T03:54:37Z","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":"f5ceb5d54c17c92f0d273f657ba697f58b380e3f4c5a92d19794a4989abc1ccd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-11-05T13:49:51Z","title_canon_sha256":"2f79a33fdf94b81b70a7a5476dd164db07988fc7330fa98fa6f55c464fb72617"},"schema_version":"1.0","source":{"id":"1111.1307","kind":"arxiv","version":3}},"canonical_sha256":"2da83c72160c91b5437bc7e12863bf523d70c91e099422f063552250a58f6324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2da83c72160c91b5437bc7e12863bf523d70c91e099422f063552250a58f6324","first_computed_at":"2026-05-18T03:54:37.490276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:37.490276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2kVsa+P8Q+C+Wlpn+e2/eez3GvORMzmO2tgtDfW0E0rYD5LGMjE+B1RW/f3GFvFkG2vNGfxXoK82HlBtCd6VDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:37.490823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1307","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ec81635550dde491b8094b583a93a8e177f233d5711ef08a45bb2ddbe904c9","sha256:6c2b758a39b433617d2f7ad5e25a1e41885e960c1c1d73edc21e07b4010a30c5"],"state_sha256":"93c5a40276571a6a4174be84cdc940599d1c08b5cdb78c95bd2c75f6611f0dc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpGRgMAo2bv1fI2YZz5ECDVETx9pcrJftrdGf5Ll7mmhds29rorclGft5gB3y8tsaC55CpS8EjoMys4T3QySDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:44:38.554052Z","bundle_sha256":"7c6e692b29ab14709711b34f937ad6629c88d09df0fcf7982c1d7e078640a1e9"}}