{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z3WFH545ZXUZAL3B5V4P3WMHG7","short_pith_number":"pith:Z3WFH545","schema_version":"1.0","canonical_sha256":"ceec53f79dcde9902f61ed78fdd98737d62214d66c144b55cd163fde6c00018c","source":{"kind":"arxiv","id":"1611.07971","version":3},"attestation_state":"computed","paper":{"title":"Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jon O\\~nativia, Pier Luigi Dragotti, Yue M. Lu","submitted_at":"2016-11-23T20:56:10Z","abstract_excerpt":"Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem when the underlying dictionary is the union of a Vandermonde matrix and a banded matrix. Unlike our previous work which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper presents a probabilistic average-case analysis of the algorithm. Based on a generating-function approach, closed-form expressions for the exact "},"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":"1611.07971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-23T20:56:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b98b7ccdb6b68f11223b3f7984b666533ba5b8e9c654a0d1eaea029a32df52dd","abstract_canon_sha256":"5773fe6bc608dd07282b417061e355441e141579b95f784cf7148e517c58f315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:40.786948Z","signature_b64":"rFvvxMmEUCyysqri0ovOJmDxv9MRL3oyx9+z6gULVTEoCKDwGYf5iVtYrxsku/QW68bed2S8/bBA1gAX/DbPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceec53f79dcde9902f61ed78fdd98737d62214d66c144b55cd163fde6c00018c","last_reissued_at":"2026-05-18T00:40:40.786218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:40.786218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jon O\\~nativia, Pier Luigi Dragotti, Yue M. Lu","submitted_at":"2016-11-23T20:56:10Z","abstract_excerpt":"Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem when the underlying dictionary is the union of a Vandermonde matrix and a banded matrix. Unlike our previous work which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper presents a probabilistic average-case analysis of the algorithm. Based on a generating-function approach, closed-form expressions for the exact "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07971","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":"1611.07971","created_at":"2026-05-18T00:40:40.786347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07971v3","created_at":"2026-05-18T00:40:40.786347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07971","created_at":"2026-05-18T00:40:40.786347+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3WFH545ZXUZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3WFH545ZXUZAL3B","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3WFH545","created_at":"2026-05-18T12:30:53.716459+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/Z3WFH545ZXUZAL3B5V4P3WMHG7","json":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7.json","graph_json":"https://pith.science/api/pith-number/Z3WFH545ZXUZAL3B5V4P3WMHG7/graph.json","events_json":"https://pith.science/api/pith-number/Z3WFH545ZXUZAL3B5V4P3WMHG7/events.json","paper":"https://pith.science/paper/Z3WFH545"},"agent_actions":{"view_html":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7","download_json":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7.json","view_paper":"https://pith.science/paper/Z3WFH545","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07971&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3WFH545ZXUZAL3B5V4P3WMHG7/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3WFH545ZXUZAL3B5V4P3WMHG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7/action/storage_attestation","attest_author":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7/action/author_attestation","sign_citation":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7/action/citation_signature","submit_replication":"https://pith.science/pith/Z3WFH545ZXUZAL3B5V4P3WMHG7/action/replication_record"}},"created_at":"2026-05-18T00:40:40.786347+00:00","updated_at":"2026-05-18T00:40:40.786347+00:00"}