{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VLZU4FGEQFSIYK6KXNG26SEAKT","short_pith_number":"pith:VLZU4FGE","canonical_record":{"source":{"id":"1308.4601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-08-21T14:49:03Z","cross_cats_sorted":[],"title_canon_sha256":"071f303ae491cca36179dc9e74dcfd953b3bb4205f4834d534e873725c19989e","abstract_canon_sha256":"d4ba8f50578b9c53a719de4d6d337d1f46afe63da7b0188511f6dec131e881b5"},"schema_version":"1.0"},"canonical_sha256":"aaf34e14c481648c2bcabb4daf488054e06f103f7935567a051bcce68c690ccc","source":{"kind":"arxiv","id":"1308.4601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4601","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4601v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4601","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"VLZU4FGEQFSI","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VLZU4FGEQFSIYK6K","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VLZU4FGE","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VLZU4FGEQFSIYK6KXNG26SEAKT","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-08-21T14:49:03Z","cross_cats_sorted":[],"title_canon_sha256":"071f303ae491cca36179dc9e74dcfd953b3bb4205f4834d534e873725c19989e","abstract_canon_sha256":"d4ba8f50578b9c53a719de4d6d337d1f46afe63da7b0188511f6dec131e881b5"},"schema_version":"1.0"},"canonical_sha256":"aaf34e14c481648c2bcabb4daf488054e06f103f7935567a051bcce68c690ccc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:21.548527Z","signature_b64":"ocVz2yeQ5EVnKswfWg/1+v6ik2LqQf8c4U764tUH+s629k39GFjZ9o9q4TT3yqgdQwbEsfzmPbsIn4dCu4XxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaf34e14c481648c2bcabb4daf488054e06f103f7935567a051bcce68c690ccc","last_reissued_at":"2026-05-18T03:15:21.547767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:21.547767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4601","source_version":1,"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0GN14xQ8946ooIrFBap0B271sgZ53HE8irNcEFC46QlfrQOa8qpSDEkliC+sbJAaA3O5XlZ5CZsWv8dV/kCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:19:04.301413Z"},"content_sha256":"7b3da9adff658c2963c33711073a7e06f67f5068b51b1959672a8a43d48da58e","schema_version":"1.0","event_id":"sha256:7b3da9adff658c2963c33711073a7e06f67f5068b51b1959672a8a43d48da58e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VLZU4FGEQFSIYK6KXNG26SEAKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference in Gaussian models with missing data using Equalisation Maximisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Fredrik Lindsten, Johan Dahlin, Thomas B. Sch\\\"on","submitted_at":"2013-08-21T14:49:03Z","abstract_excerpt":"Equalisation Maximisation (EqM) is an algorithm for estimating parameters in auto-regressive (AR) models where some fraction of the data is missing. It has previously been shown that the EqM algorithm is a competitive alternative to expectation maximisation, estimating models with equal predictive capability at a lower computational cost.\n  The EqM algorithm has previously been motivated as a heuristic. In this paper, we instead show that EqM can be viewed as an approximation of a proximal point algorithm. We also derive the method for the entire class of Gaussian models and exemplify its use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4601","kind":"arxiv","version":1},"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+1LsPBCG6PGlhEOH+Es2G9y+JeptHhviKCefRZSLTClNjpofxnha5hdm6wCLldN0DzjK1ISrncyUwu+hdIyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:19:04.302131Z"},"content_sha256":"4da0a6754a2d843dd599601350770a687fce0cc34f4573028d9ea70f0efabde2","schema_version":"1.0","event_id":"sha256:4da0a6754a2d843dd599601350770a687fce0cc34f4573028d9ea70f0efabde2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/bundle.json","state_url":"https://pith.science/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/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-11T03:19:04Z","links":{"resolver":"https://pith.science/pith/VLZU4FGEQFSIYK6KXNG26SEAKT","bundle":"https://pith.science/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/bundle.json","state":"https://pith.science/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLZU4FGEQFSIYK6KXNG26SEAKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VLZU4FGEQFSIYK6KXNG26SEAKT","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":"d4ba8f50578b9c53a719de4d6d337d1f46afe63da7b0188511f6dec131e881b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-08-21T14:49:03Z","title_canon_sha256":"071f303ae491cca36179dc9e74dcfd953b3bb4205f4834d534e873725c19989e"},"schema_version":"1.0","source":{"id":"1308.4601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4601","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4601v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4601","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"VLZU4FGEQFSI","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VLZU4FGEQFSIYK6K","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VLZU4FGE","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4da0a6754a2d843dd599601350770a687fce0cc34f4573028d9ea70f0efabde2","target":"graph","created_at":"2026-05-18T03:15:21Z","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":"Equalisation Maximisation (EqM) is an algorithm for estimating parameters in auto-regressive (AR) models where some fraction of the data is missing. It has previously been shown that the EqM algorithm is a competitive alternative to expectation maximisation, estimating models with equal predictive capability at a lower computational cost.\n  The EqM algorithm has previously been motivated as a heuristic. In this paper, we instead show that EqM can be viewed as an approximation of a proximal point algorithm. We also derive the method for the entire class of Gaussian models and exemplify its use ","authors_text":"Fredrik Lindsten, Johan Dahlin, Thomas B. Sch\\\"on","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-08-21T14:49:03Z","title":"Inference in Gaussian models with missing data using Equalisation Maximisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4601","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:7b3da9adff658c2963c33711073a7e06f67f5068b51b1959672a8a43d48da58e","target":"record","created_at":"2026-05-18T03:15:21Z","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":"d4ba8f50578b9c53a719de4d6d337d1f46afe63da7b0188511f6dec131e881b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-08-21T14:49:03Z","title_canon_sha256":"071f303ae491cca36179dc9e74dcfd953b3bb4205f4834d534e873725c19989e"},"schema_version":"1.0","source":{"id":"1308.4601","kind":"arxiv","version":1}},"canonical_sha256":"aaf34e14c481648c2bcabb4daf488054e06f103f7935567a051bcce68c690ccc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaf34e14c481648c2bcabb4daf488054e06f103f7935567a051bcce68c690ccc","first_computed_at":"2026-05-18T03:15:21.547767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:21.547767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ocVz2yeQ5EVnKswfWg/1+v6ik2LqQf8c4U764tUH+s629k39GFjZ9o9q4TT3yqgdQwbEsfzmPbsIn4dCu4XxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:21.548527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b3da9adff658c2963c33711073a7e06f67f5068b51b1959672a8a43d48da58e","sha256:4da0a6754a2d843dd599601350770a687fce0cc34f4573028d9ea70f0efabde2"],"state_sha256":"2c52402f7e8b0a73a45eccbf742de06cd620c9a36b761fbbf649bd5f4db14711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIuT5KUfwzszu250gpdmZ5zJcPO3FAuh6CI1vD/jqX1PUt6oqfdEXw4dUw6M0QLelX48jEdll0Lfb5WuMSm3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:19:04.306271Z","bundle_sha256":"1633ce192d664d7aa79c538589bfae46af233a016fc0024faa334a34e47bd0df"}}