{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MZHXF7DEZA2RXFMHN3VZCNLNY7","short_pith_number":"pith:MZHXF7DE","canonical_record":{"source":{"id":"1306.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-31T21:57:12Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"6dd3036054fc9acb2d74b9bfa261abf5f987c15aa8056453fd843addec45f867","abstract_canon_sha256":"8263bbf59d25291ab0e808d0257536ab7a992f191abba948c425ef3ff813fe57"},"schema_version":"1.0"},"canonical_sha256":"664f72fc64c8351b95876eeb91356dc7ce1b96576184057eee381f9ca712a3cf","source":{"kind":"arxiv","id":"1306.0040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0040","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0040v1","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0040","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"MZHXF7DEZA2R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZHXF7DEZA2RXFMH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZHXF7DE","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MZHXF7DEZA2RXFMHN3VZCNLNY7","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-31T21:57:12Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"6dd3036054fc9acb2d74b9bfa261abf5f987c15aa8056453fd843addec45f867","abstract_canon_sha256":"8263bbf59d25291ab0e808d0257536ab7a992f191abba948c425ef3ff813fe57"},"schema_version":"1.0"},"canonical_sha256":"664f72fc64c8351b95876eeb91356dc7ce1b96576184057eee381f9ca712a3cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:04.802236Z","signature_b64":"YslgnttaWW1oWFZDsizkHthW03q2r6yRKL8NRoDxzI7ZwKEYy1QtGmvGZIityMkDM6jeiPVTbpd6JhGkkE5KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664f72fc64c8351b95876eeb91356dc7ce1b96576184057eee381f9ca712a3cf","last_reissued_at":"2026-05-18T03:22:04.801642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:04.801642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0040","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:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zbgVNa0HKmVdfbOeBKHuMvUGh2da2XN+LVATaInuXjQpGIV8hv8rfmdJtVr65eZDdXVpAaub8QdVXr1DEXpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:13:31.168781Z"},"content_sha256":"a41e2927c4fc9ee6e296fc170cdac7485c717c1c925f95bc9c637d4224a8b6ab","schema_version":"1.0","event_id":"sha256:a41e2927c4fc9ee6e296fc170cdac7485c717c1c925f95bc9c637d4224a8b6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MZHXF7DEZA2RXFMHN3VZCNLNY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expectation-maximization for logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"James G. Scott, Liang Sun","submitted_at":"2013-05-31T21:57:12Z","abstract_excerpt":"We present a family of expectation-maximization (EM) algorithms for binary and negative-binomial logistic regression, drawing a sharp connection with the variational-Bayes algorithm of Jaakkola and Jordan (2000). Indeed, our results allow a version of this variational-Bayes approach to be re-interpreted as a true EM algorithm. We study several interesting features of the algorithm, and of this previously unrecognized connection with variational Bayes. We also generalize the approach to sparsity-promoting priors, and to an online method whose convergence properties are easily established. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0040","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:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kH7LLyQXqPbYqnxbWDSONFS9ovkzG0XR8WGPks1Ag/kYotkAENjvWQocHEVptvmAfXXxuCgXd6xmF+zNtFFTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:13:31.169128Z"},"content_sha256":"e3a1816bcfa997ece8c5a3eb6a707cd535af662d6d8538a6014b3ab67f78c118","schema_version":"1.0","event_id":"sha256:e3a1816bcfa997ece8c5a3eb6a707cd535af662d6d8538a6014b3ab67f78c118"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/bundle.json","state_url":"https://pith.science/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/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-11T10:13:31Z","links":{"resolver":"https://pith.science/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7","bundle":"https://pith.science/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/bundle.json","state":"https://pith.science/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZHXF7DEZA2RXFMHN3VZCNLNY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MZHXF7DEZA2RXFMHN3VZCNLNY7","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":"8263bbf59d25291ab0e808d0257536ab7a992f191abba948c425ef3ff813fe57","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-31T21:57:12Z","title_canon_sha256":"6dd3036054fc9acb2d74b9bfa261abf5f987c15aa8056453fd843addec45f867"},"schema_version":"1.0","source":{"id":"1306.0040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0040","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0040v1","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0040","created_at":"2026-05-18T03:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"MZHXF7DEZA2R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZHXF7DEZA2RXFMH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZHXF7DE","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:e3a1816bcfa997ece8c5a3eb6a707cd535af662d6d8538a6014b3ab67f78c118","target":"graph","created_at":"2026-05-18T03:22:04Z","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":"We present a family of expectation-maximization (EM) algorithms for binary and negative-binomial logistic regression, drawing a sharp connection with the variational-Bayes algorithm of Jaakkola and Jordan (2000). Indeed, our results allow a version of this variational-Bayes approach to be re-interpreted as a true EM algorithm. We study several interesting features of the algorithm, and of this previously unrecognized connection with variational Bayes. We also generalize the approach to sparsity-promoting priors, and to an online method whose convergence properties are easily established. This ","authors_text":"James G. Scott, Liang Sun","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-31T21:57:12Z","title":"Expectation-maximization for logistic regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0040","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:a41e2927c4fc9ee6e296fc170cdac7485c717c1c925f95bc9c637d4224a8b6ab","target":"record","created_at":"2026-05-18T03:22:04Z","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":"8263bbf59d25291ab0e808d0257536ab7a992f191abba948c425ef3ff813fe57","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-05-31T21:57:12Z","title_canon_sha256":"6dd3036054fc9acb2d74b9bfa261abf5f987c15aa8056453fd843addec45f867"},"schema_version":"1.0","source":{"id":"1306.0040","kind":"arxiv","version":1}},"canonical_sha256":"664f72fc64c8351b95876eeb91356dc7ce1b96576184057eee381f9ca712a3cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"664f72fc64c8351b95876eeb91356dc7ce1b96576184057eee381f9ca712a3cf","first_computed_at":"2026-05-18T03:22:04.801642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:04.801642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YslgnttaWW1oWFZDsizkHthW03q2r6yRKL8NRoDxzI7ZwKEYy1QtGmvGZIityMkDM6jeiPVTbpd6JhGkkE5KCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:04.802236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a41e2927c4fc9ee6e296fc170cdac7485c717c1c925f95bc9c637d4224a8b6ab","sha256:e3a1816bcfa997ece8c5a3eb6a707cd535af662d6d8538a6014b3ab67f78c118"],"state_sha256":"cd5e79d4e1e1148ce05adaabd77467622ca397f070a8acb308f12466ff9f5867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1srfzN1cJK5k8+5tXxA/nY62yaV/Yr1NJL3K5B8NZBvIXtxnhKjNRQb5s7Xr+Egmq1MhoAhgdr7OGvhQsAEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:13:31.171086Z","bundle_sha256":"8ba795c09ff9ddb99a805e06255bb2a44996fbd900e7e3657eb433d84358a3db"}}