{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4QJWLCGWVDW46L2MFG6PUMFRWI","short_pith_number":"pith:4QJWLCGW","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"},"canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","source":{"kind":"arxiv","id":"1711.07038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07038","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07038v2","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07038","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"4QJWLCGWVDW4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QJWLCGWVDW46L2M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QJWLCGW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4QJWLCGWVDW46L2MFG6PUMFRWI","target":"record","payload":{"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"},"canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","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"},"source_kind":"arxiv","source_id":"1711.07038","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOnWcOjhlymbnl+/G5nIsz+His4CGuRD3rM17AErkuhTKSUgGGBVX8aaEoy2zveb8NxnHwirPKbArvCG20L4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:59.182879Z"},"content_sha256":"d80f6d20838ad17a28a930d7323fec7467f1121dab35cd657b667734d53ed6ca","schema_version":"1.0","event_id":"sha256:d80f6d20838ad17a28a930d7323fec7467f1121dab35cd657b667734d53ed6ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4QJWLCGWVDW46L2MFG6PUMFRWI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghJcvpbn8VYx1QmvGnOUIeYcpGpub8Kq69kcRRt5+uBZTj1FAwCQhG9VEc4yLmd33bDHw1ppVtITQgRrzj/EDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:59.183557Z"},"content_sha256":"9898aec6c93ad447695f90254a52067ca8724b43101ab9118255cde517880afa","schema_version":"1.0","event_id":"sha256:9898aec6c93ad447695f90254a52067ca8724b43101ab9118255cde517880afa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/bundle.json","state_url":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T10:59:59Z","links":{"resolver":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI","bundle":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/bundle.json","state":"https://pith.science/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QJWLCGWVDW46L2MFG6PUMFRWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QJWLCGWVDW46L2MFG6PUMFRWI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"71ca8d167924e11fd518698c3bf691f62fc1b56adc9a77b7ef97ce8e863fc180","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-19T16:04:51Z","title_canon_sha256":"be198141be278c2e36b78c328941bec8028cab3ab2ee680bbc56c580ce1558f0"},"schema_version":"1.0","source":{"id":"1711.07038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07038","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07038v2","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07038","created_at":"2026-05-18T00:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"4QJWLCGWVDW4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QJWLCGWVDW46L2M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QJWLCGW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:9898aec6c93ad447695f90254a52067ca8724b43101ab9118255cde517880afa","target":"graph","created_at":"2026-05-18T00:19:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ganzhao Yuan, Haoxian Tan, Wei-Shi Zheng","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-19T16:04:51Z","title":"A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07038","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d80f6d20838ad17a28a930d7323fec7467f1121dab35cd657b667734d53ed6ca","target":"record","created_at":"2026-05-18T00:19:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"71ca8d167924e11fd518698c3bf691f62fc1b56adc9a77b7ef97ce8e863fc180","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-19T16:04:51Z","title_canon_sha256":"be198141be278c2e36b78c328941bec8028cab3ab2ee680bbc56c580ce1558f0"},"schema_version":"1.0","source":{"id":"1711.07038","kind":"arxiv","version":2}},"canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4136588d6a8edcf2f4c29bcfa30b1b20f655cfac5a2cf3799b597ac66e659de","first_computed_at":"2026-05-18T00:19:16.857637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:16.857637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8szCicbaZBRJzIn4kOWsahABO3/jGPpAzDZDN5gmOfTQ/CSxDaczo8Qc2fI3SfuHxqHP03In/ZdLbfOO8PzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:16.858346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80f6d20838ad17a28a930d7323fec7467f1121dab35cd657b667734d53ed6ca","sha256:9898aec6c93ad447695f90254a52067ca8724b43101ab9118255cde517880afa"],"state_sha256":"96a8a4747b88f41f4db778a66c972122c46de80377fc51abbe18b6ca025185b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWfYhXxDp+abQSV5RfYUQ3xgQahvsRezfghMC0Ez2uGXvKp0Jju9mLuu5GKplNwTgZiIX4wP4JDQPHc8JEdCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:59:59.187220Z","bundle_sha256":"e39ca285810cf31ffc503858d9c4fbe177b11e4c85464808529821408abea960"}}