{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K6SOV3KES2SRYIHOESDM7GUXXN","short_pith_number":"pith:K6SOV3KE","schema_version":"1.0","canonical_sha256":"57a4eaed4496a51c20ee2486cf9a97bb513976b3c7eb9f5879ed1231bfeec267","source":{"kind":"arxiv","id":"1302.0561","version":4},"attestation_state":"computed","paper":{"title":"Breaking the coherence barrier: A new theory for compressed sensing","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Anders C. Hansen, Ben Adcock, Bogdan Roman, Clarice Poon","submitted_at":"2013-02-04T01:07:22Z","abstract_excerpt":"This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces a mathematical framework that generalizes the three standard pillars of compressed sensing - namely, sparsity, incoherence and uniform random subsampling - to three new concepts: asymptotic sparsity, asymptotic incoherence and multilevel random sampling. The new theorems show that compressed sensing is also possible, and reveals several advantages, under these substantially relaxed conditions. The importance of this is thre"},"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":"1302.0561","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T01:07:22Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"23551a681d1d836b7af9bf02fa35af4f8482519ec05f14e29729987a8c63b249","abstract_canon_sha256":"b152b798bd3795549f756aed9e126b8bbc8df40b125f790a010ddaeb1b2c2641"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:18.440491Z","signature_b64":"duBKzkk3cR1lFra/nW5KpX/Mgi/k1aMnWRe8RFO4wKjQYFazDdlrrUGEA74SIGj8vgKzBiFAo8HMQ49dj2flAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a4eaed4496a51c20ee2486cf9a97bb513976b3c7eb9f5879ed1231bfeec267","last_reissued_at":"2026-05-18T02:49:18.439900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:18.439900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the coherence barrier: A new theory for compressed sensing","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Anders C. Hansen, Ben Adcock, Bogdan Roman, Clarice Poon","submitted_at":"2013-02-04T01:07:22Z","abstract_excerpt":"This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces a mathematical framework that generalizes the three standard pillars of compressed sensing - namely, sparsity, incoherence and uniform random subsampling - to three new concepts: asymptotic sparsity, asymptotic incoherence and multilevel random sampling. The new theorems show that compressed sensing is also possible, and reveals several advantages, under these substantially relaxed conditions. The importance of this is thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0561","kind":"arxiv","version":4},"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":"1302.0561","created_at":"2026-05-18T02:49:18.440007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0561v4","created_at":"2026-05-18T02:49:18.440007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0561","created_at":"2026-05-18T02:49:18.440007+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6SOV3KES2SR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6SOV3KES2SRYIHO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6SOV3KE","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07396","citing_title":"Sparse recovery guarantees for block orthogonal binary matrices constructed via Generalized Euler Squares","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN","json":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN.json","graph_json":"https://pith.science/api/pith-number/K6SOV3KES2SRYIHOESDM7GUXXN/graph.json","events_json":"https://pith.science/api/pith-number/K6SOV3KES2SRYIHOESDM7GUXXN/events.json","paper":"https://pith.science/paper/K6SOV3KE"},"agent_actions":{"view_html":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN","download_json":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN.json","view_paper":"https://pith.science/paper/K6SOV3KE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0561&json=true","fetch_graph":"https://pith.science/api/pith-number/K6SOV3KES2SRYIHOESDM7GUXXN/graph.json","fetch_events":"https://pith.science/api/pith-number/K6SOV3KES2SRYIHOESDM7GUXXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN/action/storage_attestation","attest_author":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN/action/author_attestation","sign_citation":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN/action/citation_signature","submit_replication":"https://pith.science/pith/K6SOV3KES2SRYIHOESDM7GUXXN/action/replication_record"}},"created_at":"2026-05-18T02:49:18.440007+00:00","updated_at":"2026-05-18T02:49:18.440007+00:00"}