{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J4SHZMQNCWHZVWDX6G6CDEQVNQ","short_pith_number":"pith:J4SHZMQN","schema_version":"1.0","canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","source":{"kind":"arxiv","id":"1610.06853","version":1},"attestation_state":"computed","paper":{"title":"Spark Level Sparsity and the $\\ell_1$ Tail Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Chun-kit Lai, Daniel Mondo, Shidong Li","submitted_at":"2016-10-20T19:35:25Z","abstract_excerpt":"Solving compressed sensing problems relies on the properties of sparse signals. It is commonly assumed that the sparsity s needs to be less than one half of the spark of the sensing matrix A, and then the unique sparsest solution exists, and recoverable by $\\ell_1$-minimization or related procedures. We discover, however, a measure theoretical uniqueness exists for nearly spark-level sparsity from compressed measurements Ax = b. Specifically, suppose A is of full spark with m rows, and suppose $\\frac{m}{2}$ < s < m. Then the solution to Ax = b is unique for x with $\\|x\\|_0 \\leq s$ up to a set "},"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":"1610.06853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-20T19:35:25Z","cross_cats_sorted":["math.FA","math.IT"],"title_canon_sha256":"40f3321da4554b3f5b1612f33075241ed7275ecdc61e5be1caa3d12d77976b45","abstract_canon_sha256":"60d6b3460c444442482d423c6b47203005ace2d3197b97178746749c6bdc8855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.567515Z","signature_b64":"6okBMjnjO+u3E4kEELzC/ZxGV5QzcBzaBYjOg7+LOhRhsL+w/Ctc12AkFRHRHaozaof/xg52JNa6wsRCVsaUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","last_reissued_at":"2026-05-18T01:01:36.566759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.566759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spark Level Sparsity and the $\\ell_1$ Tail Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Chun-kit Lai, Daniel Mondo, Shidong Li","submitted_at":"2016-10-20T19:35:25Z","abstract_excerpt":"Solving compressed sensing problems relies on the properties of sparse signals. It is commonly assumed that the sparsity s needs to be less than one half of the spark of the sensing matrix A, and then the unique sparsest solution exists, and recoverable by $\\ell_1$-minimization or related procedures. We discover, however, a measure theoretical uniqueness exists for nearly spark-level sparsity from compressed measurements Ax = b. Specifically, suppose A is of full spark with m rows, and suppose $\\frac{m}{2}$ < s < m. Then the solution to Ax = b is unique for x with $\\|x\\|_0 \\leq s$ up to a set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06853","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":"1610.06853","created_at":"2026-05-18T01:01:36.566878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06853v1","created_at":"2026-05-18T01:01:36.566878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06853","created_at":"2026-05-18T01:01:36.566878+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4SHZMQNCWHZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4SHZMQNCWHZVWDX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4SHZMQN","created_at":"2026-05-18T12:30:22.444734+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/J4SHZMQNCWHZVWDX6G6CDEQVNQ","json":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ.json","graph_json":"https://pith.science/api/pith-number/J4SHZMQNCWHZVWDX6G6CDEQVNQ/graph.json","events_json":"https://pith.science/api/pith-number/J4SHZMQNCWHZVWDX6G6CDEQVNQ/events.json","paper":"https://pith.science/paper/J4SHZMQN"},"agent_actions":{"view_html":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ","download_json":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ.json","view_paper":"https://pith.science/paper/J4SHZMQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06853&json=true","fetch_graph":"https://pith.science/api/pith-number/J4SHZMQNCWHZVWDX6G6CDEQVNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J4SHZMQNCWHZVWDX6G6CDEQVNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/action/storage_attestation","attest_author":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/action/author_attestation","sign_citation":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/action/citation_signature","submit_replication":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/action/replication_record"}},"created_at":"2026-05-18T01:01:36.566878+00:00","updated_at":"2026-05-18T01:01:36.566878+00:00"}