{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZLAUUYFTDAN3FW3SD64SVTB6J5","short_pith_number":"pith:ZLAUUYFT","canonical_record":{"source":{"id":"1706.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-04T23:20:13Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"5bed644feb30f0263a4faedd8034ca0ecb295ac20886c171171e64becbeb2c69","abstract_canon_sha256":"4fd76a77b8ae26909b025732680bc3598901424350b29cd4e6ccab8433e2e59a"},"schema_version":"1.0"},"canonical_sha256":"cac14a60b3181bb2db721fb92acc3e4f5ac9e39e1f2539652b834cdecac008c3","source":{"kind":"arxiv","id":"1706.01158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01158","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01158v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01158","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZLAUUYFTDAN3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZLAUUYFTDAN3FW3S","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZLAUUYFT","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZLAUUYFTDAN3FW3SD64SVTB6J5","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-04T23:20:13Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"5bed644feb30f0263a4faedd8034ca0ecb295ac20886c171171e64becbeb2c69","abstract_canon_sha256":"4fd76a77b8ae26909b025732680bc3598901424350b29cd4e6ccab8433e2e59a"},"schema_version":"1.0"},"canonical_sha256":"cac14a60b3181bb2db721fb92acc3e4f5ac9e39e1f2539652b834cdecac008c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:04.309167Z","signature_b64":"1HOSGGMAlaSdzWu53ZWVK+6ZatUdxupPRY645LY5RsLxzBcU1MOh6kzvZjz9w/ElrEtMbfEKCHobodgZrHpVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac14a60b3181bb2db721fb92acc3e4f5ac9e39e1f2539652b834cdecac008c3","last_reissued_at":"2026-05-18T00:43:04.308488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:04.308488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01158","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-18T00:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUBmJLsvtTHKTnyCpepTJNn9NqoHh7jqnk91QMJOkjogMH+OlbGsCnCkBH5xSbDj4BfbUaUPjz5Da6cGwv9GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:47:20.055135Z"},"content_sha256":"ea6b37cf81d09117a9557957e08c814f1adae4ff0058acdba035528646a2eb9e","schema_version":"1.0","event_id":"sha256:ea6b37cf81d09117a9557957e08c814f1adae4ff0058acdba035528646a2eb9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZLAUUYFTDAN3FW3SD64SVTB6J5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphical Nonconvex Optimization for Optimal Estimation in Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Han Liu, Kean Ming Tan, Qiang Sun, Tong Zhang","submitted_at":"2017-06-04T23:20:13Z","abstract_excerpt":"We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In this paper, we propose the graphical nonconvex optimization for optimal estimation in Gaussian graphical models, which is then approximated by a sequence of convex programs. Our proposal is computationally tractable and produces an estimator that achieves the oracle rate of convergence. The statistical error introduced by the sequential approximation using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01158","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-18T00:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciR+5M6UcZR0LeGuIEPWjEjrfYarRIEWgQxgLaeCTqrsfEPB00s7ZF13qs+TnXXz0mYBV9D0zBmMe43hGp3wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:47:20.055726Z"},"content_sha256":"0b06a0553c9532a90c3a367fd56b1d2a2d4930e69a1df07e93d9dee471383a55","schema_version":"1.0","event_id":"sha256:0b06a0553c9532a90c3a367fd56b1d2a2d4930e69a1df07e93d9dee471383a55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/bundle.json","state_url":"https://pith.science/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/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-25T04:47:20Z","links":{"resolver":"https://pith.science/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5","bundle":"https://pith.science/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/bundle.json","state":"https://pith.science/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLAUUYFTDAN3FW3SD64SVTB6J5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZLAUUYFTDAN3FW3SD64SVTB6J5","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":"4fd76a77b8ae26909b025732680bc3598901424350b29cd4e6ccab8433e2e59a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-04T23:20:13Z","title_canon_sha256":"5bed644feb30f0263a4faedd8034ca0ecb295ac20886c171171e64becbeb2c69"},"schema_version":"1.0","source":{"id":"1706.01158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01158","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01158v1","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01158","created_at":"2026-05-18T00:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZLAUUYFTDAN3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZLAUUYFTDAN3FW3S","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZLAUUYFT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:0b06a0553c9532a90c3a367fd56b1d2a2d4930e69a1df07e93d9dee471383a55","target":"graph","created_at":"2026-05-18T00:43: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 consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In this paper, we propose the graphical nonconvex optimization for optimal estimation in Gaussian graphical models, which is then approximated by a sequence of convex programs. Our proposal is computationally tractable and produces an estimator that achieves the oracle rate of convergence. The statistical error introduced by the sequential approximation using ","authors_text":"Han Liu, Kean Ming Tan, Qiang Sun, Tong Zhang","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-04T23:20:13Z","title":"Graphical Nonconvex Optimization for Optimal Estimation in Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01158","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:ea6b37cf81d09117a9557957e08c814f1adae4ff0058acdba035528646a2eb9e","target":"record","created_at":"2026-05-18T00:43: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":"4fd76a77b8ae26909b025732680bc3598901424350b29cd4e6ccab8433e2e59a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-04T23:20:13Z","title_canon_sha256":"5bed644feb30f0263a4faedd8034ca0ecb295ac20886c171171e64becbeb2c69"},"schema_version":"1.0","source":{"id":"1706.01158","kind":"arxiv","version":1}},"canonical_sha256":"cac14a60b3181bb2db721fb92acc3e4f5ac9e39e1f2539652b834cdecac008c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cac14a60b3181bb2db721fb92acc3e4f5ac9e39e1f2539652b834cdecac008c3","first_computed_at":"2026-05-18T00:43:04.308488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:04.308488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1HOSGGMAlaSdzWu53ZWVK+6ZatUdxupPRY645LY5RsLxzBcU1MOh6kzvZjz9w/ElrEtMbfEKCHobodgZrHpVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:04.309167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea6b37cf81d09117a9557957e08c814f1adae4ff0058acdba035528646a2eb9e","sha256:0b06a0553c9532a90c3a367fd56b1d2a2d4930e69a1df07e93d9dee471383a55"],"state_sha256":"a561174402a71aa268ba249589a1a27f272fbf171cb09d3a8ea876d2bc2b2481"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXGSBWQqYApIYr7giIN1pYLLHF0X1o4r8dPI8MTnzES5ojMT91MI/INpmxZ/+Adgz6xMR/05uCwdNG7OCaZBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:47:20.058854Z","bundle_sha256":"47994280cade7c99fb384672f8a9e61b95aa26e5edbe9533d91a80f2e3fef6f6"}}