{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IJEMI3SQYXVFN2GCX3VPON6OFU","short_pith_number":"pith:IJEMI3SQ","schema_version":"1.0","canonical_sha256":"4248c46e50c5ea56e8c2beeaf737ce2d0a8836ddba0965a013e10e663c4ad9c4","source":{"kind":"arxiv","id":"1504.01014","version":3},"attestation_state":"computed","paper":{"title":"Discrete uncertainty principles and sparse signal processing","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Afonso S. Bandeira, Dustin G. Mixon, Megan E. Lewis","submitted_at":"2015-04-04T15:09:41Z","abstract_excerpt":"We develop new discrete uncertainty principles in terms of numerical sparsity, which is a continuous proxy for the 0-norm. Unlike traditional sparsity, the continuity of numerical sparsity naturally accommodates functions which are nearly sparse. After studying these principles and the functions that achieve exact or near equality in them, we identify certain consequences in a number of sparse signal processing applications."},"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":"1504.01014","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T15:09:41Z","cross_cats_sorted":["math.FA","math.IT"],"title_canon_sha256":"46557bb0e25ea4c89897a273a6314bdbdb65916d790767a2548da4a1b2b3c14d","abstract_canon_sha256":"25b938e83e08c9098478c107d7dba2d023f0732752a7cd4428b94f3db51d8adc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:43.839284Z","signature_b64":"8VVEGDlUpl9JCh4YHET81Z42Z86U3v0vVk9iYKGL2cXlr8IV8lsPca109+yy1ZvVe8BmPOq7NQBF5692SsFBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4248c46e50c5ea56e8c2beeaf737ce2d0a8836ddba0965a013e10e663c4ad9c4","last_reissued_at":"2026-05-18T00:43:43.838622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:43.838622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete uncertainty principles and sparse signal processing","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Afonso S. Bandeira, Dustin G. Mixon, Megan E. Lewis","submitted_at":"2015-04-04T15:09:41Z","abstract_excerpt":"We develop new discrete uncertainty principles in terms of numerical sparsity, which is a continuous proxy for the 0-norm. Unlike traditional sparsity, the continuity of numerical sparsity naturally accommodates functions which are nearly sparse. After studying these principles and the functions that achieve exact or near equality in them, we identify certain consequences in a number of sparse signal processing applications."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01014","kind":"arxiv","version":3},"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":"1504.01014","created_at":"2026-05-18T00:43:43.838742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01014v3","created_at":"2026-05-18T00:43:43.838742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01014","created_at":"2026-05-18T00:43:43.838742+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJEMI3SQYXVF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJEMI3SQYXVFN2GC","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJEMI3SQ","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21292","citing_title":"Large values in time series and additive combinatorics","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU","json":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU.json","graph_json":"https://pith.science/api/pith-number/IJEMI3SQYXVFN2GCX3VPON6OFU/graph.json","events_json":"https://pith.science/api/pith-number/IJEMI3SQYXVFN2GCX3VPON6OFU/events.json","paper":"https://pith.science/paper/IJEMI3SQ"},"agent_actions":{"view_html":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU","download_json":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU.json","view_paper":"https://pith.science/paper/IJEMI3SQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01014&json=true","fetch_graph":"https://pith.science/api/pith-number/IJEMI3SQYXVFN2GCX3VPON6OFU/graph.json","fetch_events":"https://pith.science/api/pith-number/IJEMI3SQYXVFN2GCX3VPON6OFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU/action/storage_attestation","attest_author":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU/action/author_attestation","sign_citation":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU/action/citation_signature","submit_replication":"https://pith.science/pith/IJEMI3SQYXVFN2GCX3VPON6OFU/action/replication_record"}},"created_at":"2026-05-18T00:43:43.838742+00:00","updated_at":"2026-05-18T00:43:43.838742+00:00"}