{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7WRNNEC6BBTUBVAQNV4R73VFXH","short_pith_number":"pith:7WRNNEC6","canonical_record":{"source":{"id":"1803.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"72dc8e5737a9bc0c4adb7c9d3d9b1cf3ddb3717bef1fa76ef606ee25aec4d0bd","abstract_canon_sha256":"28ef21be278a19883d965666ed86fbc1e534537fd661c18d3f1436de5fbe0190"},"schema_version":"1.0"},"canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","source":{"kind":"arxiv","id":"1803.06673","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06673","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06673v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06673","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"7WRNNEC6BBTU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WRNNEC6BBTUBVAQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WRNNEC6","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7WRNNEC6BBTUBVAQNV4R73VFXH","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"72dc8e5737a9bc0c4adb7c9d3d9b1cf3ddb3717bef1fa76ef606ee25aec4d0bd","abstract_canon_sha256":"28ef21be278a19883d965666ed86fbc1e534537fd661c18d3f1436de5fbe0190"},"schema_version":"1.0"},"canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:20.948065Z","signature_b64":"mq9HS9DQ659GOaepNbFlFhr8vAYSTMQt7DnpGBkQOdmWUh0MBIlIznAapkdxIM3umsu1C2sb7X0BUtidjF7JCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","last_reissued_at":"2026-05-18T00:08:20.947563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:20.947563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06673","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-18T00:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZzU/5ZY8IkPQVodqlPwf/WMDe7i7WfHw2DrNikknAwGO71aN6U/ekWiqLx0aX8UQXOyN8J8BLKtdBBBo8Y8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:06:06.073393Z"},"content_sha256":"3bf5543becc3a3fa04cceb5a167d31a38caf84c3f18e9c4e91161f91094dde59","schema_version":"1.0","event_id":"sha256:3bf5543becc3a3fa04cceb5a167d31a38caf84c3f18e9c4e91161f91094dde59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7WRNNEC6BBTUBVAQNV4R73VFXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM-like algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Nicholas C. Henderson, Ravi Varadhan","submitted_at":"2018-03-18T15:01:22Z","abstract_excerpt":"The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed slow convergence which often hinders the application of EM algorithms in high-dimensional problems or in other complex settings.To address the need for more rapidly convergent EM algorithms, we describe a new class of acceleration schemes that build on the Anderson acceleration technique for speeding fixed-point iterations. Our approach is effective at greatly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06673","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-18T00:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/r+oCuX5qQio1kicoiT76BrdZcsfIKuIiazSFEQOyyqvqPLxoIR0pPQcP1tkHPUaW70HFikbaUSEFmOhbaABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:06:06.074120Z"},"content_sha256":"7c0ce983761cf4177efc82c6c8462a580cdd7b609a60b29e3f060c5489713dca","schema_version":"1.0","event_id":"sha256:7c0ce983761cf4177efc82c6c8462a580cdd7b609a60b29e3f060c5489713dca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/bundle.json","state_url":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/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-08T15:06:06Z","links":{"resolver":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH","bundle":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/bundle.json","state":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7WRNNEC6BBTUBVAQNV4R73VFXH","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":"28ef21be278a19883d965666ed86fbc1e534537fd661c18d3f1436de5fbe0190","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","title_canon_sha256":"72dc8e5737a9bc0c4adb7c9d3d9b1cf3ddb3717bef1fa76ef606ee25aec4d0bd"},"schema_version":"1.0","source":{"id":"1803.06673","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06673","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06673v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06673","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"7WRNNEC6BBTU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WRNNEC6BBTUBVAQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WRNNEC6","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:7c0ce983761cf4177efc82c6c8462a580cdd7b609a60b29e3f060c5489713dca","target":"graph","created_at":"2026-05-18T00:08:20Z","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 well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed slow convergence which often hinders the application of EM algorithms in high-dimensional problems or in other complex settings.To address the need for more rapidly convergent EM algorithms, we describe a new class of acceleration schemes that build on the Anderson acceleration technique for speeding fixed-point iterations. Our approach is effective at greatly","authors_text":"Nicholas C. Henderson, Ravi Varadhan","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","title":"Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM-like algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06673","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:3bf5543becc3a3fa04cceb5a167d31a38caf84c3f18e9c4e91161f91094dde59","target":"record","created_at":"2026-05-18T00:08:20Z","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":"28ef21be278a19883d965666ed86fbc1e534537fd661c18d3f1436de5fbe0190","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","title_canon_sha256":"72dc8e5737a9bc0c4adb7c9d3d9b1cf3ddb3717bef1fa76ef606ee25aec4d0bd"},"schema_version":"1.0","source":{"id":"1803.06673","kind":"arxiv","version":2}},"canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","first_computed_at":"2026-05-18T00:08:20.947563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:20.947563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mq9HS9DQ659GOaepNbFlFhr8vAYSTMQt7DnpGBkQOdmWUh0MBIlIznAapkdxIM3umsu1C2sb7X0BUtidjF7JCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:20.948065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06673","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf5543becc3a3fa04cceb5a167d31a38caf84c3f18e9c4e91161f91094dde59","sha256:7c0ce983761cf4177efc82c6c8462a580cdd7b609a60b29e3f060c5489713dca"],"state_sha256":"99a4848952017064b26b807b53d19ff9b56b451a908fd8f5cdcc44aae4ed8416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A42QauFqBxVKPMkZOvwEsuvMdCwIJBC9zdRkJzbZx96OvFmtDRRbqMhI8ncAZhrigovWiredy3pJnuOyVqAtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:06:06.077138Z","bundle_sha256":"293f72e78089ae5370c7157176dffec842aafd378b12a39b2709eda98c510976"}}