{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MDHKEVYITWRR4XYY5IXHWKSCDA","short_pith_number":"pith:MDHKEVYI","canonical_record":{"source":{"id":"1009.0530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-02T20:06:40Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"2f4e8214580fb7d66f38194d79835e1ca5ebb12357223cb38269f6e7e9adcda4","abstract_canon_sha256":"6ad0a94ac9283a5eb68ecc3482e5489dbb83d8ffdde278bbe71170656f70213f"},"schema_version":"1.0"},"canonical_sha256":"60cea257089da31e5f18ea2e7b2a4218329811a05ec148577ff2e959e141e9e0","source":{"kind":"arxiv","id":"1009.0530","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0530","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0530v2","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0530","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"MDHKEVYITWRR","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MDHKEVYITWRR4XYY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MDHKEVYI","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MDHKEVYITWRR4XYY5IXHWKSCDA","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-02T20:06:40Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"2f4e8214580fb7d66f38194d79835e1ca5ebb12357223cb38269f6e7e9adcda4","abstract_canon_sha256":"6ad0a94ac9283a5eb68ecc3482e5489dbb83d8ffdde278bbe71170656f70213f"},"schema_version":"1.0"},"canonical_sha256":"60cea257089da31e5f18ea2e7b2a4218329811a05ec148577ff2e959e141e9e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:55.004086Z","signature_b64":"9OEtOJLmGN7kOIwKEycZwYWl8lGXxpqjnXXviSZS4GhVZKfV+mTl1QqyihRAcUU8ZCEWiKgwwADMTgNak4TIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cea257089da31e5f18ea2e7b2a4218329811a05ec148577ff2e959e141e9e0","last_reissued_at":"2026-05-18T04:04:55.003626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:55.003626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0530","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-18T04:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQQ8R9GinmVROyq23tSQfMpwDhMZxF/j7TAwQN/07ofIFbrXWONPQLJxWrODTDGZhcnWn71AwmfUaNwGjFPVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:57.191163Z"},"content_sha256":"21dd7f1add98302eec9e9da7ae009bc9362af3cf5e50e52597095923f2134d09","schema_version":"1.0","event_id":"sha256:21dd7f1add98302eec9e9da7ae009bc9362af3cf5e50e52597095923f2134d09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MDHKEVYITWRR4XYY5IXHWKSCDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional covariance estimation based on 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":"Min Xu, Peter Buhlmann, Philipp Rutimann, Shuheng Zhou","submitted_at":"2010-09-02T20:06:40Z","abstract_excerpt":"Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using $\\ell_1$-penalization methods. We propose and study the following method. We combine a multiple regression approach with ideas of thresholding and refitting: first we infer a sparse undirected graphical model structure via thresholding of each among many $\\ell_1$-norm penalized regression functions; we then estimate the covariance matrix and its inverse using the maximum likelihood estimator. We show that under suitable conditions, this approach yields consis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0530","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-18T04:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOm3cbBZ9SfuThFNrvKHckrlHWV9wgU/k1k6J5uvPm8E3m+q5Ux7xKENAeL2FwMnbehjzOayLgYyDiwFfjT4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:57.191822Z"},"content_sha256":"a02aa7ee9ce24abd01be52248e735de5814b800f9f22f885b5d057c8929e3be8","schema_version":"1.0","event_id":"sha256:a02aa7ee9ce24abd01be52248e735de5814b800f9f22f885b5d057c8929e3be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/bundle.json","state_url":"https://pith.science/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/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-25T11:58:57Z","links":{"resolver":"https://pith.science/pith/MDHKEVYITWRR4XYY5IXHWKSCDA","bundle":"https://pith.science/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/bundle.json","state":"https://pith.science/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDHKEVYITWRR4XYY5IXHWKSCDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MDHKEVYITWRR4XYY5IXHWKSCDA","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":"6ad0a94ac9283a5eb68ecc3482e5489dbb83d8ffdde278bbe71170656f70213f","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-02T20:06:40Z","title_canon_sha256":"2f4e8214580fb7d66f38194d79835e1ca5ebb12357223cb38269f6e7e9adcda4"},"schema_version":"1.0","source":{"id":"1009.0530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0530","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0530v2","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0530","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"MDHKEVYITWRR","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MDHKEVYITWRR4XYY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MDHKEVYI","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a02aa7ee9ce24abd01be52248e735de5814b800f9f22f885b5d057c8929e3be8","target":"graph","created_at":"2026-05-18T04:04:55Z","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":"Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using $\\ell_1$-penalization methods. We propose and study the following method. We combine a multiple regression approach with ideas of thresholding and refitting: first we infer a sparse undirected graphical model structure via thresholding of each among many $\\ell_1$-norm penalized regression functions; we then estimate the covariance matrix and its inverse using the maximum likelihood estimator. We show that under suitable conditions, this approach yields consis","authors_text":"Min Xu, Peter Buhlmann, Philipp Rutimann, Shuheng Zhou","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-02T20:06:40Z","title":"High-dimensional covariance estimation based on Gaussian graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0530","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:21dd7f1add98302eec9e9da7ae009bc9362af3cf5e50e52597095923f2134d09","target":"record","created_at":"2026-05-18T04:04:55Z","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":"6ad0a94ac9283a5eb68ecc3482e5489dbb83d8ffdde278bbe71170656f70213f","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-02T20:06:40Z","title_canon_sha256":"2f4e8214580fb7d66f38194d79835e1ca5ebb12357223cb38269f6e7e9adcda4"},"schema_version":"1.0","source":{"id":"1009.0530","kind":"arxiv","version":2}},"canonical_sha256":"60cea257089da31e5f18ea2e7b2a4218329811a05ec148577ff2e959e141e9e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60cea257089da31e5f18ea2e7b2a4218329811a05ec148577ff2e959e141e9e0","first_computed_at":"2026-05-18T04:04:55.003626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:55.003626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9OEtOJLmGN7kOIwKEycZwYWl8lGXxpqjnXXviSZS4GhVZKfV+mTl1QqyihRAcUU8ZCEWiKgwwADMTgNak4TIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:55.004086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21dd7f1add98302eec9e9da7ae009bc9362af3cf5e50e52597095923f2134d09","sha256:a02aa7ee9ce24abd01be52248e735de5814b800f9f22f885b5d057c8929e3be8"],"state_sha256":"9c90b7e504720e70866f0ac2aae5d7ef6a3d2e259f2494b2dae84583843eec08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjwN5pw+davkCzMVk1Kbt2KQTCf2BesWOugi3/354/n9tStEnQJOMKZVWbTooqjDTK88tLzJheiDxvEMpWa7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:58:57.195212Z","bundle_sha256":"b320ffab392f6831c2377aefdfdb06f5baeb4db220a5d1de688a97890631de81"}}