{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HCUPG67SSOU3KZV7Z6UA6UN2PS","short_pith_number":"pith:HCUPG67S","canonical_record":{"source":{"id":"1309.6024","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-24T01:58:23Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"0e64398e902d09480378b927aed5905514779a06b9da5a00cb0e7c1371a95c93","abstract_canon_sha256":"dbf3822be136d797018c96a6c50db5b8c4220457663f66bacdb6bf444ce61f01"},"schema_version":"1.0"},"canonical_sha256":"38a8f37bf293a9b566bfcfa80f51ba7c9d0f15a85e150477ed0565299495b164","source":{"kind":"arxiv","id":"1309.6024","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6024","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6024v3","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6024","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"HCUPG67SSOU3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HCUPG67SSOU3KZV7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HCUPG67S","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HCUPG67SSOU3KZV7Z6UA6UN2PS","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6024","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-24T01:58:23Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"0e64398e902d09480378b927aed5905514779a06b9da5a00cb0e7c1371a95c93","abstract_canon_sha256":"dbf3822be136d797018c96a6c50db5b8c4220457663f66bacdb6bf444ce61f01"},"schema_version":"1.0"},"canonical_sha256":"38a8f37bf293a9b566bfcfa80f51ba7c9d0f15a85e150477ed0565299495b164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:27.414079Z","signature_b64":"Bv0heVrL4fat8eqpHtaiEYUzutTSdsPhKKRWlhREXUI2YCe+9wCLHSy3pxo3hOV6tCt7btU5shHDYaJc09IEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38a8f37bf293a9b566bfcfa80f51ba7c9d0f15a85e150477ed0565299495b164","last_reissued_at":"2026-05-18T01:58:27.413369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:27.413369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6024","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-18T01:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xvz2dY+gLYbfyoxU9svY/jvIB2xpLqqCdpVC25Yii0v9bfWAHcqqEempNnzWay5ufVfnyAghRPxRGer4t0iOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:30.566790Z"},"content_sha256":"d3a91cf780a026caeb1828a7a6a305ee001dc7ec8ec45525395970c8889a11d2","schema_version":"1.0","event_id":"sha256:d3a91cf780a026caeb1828a7a6a305ee001dc7ec8ec45525395970c8889a11d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HCUPG67SSOU3KZV7Z6UA6UN2PS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic normality and optimalities in estimation of large Gaussian graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Cun-Hui Zhang, Harrison H. Zhou, Tingni Sun, Zhao Ren","submitted_at":"2013-09-24T01:58:23Z","abstract_excerpt":"The Gaussian graphical model, a popular paradigm for studying relationship among variables in a wide range of applications, has attracted great attention in recent years. This paper considers a fundamental question: When is it possible to estimate low-dimensional parameters at parametric square-root rate in a large Gaussian graphical model? A novel regression approach is proposed to obtain asymptotically efficient estimation of each entry of a precision matrix under a sparseness condition relative to the sample size. When the precision matrix is not sufficiently sparse, or equivalently the sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6024","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-18T01:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wK0Zb2o5Ng7/D0LQuBIYIGllvxQC7Vij3hVHp1j9h2/lMBDUVwIPyViZACi03mHhfPbNBR3+Ehffvp2gVqyuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:30.567482Z"},"content_sha256":"6ec6092c303c1281ddee0617d6e31e880b0dcad4d854c62f77918041010fe068","schema_version":"1.0","event_id":"sha256:6ec6092c303c1281ddee0617d6e31e880b0dcad4d854c62f77918041010fe068"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/bundle.json","state_url":"https://pith.science/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/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-27T22:40:30Z","links":{"resolver":"https://pith.science/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS","bundle":"https://pith.science/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/bundle.json","state":"https://pith.science/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCUPG67SSOU3KZV7Z6UA6UN2PS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HCUPG67SSOU3KZV7Z6UA6UN2PS","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":"dbf3822be136d797018c96a6c50db5b8c4220457663f66bacdb6bf444ce61f01","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-24T01:58:23Z","title_canon_sha256":"0e64398e902d09480378b927aed5905514779a06b9da5a00cb0e7c1371a95c93"},"schema_version":"1.0","source":{"id":"1309.6024","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6024","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6024v3","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6024","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"HCUPG67SSOU3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HCUPG67SSOU3KZV7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HCUPG67S","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:6ec6092c303c1281ddee0617d6e31e880b0dcad4d854c62f77918041010fe068","target":"graph","created_at":"2026-05-18T01:58:27Z","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 Gaussian graphical model, a popular paradigm for studying relationship among variables in a wide range of applications, has attracted great attention in recent years. This paper considers a fundamental question: When is it possible to estimate low-dimensional parameters at parametric square-root rate in a large Gaussian graphical model? A novel regression approach is proposed to obtain asymptotically efficient estimation of each entry of a precision matrix under a sparseness condition relative to the sample size. When the precision matrix is not sufficiently sparse, or equivalently the sam","authors_text":"Cun-Hui Zhang, Harrison H. Zhou, Tingni Sun, Zhao Ren","cross_cats":["stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-24T01:58:23Z","title":"Asymptotic normality and optimalities in estimation of large Gaussian graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6024","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:d3a91cf780a026caeb1828a7a6a305ee001dc7ec8ec45525395970c8889a11d2","target":"record","created_at":"2026-05-18T01:58:27Z","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":"dbf3822be136d797018c96a6c50db5b8c4220457663f66bacdb6bf444ce61f01","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-24T01:58:23Z","title_canon_sha256":"0e64398e902d09480378b927aed5905514779a06b9da5a00cb0e7c1371a95c93"},"schema_version":"1.0","source":{"id":"1309.6024","kind":"arxiv","version":3}},"canonical_sha256":"38a8f37bf293a9b566bfcfa80f51ba7c9d0f15a85e150477ed0565299495b164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38a8f37bf293a9b566bfcfa80f51ba7c9d0f15a85e150477ed0565299495b164","first_computed_at":"2026-05-18T01:58:27.413369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:27.413369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bv0heVrL4fat8eqpHtaiEYUzutTSdsPhKKRWlhREXUI2YCe+9wCLHSy3pxo3hOV6tCt7btU5shHDYaJc09IEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:27.414079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6024","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3a91cf780a026caeb1828a7a6a305ee001dc7ec8ec45525395970c8889a11d2","sha256:6ec6092c303c1281ddee0617d6e31e880b0dcad4d854c62f77918041010fe068"],"state_sha256":"4cf6889751ce651f1649c48caa9201b20bea27dd0c4e931f1cadc10f8d19865b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CL63vy6A6quf179hY1OZsXAWJvuSfivO+8Q/D+dv3X9q+eiyUXPEMGGUP1X/2OktTOcwcLeTZqq1+P6+KgCqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:40:30.571055Z","bundle_sha256":"5ce9f2ede705217db7c3e7018d9c2533fc140b15235d07aa61c202cfd65fa098"}}