{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TLTVPFHBQDVHWFAD5FNWIMLGWV","short_pith_number":"pith:TLTVPFHB","schema_version":"1.0","canonical_sha256":"9ae75794e180ea7b1403e95b643166b54275eca23da8f43b8361f8b368881bdd","source":{"kind":"arxiv","id":"1803.04218","version":1},"attestation_state":"computed","paper":{"title":"Compressed Sensing for Analog Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Axel Flinth, Bernard G. Bodmann, Gitta Kutyniok","submitted_at":"2018-03-12T12:30:06Z","abstract_excerpt":"In this paper we develop a general theory of compressed sensing for analog signals, in close similarity to prior results for vectors in finite dimensional spaces that are sparse in a given orthonormal basis. The signals are modeled by functions in a reproducing kernel Hilbert space. Sparsity is defined as the minimal number of terms in expansions based on the kernel functions. Minimizing this number is under certain conditions equivalent to minimizing an atomic norm, the pre-dual of the supremum norm for functions in the Hilbert space. The norm minimizer is shown to exist based on a compactnes"},"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":"1803.04218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-03-12T12:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"db03b4201c9ffe79fc8a518f41b16def7f9b311f641355ee7b907ce28f25f49b","abstract_canon_sha256":"fd2e4bbd9e405537dfd1f84f074683d2437d8298ab9392497be5b914d160bebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:32.271137Z","signature_b64":"TLArF5ho9eecT8jorB20Q/wUB39KNnDcJJFoX36AcBZHGCNpnkkzOks8BnLE2zzNyc62ciXzUjspYEPgp1HqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae75794e180ea7b1403e95b643166b54275eca23da8f43b8361f8b368881bdd","last_reissued_at":"2026-05-18T00:21:32.270549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:32.270549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Sensing for Analog Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Axel Flinth, Bernard G. Bodmann, Gitta Kutyniok","submitted_at":"2018-03-12T12:30:06Z","abstract_excerpt":"In this paper we develop a general theory of compressed sensing for analog signals, in close similarity to prior results for vectors in finite dimensional spaces that are sparse in a given orthonormal basis. The signals are modeled by functions in a reproducing kernel Hilbert space. Sparsity is defined as the minimal number of terms in expansions based on the kernel functions. Minimizing this number is under certain conditions equivalent to minimizing an atomic norm, the pre-dual of the supremum norm for functions in the Hilbert space. The norm minimizer is shown to exist based on a compactnes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04218","kind":"arxiv","version":1},"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":"1803.04218","created_at":"2026-05-18T00:21:32.270640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04218v1","created_at":"2026-05-18T00:21:32.270640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04218","created_at":"2026-05-18T00:21:32.270640+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLTVPFHBQDVH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLTVPFHBQDVHWFAD","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLTVPFHB","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09919","citing_title":"On the linear convergence rates of exchange and continuous methods for total variation minimization","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV","json":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV.json","graph_json":"https://pith.science/api/pith-number/TLTVPFHBQDVHWFAD5FNWIMLGWV/graph.json","events_json":"https://pith.science/api/pith-number/TLTVPFHBQDVHWFAD5FNWIMLGWV/events.json","paper":"https://pith.science/paper/TLTVPFHB"},"agent_actions":{"view_html":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV","download_json":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV.json","view_paper":"https://pith.science/paper/TLTVPFHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04218&json=true","fetch_graph":"https://pith.science/api/pith-number/TLTVPFHBQDVHWFAD5FNWIMLGWV/graph.json","fetch_events":"https://pith.science/api/pith-number/TLTVPFHBQDVHWFAD5FNWIMLGWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV/action/storage_attestation","attest_author":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV/action/author_attestation","sign_citation":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV/action/citation_signature","submit_replication":"https://pith.science/pith/TLTVPFHBQDVHWFAD5FNWIMLGWV/action/replication_record"}},"created_at":"2026-05-18T00:21:32.270640+00:00","updated_at":"2026-05-18T00:21:32.270640+00:00"}