{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:R72SWOGGRXLJCNV646TKYCGSPD","short_pith_number":"pith:R72SWOGG","schema_version":"1.0","canonical_sha256":"8ff52b38c68dd69136bee7a6ac08d278f652f76042d61f03e7fc9e9a4a05269d","source":{"kind":"arxiv","id":"1111.5479","version":2},"attestation_state":"computed","paper":{"title":"The Graphical Lasso: New Insights and Alternatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Rahul Mazumder, Trevor Hastie","submitted_at":"2011-11-23T12:47:50Z","abstract_excerpt":"The graphical lasso \\citep{FHT2007a} is an algorithm for learning the structure in an undirected Gaussian graphical model, using $\\ell_1$ regularization to control the number of zeros in the precision matrix ${\\B\\Theta}={\\B\\Sigma}^{-1}$ \\citep{BGA2008,yuan_lin_07}. The {\\texttt R} package \\GL\\ \\citep{FHT2007a} is popular, fast, and allows one to efficiently build a path of models for different values of the tuning parameter. Convergence of \\GL\\ can be tricky; the converged precision matrix might not be the inverse of the estimated covariance, and occasionally it fails to converge with warm sta"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1111.5479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-23T12:47:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c8f3fa562d9a3e367b4360df378c7135a787a4131889af4006f7099f4b5aa62d","abstract_canon_sha256":"4989ba228494f67cceb1f497261f776403ec5319c0b63b08ad1dfcfab34a237e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:11.866807Z","signature_b64":"hq4hKjq/PZOsc8ghIQNcad8oIrO1zptVq+230VVx1TliwWolEcX2anzizOvbtxzqJg37vPKEVEbIsrFUGwtqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff52b38c68dd69136bee7a6ac08d278f652f76042d61f03e7fc9e9a4a05269d","last_reissued_at":"2026-05-18T03:49:11.866003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:11.866003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Graphical Lasso: New Insights and Alternatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Rahul Mazumder, Trevor Hastie","submitted_at":"2011-11-23T12:47:50Z","abstract_excerpt":"The graphical lasso \\citep{FHT2007a} is an algorithm for learning the structure in an undirected Gaussian graphical model, using $\\ell_1$ regularization to control the number of zeros in the precision matrix ${\\B\\Theta}={\\B\\Sigma}^{-1}$ \\citep{BGA2008,yuan_lin_07}. The {\\texttt R} package \\GL\\ \\citep{FHT2007a} is popular, fast, and allows one to efficiently build a path of models for different values of the tuning parameter. Convergence of \\GL\\ can be tricky; the converged precision matrix might not be the inverse of the estimated covariance, and occasionally it fails to converge with warm sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5479","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.5479","created_at":"2026-05-18T03:49:11.866136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5479v2","created_at":"2026-05-18T03:49:11.866136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5479","created_at":"2026-05-18T03:49:11.866136+00:00"},{"alias_kind":"pith_short_12","alias_value":"R72SWOGGRXLJ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"R72SWOGGRXLJCNV6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"R72SWOGG","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.22370","citing_title":"Operator Splitting with Hamilton-Jacobi-based Proximals","ref_index":2012,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD","json":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD.json","graph_json":"https://pith.science/api/pith-number/R72SWOGGRXLJCNV646TKYCGSPD/graph.json","events_json":"https://pith.science/api/pith-number/R72SWOGGRXLJCNV646TKYCGSPD/events.json","paper":"https://pith.science/paper/R72SWOGG"},"agent_actions":{"view_html":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD","download_json":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD.json","view_paper":"https://pith.science/paper/R72SWOGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5479&json=true","fetch_graph":"https://pith.science/api/pith-number/R72SWOGGRXLJCNV646TKYCGSPD/graph.json","fetch_events":"https://pith.science/api/pith-number/R72SWOGGRXLJCNV646TKYCGSPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD/action/storage_attestation","attest_author":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD/action/author_attestation","sign_citation":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD/action/citation_signature","submit_replication":"https://pith.science/pith/R72SWOGGRXLJCNV646TKYCGSPD/action/replication_record"}},"created_at":"2026-05-18T03:49:11.866136+00:00","updated_at":"2026-05-18T03:49:11.866136+00:00"}