{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2QRTEFKVKTOQVVZCNCNUFOQ3KQ","short_pith_number":"pith:2QRTEFKV","canonical_record":{"source":{"id":"1309.6609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-09-25T19:00:17Z","cross_cats_sorted":[],"title_canon_sha256":"bd91d7dc2d11b1a610f29d511fb75f23cd78c6bf3ac5fe718ebc04768626f237","abstract_canon_sha256":"91acadb0775c97e1ec89f4ad96d3726b6635e360f6e5f9d5afae47ec3f86e3fc"},"schema_version":"1.0"},"canonical_sha256":"d42332155554dd0ad722689b42ba1b5437740b791b141c61e76eb705611c41e8","source":{"kind":"arxiv","id":"1309.6609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6609","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6609v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6609","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"2QRTEFKVKTOQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2QRTEFKVKTOQVVZC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2QRTEFKV","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2QRTEFKVKTOQVVZCNCNUFOQ3KQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-09-25T19:00:17Z","cross_cats_sorted":[],"title_canon_sha256":"bd91d7dc2d11b1a610f29d511fb75f23cd78c6bf3ac5fe718ebc04768626f237","abstract_canon_sha256":"91acadb0775c97e1ec89f4ad96d3726b6635e360f6e5f9d5afae47ec3f86e3fc"},"schema_version":"1.0"},"canonical_sha256":"d42332155554dd0ad722689b42ba1b5437740b791b141c61e76eb705611c41e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:20.540960Z","signature_b64":"IMGseXHdgy/1guaCxgHzl4TwT6QPfPw1Cga7vM18o2MAuVTpaKKsofrOmXIq2D1gcg4PMlNKAOElcIMOW/1eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42332155554dd0ad722689b42ba1b5437740b791b141c61e76eb705611c41e8","last_reissued_at":"2026-05-18T03:12:20.540204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:20.540204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6609","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12mNqVQd1a0bFBJYqkJGjZSvmBNhc4GzfDo4smYyqwcF8LFAwdulvGHlMkAm6pdA0Gh6nmEZYjSzsosdQ5QkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:12:49.646929Z"},"content_sha256":"581462e7640a5ddd8471eb9a906ea9e9911d33ceac70ec47c7dc68dd84741324","schema_version":"1.0","event_id":"sha256:581462e7640a5ddd8471eb9a906ea9e9911d33ceac70ec47c7dc68dd84741324"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2QRTEFKVKTOQVVZCNCNUFOQ3KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Expectation-Maximization Algorithm for the Matrix Normal Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Hunter Glanz, Luis Carvalho","submitted_at":"2013-09-25T19:00:17Z","abstract_excerpt":"Dramatic increases in the size and dimensionality of many recent data sets make crucial the need for sophisticated methods that can exploit inherent structure and handle missing values. In this article we derive an expectation-maximization (EM) algorithm for the matrix normal distribution, a distribution well-suited for naturally structured data such as spatio-temporal data. We review previously established maximum likelihood matrix normal estimates, and then consider the situation involving missing data. We apply our EM method in a simulation study exploring errors across different dimensions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6609","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43xhrc7oE/+ovMdCwIcrKPd7sGS3odNlitqZ8Tg1pMMG5bhHk7XXirUPDNSF2iD3Y6TaS7VhtAn3iH36ZtWRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:12:49.647267Z"},"content_sha256":"18a5c815b6b691a6b05864b36369b2a1b25c703dcca17b7b5b11158f906d7549","schema_version":"1.0","event_id":"sha256:18a5c815b6b691a6b05864b36369b2a1b25c703dcca17b7b5b11158f906d7549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/bundle.json","state_url":"https://pith.science/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/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-02T18:12:49Z","links":{"resolver":"https://pith.science/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ","bundle":"https://pith.science/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/bundle.json","state":"https://pith.science/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QRTEFKVKTOQVVZCNCNUFOQ3KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2QRTEFKVKTOQVVZCNCNUFOQ3KQ","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":"91acadb0775c97e1ec89f4ad96d3726b6635e360f6e5f9d5afae47ec3f86e3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-09-25T19:00:17Z","title_canon_sha256":"bd91d7dc2d11b1a610f29d511fb75f23cd78c6bf3ac5fe718ebc04768626f237"},"schema_version":"1.0","source":{"id":"1309.6609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6609","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6609v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6609","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"2QRTEFKVKTOQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2QRTEFKVKTOQVVZC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2QRTEFKV","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:18a5c815b6b691a6b05864b36369b2a1b25c703dcca17b7b5b11158f906d7549","target":"graph","created_at":"2026-05-18T03:12: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":"Dramatic increases in the size and dimensionality of many recent data sets make crucial the need for sophisticated methods that can exploit inherent structure and handle missing values. In this article we derive an expectation-maximization (EM) algorithm for the matrix normal distribution, a distribution well-suited for naturally structured data such as spatio-temporal data. We review previously established maximum likelihood matrix normal estimates, and then consider the situation involving missing data. We apply our EM method in a simulation study exploring errors across different dimensions","authors_text":"Hunter Glanz, Luis Carvalho","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-09-25T19:00:17Z","title":"An Expectation-Maximization Algorithm for the Matrix Normal Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6609","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:581462e7640a5ddd8471eb9a906ea9e9911d33ceac70ec47c7dc68dd84741324","target":"record","created_at":"2026-05-18T03:12: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":"91acadb0775c97e1ec89f4ad96d3726b6635e360f6e5f9d5afae47ec3f86e3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-09-25T19:00:17Z","title_canon_sha256":"bd91d7dc2d11b1a610f29d511fb75f23cd78c6bf3ac5fe718ebc04768626f237"},"schema_version":"1.0","source":{"id":"1309.6609","kind":"arxiv","version":1}},"canonical_sha256":"d42332155554dd0ad722689b42ba1b5437740b791b141c61e76eb705611c41e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42332155554dd0ad722689b42ba1b5437740b791b141c61e76eb705611c41e8","first_computed_at":"2026-05-18T03:12:20.540204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:20.540204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IMGseXHdgy/1guaCxgHzl4TwT6QPfPw1Cga7vM18o2MAuVTpaKKsofrOmXIq2D1gcg4PMlNKAOElcIMOW/1eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:20.540960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:581462e7640a5ddd8471eb9a906ea9e9911d33ceac70ec47c7dc68dd84741324","sha256:18a5c815b6b691a6b05864b36369b2a1b25c703dcca17b7b5b11158f906d7549"],"state_sha256":"00d22389743a9edc1dd7d1da48ab99e6e7f824241036058048e9a3610eb8c9f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caKi8aCI/3KWf195ffz6O5cJgHj6FZ4q4wa26KEEHd/FlCqPYraYh0dqkvDaWMD/uUXiHbjxyJm6dJCD1+zCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:12:49.649209Z","bundle_sha256":"7e882b27ada2e07c9a01d89debffd32fba35b7ac3211bc8fe63b84ea24bc9f70"}}