{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O3SWPILGKRZ3N2BLGR37TYGF6U","short_pith_number":"pith:O3SWPILG","canonical_record":{"source":{"id":"1802.04911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-14T01:00:10Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"179557de8f240bde1f072396e22315f8056b33e287bfebc198763c4cda3addba","abstract_canon_sha256":"8cc49f38b2f2e3a46e79bc8ba26fc7fbbc3277eea08ccc6b06668aec64911cf5"},"schema_version":"1.0"},"canonical_sha256":"76e567a1665473b6e82b3477f9e0c5f526f0e131a6d4734d211a662306d08831","source":{"kind":"arxiv","id":"1802.04911","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04911","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04911v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04911","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"O3SWPILGKRZ3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3SWPILGKRZ3N2BL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3SWPILG","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O3SWPILGKRZ3N2BLGR37TYGF6U","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-14T01:00:10Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"179557de8f240bde1f072396e22315f8056b33e287bfebc198763c4cda3addba","abstract_canon_sha256":"8cc49f38b2f2e3a46e79bc8ba26fc7fbbc3277eea08ccc6b06668aec64911cf5"},"schema_version":"1.0"},"canonical_sha256":"76e567a1665473b6e82b3477f9e0c5f526f0e131a6d4734d211a662306d08831","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.265780Z","signature_b64":"VZPqZj0dNjQywa9X5RTun2NrE2oF60qlAtuGf6IItobxn4xXDdH2bxm2sKTCKZtHIua/dw3GZbNJJq9Zz9cpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76e567a1665473b6e82b3477f9e0c5f526f0e131a6d4734d211a662306d08831","last_reissued_at":"2026-05-18T00:14:00.265014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.265014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04911","source_version":3,"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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3H4498bq9/FTgB6ehXxga/nkx4xBZxqHBrWMBYSFY5HA4M9w5NVj5d7C0X1bwZ8ZhRZCVDvkSE5Td6klf+nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:37:03.912953Z"},"content_sha256":"af98a387b9eb24d6208d0dd4b5ca306db473a54685c32ea5a4486ae579e25947","schema_version":"1.0","event_id":"sha256:af98a387b9eb24d6208d0dd4b5ca306db473a54685c32ea5a4486ae579e25947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O3SWPILGKRZ3N2BLGR37TYGF6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Richard Y. Zhang, Salar Fattahi, Somayeh Sojoudi","submitted_at":"2018-02-14T01:00:10Z","abstract_excerpt":"The sparse inverse covariance estimation problem is commonly solved using an $\\ell_{1}$-regularized Gaussian maximum likelihood estimator known as \"graphical lasso\", but its computational cost becomes prohibitive for large data sets. A recent line of results showed--under mild assumptions--that the graphical lasso estimator can be retrieved by soft-thresholding the sample covariance matrix and solving a maximum determinant matrix completion (MDMC) problem. This paper proves an extension of this result, and describes a Newton-CG algorithm to efficiently solve the MDMC problem. Assuming that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04911","kind":"arxiv","version":3},"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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyMD+xSOHwymIr0zBp//8Bb7k8GhKL4CocRCzeornoFSF8LPby5uk8xCm6ICu+U7f49C851SFkbuw2JQXWmmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:37:03.913613Z"},"content_sha256":"58258b10a11aaefc04ca165260863c39e90d6491233a490eec2ee55fc2362c5c","schema_version":"1.0","event_id":"sha256:58258b10a11aaefc04ca165260863c39e90d6491233a490eec2ee55fc2362c5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/bundle.json","state_url":"https://pith.science/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/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-05-26T01:37:03Z","links":{"resolver":"https://pith.science/pith/O3SWPILGKRZ3N2BLGR37TYGF6U","bundle":"https://pith.science/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/bundle.json","state":"https://pith.science/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3SWPILGKRZ3N2BLGR37TYGF6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O3SWPILGKRZ3N2BLGR37TYGF6U","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":"8cc49f38b2f2e3a46e79bc8ba26fc7fbbc3277eea08ccc6b06668aec64911cf5","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-14T01:00:10Z","title_canon_sha256":"179557de8f240bde1f072396e22315f8056b33e287bfebc198763c4cda3addba"},"schema_version":"1.0","source":{"id":"1802.04911","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04911","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04911v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04911","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"O3SWPILGKRZ3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3SWPILGKRZ3N2BL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3SWPILG","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:58258b10a11aaefc04ca165260863c39e90d6491233a490eec2ee55fc2362c5c","target":"graph","created_at":"2026-05-18T00:14:00Z","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 sparse inverse covariance estimation problem is commonly solved using an $\\ell_{1}$-regularized Gaussian maximum likelihood estimator known as \"graphical lasso\", but its computational cost becomes prohibitive for large data sets. A recent line of results showed--under mild assumptions--that the graphical lasso estimator can be retrieved by soft-thresholding the sample covariance matrix and solving a maximum determinant matrix completion (MDMC) problem. This paper proves an extension of this result, and describes a Newton-CG algorithm to efficiently solve the MDMC problem. Assuming that the","authors_text":"Richard Y. Zhang, Salar Fattahi, Somayeh Sojoudi","cross_cats":["cs.LG","math.OC","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-14T01:00:10Z","title":"Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04911","kind":"arxiv","version":3},"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:af98a387b9eb24d6208d0dd4b5ca306db473a54685c32ea5a4486ae579e25947","target":"record","created_at":"2026-05-18T00:14:00Z","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":"8cc49f38b2f2e3a46e79bc8ba26fc7fbbc3277eea08ccc6b06668aec64911cf5","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-14T01:00:10Z","title_canon_sha256":"179557de8f240bde1f072396e22315f8056b33e287bfebc198763c4cda3addba"},"schema_version":"1.0","source":{"id":"1802.04911","kind":"arxiv","version":3}},"canonical_sha256":"76e567a1665473b6e82b3477f9e0c5f526f0e131a6d4734d211a662306d08831","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76e567a1665473b6e82b3477f9e0c5f526f0e131a6d4734d211a662306d08831","first_computed_at":"2026-05-18T00:14:00.265014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.265014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZPqZj0dNjQywa9X5RTun2NrE2oF60qlAtuGf6IItobxn4xXDdH2bxm2sKTCKZtHIua/dw3GZbNJJq9Zz9cpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.265780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04911","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af98a387b9eb24d6208d0dd4b5ca306db473a54685c32ea5a4486ae579e25947","sha256:58258b10a11aaefc04ca165260863c39e90d6491233a490eec2ee55fc2362c5c"],"state_sha256":"0d1b09f9cd8bb8a1832d6afdeaa2682c1ec04f44cc23c0958c18e360a3f33f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gE9zeTKIO7/QGPQktfPiwHqrg9NZxFkEYHArn888wCuKConfXu4mzyXiRwTNCcANiTGUxV/otlLK6fPIzJstAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:37:03.916948Z","bundle_sha256":"26e31f76c335475405534653ac364eb590263569fb5665ebdd118c5a8e66f66d"}}