{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6QRNDE3FA7TOWNXZTGHSQYN6JB","short_pith_number":"pith:6QRNDE3F","canonical_record":{"source":{"id":"1403.6622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","cross_cats_sorted":[],"title_canon_sha256":"ac3ab20c873afc8ec5f84d67a928127bc0c65f15d9fec17b284b61f3e96b55b2","abstract_canon_sha256":"04506ea94c21ed7c0ade24572113edfc236c715c6ded08a02b6e41e122fc2895"},"schema_version":"1.0"},"canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","source":{"kind":"arxiv","id":"1403.6622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6622","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6622v2","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6622","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"6QRNDE3FA7TO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6QRNDE3FA7TOWNXZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6QRNDE3F","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6QRNDE3FA7TOWNXZTGHSQYN6JB","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","cross_cats_sorted":[],"title_canon_sha256":"ac3ab20c873afc8ec5f84d67a928127bc0c65f15d9fec17b284b61f3e96b55b2","abstract_canon_sha256":"04506ea94c21ed7c0ade24572113edfc236c715c6ded08a02b6e41e122fc2895"},"schema_version":"1.0"},"canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.928175Z","signature_b64":"PX/GtiEVT94EdOrClQ7UdOzzW+RYL3KEawE9hvFeh8YHRdXFV0JzYM4S7/NJX57I3vrqKCRyUNhfvX9LPF8SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","last_reissued_at":"2026-05-18T02:47:22.927605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.927605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6622","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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvMze+0tLlEXcnR6tGV9Clh4ODXO2N+7jlx6VvW8oL72K45ySK53Ceq98hZmwwm652fSsijLL1RyFdBmycYPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:57.997896Z"},"content_sha256":"4fcafcae8697c6d95718ca1ac974b91386c4094fb92ec277093f05651a99464e","schema_version":"1.0","event_id":"sha256:4fcafcae8697c6d95718ca1ac974b91386c4094fb92ec277093f05651a99464e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6QRNDE3FA7TOWNXZTGHSQYN6JB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteration complexity analysis of random coordinate descent methods for $\\ell_0$ regularized convex problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2014-03-26T10:42:52Z","abstract_excerpt":"In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\\ell_0$ regularization. Our family of methods covers particular cases such as random block coordinate gradient descent and random proximal coordinate descent methods. We analyze necessary optimality conditions for this nonconvex $\\ell_0$ regularized problem and devise a separation of the set of local minima into restricted classes based on approximation versions of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6622","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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rP8rpggj04Ie0DaWlS2iPGembE8X4zaeouk6iTuGkgDuCaJyZ4wbC+ajkzqet3gEl4Qbm/O0MRjL/xgSmRVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:57.998287Z"},"content_sha256":"ef1e0560fcc3246f035104425104c985c3fd62aef54ed5acb77bae9df202f59c","schema_version":"1.0","event_id":"sha256:ef1e0560fcc3246f035104425104c985c3fd62aef54ed5acb77bae9df202f59c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/bundle.json","state_url":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/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-26T07:06:57Z","links":{"resolver":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB","bundle":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/bundle.json","state":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6QRNDE3FA7TOWNXZTGHSQYN6JB","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":"04506ea94c21ed7c0ade24572113edfc236c715c6ded08a02b6e41e122fc2895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","title_canon_sha256":"ac3ab20c873afc8ec5f84d67a928127bc0c65f15d9fec17b284b61f3e96b55b2"},"schema_version":"1.0","source":{"id":"1403.6622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6622","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6622v2","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6622","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"6QRNDE3FA7TO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6QRNDE3FA7TOWNXZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6QRNDE3F","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:ef1e0560fcc3246f035104425104c985c3fd62aef54ed5acb77bae9df202f59c","target":"graph","created_at":"2026-05-18T02:47:22Z","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":"In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\\ell_0$ regularization. Our family of methods covers particular cases such as random block coordinate gradient descent and random proximal coordinate descent methods. We analyze necessary optimality conditions for this nonconvex $\\ell_0$ regularized problem and devise a separation of the set of local minima into restricted classes based on approximation versions of th","authors_text":"Andrei Patrascu, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","title":"Iteration complexity analysis of random coordinate descent methods for $\\ell_0$ regularized convex problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6622","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:4fcafcae8697c6d95718ca1ac974b91386c4094fb92ec277093f05651a99464e","target":"record","created_at":"2026-05-18T02:47:22Z","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":"04506ea94c21ed7c0ade24572113edfc236c715c6ded08a02b6e41e122fc2895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","title_canon_sha256":"ac3ab20c873afc8ec5f84d67a928127bc0c65f15d9fec17b284b61f3e96b55b2"},"schema_version":"1.0","source":{"id":"1403.6622","kind":"arxiv","version":2}},"canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","first_computed_at":"2026-05-18T02:47:22.927605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:22.927605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PX/GtiEVT94EdOrClQ7UdOzzW+RYL3KEawE9hvFeh8YHRdXFV0JzYM4S7/NJX57I3vrqKCRyUNhfvX9LPF8SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:22.928175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcafcae8697c6d95718ca1ac974b91386c4094fb92ec277093f05651a99464e","sha256:ef1e0560fcc3246f035104425104c985c3fd62aef54ed5acb77bae9df202f59c"],"state_sha256":"5fb7ce165b27c678d7fa1a561e153b58c52719db365e8f839302deafe2ef869a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Vp1g2RodYs5vfPLS6R7X+xfhCKJosqZUHAfPBjTeBKxDB8U9jnYbx0JNSCuV+aEN8J6zMUbYlj3jF7QOY/ACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:06:58.001346Z","bundle_sha256":"08f1af073d8170623ba5f2659cff4b37d62edb991f3708cd0351e75f98de8898"}}