{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:267V5OT7W4YZDDLDVVOXMAETKA","short_pith_number":"pith:267V5OT7","schema_version":"1.0","canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","source":{"kind":"arxiv","id":"1505.06841","version":2},"attestation_state":"computed","paper":{"title":"Successive Concave Sparsity Approximation for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Koochakzadeh, Cristian R. Rojas, Magnus Jansson, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","submitted_at":"2015-05-26T08:07:32Z","abstract_excerpt":"In this paper, based on a successively accuracy-increasing approximation of the $\\ell_0$ norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class of concave functions that aggressively induce sparsity and their closeness to the $\\ell_0$ norm can be controlled. We prove that the series of the approximations asymptotically coincides with the $\\ell_1$ and $\\ell_0$ norms when the approximation accuracy changes from the worst fitting to the best fitting. When measurements are noise-free, an optimization s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.06841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-26T08:07:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd565ef19840b5bece0b561fb7cacde3c3c83e60480ec502e53497dd88fbe667","abstract_canon_sha256":"b1ff0272f6b3b424b95749ce7ce271a2f94b5d61f3cae3473e4a7c68a604e299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:25.900934Z","signature_b64":"2wK0emHLQIz/1YkBv0BFBuBvG0GyGgM9GyxV/FVye12SuH/47M83sU/S1HBbqeo3UhLR+CiATW460I8GBHYcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","last_reissued_at":"2026-05-18T01:00:25.900204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:25.900204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Concave Sparsity Approximation for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Koochakzadeh, Cristian R. Rojas, Magnus Jansson, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","submitted_at":"2015-05-26T08:07:32Z","abstract_excerpt":"In this paper, based on a successively accuracy-increasing approximation of the $\\ell_0$ norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class of concave functions that aggressively induce sparsity and their closeness to the $\\ell_0$ norm can be controlled. We prove that the series of the approximations asymptotically coincides with the $\\ell_1$ and $\\ell_0$ norms when the approximation accuracy changes from the worst fitting to the best fitting. When measurements are noise-free, an optimization s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06841","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06841","created_at":"2026-05-18T01:00:25.900332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06841v2","created_at":"2026-05-18T01:00:25.900332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06841","created_at":"2026-05-18T01:00:25.900332+00:00"},{"alias_kind":"pith_short_12","alias_value":"267V5OT7W4YZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"267V5OT7W4YZDDLD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"267V5OT7","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA","json":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA.json","graph_json":"https://pith.science/api/pith-number/267V5OT7W4YZDDLDVVOXMAETKA/graph.json","events_json":"https://pith.science/api/pith-number/267V5OT7W4YZDDLDVVOXMAETKA/events.json","paper":"https://pith.science/paper/267V5OT7"},"agent_actions":{"view_html":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA","download_json":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA.json","view_paper":"https://pith.science/paper/267V5OT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06841&json=true","fetch_graph":"https://pith.science/api/pith-number/267V5OT7W4YZDDLDVVOXMAETKA/graph.json","fetch_events":"https://pith.science/api/pith-number/267V5OT7W4YZDDLDVVOXMAETKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/action/storage_attestation","attest_author":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/action/author_attestation","sign_citation":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/action/citation_signature","submit_replication":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/action/replication_record"}},"created_at":"2026-05-18T01:00:25.900332+00:00","updated_at":"2026-05-18T01:00:25.900332+00:00"}