{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:3KBN4OS2CCGBI7T5JLOTGVUYRB","short_pith_number":"pith:3KBN4OS2","schema_version":"1.0","canonical_sha256":"da82de3a5a108c147e7d4add33569888644271175db5829a9bc8320148565a41","source":{"kind":"arxiv","id":"cs/0506023","version":1},"attestation_state":"computed","paper":{"title":"Sparse Covariance Selection via Robust Maximum Likelihood Estimation","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui, Onureena Banerjee","submitted_at":"2005-06-08T21:08:38Z","abstract_excerpt":"We address a problem of covariance selection, where we seek a trade-off between a high likelihood against the number of non-zero elements in the inverse covariance matrix. We solve a maximum likelihood problem with a penalty term given by the sum of absolute values of the elements of the inverse covariance matrix, and allow for imposing bounds on the condition number of the solution. The problem is directly amenable to now standard interior-point algorithms for convex optimization, but remains challenging due to its size. We first give some results on the theoretical computational complexity o"},"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":"cs/0506023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CE","submitted_at":"2005-06-08T21:08:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8d21df84a339033d52f12569d061279a2258a9f7b1b683649359a49faa6694cc","abstract_canon_sha256":"e2cb77dd8f235e022f6e8f0bb4b30ec77ddf2d92be4776255f734d44c2a4167b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:02.969364Z","signature_b64":"9tVXEPLCWFw7ftN1WSUFW7W5iFZIBYlD9xAYoyit/poTzAiSyBlQTKGjZkQMFQM3zraQBfrERBZJnGZAx4wuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da82de3a5a108c147e7d4add33569888644271175db5829a9bc8320148565a41","last_reissued_at":"2026-07-04T14:25:02.968945Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:02.968945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Covariance Selection via Robust Maximum Likelihood Estimation","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui, Onureena Banerjee","submitted_at":"2005-06-08T21:08:38Z","abstract_excerpt":"We address a problem of covariance selection, where we seek a trade-off between a high likelihood against the number of non-zero elements in the inverse covariance matrix. We solve a maximum likelihood problem with a penalty term given by the sum of absolute values of the elements of the inverse covariance matrix, and allow for imposing bounds on the condition number of the solution. The problem is directly amenable to now standard interior-point algorithms for convex optimization, but remains challenging due to its size. We first give some results on the theoretical computational complexity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0506023","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0506023/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0506023","created_at":"2026-07-04T14:25:02.969001+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0506023v1","created_at":"2026-07-04T14:25:02.969001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0506023","created_at":"2026-07-04T14:25:02.969001+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KBN4OS2CCGB","created_at":"2026-07-04T14:25:02.969001+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KBN4OS2CCGBI7T5","created_at":"2026-07-04T14:25:02.969001+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KBN4OS2","created_at":"2026-07-04T14:25:02.969001+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/3KBN4OS2CCGBI7T5JLOTGVUYRB","json":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB.json","graph_json":"https://pith.science/api/pith-number/3KBN4OS2CCGBI7T5JLOTGVUYRB/graph.json","events_json":"https://pith.science/api/pith-number/3KBN4OS2CCGBI7T5JLOTGVUYRB/events.json","paper":"https://pith.science/paper/3KBN4OS2"},"agent_actions":{"view_html":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB","download_json":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB.json","view_paper":"https://pith.science/paper/3KBN4OS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0506023&json=true","fetch_graph":"https://pith.science/api/pith-number/3KBN4OS2CCGBI7T5JLOTGVUYRB/graph.json","fetch_events":"https://pith.science/api/pith-number/3KBN4OS2CCGBI7T5JLOTGVUYRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB/action/storage_attestation","attest_author":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB/action/author_attestation","sign_citation":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB/action/citation_signature","submit_replication":"https://pith.science/pith/3KBN4OS2CCGBI7T5JLOTGVUYRB/action/replication_record"}},"created_at":"2026-07-04T14:25:02.969001+00:00","updated_at":"2026-07-04T14:25:02.969001+00:00"}