{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FCBYXYLHVK2ZNRR6OC7MJZLV4H","short_pith_number":"pith:FCBYXYLH","canonical_record":{"source":{"id":"1206.1275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:51:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e39e912ca475d033f1e3a91e5ee7aef2ed0fa786e5e29978c7cdf9eda816c5c7","abstract_canon_sha256":"19307de032542fec7cb2240b49aeda301f2cb5e5e132b9b3f13ea253e095c782"},"schema_version":"1.0"},"canonical_sha256":"28838be167aab596c63e70bec4e575e1ce77cc3e39173dd70e4afe3bdde5a441","source":{"kind":"arxiv","id":"1206.1275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1275","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1275v2","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1275","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"FCBYXYLHVK2Z","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCBYXYLHVK2ZNRR6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCBYXYLH","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FCBYXYLHVK2ZNRR6OC7MJZLV4H","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:51:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e39e912ca475d033f1e3a91e5ee7aef2ed0fa786e5e29978c7cdf9eda816c5c7","abstract_canon_sha256":"19307de032542fec7cb2240b49aeda301f2cb5e5e132b9b3f13ea253e095c782"},"schema_version":"1.0"},"canonical_sha256":"28838be167aab596c63e70bec4e575e1ce77cc3e39173dd70e4afe3bdde5a441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:46.930699Z","signature_b64":"IzLUUTwGkr3IWukJRYWLy3Cvt4KJUVk45mv+siJMSwbvxLllAC69eBjca9NIMzJNfH41ImjXKZb1CAZj6ibQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28838be167aab596c63e70bec4e575e1ce77cc3e39173dd70e4afe3bdde5a441","last_reissued_at":"2026-05-18T03:44:46.930190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:46.930190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1275","source_version":2,"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:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1d2Gxn8nujLdNLN7HA+kQ60M4a19pmYbe4bpESJfK/nuRAjRkBcOMVMNDcHm6yV8iiQw/6CUAglCrYif5/XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:22:45.950900Z"},"content_sha256":"ea30adb4abf8af8edf2e919719ce0b8c4f3eab519ec66a9479648e7d1c5ae48b","schema_version":"1.0","event_id":"sha256:ea30adb4abf8af8edf2e919719ce0b8c4f3eab519ec66a9479648e7d1c5ae48b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FCBYXYLHVK2ZNRR6OC7MJZLV4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hui Zou, Lingzhou Xue, Shiqian Ma","submitted_at":"2012-06-06T16:51:40Z","abstract_excerpt":"Chandrasekaran, Parrilo and Willsky (2010) proposed a convex optimization problem to characterize graphical model selection in the presence of unobserved variables. This convex optimization problem aims to estimate an inverse covariance matrix that can be decomposed into a sparse matrix minus a low-rank matrix from sample data. Solving this convex optimization problem is very challenging, especially for large problems. In this paper, we propose two alternating direction methods for solving this problem. The first method is to apply the classical alternating direction method of multipliers to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1275","kind":"arxiv","version":2},"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:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9B7gBzqlITF7frpHLDNmFmKroUf4TWkbD/2GCGwAoRbB4xvXa+7fqVkqTdMBTEQoCVR+hceSiEIMQYtpEgUaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:22:45.951574Z"},"content_sha256":"1ad42cea82086014af112eb2d89adf51c5c0e6f61ee57f110cd0cbad4a391cff","schema_version":"1.0","event_id":"sha256:1ad42cea82086014af112eb2d89adf51c5c0e6f61ee57f110cd0cbad4a391cff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/bundle.json","state_url":"https://pith.science/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/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-24T08:22:45Z","links":{"resolver":"https://pith.science/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H","bundle":"https://pith.science/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/bundle.json","state":"https://pith.science/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCBYXYLHVK2ZNRR6OC7MJZLV4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FCBYXYLHVK2ZNRR6OC7MJZLV4H","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":"19307de032542fec7cb2240b49aeda301f2cb5e5e132b9b3f13ea253e095c782","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:51:40Z","title_canon_sha256":"e39e912ca475d033f1e3a91e5ee7aef2ed0fa786e5e29978c7cdf9eda816c5c7"},"schema_version":"1.0","source":{"id":"1206.1275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1275","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1275v2","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1275","created_at":"2026-05-18T03:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"FCBYXYLHVK2Z","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCBYXYLHVK2ZNRR6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCBYXYLH","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:1ad42cea82086014af112eb2d89adf51c5c0e6f61ee57f110cd0cbad4a391cff","target":"graph","created_at":"2026-05-18T03:44:46Z","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":"Chandrasekaran, Parrilo and Willsky (2010) proposed a convex optimization problem to characterize graphical model selection in the presence of unobserved variables. This convex optimization problem aims to estimate an inverse covariance matrix that can be decomposed into a sparse matrix minus a low-rank matrix from sample data. Solving this convex optimization problem is very challenging, especially for large problems. In this paper, we propose two alternating direction methods for solving this problem. The first method is to apply the classical alternating direction method of multipliers to s","authors_text":"Hui Zou, Lingzhou Xue, Shiqian Ma","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:51:40Z","title":"Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1275","kind":"arxiv","version":2},"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:ea30adb4abf8af8edf2e919719ce0b8c4f3eab519ec66a9479648e7d1c5ae48b","target":"record","created_at":"2026-05-18T03:44:46Z","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":"19307de032542fec7cb2240b49aeda301f2cb5e5e132b9b3f13ea253e095c782","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:51:40Z","title_canon_sha256":"e39e912ca475d033f1e3a91e5ee7aef2ed0fa786e5e29978c7cdf9eda816c5c7"},"schema_version":"1.0","source":{"id":"1206.1275","kind":"arxiv","version":2}},"canonical_sha256":"28838be167aab596c63e70bec4e575e1ce77cc3e39173dd70e4afe3bdde5a441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28838be167aab596c63e70bec4e575e1ce77cc3e39173dd70e4afe3bdde5a441","first_computed_at":"2026-05-18T03:44:46.930190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:46.930190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IzLUUTwGkr3IWukJRYWLy3Cvt4KJUVk45mv+siJMSwbvxLllAC69eBjca9NIMzJNfH41ImjXKZb1CAZj6ibQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:46.930699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea30adb4abf8af8edf2e919719ce0b8c4f3eab519ec66a9479648e7d1c5ae48b","sha256:1ad42cea82086014af112eb2d89adf51c5c0e6f61ee57f110cd0cbad4a391cff"],"state_sha256":"700dc8764bba20dd6623c61a5eb8c97426f36c734b10a5ad5248d25714f6e2da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmSWOzIdobM2sYVVK8Cu5qgdBarfTPOnEuLvbt1sPgqoNsYtmtpup9pMwoGsjMmwPeBnO8DCcpQK5nI34XiiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T08:22:45.955371Z","bundle_sha256":"a854541492dad5e83a2d1e8d690dbeb7a000bc9f745b93edf090d0806028bbc6"}}