{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RLGDZ3NVMN2DXYXG52J5Y2CE5J","short_pith_number":"pith:RLGDZ3NV","canonical_record":{"source":{"id":"2409.12067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-18T15:39:12Z","cross_cats_sorted":["cs.LG","cs.MS","stat.CO"],"title_canon_sha256":"be3b0948715989eeb8206145024360b93589ddc4965323c75e81f7df33f580a0","abstract_canon_sha256":"f351931a279a1b146e753883dcebc0c030c4a8902141c081d54753f71b609a09"},"schema_version":"1.0"},"canonical_sha256":"8acc3cedb563743be2e6ee93dc6844ea76ec30e4b8bc7e2ccce3f947278d55de","source":{"kind":"arxiv","id":"2409.12067","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12067","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12067v4","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12067","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"RLGDZ3NVMN2D","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLGDZ3NVMN2DXYXG","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLGDZ3NV","created_at":"2026-07-05T11:58:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RLGDZ3NVMN2DXYXG52J5Y2CE5J","target":"record","payload":{"canonical_record":{"source":{"id":"2409.12067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-18T15:39:12Z","cross_cats_sorted":["cs.LG","cs.MS","stat.CO"],"title_canon_sha256":"be3b0948715989eeb8206145024360b93589ddc4965323c75e81f7df33f580a0","abstract_canon_sha256":"f351931a279a1b146e753883dcebc0c030c4a8902141c081d54753f71b609a09"},"schema_version":"1.0"},"canonical_sha256":"8acc3cedb563743be2e6ee93dc6844ea76ec30e4b8bc7e2ccce3f947278d55de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:20.599451Z","signature_b64":"yPeTj08TldiWhWF7yVJ1jY1aPEt8MmTNwth75cBTlwi8WmVNlideoA3e8HJDbcUOCUYtpEgZtLY5on/g7vc6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8acc3cedb563743be2e6ee93dc6844ea76ec30e4b8bc7e2ccce3f947278d55de","last_reissued_at":"2026-07-05T11:58:20.598909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:20.598909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.12067","source_version":4,"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-07-05T11:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwDbOAewtSyd7lF3Uk56mTrfOwE/HTDARdRSnyijOIMIk8SJjz3Ya84xMuCOj4E9mR7hF0qP+xVYJo1qxy55Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:05:05.662637Z"},"content_sha256":"002dc23bb696f2589e761c3049719d619a266ee6f90ada0fa92b44007142b068","schema_version":"1.0","event_id":"sha256:002dc23bb696f2589e761c3049719d619a266ee6f90ada0fa92b44007142b068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RLGDZ3NVMN2DXYXG52J5Y2CE5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fitting Multilevel Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MS","stat.CO"],"primary_cat":"stat.ML","authors_text":"Stephen Boyd, Tetiana Parshakova, Trevor Hastie","submitted_at":"2024-09-18T15:39:12Z","abstract_excerpt":"We examine a special case of the multilevel factor model, with covariance given by multilevel low rank (MLR) matrix~\\cite{parshakova2023factor}. We develop a novel, fast implementation of the expectation-maximization algorithm, tailored for multilevel factor models, to maximize the likelihood of the observed data. This method accommodates any hierarchical structure and maintains linear time and storage complexities per iteration. This is achieved through a new efficient technique for computing the inverse of the positive definite MLR matrix. We show that the inverse of positive definite MLR ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12067","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.12067/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RTpF8ECsR7s5sJLNG25J9zPqFb0J31sMpvmL8EXoS3M+fQf3N2OnN3GZhG/0xTpSEwD6AKuo94G58F+zYpHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:05:05.663131Z"},"content_sha256":"2052d1d56442358fc76137e2416974387ee0601dc015d9ef1498b3ea39df4410","schema_version":"1.0","event_id":"sha256:2052d1d56442358fc76137e2416974387ee0601dc015d9ef1498b3ea39df4410"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/bundle.json","state_url":"https://pith.science/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/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-08-05T06:05:05Z","links":{"resolver":"https://pith.science/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J","bundle":"https://pith.science/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/bundle.json","state":"https://pith.science/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLGDZ3NVMN2DXYXG52J5Y2CE5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RLGDZ3NVMN2DXYXG52J5Y2CE5J","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":"f351931a279a1b146e753883dcebc0c030c4a8902141c081d54753f71b609a09","cross_cats_sorted":["cs.LG","cs.MS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-18T15:39:12Z","title_canon_sha256":"be3b0948715989eeb8206145024360b93589ddc4965323c75e81f7df33f580a0"},"schema_version":"1.0","source":{"id":"2409.12067","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12067","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12067v4","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12067","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"RLGDZ3NVMN2D","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLGDZ3NVMN2DXYXG","created_at":"2026-07-05T11:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLGDZ3NV","created_at":"2026-07-05T11:58:20Z"}],"graph_snapshots":[{"event_id":"sha256:2052d1d56442358fc76137e2416974387ee0601dc015d9ef1498b3ea39df4410","target":"graph","created_at":"2026-07-05T11:58: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.12067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We examine a special case of the multilevel factor model, with covariance given by multilevel low rank (MLR) matrix~\\cite{parshakova2023factor}. We develop a novel, fast implementation of the expectation-maximization algorithm, tailored for multilevel factor models, to maximize the likelihood of the observed data. This method accommodates any hierarchical structure and maintains linear time and storage complexities per iteration. This is achieved through a new efficient technique for computing the inverse of the positive definite MLR matrix. We show that the inverse of positive definite MLR ma","authors_text":"Stephen Boyd, Tetiana Parshakova, Trevor Hastie","cross_cats":["cs.LG","cs.MS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-18T15:39:12Z","title":"Fitting Multilevel Factor Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12067","kind":"arxiv","version":4},"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:002dc23bb696f2589e761c3049719d619a266ee6f90ada0fa92b44007142b068","target":"record","created_at":"2026-07-05T11:58: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":"f351931a279a1b146e753883dcebc0c030c4a8902141c081d54753f71b609a09","cross_cats_sorted":["cs.LG","cs.MS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-18T15:39:12Z","title_canon_sha256":"be3b0948715989eeb8206145024360b93589ddc4965323c75e81f7df33f580a0"},"schema_version":"1.0","source":{"id":"2409.12067","kind":"arxiv","version":4}},"canonical_sha256":"8acc3cedb563743be2e6ee93dc6844ea76ec30e4b8bc7e2ccce3f947278d55de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8acc3cedb563743be2e6ee93dc6844ea76ec30e4b8bc7e2ccce3f947278d55de","first_computed_at":"2026-07-05T11:58:20.598909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:20.598909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yPeTj08TldiWhWF7yVJ1jY1aPEt8MmTNwth75cBTlwi8WmVNlideoA3e8HJDbcUOCUYtpEgZtLY5on/g7vc6Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:20.599451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.12067","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:002dc23bb696f2589e761c3049719d619a266ee6f90ada0fa92b44007142b068","sha256:2052d1d56442358fc76137e2416974387ee0601dc015d9ef1498b3ea39df4410"],"state_sha256":"e19cee282be4b45008de09450b8e77590b7aa752509202c65e795fb36ba98fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9VekIP5C9aCBSXpPVg65SVrL4L2vmXsX9QAMqnUBG5ETuIU5C7rnKUu6w9vwaNVXRdn3clHjBo66wew41nnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:05:05.666298Z","bundle_sha256":"3bfc843d43b24777ee9ad7c1cb3090e0bd2880c01c95c931c861586586a64ca7"}}