{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4QJWLCGWVDW46L2MFG6PUMFRWI","short_pith_number":"pith:4QJWLCGW","schema_version":"1.0","canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","source":{"kind":"arxiv","id":"1711.07038","version":2},"attestation_state":"computed","paper":{"title":"A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Ganzhao Yuan, Haoxian Tan, Wei-Shi Zheng","submitted_at":"2017-11-19T16:04:51Z","abstract_excerpt":"Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data. However, such a problem is difficult to solve since it is NP-hard. Existing solutions are primarily based on convex approximation and iterative hard thresholding, which only lead to sub-optimal solutions. In this work, we propose a coordinate-wise optimization algorithm to solve this problem which is guaranteed to converge to a coordinate-wise minimum point. The algorithm iteratively and greedily selects one variable or swaps two variables to identify the support set, and then solv"},"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":"1711.07038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-19T16:04:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"be198141be278c2e36b78c328941bec8028cab3ab2ee680bbc56c580ce1558f0","abstract_canon_sha256":"71ca8d167924e11fd518698c3bf691f62fc1b56adc9a77b7ef97ce8e863fc180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:16.858346Z","signature_b64":"s8szCicbaZBRJzIn4kOWsahABO3/jGPpAzDZDN5gmOfTQ/CSxDaczo8Qc2fI3SfuHxqHP03In/ZdLbfOO8PzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","last_reissued_at":"2026-05-18T00:19:16.857637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:16.857637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Ganzhao Yuan, Haoxian Tan, Wei-Shi Zheng","submitted_at":"2017-11-19T16:04:51Z","abstract_excerpt":"Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data. However, such a problem is difficult to solve since it is NP-hard. Existing solutions are primarily based on convex approximation and iterative hard thresholding, which only lead to sub-optimal solutions. In this work, we propose a coordinate-wise optimization algorithm to solve this problem which is guaranteed to converge to a coordinate-wise minimum point. The algorithm iteratively and greedily selects one variable or swaps two variables to identify the support set, and then solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07038","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":"1711.07038","created_at":"2026-05-18T00:19:16.857765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07038v2","created_at":"2026-05-18T00:19:16.857765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07038","created_at":"2026-05-18T00:19:16.857765+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QJWLCGWVDW4","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QJWLCGWVDW46L2M","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QJWLCGW","created_at":"2026-05-18T12:31:00.734936+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/4QJWLCGWVDW46L2MFG6PUMFRWI","json":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI.json","graph_json":"https://pith.science/api/pith-number/4QJWLCGWVDW46L2MFG6PUMFRWI/graph.json","events_json":"https://pith.science/api/pith-number/4QJWLCGWVDW46L2MFG6PUMFRWI/events.json","paper":"https://pith.science/paper/4QJWLCGW"},"agent_actions":{"view_html":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI","download_json":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI.json","view_paper":"https://pith.science/paper/4QJWLCGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07038&json=true","fetch_graph":"https://pith.science/api/pith-number/4QJWLCGWVDW46L2MFG6PUMFRWI/graph.json","fetch_events":"https://pith.science/api/pith-number/4QJWLCGWVDW46L2MFG6PUMFRWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/action/storage_attestation","attest_author":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/action/author_attestation","sign_citation":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/action/citation_signature","submit_replication":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/action/replication_record"}},"created_at":"2026-05-18T00:19:16.857765+00:00","updated_at":"2026-05-18T00:19:16.857765+00:00"}