{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZD2IZY5YMUUUTD3IXLD6IV5WCR","short_pith_number":"pith:ZD2IZY5Y","schema_version":"1.0","canonical_sha256":"c8f48ce3b86529498f68bac7e457b6144b25c3b89e7d62a9f50c7b505b147e57","source":{"kind":"arxiv","id":"1211.2532","version":3},"attestation_state":"computed","paper":{"title":"Iterative Thresholding Algorithm for Sparse Inverse Covariance Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Arian Maleki, Bala Rajaratnam, Benjamin T. Rolfs, Dominique Guillot, Ian Wong","submitted_at":"2012-11-12T08:35:26Z","abstract_excerpt":"The L1-regularized maximum likelihood estimation problem has recently become a topic of great interest within the machine learning, statistics, and optimization communities as a method for producing sparse inverse covariance estimators. In this paper, a proximal gradient method (G-ISTA) for performing L1-regularized covariance matrix estimation is presented. Although numerous algorithms have been proposed for solving this problem, this simple proximal gradient method is found to have attractive theoretical and numerical properties. G-ISTA has a linear rate of convergence, resulting in an O(log"},"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":"1211.2532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-11-12T08:35:26Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2702e30cc1e325fa537080191a1c1832e31eaf084cf5100e1da175889770bfb3","abstract_canon_sha256":"feb11b02a1f1ef8b6954c79889c123acde1ea2ef29db53070472e29d6aa97ce9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:52.605537Z","signature_b64":"Womnk4yNyzXvW8huhkgFjLnVXCWiZ3MbaWO8zfomfEH0L9yu8J5TQi8xtmBiLvMucWNnM3OwF7GJmn0QtBs3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8f48ce3b86529498f68bac7e457b6144b25c3b89e7d62a9f50c7b505b147e57","last_reissued_at":"2026-05-18T03:39:52.605092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:52.605092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Thresholding Algorithm for Sparse Inverse Covariance Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Arian Maleki, Bala Rajaratnam, Benjamin T. Rolfs, Dominique Guillot, Ian Wong","submitted_at":"2012-11-12T08:35:26Z","abstract_excerpt":"The L1-regularized maximum likelihood estimation problem has recently become a topic of great interest within the machine learning, statistics, and optimization communities as a method for producing sparse inverse covariance estimators. In this paper, a proximal gradient method (G-ISTA) for performing L1-regularized covariance matrix estimation is presented. Although numerous algorithms have been proposed for solving this problem, this simple proximal gradient method is found to have attractive theoretical and numerical properties. G-ISTA has a linear rate of convergence, resulting in an O(log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2532","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.2532","created_at":"2026-05-18T03:39:52.605159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2532v3","created_at":"2026-05-18T03:39:52.605159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2532","created_at":"2026-05-18T03:39:52.605159+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZD2IZY5YMUUU","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZD2IZY5YMUUUTD3I","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZD2IZY5Y","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR","json":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR.json","graph_json":"https://pith.science/api/pith-number/ZD2IZY5YMUUUTD3IXLD6IV5WCR/graph.json","events_json":"https://pith.science/api/pith-number/ZD2IZY5YMUUUTD3IXLD6IV5WCR/events.json","paper":"https://pith.science/paper/ZD2IZY5Y"},"agent_actions":{"view_html":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR","download_json":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR.json","view_paper":"https://pith.science/paper/ZD2IZY5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2532&json=true","fetch_graph":"https://pith.science/api/pith-number/ZD2IZY5YMUUUTD3IXLD6IV5WCR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZD2IZY5YMUUUTD3IXLD6IV5WCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR/action/storage_attestation","attest_author":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR/action/author_attestation","sign_citation":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR/action/citation_signature","submit_replication":"https://pith.science/pith/ZD2IZY5YMUUUTD3IXLD6IV5WCR/action/replication_record"}},"created_at":"2026-05-18T03:39:52.605159+00:00","updated_at":"2026-05-18T03:39:52.605159+00:00"}