{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WZX243KQC2LWXEVNMFGCTBLLBH","short_pith_number":"pith:WZX243KQ","canonical_record":{"source":{"id":"1203.3896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-17T21:58:02Z","cross_cats_sorted":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"11f16bced40684f20c8e5309033e8cb3a2c28ccdeb0a9aa9fcabbfc9f81a12e6","abstract_canon_sha256":"27b4945d7309db5056594f25de35065cda0153d6515242d56c8f3b5716b8cfdc"},"schema_version":"1.0"},"canonical_sha256":"b66fae6d5016976b92ad614c29856b09e68cab822587968e118bce9137109764","source":{"kind":"arxiv","id":"1203.3896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3896","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3896v2","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3896","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"WZX243KQC2LW","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WZX243KQC2LWXEVN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WZX243KQ","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WZX243KQC2LWXEVNMFGCTBLLBH","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-17T21:58:02Z","cross_cats_sorted":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"11f16bced40684f20c8e5309033e8cb3a2c28ccdeb0a9aa9fcabbfc9f81a12e6","abstract_canon_sha256":"27b4945d7309db5056594f25de35065cda0153d6515242d56c8f3b5716b8cfdc"},"schema_version":"1.0"},"canonical_sha256":"b66fae6d5016976b92ad614c29856b09e68cab822587968e118bce9137109764","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:14.187608Z","signature_b64":"tfedzwwBc6yv8jD5/rxjiHaFhMQsCOyfptruYbV58fFtviqXemGP7iERqQ7HNdU4scEr3i2AGeYwUvYWLImKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66fae6d5016976b92ad614c29856b09e68cab822587968e118bce9137109764","last_reissued_at":"2026-05-18T00:54:14.187116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:14.187116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3896","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-18T00:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRHNe/9y3j3C98hs9o/1IU131/AlzrhDpowb27PCiQH0n6T+rhHjy2zn4vfbSTCRLcrGQcBw0H/ohIQvwa1tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:08:29.537358Z"},"content_sha256":"d7b253c0d269ceedaa75bfb0ba6237e3357528141acbb661682d7ea03008eeb8","schema_version":"1.0","event_id":"sha256:d7b253c0d269ceedaa75bfb0ba6237e3357528141acbb661682d7ea03008eeb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WZX243KQC2LWXEVNMFGCTBLLBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Adaptive Sparse Precision Matrix Estimation in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Weidong Liu, Xi Luo","submitted_at":"2012-03-17T21:58:02Z","abstract_excerpt":"This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse Column-wise Inverse Operator, to address these two issues. We analyze an adaptive procedure based on cross validation, and establish its convergence rate under the Frobenius norm. The convergence rates under other matrix norms are also established. This method also enjoys the advantage of fast computation for large-scale problems, via a coordinate descent algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3896","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-18T00:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K43GUWCFC7jyZR9Sth+Kw1mkJcDdqzbdv0oDDwuTyaUUgna1UZtSnvNufMyseF/mU+WdqjXgWiZHrxpW5zRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:08:29.537924Z"},"content_sha256":"6e800ae3f71ab9fbaf6b8ff8581899ff4b9fee9f0bfa6ac3d7329bbd394d54b6","schema_version":"1.0","event_id":"sha256:6e800ae3f71ab9fbaf6b8ff8581899ff4b9fee9f0bfa6ac3d7329bbd394d54b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZX243KQC2LWXEVNMFGCTBLLBH/bundle.json","state_url":"https://pith.science/pith/WZX243KQC2LWXEVNMFGCTBLLBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZX243KQC2LWXEVNMFGCTBLLBH/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-19T02:08:29Z","links":{"resolver":"https://pith.science/pith/WZX243KQC2LWXEVNMFGCTBLLBH","bundle":"https://pith.science/pith/WZX243KQC2LWXEVNMFGCTBLLBH/bundle.json","state":"https://pith.science/pith/WZX243KQC2LWXEVNMFGCTBLLBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZX243KQC2LWXEVNMFGCTBLLBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WZX243KQC2LWXEVNMFGCTBLLBH","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":"27b4945d7309db5056594f25de35065cda0153d6515242d56c8f3b5716b8cfdc","cross_cats_sorted":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-17T21:58:02Z","title_canon_sha256":"11f16bced40684f20c8e5309033e8cb3a2c28ccdeb0a9aa9fcabbfc9f81a12e6"},"schema_version":"1.0","source":{"id":"1203.3896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3896","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3896v2","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3896","created_at":"2026-05-18T00:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"WZX243KQC2LW","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WZX243KQC2LWXEVN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WZX243KQ","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:6e800ae3f71ab9fbaf6b8ff8581899ff4b9fee9f0bfa6ac3d7329bbd394d54b6","target":"graph","created_at":"2026-05-18T00:54:14Z","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":"This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse Column-wise Inverse Operator, to address these two issues. We analyze an adaptive procedure based on cross validation, and establish its convergence rate under the Frobenius norm. The convergence rates under other matrix norms are also established. This method also enjoys the advantage of fast computation for large-scale problems, via a coordinate descent algo","authors_text":"Weidong Liu, Xi Luo","cross_cats":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-17T21:58:02Z","title":"Fast and Adaptive Sparse Precision Matrix Estimation in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3896","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:d7b253c0d269ceedaa75bfb0ba6237e3357528141acbb661682d7ea03008eeb8","target":"record","created_at":"2026-05-18T00:54:14Z","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":"27b4945d7309db5056594f25de35065cda0153d6515242d56c8f3b5716b8cfdc","cross_cats_sorted":["math.ST","stat.AP","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-17T21:58:02Z","title_canon_sha256":"11f16bced40684f20c8e5309033e8cb3a2c28ccdeb0a9aa9fcabbfc9f81a12e6"},"schema_version":"1.0","source":{"id":"1203.3896","kind":"arxiv","version":2}},"canonical_sha256":"b66fae6d5016976b92ad614c29856b09e68cab822587968e118bce9137109764","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b66fae6d5016976b92ad614c29856b09e68cab822587968e118bce9137109764","first_computed_at":"2026-05-18T00:54:14.187116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:14.187116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tfedzwwBc6yv8jD5/rxjiHaFhMQsCOyfptruYbV58fFtviqXemGP7iERqQ7HNdU4scEr3i2AGeYwUvYWLImKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:14.187608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7b253c0d269ceedaa75bfb0ba6237e3357528141acbb661682d7ea03008eeb8","sha256:6e800ae3f71ab9fbaf6b8ff8581899ff4b9fee9f0bfa6ac3d7329bbd394d54b6"],"state_sha256":"65e5099df97920dd03b9aeca756db1ce7eb8c018fe543d373481add374926de9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9OILh2flkgcr7/9f2/x9jQVD3PgnC7O0sKBxHe//7IZFAFR5j1TeiKnb/q3cLh/u3zfqHBkM/qCaaCFo5izCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T02:08:29.539773Z","bundle_sha256":"1dcdc552583c8854cd08e2db996306fec1ed26155b1613662d6c5866f45a1dc1"}}