{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BOODPMO6TB6UUZ2IFGAQKUPONB","short_pith_number":"pith:BOODPMO6","canonical_record":{"source":{"id":"1506.05374","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T15:58:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77bf27d077afc79ef0e21c163921fa9652cfc463a850e617f2ff14a36543d402","abstract_canon_sha256":"e731b7946d93042e53609c6dd9e3e1fb61e8cc558b87922739b5a268d2175a20"},"schema_version":"1.0"},"canonical_sha256":"0b9c37b1de987d4a674829810551ee687b279cdc31963e308b10e070bb89091a","source":{"kind":"arxiv","id":"1506.05374","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05374","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05374v3","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05374","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"BOODPMO6TB6U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BOODPMO6TB6UUZ2I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BOODPMO6","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BOODPMO6TB6UUZ2IFGAQKUPONB","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05374","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T15:58:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77bf27d077afc79ef0e21c163921fa9652cfc463a850e617f2ff14a36543d402","abstract_canon_sha256":"e731b7946d93042e53609c6dd9e3e1fb61e8cc558b87922739b5a268d2175a20"},"schema_version":"1.0"},"canonical_sha256":"0b9c37b1de987d4a674829810551ee687b279cdc31963e308b10e070bb89091a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:06.036240Z","signature_b64":"4+9AO6LyKOiQ7Tnpk/5UpmembYarcUFhfn0J90oghW3/Ny7+kR9AHn4Jzc86jOzNTDucsSXXy365+Ndm8fWdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9c37b1de987d4a674829810551ee687b279cdc31963e308b10e070bb89091a","last_reissued_at":"2026-05-18T01:19:06.035638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:06.035638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05374","source_version":3,"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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9U1Bv++vCFcCoUqXYx3ntL8gK9QzzbdMJM0dgR4ASDYERJ2zRr4YBSrBhDkIzDSJU2YPjHwt0xEFFajU68nyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:19:26.567846Z"},"content_sha256":"23fa9a60e4720ce570a1ac2aea8c7b7afc892f6e0d5a46a50e9367e226f5f379","schema_version":"1.0","event_id":"sha256:23fa9a60e4720ce570a1ac2aea8c7b7afc892f6e0d5a46a50e9367e226f5f379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BOODPMO6TB6UUZ2IFGAQKUPONB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient $\\ell_q$ Minimization Algorithms for Compressive Sensing Based on Proximity Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fei Wen, Peilin Liu, Rendong Ying, Yipeng Liu, Yuan Yang","submitted_at":"2015-06-17T15:58:29Z","abstract_excerpt":"This paper considers solving the unconstrained $\\ell_q$-norm ($0\\leq q<1$) regularized least squares ($\\ell_q$-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via incorporating the proximity operator for nonconvex $\\ell_q$-norm functions into the fast iterative shrinkage/thresholding (FISTA) and the alternative direction method of multipliers (ADMM) frameworks, respectively. Furthermore, in solving the nonconvex $\\ell_q$-LS problem, a sequential minimization strategy is adopted in the new algorithms to gain better global "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05374","kind":"arxiv","version":3},"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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7woyj2TqJha1vpT/6BxzjBK6wISGtUwHtnVBctCr/DOK8gyi7ZNGzj/SnTRc2cboFn6A9zMBjKa5+4z4qn4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:19:26.568569Z"},"content_sha256":"a06e2b9658b266074963fe78f973bcf03ae421bf1a91e82ec663eaea962cfb5d","schema_version":"1.0","event_id":"sha256:a06e2b9658b266074963fe78f973bcf03ae421bf1a91e82ec663eaea962cfb5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/bundle.json","state_url":"https://pith.science/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/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-08T17:19:26Z","links":{"resolver":"https://pith.science/pith/BOODPMO6TB6UUZ2IFGAQKUPONB","bundle":"https://pith.science/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/bundle.json","state":"https://pith.science/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOODPMO6TB6UUZ2IFGAQKUPONB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BOODPMO6TB6UUZ2IFGAQKUPONB","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":"e731b7946d93042e53609c6dd9e3e1fb61e8cc558b87922739b5a268d2175a20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T15:58:29Z","title_canon_sha256":"77bf27d077afc79ef0e21c163921fa9652cfc463a850e617f2ff14a36543d402"},"schema_version":"1.0","source":{"id":"1506.05374","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05374","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05374v3","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05374","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"BOODPMO6TB6U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BOODPMO6TB6UUZ2I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BOODPMO6","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:a06e2b9658b266074963fe78f973bcf03ae421bf1a91e82ec663eaea962cfb5d","target":"graph","created_at":"2026-05-18T01:19:06Z","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":"This paper considers solving the unconstrained $\\ell_q$-norm ($0\\leq q<1$) regularized least squares ($\\ell_q$-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via incorporating the proximity operator for nonconvex $\\ell_q$-norm functions into the fast iterative shrinkage/thresholding (FISTA) and the alternative direction method of multipliers (ADMM) frameworks, respectively. Furthermore, in solving the nonconvex $\\ell_q$-LS problem, a sequential minimization strategy is adopted in the new algorithms to gain better global ","authors_text":"Fei Wen, Peilin Liu, Rendong Ying, Yipeng Liu, Yuan Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T15:58:29Z","title":"Efficient $\\ell_q$ Minimization Algorithms for Compressive Sensing Based on Proximity Operator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05374","kind":"arxiv","version":3},"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:23fa9a60e4720ce570a1ac2aea8c7b7afc892f6e0d5a46a50e9367e226f5f379","target":"record","created_at":"2026-05-18T01:19:06Z","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":"e731b7946d93042e53609c6dd9e3e1fb61e8cc558b87922739b5a268d2175a20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-17T15:58:29Z","title_canon_sha256":"77bf27d077afc79ef0e21c163921fa9652cfc463a850e617f2ff14a36543d402"},"schema_version":"1.0","source":{"id":"1506.05374","kind":"arxiv","version":3}},"canonical_sha256":"0b9c37b1de987d4a674829810551ee687b279cdc31963e308b10e070bb89091a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b9c37b1de987d4a674829810551ee687b279cdc31963e308b10e070bb89091a","first_computed_at":"2026-05-18T01:19:06.035638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:06.035638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4+9AO6LyKOiQ7Tnpk/5UpmembYarcUFhfn0J90oghW3/Ny7+kR9AHn4Jzc86jOzNTDucsSXXy365+Ndm8fWdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:06.036240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05374","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23fa9a60e4720ce570a1ac2aea8c7b7afc892f6e0d5a46a50e9367e226f5f379","sha256:a06e2b9658b266074963fe78f973bcf03ae421bf1a91e82ec663eaea962cfb5d"],"state_sha256":"6132b54c73e65d22912d9559860aa8c50553bec2624ca086450640f65d659d50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWGxXUyOSxoqhMhc1nZ9BHURQxaQGThMjv7BVUKclmQCidWlzUOjUOTjhmyIANQm/xEuUVP1WUsWMLtMPyY9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:19:26.572176Z","bundle_sha256":"46fafc3a17ec3664207467c49651e5fb0946a2c5e5a3d3211930e2b39b5df74d"}}