{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SQ4ONLVZ5XIDDTZIJWMXTVHOPO","short_pith_number":"pith:SQ4ONLVZ","canonical_record":{"source":{"id":"1310.1147","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-04T02:06:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"640d6a09cc6f22622b521960465775c902b5df456bcbb35f223d47a8cd44b514","abstract_canon_sha256":"cdd68e480e9e4a6a30160e47021a1b0a096800d4c6761d37d576925532280831"},"schema_version":"1.0"},"canonical_sha256":"9438e6aeb9edd031cf284d9979d4ee7b8db476ec99fa51c1a74a41778b2be6ef","source":{"kind":"arxiv","id":"1310.1147","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1147","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1147v5","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1147","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"SQ4ONLVZ5XID","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQ4ONLVZ5XIDDTZI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQ4ONLVZ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SQ4ONLVZ5XIDDTZIJWMXTVHOPO","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1147","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-04T02:06:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"640d6a09cc6f22622b521960465775c902b5df456bcbb35f223d47a8cd44b514","abstract_canon_sha256":"cdd68e480e9e4a6a30160e47021a1b0a096800d4c6761d37d576925532280831"},"schema_version":"1.0"},"canonical_sha256":"9438e6aeb9edd031cf284d9979d4ee7b8db476ec99fa51c1a74a41778b2be6ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.535740Z","signature_b64":"5hLbjmQpDRBLzyVWfONiI4lv/dNMlLVYGW13B+jzGLrR4zwsK2P79OyXEx6FE5qMQs1f6bvIKMEfBF3VXEYWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9438e6aeb9edd031cf284d9979d4ee7b8db476ec99fa51c1a74a41778b2be6ef","last_reissued_at":"2026-05-17T23:52:34.535346Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.535346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1147","source_version":5,"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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04GzQCL8eI4SRNZEvzI0h6qBhdplzuaXL0lsodE9hEgby8+Kpld+3/khrGYPu4/h9JH68egH+OJl8ESKfOHVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T19:26:02.685892Z"},"content_sha256":"41b41679a1024958bbe96dc352fc4e1f806dcd7a04dd50be01c7b835baef3740","schema_version":"1.0","event_id":"sha256:41b41679a1024958bbe96dc352fc4e1f806dcd7a04dd50be01c7b835baef3740"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SQ4ONLVZ5XIDDTZIJWMXTVHOPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Primal Dual Active Set Algorithm for Nonconvex Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Bangti Jin, Can Yang, Jian Huang, Jin Liu, Xiliang Lu, Yuling Jiao","submitted_at":"2013-10-04T02:06:00Z","abstract_excerpt":"In this paper, we consider the problem of recovering a sparse signal based on penalized least squares formulations. We develop a novel algorithm of primal-dual active set type for a class of nonconvex sparsity-promoting penalties, including $\\ell^0$, bridge, smoothly clipped absolute deviation, capped $\\ell^1$ and minimax concavity penalty. First we establish the existence of a global minimizer for the related optimization problems. Then we derive a novel necessary optimality condition for the global minimizer using the associated thresholding operator. The solutions to the optimality system a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1147","kind":"arxiv","version":5},"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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHFyAJefu8cwlcIhrX6s00LE9QpmbVKKX60Rpv2GwoDkKyOgjCUOpzbC6+CMrZ0EWUbeQTVanm73NM02xRq5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T19:26:02.686252Z"},"content_sha256":"80bd3fd6ba47824e6bb5a83e9a90f531e695ed72ac5667c1eac2c856e9117a28","schema_version":"1.0","event_id":"sha256:80bd3fd6ba47824e6bb5a83e9a90f531e695ed72ac5667c1eac2c856e9117a28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/bundle.json","state_url":"https://pith.science/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/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-19T19:26:02Z","links":{"resolver":"https://pith.science/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO","bundle":"https://pith.science/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/bundle.json","state":"https://pith.science/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQ4ONLVZ5XIDDTZIJWMXTVHOPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SQ4ONLVZ5XIDDTZIJWMXTVHOPO","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":"cdd68e480e9e4a6a30160e47021a1b0a096800d4c6761d37d576925532280831","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-04T02:06:00Z","title_canon_sha256":"640d6a09cc6f22622b521960465775c902b5df456bcbb35f223d47a8cd44b514"},"schema_version":"1.0","source":{"id":"1310.1147","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1147","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1147v5","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1147","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"SQ4ONLVZ5XID","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQ4ONLVZ5XIDDTZI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQ4ONLVZ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:80bd3fd6ba47824e6bb5a83e9a90f531e695ed72ac5667c1eac2c856e9117a28","target":"graph","created_at":"2026-05-17T23:52:34Z","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 consider the problem of recovering a sparse signal based on penalized least squares formulations. We develop a novel algorithm of primal-dual active set type for a class of nonconvex sparsity-promoting penalties, including $\\ell^0$, bridge, smoothly clipped absolute deviation, capped $\\ell^1$ and minimax concavity penalty. First we establish the existence of a global minimizer for the related optimization problems. Then we derive a novel necessary optimality condition for the global minimizer using the associated thresholding operator. The solutions to the optimality system a","authors_text":"Bangti Jin, Can Yang, Jian Huang, Jin Liu, Xiliang Lu, Yuling Jiao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-04T02:06:00Z","title":"A Unified Primal Dual Active Set Algorithm for Nonconvex Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1147","kind":"arxiv","version":5},"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:41b41679a1024958bbe96dc352fc4e1f806dcd7a04dd50be01c7b835baef3740","target":"record","created_at":"2026-05-17T23:52:34Z","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":"cdd68e480e9e4a6a30160e47021a1b0a096800d4c6761d37d576925532280831","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-04T02:06:00Z","title_canon_sha256":"640d6a09cc6f22622b521960465775c902b5df456bcbb35f223d47a8cd44b514"},"schema_version":"1.0","source":{"id":"1310.1147","kind":"arxiv","version":5}},"canonical_sha256":"9438e6aeb9edd031cf284d9979d4ee7b8db476ec99fa51c1a74a41778b2be6ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9438e6aeb9edd031cf284d9979d4ee7b8db476ec99fa51c1a74a41778b2be6ef","first_computed_at":"2026-05-17T23:52:34.535346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:34.535346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hLbjmQpDRBLzyVWfONiI4lv/dNMlLVYGW13B+jzGLrR4zwsK2P79OyXEx6FE5qMQs1f6bvIKMEfBF3VXEYWBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:34.535740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1147","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41b41679a1024958bbe96dc352fc4e1f806dcd7a04dd50be01c7b835baef3740","sha256:80bd3fd6ba47824e6bb5a83e9a90f531e695ed72ac5667c1eac2c856e9117a28"],"state_sha256":"36f7bfd29b69a1d134c79a97dab41e390a7d35c78548df3137866eb8d4b7675c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkkv21BFOmEQBSGbr+TYowKYYgzbNfyGWj0NuJdvKyJwxPexr7bxmLnJbWWMyg6fctLOtsi+5CFSJv9VAMZtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T19:26:02.688552Z","bundle_sha256":"91c964e971d78a9b3f34bce327afdaed6a1a59dca7fef5bff1b6feffc63018f4"}}