{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NQE2B647KRWJDFJM37F5RYQBCD","short_pith_number":"pith:NQE2B647","schema_version":"1.0","canonical_sha256":"6c09a0fb9f546c91952cdfcbd8e20110fe0cd29935dc23254cd1e8764e883841","source":{"kind":"arxiv","id":"1009.3663","version":3},"attestation_state":"computed","paper":{"title":"Optimally Sparse Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT"],"primary_cat":"math.NA","authors_text":"Andreas Heinecke, Felix Krahmer, Gitta Kutyniok, Peter G. Casazza","submitted_at":"2010-09-19T22:00:04Z","abstract_excerpt":"Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. However, when the signal dimension is large, the computation of the frame measurements of a signal typically requires a large number of additions and multiplications, and this makes a frame decomposition intractable in applications with limited computing budget. To address this problem, in this paper, we focus on frames in finite-dimensional Hilbert spaces and introduce sparsity for such frames as a new paradigm. In our t"},"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":"1009.3663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-19T22:00:04Z","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"title_canon_sha256":"28e64a56890083eb7139b85e31cc038995b9b0ffb3dd27dfc310c6ccf78a5974","abstract_canon_sha256":"2998a1a377bab45e57677b43dfd67c8f35bb6aac4ab6a551d48d19e4be78fcb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.314083Z","signature_b64":"jfPXDIYOLvaTA3NpBShCbgTUBnfQXOIFsA5OgYXHzxF/TuOPTHY5elkjqSzN+WfLEEw/QAD/P2ao2NC/IKLcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c09a0fb9f546c91952cdfcbd8e20110fe0cd29935dc23254cd1e8764e883841","last_reissued_at":"2026-05-18T04:19:12.313616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.313616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Sparse Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT"],"primary_cat":"math.NA","authors_text":"Andreas Heinecke, Felix Krahmer, Gitta Kutyniok, Peter G. Casazza","submitted_at":"2010-09-19T22:00:04Z","abstract_excerpt":"Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. However, when the signal dimension is large, the computation of the frame measurements of a signal typically requires a large number of additions and multiplications, and this makes a frame decomposition intractable in applications with limited computing budget. To address this problem, in this paper, we focus on frames in finite-dimensional Hilbert spaces and introduce sparsity for such frames as a new paradigm. In our t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3663","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":"1009.3663","created_at":"2026-05-18T04:19:12.313687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3663v3","created_at":"2026-05-18T04:19:12.313687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3663","created_at":"2026-05-18T04:19:12.313687+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQE2B647KRWJ","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQE2B647KRWJDFJM","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQE2B647","created_at":"2026-05-18T12:26:10.704358+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/NQE2B647KRWJDFJM37F5RYQBCD","json":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD.json","graph_json":"https://pith.science/api/pith-number/NQE2B647KRWJDFJM37F5RYQBCD/graph.json","events_json":"https://pith.science/api/pith-number/NQE2B647KRWJDFJM37F5RYQBCD/events.json","paper":"https://pith.science/paper/NQE2B647"},"agent_actions":{"view_html":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD","download_json":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD.json","view_paper":"https://pith.science/paper/NQE2B647","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3663&json=true","fetch_graph":"https://pith.science/api/pith-number/NQE2B647KRWJDFJM37F5RYQBCD/graph.json","fetch_events":"https://pith.science/api/pith-number/NQE2B647KRWJDFJM37F5RYQBCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD/action/storage_attestation","attest_author":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD/action/author_attestation","sign_citation":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD/action/citation_signature","submit_replication":"https://pith.science/pith/NQE2B647KRWJDFJM37F5RYQBCD/action/replication_record"}},"created_at":"2026-05-18T04:19:12.313687+00:00","updated_at":"2026-05-18T04:19:12.313687+00:00"}