{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UWLAV6JREERFR74QBD3W7YAPTO","short_pith_number":"pith:UWLAV6JR","canonical_record":{"source":{"id":"1106.5175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-06-25T21:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"ee996c67612a29e0a174bec215d5c0fe6b83c84ef408008c4815a950e7c3e72e","abstract_canon_sha256":"e385dfc7a042cc6065f31321f69b1b4c1e01f295ef2798760e3a965c084eaf57"},"schema_version":"1.0"},"canonical_sha256":"a5960af931212258ff9008f76fe00f9b8ca9068bbae769e85097e2066cb4111b","source":{"kind":"arxiv","id":"1106.5175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5175","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5175v1","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5175","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"UWLAV6JREERF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UWLAV6JREERFR74Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UWLAV6JR","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UWLAV6JREERFR74QBD3W7YAPTO","target":"record","payload":{"canonical_record":{"source":{"id":"1106.5175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-06-25T21:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"ee996c67612a29e0a174bec215d5c0fe6b83c84ef408008c4815a950e7c3e72e","abstract_canon_sha256":"e385dfc7a042cc6065f31321f69b1b4c1e01f295ef2798760e3a965c084eaf57"},"schema_version":"1.0"},"canonical_sha256":"a5960af931212258ff9008f76fe00f9b8ca9068bbae769e85097e2066cb4111b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:14.136915Z","signature_b64":"kMAwSUhYHeeghV9y+uAkyajV4HYUI8OY/2IOnjLOzvKxTMnTc+Auykxg7GlNiLUldW5T0k6nGaUb+0NaY3kWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5960af931212258ff9008f76fe00f9b8ca9068bbae769e85097e2066cb4111b","last_reissued_at":"2026-05-18T04:19:14.136462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:14.136462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.5175","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-18T04:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXubGB3bra8XgUm1K2mDY1/2zzNQLsyOjojfAiR17gKt/Fg+unl5aXq1gVKQbymBwm/7t3JmR+DDXxXjVct4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:37:12.558021Z"},"content_sha256":"f9ee9f8a0ad65dd398a90ab2546fb858746f56b35618047328a6c03335970ea8","schema_version":"1.0","event_id":"sha256:f9ee9f8a0ad65dd398a90ab2546fb858746f56b35618047328a6c03335970ea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UWLAV6JREERFR74QBD3W7YAPTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Inverse Covariance Estimation via an Adaptive Gradient-Based Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Dongmin Kim, Suvrit Sra","submitted_at":"2011-06-25T21:38:55Z","abstract_excerpt":"We study the problem of estimating from data, a sparse approximation to the inverse covariance matrix. Estimating a sparsity constrained inverse covariance matrix is a key component in Gaussian graphical model learning, but one that is numerically very challenging. We address this challenge by developing a new adaptive gradient-based method that carefully combines gradient information with an adaptive step-scaling strategy, which results in a scalable, highly competitive method. Our algorithm, like its predecessors, maximizes an $\\ell_1$-norm penalized log-likelihood and has the same per itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5175","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-18T04:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sanAzrEbCdkeakbS1/WD9yLDqusEdez2agIYFVv1LelcKbWhuxnnikpyVaQUYkEEtXPuMq7Sr1+SFiS9CJlxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:37:12.558664Z"},"content_sha256":"5ff556a7ce57acc207508890dd9719b414843374c034edc5e7ea27e6f293f00e","schema_version":"1.0","event_id":"sha256:5ff556a7ce57acc207508890dd9719b414843374c034edc5e7ea27e6f293f00e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWLAV6JREERFR74QBD3W7YAPTO/bundle.json","state_url":"https://pith.science/pith/UWLAV6JREERFR74QBD3W7YAPTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWLAV6JREERFR74QBD3W7YAPTO/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-06-06T12:37:12Z","links":{"resolver":"https://pith.science/pith/UWLAV6JREERFR74QBD3W7YAPTO","bundle":"https://pith.science/pith/UWLAV6JREERFR74QBD3W7YAPTO/bundle.json","state":"https://pith.science/pith/UWLAV6JREERFR74QBD3W7YAPTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWLAV6JREERFR74QBD3W7YAPTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UWLAV6JREERFR74QBD3W7YAPTO","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":"e385dfc7a042cc6065f31321f69b1b4c1e01f295ef2798760e3a965c084eaf57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-06-25T21:38:55Z","title_canon_sha256":"ee996c67612a29e0a174bec215d5c0fe6b83c84ef408008c4815a950e7c3e72e"},"schema_version":"1.0","source":{"id":"1106.5175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5175","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5175v1","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5175","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"UWLAV6JREERF","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UWLAV6JREERFR74Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UWLAV6JR","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:5ff556a7ce57acc207508890dd9719b414843374c034edc5e7ea27e6f293f00e","target":"graph","created_at":"2026-05-18T04:19: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":"We study the problem of estimating from data, a sparse approximation to the inverse covariance matrix. Estimating a sparsity constrained inverse covariance matrix is a key component in Gaussian graphical model learning, but one that is numerically very challenging. We address this challenge by developing a new adaptive gradient-based method that carefully combines gradient information with an adaptive step-scaling strategy, which results in a scalable, highly competitive method. Our algorithm, like its predecessors, maximizes an $\\ell_1$-norm penalized log-likelihood and has the same per itera","authors_text":"Dongmin Kim, Suvrit Sra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-06-25T21:38:55Z","title":"Sparse Inverse Covariance Estimation via an Adaptive Gradient-Based Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5175","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:f9ee9f8a0ad65dd398a90ab2546fb858746f56b35618047328a6c03335970ea8","target":"record","created_at":"2026-05-18T04:19: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":"e385dfc7a042cc6065f31321f69b1b4c1e01f295ef2798760e3a965c084eaf57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-06-25T21:38:55Z","title_canon_sha256":"ee996c67612a29e0a174bec215d5c0fe6b83c84ef408008c4815a950e7c3e72e"},"schema_version":"1.0","source":{"id":"1106.5175","kind":"arxiv","version":1}},"canonical_sha256":"a5960af931212258ff9008f76fe00f9b8ca9068bbae769e85097e2066cb4111b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5960af931212258ff9008f76fe00f9b8ca9068bbae769e85097e2066cb4111b","first_computed_at":"2026-05-18T04:19:14.136462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:14.136462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMAwSUhYHeeghV9y+uAkyajV4HYUI8OY/2IOnjLOzvKxTMnTc+Auykxg7GlNiLUldW5T0k6nGaUb+0NaY3kWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:14.136915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9ee9f8a0ad65dd398a90ab2546fb858746f56b35618047328a6c03335970ea8","sha256:5ff556a7ce57acc207508890dd9719b414843374c034edc5e7ea27e6f293f00e"],"state_sha256":"73c472d1296c744964411c0a66064387f7dd7e7a35c6d2e1b07a390a38a520e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qq7ePntmZ1fDyxXDfqVOsmJiVpCpHmdptyWsXil5TM8igZcfOvGrBPg+7+PFCrzc4uoH6dxSDTeLxqZ++JGnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:37:12.562061Z","bundle_sha256":"21af8db4947f6a0bdc6be5b10efd8aec4b6ecb6063b533341bf607cbf0b0f1d3"}}