{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WPKRXKRYYRLTUP7JL7BXMHEDV5","short_pith_number":"pith:WPKRXKRY","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"},"canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","source":{"kind":"arxiv","id":"1410.2447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2447","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2447v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2447","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"WPKRXKRYYRLT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WPKRXKRYYRLTUP7J","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WPKRXKRY","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WPKRXKRYYRLTUP7JL7BXMHEDV5","target":"record","payload":{"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"},"canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","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"},"source_kind":"arxiv","source_id":"1410.2447","source_version":1,"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-18T02:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20HaO74aHBzj+oKE8Mv5npX8zkIPy/IMl80j/xuIBJuqZZA8/lr6/I2nQVGJ3Pjsp16UlpWZgOdSxkip8LeFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:33:00.906546Z"},"content_sha256":"a5a015376ab05a165a2cefd373853081d469301e46faf3ed156ebc384aafe5b4","schema_version":"1.0","event_id":"sha256:a5a015376ab05a165a2cefd373853081d469301e46faf3ed156ebc384aafe5b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WPKRXKRYYRLTUP7JL7BXMHEDV5","target":"graph","payload":{"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"},"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-18T02:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WE6hch257ldg825/I0oQZzhFguUWk780g3gMVX5Jy5o32xY2Neg3kBgKukRZTsEOGJw15V0fqA6o3+CDzHWQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:33:00.907189Z"},"content_sha256":"05d3c05bf4cd25cf254a850fa842f0964f93729776153504f6ae4351541de170","schema_version":"1.0","event_id":"sha256:05d3c05bf4cd25cf254a850fa842f0964f93729776153504f6ae4351541de170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/bundle.json","state_url":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/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-08T21:33:00Z","links":{"resolver":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5","bundle":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/bundle.json","state":"https://pith.science/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPKRXKRYYRLTUP7JL7BXMHEDV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WPKRXKRYYRLTUP7JL7BXMHEDV5","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":"ff394752f4b98e9469a06a0e0fc290dfddf751f653d00d54e770ccffdff9ec41","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-09T13:20:21Z","title_canon_sha256":"627f9998d739815addd8548d169afdc537a4753092176c4a85e548789290674b"},"schema_version":"1.0","source":{"id":"1410.2447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2447","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2447v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2447","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"WPKRXKRYYRLT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WPKRXKRYYRLTUP7J","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WPKRXKRY","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:05d3c05bf4cd25cf254a850fa842f0964f93729776153504f6ae4351541de170","target":"graph","created_at":"2026-05-18T02:40:46Z","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 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","authors_text":"Sheng Han, Suzhen Wang, Zhiguo Zhang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-09T13:20:21Z","title":"New Accumulative Score Function Based Bound For Sparsity Level of L1 Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2447","kind":"arxiv","version":1},"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:a5a015376ab05a165a2cefd373853081d469301e46faf3ed156ebc384aafe5b4","target":"record","created_at":"2026-05-18T02:40:46Z","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":"ff394752f4b98e9469a06a0e0fc290dfddf751f653d00d54e770ccffdff9ec41","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-09T13:20:21Z","title_canon_sha256":"627f9998d739815addd8548d169afdc537a4753092176c4a85e548789290674b"},"schema_version":"1.0","source":{"id":"1410.2447","kind":"arxiv","version":1}},"canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d51baa38c4573a3fe95fc3761c83af5be93135659f03557337c3ae09ba3e49","first_computed_at":"2026-05-18T02:40:46.348900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:46.348900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9O7x3V65zM/uTK4IQRXZq52lKp6liuf0bvdCOH+53af6p/M5NPx0ydGgdnvjnvthrmL7tKQOLGSDntJ0CHx9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:46.349396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5a015376ab05a165a2cefd373853081d469301e46faf3ed156ebc384aafe5b4","sha256:05d3c05bf4cd25cf254a850fa842f0964f93729776153504f6ae4351541de170"],"state_sha256":"b759562c934fbd4325b2d40b90b81ae5cf797d3765050c3a3ed8a605cacc0eb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njHx9eICSiwInbxjeJF9a/0Y88i/UzSP+pWaksXyNI0enVMOAA5u0o4bRMV3ECTBmJKO43oTdefK1JK4YH6gBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:33:00.911228Z","bundle_sha256":"efe94e6ef99ed8e31805cfbe35f2f6b7026d0650dec70f1ea20cae901bd2824f"}}