{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WPKRXKRYYRLTUP7JL7BXMHEDV5","short_pith_number":"pith:WPKRXKRY","schema_version":"1.0","canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","source":{"kind":"arxiv","id":"1410.2447","version":1},"attestation_state":"computed","paper":{"title":"New Accumulative Score Function Based Bound For Sparsity Level of L1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Sheng Han, Suzhen Wang, Zhiguo Zhang","submitted_at":"2014-10-09T13:20:21Z","abstract_excerpt":"This paper discusses a fundamental problem in compressed sensing: the sparse recoverability of L1 minimization with an arbitrary sensing matrix. We develop an new accumulative score function (ASF) to provide a lower bound for the recoverable sparsity level (SL) of a sensing matrix while preserving a low computational complexity. We first define a score function for each row of a matrix, and then ASF sums up large scores until the total score reaches 0.5. Interestingly, the number of involved rows in the summation is a reliable lower bound of SL. It is further proved that ASF provides a sharper"},"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":"1410.2447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-09T13:20:21Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"627f9998d739815addd8548d169afdc537a4753092176c4a85e548789290674b","abstract_canon_sha256":"ff394752f4b98e9469a06a0e0fc290dfddf751f653d00d54e770ccffdff9ec41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.349396Z","signature_b64":"9O7x3V65zM/uTK4IQRXZq52lKp6liuf0bvdCOH+53af6p/M5NPx0ydGgdnvjnvthrmL7tKQOLGSDntJ0CHx9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","last_reissued_at":"2026-05-18T02:40:46.348900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.348900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Accumulative Score Function Based Bound For Sparsity Level of L1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Sheng Han, Suzhen Wang, Zhiguo Zhang","submitted_at":"2014-10-09T13:20:21Z","abstract_excerpt":"This paper discusses a fundamental problem in compressed sensing: the sparse recoverability of L1 minimization with an arbitrary sensing matrix. We develop an new accumulative score function (ASF) to provide a lower bound for the recoverable sparsity level (SL) of a sensing matrix while preserving a low computational complexity. We first define a score function for each row of a matrix, and then ASF sums up large scores until the total score reaches 0.5. Interestingly, the number of involved rows in the summation is a reliable lower bound of SL. It is further proved that ASF provides a sharper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2447","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2447","created_at":"2026-05-18T02:40:46.348967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2447v1","created_at":"2026-05-18T02:40:46.348967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2447","created_at":"2026-05-18T02:40:46.348967+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPKRXKRYYRLT","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPKRXKRYYRLTUP7J","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPKRXKRY","created_at":"2026-05-18T12:28:54.890064+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/WPKRXKRYYRLTUP7JL7BXMHEDV5","json":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5.json","graph_json":"https://pith.science/api/pith-number/WPKRXKRYYRLTUP7JL7BXMHEDV5/graph.json","events_json":"https://pith.science/api/pith-number/WPKRXKRYYRLTUP7JL7BXMHEDV5/events.json","paper":"https://pith.science/paper/WPKRXKRY"},"agent_actions":{"view_html":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5","download_json":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5.json","view_paper":"https://pith.science/paper/WPKRXKRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2447&json=true","fetch_graph":"https://pith.science/api/pith-number/WPKRXKRYYRLTUP7JL7BXMHEDV5/graph.json","fetch_events":"https://pith.science/api/pith-number/WPKRXKRYYRLTUP7JL7BXMHEDV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/action/storage_attestation","attest_author":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/action/author_attestation","sign_citation":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/action/citation_signature","submit_replication":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/action/replication_record"}},"created_at":"2026-05-18T02:40:46.348967+00:00","updated_at":"2026-05-18T02:40:46.348967+00:00"}