{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4RQ6N7ZYKIFAAHMXMQKNSSYCO7","short_pith_number":"pith:4RQ6N7ZY","schema_version":"1.0","canonical_sha256":"e461e6ff38520a001d976414d94b0277feff586812dce23480fb255eb1fdd521","source":{"kind":"arxiv","id":"1310.6011","version":2},"attestation_state":"computed","paper":{"title":"On Sparse Representation in Fourier and Local Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pier Luigi Dragotti, Yue M. Lu","submitted_at":"2013-10-22T18:56:34Z","abstract_excerpt":"We consider the classical problem of finding the sparse representation of a signal in a pair of bases. When both bases are orthogonal, it is known that the sparse representation is unique when the sparsity $K$ of the signal satisfies $K<1/\\mu(D)$, where $\\mu(D)$ is the mutual coherence of the dictionary. Furthermore, the sparse representation can be obtained in polynomial time by Basis Pursuit (BP), when $K<0.91/\\mu(D)$. Therefore, there is a gap between the unicity condition and the one required to use the polynomial-complexity BP formulation. For the case of general dictionaries, it is also "},"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":"1310.6011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-22T18:56:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b0e25d5312bb41a1030f506ac94d316aca78bcdf2a24bbea2bd9dfc493b580c","abstract_canon_sha256":"ea14e61c95a888915623890e3ccea26e3bfc6648d3ca4a758829f05265f0e27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.420012Z","signature_b64":"SN17D/P1dV/ojJ7HJQmBBnFiOOw2W+GROyl0lt1XTEC8jHLcRkaVs/dMdq9poXyoqOrtLoGzR5wOWJPflJFaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e461e6ff38520a001d976414d94b0277feff586812dce23480fb255eb1fdd521","last_reissued_at":"2026-05-18T02:50:50.419575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.419575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sparse Representation in Fourier and Local Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pier Luigi Dragotti, Yue M. Lu","submitted_at":"2013-10-22T18:56:34Z","abstract_excerpt":"We consider the classical problem of finding the sparse representation of a signal in a pair of bases. When both bases are orthogonal, it is known that the sparse representation is unique when the sparsity $K$ of the signal satisfies $K<1/\\mu(D)$, where $\\mu(D)$ is the mutual coherence of the dictionary. Furthermore, the sparse representation can be obtained in polynomial time by Basis Pursuit (BP), when $K<0.91/\\mu(D)$. Therefore, there is a gap between the unicity condition and the one required to use the polynomial-complexity BP formulation. For the case of general dictionaries, it is also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6011","kind":"arxiv","version":2},"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":"1310.6011","created_at":"2026-05-18T02:50:50.419640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6011v2","created_at":"2026-05-18T02:50:50.419640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6011","created_at":"2026-05-18T02:50:50.419640+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RQ6N7ZYKIFA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RQ6N7ZYKIFAAHMX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RQ6N7ZY","created_at":"2026-05-18T12:27:34.582898+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/4RQ6N7ZYKIFAAHMXMQKNSSYCO7","json":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7.json","graph_json":"https://pith.science/api/pith-number/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/graph.json","events_json":"https://pith.science/api/pith-number/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/events.json","paper":"https://pith.science/paper/4RQ6N7ZY"},"agent_actions":{"view_html":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7","download_json":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7.json","view_paper":"https://pith.science/paper/4RQ6N7ZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6011&json=true","fetch_graph":"https://pith.science/api/pith-number/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/graph.json","fetch_events":"https://pith.science/api/pith-number/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/action/storage_attestation","attest_author":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/action/author_attestation","sign_citation":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/action/citation_signature","submit_replication":"https://pith.science/pith/4RQ6N7ZYKIFAAHMXMQKNSSYCO7/action/replication_record"}},"created_at":"2026-05-18T02:50:50.419640+00:00","updated_at":"2026-05-18T02:50:50.419640+00:00"}