{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XASP4S4R52NATRHBT6MSW7NVPR","short_pith_number":"pith:XASP4S4R","canonical_record":{"source":{"id":"1503.02164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T12:06:48Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"72103c56ddf22e436df8e20cf5fa6dad89726d5d44583988d2d798af25180567","abstract_canon_sha256":"ea35b8a17df5f1f27fe482f15cdc4356ca4bd06dfc8f83e41a5799f311509b55"},"schema_version":"1.0"},"canonical_sha256":"b824fe4b91ee9a09c4e19f992b7db57c67f2d1fe399ab8f6deed6fbf5b582ef6","source":{"kind":"arxiv","id":"1503.02164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02164","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02164v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02164","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"XASP4S4R52NA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XASP4S4R52NATRHB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XASP4S4R","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XASP4S4R52NATRHBT6MSW7NVPR","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T12:06:48Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"72103c56ddf22e436df8e20cf5fa6dad89726d5d44583988d2d798af25180567","abstract_canon_sha256":"ea35b8a17df5f1f27fe482f15cdc4356ca4bd06dfc8f83e41a5799f311509b55"},"schema_version":"1.0"},"canonical_sha256":"b824fe4b91ee9a09c4e19f992b7db57c67f2d1fe399ab8f6deed6fbf5b582ef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.714856Z","signature_b64":"/xiKk4iKfQnqGU2qnr9AO9R0ebHrfqZYToYyOiOQaCpLHGQEMXwjWr3EeYAXjbYhvKrsTIKVU/HU3NP2bHZdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b824fe4b91ee9a09c4e19f992b7db57c67f2d1fe399ab8f6deed6fbf5b582ef6","last_reissued_at":"2026-05-18T02:25:25.714410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.714410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02164","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:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqDPmCRzpwjZysU6msvYxU1CbFXSY97ASM/W1I7iV1CthxUgXk5YkRqGOoOFPhu51LbtmjT3AZdjnbiP+vsLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:31:46.150775Z"},"content_sha256":"a4c2589c78f2621caa0617d7081055f757defe519cac82386eb88e746d12420d","schema_version":"1.0","event_id":"sha256:a4c2589c78f2621caa0617d7081055f757defe519cac82386eb88e746d12420d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XASP4S4R52NATRHBT6MSW7NVPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nonconvex Approach for Structured Sparse Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Qian, Shubao Zhang, Zhihua Zhang","submitted_at":"2015-03-07T12:06:48Z","abstract_excerpt":"Sparse learning is an important topic in many areas such as machine learning, statistical estimation, signal processing, etc. Recently, there emerges a growing interest on structured sparse learning. In this paper we focus on the $\\ell_q$-analysis optimization problem for structured sparse learning ($0< q \\leq 1$). Compared to previous work, we establish weaker conditions for exact recovery in noiseless case and a tighter non-asymptotic upper bound of estimate error in noisy case. We further prove that the nonconvex $\\ell_q$-analysis optimization can do recovery with a lower sample complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02164","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:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kyywr9yf0PUSWvYaByALHvS6eOjcJmBI7OFYlUv/P3aEDeowV48glbeSJqR1bLlofha/8bLOfynrgofq5TSfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:31:46.151498Z"},"content_sha256":"518d3e65f010a8f552af4a67ffa0fdab71506a99f8cc76c25acc3f2ce37f88cf","schema_version":"1.0","event_id":"sha256:518d3e65f010a8f552af4a67ffa0fdab71506a99f8cc76c25acc3f2ce37f88cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XASP4S4R52NATRHBT6MSW7NVPR/bundle.json","state_url":"https://pith.science/pith/XASP4S4R52NATRHBT6MSW7NVPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XASP4S4R52NATRHBT6MSW7NVPR/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-11T23:31:46Z","links":{"resolver":"https://pith.science/pith/XASP4S4R52NATRHBT6MSW7NVPR","bundle":"https://pith.science/pith/XASP4S4R52NATRHBT6MSW7NVPR/bundle.json","state":"https://pith.science/pith/XASP4S4R52NATRHBT6MSW7NVPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XASP4S4R52NATRHBT6MSW7NVPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XASP4S4R52NATRHBT6MSW7NVPR","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":"ea35b8a17df5f1f27fe482f15cdc4356ca4bd06dfc8f83e41a5799f311509b55","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T12:06:48Z","title_canon_sha256":"72103c56ddf22e436df8e20cf5fa6dad89726d5d44583988d2d798af25180567"},"schema_version":"1.0","source":{"id":"1503.02164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02164","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02164v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02164","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"XASP4S4R52NA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XASP4S4R52NATRHB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XASP4S4R","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:518d3e65f010a8f552af4a67ffa0fdab71506a99f8cc76c25acc3f2ce37f88cf","target":"graph","created_at":"2026-05-18T02:25:25Z","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 learning is an important topic in many areas such as machine learning, statistical estimation, signal processing, etc. Recently, there emerges a growing interest on structured sparse learning. In this paper we focus on the $\\ell_q$-analysis optimization problem for structured sparse learning ($0< q \\leq 1$). Compared to previous work, we establish weaker conditions for exact recovery in noiseless case and a tighter non-asymptotic upper bound of estimate error in noisy case. We further prove that the nonconvex $\\ell_q$-analysis optimization can do recovery with a lower sample complexity ","authors_text":"Hui Qian, Shubao Zhang, Zhihua Zhang","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T12:06:48Z","title":"A Nonconvex Approach for Structured Sparse Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02164","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:a4c2589c78f2621caa0617d7081055f757defe519cac82386eb88e746d12420d","target":"record","created_at":"2026-05-18T02:25:25Z","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":"ea35b8a17df5f1f27fe482f15cdc4356ca4bd06dfc8f83e41a5799f311509b55","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T12:06:48Z","title_canon_sha256":"72103c56ddf22e436df8e20cf5fa6dad89726d5d44583988d2d798af25180567"},"schema_version":"1.0","source":{"id":"1503.02164","kind":"arxiv","version":1}},"canonical_sha256":"b824fe4b91ee9a09c4e19f992b7db57c67f2d1fe399ab8f6deed6fbf5b582ef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b824fe4b91ee9a09c4e19f992b7db57c67f2d1fe399ab8f6deed6fbf5b582ef6","first_computed_at":"2026-05-18T02:25:25.714410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:25.714410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/xiKk4iKfQnqGU2qnr9AO9R0ebHrfqZYToYyOiOQaCpLHGQEMXwjWr3EeYAXjbYhvKrsTIKVU/HU3NP2bHZdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:25.714856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4c2589c78f2621caa0617d7081055f757defe519cac82386eb88e746d12420d","sha256:518d3e65f010a8f552af4a67ffa0fdab71506a99f8cc76c25acc3f2ce37f88cf"],"state_sha256":"d793da017549ea5ff43ee82833f25259f52210edff148d76edc2cb612129764d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A25PwWVEskGCrR3ztpxEap0QASoCSd4dEWapl1pp4Et073DkraPKHcnQcnfIERr1+K+U3iw2edRF1XcalP+1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:31:46.156047Z","bundle_sha256":"5ea9b5114d848f1c93ddff9fc96baa5e6fdb9a5e2648415d3459068b12d75771"}}