{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MRMBBZT54245NSFLDAXNBABK2","short_pith_number":"pith:2MRMBBZT","canonical_record":{"source":{"id":"1408.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-04T03:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"5f95a74a1bbe219a2d3c6d678dd659148ebe3aa61070a088a68196a995e825e7","abstract_canon_sha256":"1947cba0029366fb95c3f138696f4869fbc6790a3913ce567fdbdcf5b10dcea3"},"schema_version":"1.0"},"canonical_sha256":"d322c08733ef35ceb64558c176840156b4615cc2788bb0f7e803a0009400ab8e","source":{"kind":"arxiv","id":"1408.0578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0578","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0578v1","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0578","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"2MRMBBZT5424","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MRMBBZT54245NSF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MRMBBZT","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MRMBBZT54245NSFLDAXNBABK2","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-04T03:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"5f95a74a1bbe219a2d3c6d678dd659148ebe3aa61070a088a68196a995e825e7","abstract_canon_sha256":"1947cba0029366fb95c3f138696f4869fbc6790a3913ce567fdbdcf5b10dcea3"},"schema_version":"1.0"},"canonical_sha256":"d322c08733ef35ceb64558c176840156b4615cc2788bb0f7e803a0009400ab8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:56.759372Z","signature_b64":"/ceWmKsiz+gE6rVdowHXXBTutlBnkTtHVA5sHaPxfcSRw6AMPRYkfKjHvGeOL24GZqnMvSdqq5QXxuoZ4IKwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d322c08733ef35ceb64558c176840156b4615cc2788bb0f7e803a0009400ab8e","last_reissued_at":"2026-05-18T02:45:56.758854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:56.758854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0578","source_version":1,"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:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ot9JxEiVQDe3RYtnhwh6zOSZo0ZnwTRz813Vue3HXUWtTXFUV+EvujoYsU7EDAwQG0KzbpRjgdR+6c+cAiMFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:48.544382Z"},"content_sha256":"4f41f5810a724e2c68af21049fe4b7b22eb4af382d28dbc2b54880afeedeeef2","schema_version":"1.0","event_id":"sha256:4f41f5810a724e2c68af21049fe4b7b22eb4af382d28dbc2b54880afeedeeef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MRMBBZT54245NSFLDAXNBABK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Cyclic Coordinate Descent Algorithm for lq Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinshan Zeng, Shaobo Lin, Zhimin Peng, Zongben Xu","submitted_at":"2014-08-04T03:56:59Z","abstract_excerpt":"In recent studies on sparse modeling, $l_q$ ($0<q<1$) regularization has received considerable attention due to its superiorities on sparsity-inducing and bias reduction over the $l_1$ regularization.In this paper, we propose a cyclic coordinate descent (CCD) algorithm for $l_q$ regularization. Our main result states that the CCD algorithm converges globally to a stationary point as long as the stepsize is less than a positive constant. Furthermore, we demonstrate that the CCD algorithm converges to a local minimizer under certain additional conditions. Our numerical experiments demonstrate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0578","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":""},"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:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WONEyHg0U13D6eA7ZayKjZuHftHzbU2b2d+SFjp6XIJHYd5iogI4OuzjoLgEMdaYpiwXRHpk0BaO5AV1wtETCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:48.544732Z"},"content_sha256":"5b7cb60b3f735dbafc5a021efd3515962b9d2a8fd2dfbb2e498e681bb5027a9c","schema_version":"1.0","event_id":"sha256:5b7cb60b3f735dbafc5a021efd3515962b9d2a8fd2dfbb2e498e681bb5027a9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MRMBBZT54245NSFLDAXNBABK2/bundle.json","state_url":"https://pith.science/pith/2MRMBBZT54245NSFLDAXNBABK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MRMBBZT54245NSFLDAXNBABK2/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-06-25T19:32:48Z","links":{"resolver":"https://pith.science/pith/2MRMBBZT54245NSFLDAXNBABK2","bundle":"https://pith.science/pith/2MRMBBZT54245NSFLDAXNBABK2/bundle.json","state":"https://pith.science/pith/2MRMBBZT54245NSFLDAXNBABK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MRMBBZT54245NSFLDAXNBABK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MRMBBZT54245NSFLDAXNBABK2","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":"1947cba0029366fb95c3f138696f4869fbc6790a3913ce567fdbdcf5b10dcea3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-04T03:56:59Z","title_canon_sha256":"5f95a74a1bbe219a2d3c6d678dd659148ebe3aa61070a088a68196a995e825e7"},"schema_version":"1.0","source":{"id":"1408.0578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0578","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0578v1","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0578","created_at":"2026-05-18T02:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"2MRMBBZT5424","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MRMBBZT54245NSF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MRMBBZT","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:5b7cb60b3f735dbafc5a021efd3515962b9d2a8fd2dfbb2e498e681bb5027a9c","target":"graph","created_at":"2026-05-18T02:45:56Z","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 recent studies on sparse modeling, $l_q$ ($0<q<1$) regularization has received considerable attention due to its superiorities on sparsity-inducing and bias reduction over the $l_1$ regularization.In this paper, we propose a cyclic coordinate descent (CCD) algorithm for $l_q$ regularization. Our main result states that the CCD algorithm converges globally to a stationary point as long as the stepsize is less than a positive constant. Furthermore, we demonstrate that the CCD algorithm converges to a local minimizer under certain additional conditions. Our numerical experiments demonstrate th","authors_text":"Jinshan Zeng, Shaobo Lin, Zhimin Peng, Zongben Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-04T03:56:59Z","title":"A Cyclic Coordinate Descent Algorithm for lq Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0578","kind":"arxiv","version":1},"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:4f41f5810a724e2c68af21049fe4b7b22eb4af382d28dbc2b54880afeedeeef2","target":"record","created_at":"2026-05-18T02:45:56Z","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":"1947cba0029366fb95c3f138696f4869fbc6790a3913ce567fdbdcf5b10dcea3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-04T03:56:59Z","title_canon_sha256":"5f95a74a1bbe219a2d3c6d678dd659148ebe3aa61070a088a68196a995e825e7"},"schema_version":"1.0","source":{"id":"1408.0578","kind":"arxiv","version":1}},"canonical_sha256":"d322c08733ef35ceb64558c176840156b4615cc2788bb0f7e803a0009400ab8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d322c08733ef35ceb64558c176840156b4615cc2788bb0f7e803a0009400ab8e","first_computed_at":"2026-05-18T02:45:56.758854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:56.758854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ceWmKsiz+gE6rVdowHXXBTutlBnkTtHVA5sHaPxfcSRw6AMPRYkfKjHvGeOL24GZqnMvSdqq5QXxuoZ4IKwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:56.759372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f41f5810a724e2c68af21049fe4b7b22eb4af382d28dbc2b54880afeedeeef2","sha256:5b7cb60b3f735dbafc5a021efd3515962b9d2a8fd2dfbb2e498e681bb5027a9c"],"state_sha256":"db490dac570b2b65fef1c72266d9bb865a4f81744d532711ff3336ca062d01cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1HJGvD4auPjACHKRvHfhFzXm6mFu/yYfOId6zz6qGClY06o5HnR7nD9uduGNRQn9szMqS3D0yBSMzWYVMSRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:32:48.546631Z","bundle_sha256":"78ecfb37cc9287b5c1f1b0982aae610d6afb925f4168a02a67c86a0968fcc39c"}}