{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J4SHZMQNCWHZVWDX6G6CDEQVNQ","short_pith_number":"pith:J4SHZMQN","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"},"canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","source":{"kind":"arxiv","id":"1610.06853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06853","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06853v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06853","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"J4SHZMQNCWHZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J4SHZMQNCWHZVWDX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J4SHZMQN","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J4SHZMQNCWHZVWDX6G6CDEQVNQ","target":"record","payload":{"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"},"canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","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"},"source_kind":"arxiv","source_id":"1610.06853","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4VVPiqd5tfW0qn9i7KyWSK7xDwTkzCvvLZuLGiBnFhIcSoBoygXbDiaFvPNTQiOuWQ52ubkiUu6nyO6mKWYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:25:13.329144Z"},"content_sha256":"659866b0c2f40f7d9a858233fb3b55e973b18a36c52ae3e11859b560f58ad493","schema_version":"1.0","event_id":"sha256:659866b0c2f40f7d9a858233fb3b55e973b18a36c52ae3e11859b560f58ad493"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J4SHZMQNCWHZVWDX6G6CDEQVNQ","target":"graph","payload":{"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"},"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:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8yTPk/hpYUzXWKYn5ceVJkKw8qSkVBo/sXFQ31rWEEN6yVpBpjjvVm4tl9s8K0NeK0gTc+WVz9yRY6Y/xJhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:25:13.329504Z"},"content_sha256":"27f15b6f2208c51e6c237ce6333bad447fdc55c3424c0e014e4f6b499c7a47fb","schema_version":"1.0","event_id":"sha256:27f15b6f2208c51e6c237ce6333bad447fdc55c3424c0e014e4f6b499c7a47fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/bundle.json","state_url":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/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-02T04:25:13Z","links":{"resolver":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ","bundle":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/bundle.json","state":"https://pith.science/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4SHZMQNCWHZVWDX6G6CDEQVNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J4SHZMQNCWHZVWDX6G6CDEQVNQ","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":"60d6b3460c444442482d423c6b47203005ace2d3197b97178746749c6bdc8855","cross_cats_sorted":["math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-20T19:35:25Z","title_canon_sha256":"40f3321da4554b3f5b1612f33075241ed7275ecdc61e5be1caa3d12d77976b45"},"schema_version":"1.0","source":{"id":"1610.06853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06853","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06853v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06853","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"J4SHZMQNCWHZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J4SHZMQNCWHZVWDX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J4SHZMQN","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:27f15b6f2208c51e6c237ce6333bad447fdc55c3424c0e014e4f6b499c7a47fb","target":"graph","created_at":"2026-05-18T01:01:36Z","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":"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 ","authors_text":"Chun-kit Lai, Daniel Mondo, Shidong Li","cross_cats":["math.FA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-20T19:35:25Z","title":"Spark Level Sparsity and the $\\ell_1$ Tail Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06853","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:659866b0c2f40f7d9a858233fb3b55e973b18a36c52ae3e11859b560f58ad493","target":"record","created_at":"2026-05-18T01:01:36Z","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":"60d6b3460c444442482d423c6b47203005ace2d3197b97178746749c6bdc8855","cross_cats_sorted":["math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-20T19:35:25Z","title_canon_sha256":"40f3321da4554b3f5b1612f33075241ed7275ecdc61e5be1caa3d12d77976b45"},"schema_version":"1.0","source":{"id":"1610.06853","kind":"arxiv","version":1}},"canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f247cb20d158f9ad877f1bc2192156c2ed197b709b893ff59b695bc5ad26293","first_computed_at":"2026-05-18T01:01:36.566759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.566759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6okBMjnjO+u3E4kEELzC/ZxGV5QzcBzaBYjOg7+LOhRhsL+w/Ctc12AkFRHRHaozaof/xg52JNa6wsRCVsaUCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.567515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659866b0c2f40f7d9a858233fb3b55e973b18a36c52ae3e11859b560f58ad493","sha256:27f15b6f2208c51e6c237ce6333bad447fdc55c3424c0e014e4f6b499c7a47fb"],"state_sha256":"a9fb53be9fade02f89a96dd7900a7b3886790b70aaee9eec2a127a3369f1ee62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3ho0AsQqUL84n3w1jd061Kn5/5Oj6lVB7bxf46SJCuW/ptnXq3ETaCNM7Cd3JaiLooR/VaN+5b7kqxEtXJNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:25:13.331379Z","bundle_sha256":"df4fcd9ef7774fd7999404dba758ebcfc21a1a511e11b06d7bf9ed591c92c64c"}}