{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:267V5OT7W4YZDDLDVVOXMAETKA","short_pith_number":"pith:267V5OT7","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"},"canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","source":{"kind":"arxiv","id":"1505.06841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06841","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06841v2","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06841","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"267V5OT7W4YZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"267V5OT7W4YZDDLD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"267V5OT7","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:267V5OT7W4YZDDLDVVOXMAETKA","target":"record","payload":{"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"},"canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","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"},"source_kind":"arxiv","source_id":"1505.06841","source_version":2,"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:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ebqw/DwVKEzSwt1nODy3cjOLGGgDSsKqer5chyBtBy51KsK/NTR8EPuujgEvPgXUprvo8tvfQA66jqlrT3cBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:54.249884Z"},"content_sha256":"3e11667faa1ba8321c561afa09e8d03fee131c69cc4de37746855fadd33fdeb0","schema_version":"1.0","event_id":"sha256:3e11667faa1ba8321c561afa09e8d03fee131c69cc4de37746855fadd33fdeb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:267V5OT7W4YZDDLDVVOXMAETKA","target":"graph","payload":{"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"},"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:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uI8zhyTwDt8u0yinP/mHutQQRmsN7Q+g0Gj9NjEKjnlIyCXq6vSNI6q3QoQg3WR4ZE1DIMfQ6ZbFsdFlqObkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:54.250522Z"},"content_sha256":"e90a93463a3eb5cbbef2580a123fcc33e9438fa16fcde57a7715797bfa4618b6","schema_version":"1.0","event_id":"sha256:e90a93463a3eb5cbbef2580a123fcc33e9438fa16fcde57a7715797bfa4618b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/bundle.json","state_url":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/267V5OT7W4YZDDLDVVOXMAETKA/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-05-25T15:05:54Z","links":{"resolver":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA","bundle":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/bundle.json","state":"https://pith.science/pith/267V5OT7W4YZDDLDVVOXMAETKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/267V5OT7W4YZDDLDVVOXMAETKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:267V5OT7W4YZDDLDVVOXMAETKA","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":"b1ff0272f6b3b424b95749ce7ce271a2f94b5d61f3cae3473e4a7c68a604e299","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-26T08:07:32Z","title_canon_sha256":"dd565ef19840b5bece0b561fb7cacde3c3c83e60480ec502e53497dd88fbe667"},"schema_version":"1.0","source":{"id":"1505.06841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06841","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06841v2","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06841","created_at":"2026-05-18T01:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"267V5OT7W4YZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"267V5OT7W4YZDDLD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"267V5OT7","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:e90a93463a3eb5cbbef2580a123fcc33e9438fa16fcde57a7715797bfa4618b6","target":"graph","created_at":"2026-05-18T01:00: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":"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","authors_text":"Ali Koochakzadeh, Cristian R. Rojas, Magnus Jansson, Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-26T08:07:32Z","title":"Successive Concave Sparsity Approximation for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06841","kind":"arxiv","version":2},"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:3e11667faa1ba8321c561afa09e8d03fee131c69cc4de37746855fadd33fdeb0","target":"record","created_at":"2026-05-18T01:00: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":"b1ff0272f6b3b424b95749ce7ce271a2f94b5d61f3cae3473e4a7c68a604e299","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-26T08:07:32Z","title_canon_sha256":"dd565ef19840b5bece0b561fb7cacde3c3c83e60480ec502e53497dd88fbe667"},"schema_version":"1.0","source":{"id":"1505.06841","kind":"arxiv","version":2}},"canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7bf5eba7fb731918d63ad5d760093503ee68a3041a3d1d51ffc9a2d6715bfb5","first_computed_at":"2026-05-18T01:00:25.900204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:25.900204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2wK0emHLQIz/1YkBv0BFBuBvG0GyGgM9GyxV/FVye12SuH/47M83sU/S1HBbqeo3UhLR+CiATW460I8GBHYcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:25.900934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e11667faa1ba8321c561afa09e8d03fee131c69cc4de37746855fadd33fdeb0","sha256:e90a93463a3eb5cbbef2580a123fcc33e9438fa16fcde57a7715797bfa4618b6"],"state_sha256":"b8bb840be964a3ca2d444e072a110ae0eace21bf3c2558a644a9b05022c6ff99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7c1g8OO7VraBy2y6X0r7o4pPGZdwQcKEt/2R/7nVbYIMrUMPB5HiE2mRC2BzqRGNZuepNM5xhOdwISksBCKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:05:54.254801Z","bundle_sha256":"3ef25277e4a523b58e19d6f55526790527bf55ee8a5d180c4bf7765afbde94ee"}}