{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:USBPRYZC3EA35YROIOGLH554SZ","short_pith_number":"pith:USBPRYZC","schema_version":"1.0","canonical_sha256":"a482f8e322d901bee22e438cb3f7bc9677a88daa4805433b1c8bb77cc41e4490","source":{"kind":"arxiv","id":"0908.0143","version":2},"attestation_state":"computed","paper":{"title":"A Pathwise Algorithm for Covariance Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Vijay Krishnamurthy","submitted_at":"2009-08-02T17:29:28Z","abstract_excerpt":"Covariance selection seeks to estimate a covariance matrix by maximum likelihood while restricting the number of nonzero inverse covariance matrix coefficients. A single penalty parameter usually controls the tradeoff between log likelihood and sparsity in the inverse matrix. We describe an efficient algorithm for computing a full regularization path of solutions to this problem."},"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":"0908.0143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-02T17:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"ada0b715fb67f08edeaa3e77f780549ae60783864c5a7893d95d1cc01bc8ea6a","abstract_canon_sha256":"502121d52260a8b39fc43c9de82ccd17266e74edcd15e16380296e1d830fbe51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:39.139673Z","signature_b64":"ZNeoBPDQ+AfZGRohpsOLV+tKJAg0e4RdyRmxIHIg2hG00xwAdT8Ef9mWmE/ly7mwVjpJTdakOiuTFk5IJ+pEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a482f8e322d901bee22e438cb3f7bc9677a88daa4805433b1c8bb77cc41e4490","last_reissued_at":"2026-05-18T04:39:39.139195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:39.139195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Pathwise Algorithm for Covariance Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Vijay Krishnamurthy","submitted_at":"2009-08-02T17:29:28Z","abstract_excerpt":"Covariance selection seeks to estimate a covariance matrix by maximum likelihood while restricting the number of nonzero inverse covariance matrix coefficients. A single penalty parameter usually controls the tradeoff between log likelihood and sparsity in the inverse matrix. We describe an efficient algorithm for computing a full regularization path of solutions to this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0143","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":"0908.0143","created_at":"2026-05-18T04:39:39.139257+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.0143v2","created_at":"2026-05-18T04:39:39.139257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0143","created_at":"2026-05-18T04:39:39.139257+00:00"},{"alias_kind":"pith_short_12","alias_value":"USBPRYZC3EA3","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"USBPRYZC3EA35YRO","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"USBPRYZC","created_at":"2026-05-18T12:26:02.257875+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/USBPRYZC3EA35YROIOGLH554SZ","json":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ.json","graph_json":"https://pith.science/api/pith-number/USBPRYZC3EA35YROIOGLH554SZ/graph.json","events_json":"https://pith.science/api/pith-number/USBPRYZC3EA35YROIOGLH554SZ/events.json","paper":"https://pith.science/paper/USBPRYZC"},"agent_actions":{"view_html":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ","download_json":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ.json","view_paper":"https://pith.science/paper/USBPRYZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.0143&json=true","fetch_graph":"https://pith.science/api/pith-number/USBPRYZC3EA35YROIOGLH554SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/USBPRYZC3EA35YROIOGLH554SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ/action/storage_attestation","attest_author":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ/action/author_attestation","sign_citation":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ/action/citation_signature","submit_replication":"https://pith.science/pith/USBPRYZC3EA35YROIOGLH554SZ/action/replication_record"}},"created_at":"2026-05-18T04:39:39.139257+00:00","updated_at":"2026-05-18T04:39:39.139257+00:00"}