{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YIMRXPPYG3JWLJVJGE27HYILX5","short_pith_number":"pith:YIMRXPPY","canonical_record":{"source":{"id":"1307.5339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-19T21:19:11Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"3b881a8192690edefdf8a91aedf795457c9a4aee7cbf0fcb698746fb51bd87ba","abstract_canon_sha256":"4e28dcab47a6a7fad7e52e29ecbef904c7a66cb16dbbef3fe7296d3f957b3888"},"schema_version":"1.0"},"canonical_sha256":"c2191bbdf836d365a6a93135f3e10bbf72e6746b5f1611067867cef266422024","source":{"kind":"arxiv","id":"1307.5339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5339","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5339v1","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5339","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"YIMRXPPYG3JW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YIMRXPPYG3JWLJVJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YIMRXPPY","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YIMRXPPYG3JWLJVJGE27HYILX5","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-19T21:19:11Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"3b881a8192690edefdf8a91aedf795457c9a4aee7cbf0fcb698746fb51bd87ba","abstract_canon_sha256":"4e28dcab47a6a7fad7e52e29ecbef904c7a66cb16dbbef3fe7296d3f957b3888"},"schema_version":"1.0"},"canonical_sha256":"c2191bbdf836d365a6a93135f3e10bbf72e6746b5f1611067867cef266422024","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:56.064437Z","signature_b64":"OPrDlcmnOxNT1sD9boSX2YGQNn4k2iruDLDx/3JgriKusndK2WVOmfFTS28F7FLAY/PdlNjQB+xJtZc4Hkj+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2191bbdf836d365a6a93135f3e10bbf72e6746b5f1611067867cef266422024","last_reissued_at":"2026-05-18T03:17:56.063416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:56.063416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5339","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:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdZPeSHNOntreydKV1eWZYRzoUC7N6sx60E5C2SqoUxKpf+a6gfK9N5N9ZYgrooSxVv2JJX0/gvVW3dxUzBjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:45:05.963540Z"},"content_sha256":"3d6d5a5b43e7a8dac0f99951fb052fa46b870a5fbe2e0b77dfbc75ebf0f13667","schema_version":"1.0","event_id":"sha256:3d6d5a5b43e7a8dac0f99951fb052fa46b870a5fbe2e0b77dfbc75ebf0f13667"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YIMRXPPYG3JWLJVJGE27HYILX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Cluster Graphical Lasso for improved estimation of Gaussian graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.ML","authors_text":"Ali Shojaie, Daniela Witten, Kean Ming Tan","submitted_at":"2013-07-19T21:19:11Z","abstract_excerpt":"We consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approach for this task. We begin by introducing a surprising connection between the graphical lasso and hierarchical clustering: the graphical lasso in effect performs a two-step procedure, in which (1) single linkage hierarchical clustering is performed on the variables in order to identify connected components, and then (2) an l1-penalized log likelihood is maximized on the subset "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5339","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:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88BiNWjHXay5wYE5F8/LPqD8iZ04MXiTS74IZD7Xuu87JOJG88G1C0hiMalr9oRn66XPNM4BiKd2MsPWI6OFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:45:05.964206Z"},"content_sha256":"c7f736ee2743d50cb1bb4a67c2b27d4451aeb829485ea3c4a71484cbef39867d","schema_version":"1.0","event_id":"sha256:c7f736ee2743d50cb1bb4a67c2b27d4451aeb829485ea3c4a71484cbef39867d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIMRXPPYG3JWLJVJGE27HYILX5/bundle.json","state_url":"https://pith.science/pith/YIMRXPPYG3JWLJVJGE27HYILX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIMRXPPYG3JWLJVJGE27HYILX5/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-31T12:45:05Z","links":{"resolver":"https://pith.science/pith/YIMRXPPYG3JWLJVJGE27HYILX5","bundle":"https://pith.science/pith/YIMRXPPYG3JWLJVJGE27HYILX5/bundle.json","state":"https://pith.science/pith/YIMRXPPYG3JWLJVJGE27HYILX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIMRXPPYG3JWLJVJGE27HYILX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YIMRXPPYG3JWLJVJGE27HYILX5","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":"4e28dcab47a6a7fad7e52e29ecbef904c7a66cb16dbbef3fe7296d3f957b3888","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-19T21:19:11Z","title_canon_sha256":"3b881a8192690edefdf8a91aedf795457c9a4aee7cbf0fcb698746fb51bd87ba"},"schema_version":"1.0","source":{"id":"1307.5339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5339","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5339v1","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5339","created_at":"2026-05-18T03:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"YIMRXPPYG3JW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YIMRXPPYG3JWLJVJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YIMRXPPY","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:c7f736ee2743d50cb1bb4a67c2b27d4451aeb829485ea3c4a71484cbef39867d","target":"graph","created_at":"2026-05-18T03:17:56Z","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 consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approach for this task. We begin by introducing a surprising connection between the graphical lasso and hierarchical clustering: the graphical lasso in effect performs a two-step procedure, in which (1) single linkage hierarchical clustering is performed on the variables in order to identify connected components, and then (2) an l1-penalized log likelihood is maximized on the subset ","authors_text":"Ali Shojaie, Daniela Witten, Kean Ming Tan","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-19T21:19:11Z","title":"The Cluster Graphical Lasso for improved estimation of Gaussian graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5339","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:3d6d5a5b43e7a8dac0f99951fb052fa46b870a5fbe2e0b77dfbc75ebf0f13667","target":"record","created_at":"2026-05-18T03:17:56Z","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":"4e28dcab47a6a7fad7e52e29ecbef904c7a66cb16dbbef3fe7296d3f957b3888","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-19T21:19:11Z","title_canon_sha256":"3b881a8192690edefdf8a91aedf795457c9a4aee7cbf0fcb698746fb51bd87ba"},"schema_version":"1.0","source":{"id":"1307.5339","kind":"arxiv","version":1}},"canonical_sha256":"c2191bbdf836d365a6a93135f3e10bbf72e6746b5f1611067867cef266422024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2191bbdf836d365a6a93135f3e10bbf72e6746b5f1611067867cef266422024","first_computed_at":"2026-05-18T03:17:56.063416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:56.063416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPrDlcmnOxNT1sD9boSX2YGQNn4k2iruDLDx/3JgriKusndK2WVOmfFTS28F7FLAY/PdlNjQB+xJtZc4Hkj+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:56.064437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d6d5a5b43e7a8dac0f99951fb052fa46b870a5fbe2e0b77dfbc75ebf0f13667","sha256:c7f736ee2743d50cb1bb4a67c2b27d4451aeb829485ea3c4a71484cbef39867d"],"state_sha256":"b4e52a3c69f6e2fb615ed7c04c5d369b95e739ea6a9d39974c89640247f5e7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocbi5ToT3MYJlgkiJAIWXexn3YNDOEopNm7QRdsXzZES4wYw1/uHIDJcuHnLSirhe88BYhkJ9TcIHJek0qxnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:45:05.967942Z","bundle_sha256":"f5a7d14a585fab54feade6c8fd3b40fd09fea482f38e3eade353da1ceb072249"}}