{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JPYLNS4OG2OVHCSUQU4R7VINKJ","short_pith_number":"pith:JPYLNS4O","schema_version":"1.0","canonical_sha256":"4bf0b6cb8e369d538a5485391fd50d52756dbec8662afa16065f88d660834297","source":{"kind":"arxiv","id":"1503.02352","version":4},"attestation_state":"computed","paper":{"title":"Infinite-dimensional $\\ell^1$ minimization and function approximation from pointwise data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.NA","authors_text":"Ben Adcock","submitted_at":"2015-03-09T01:10:29Z","abstract_excerpt":"We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three advantages of this approach are as follows. First, it provides interpolatory approximations in the absence of noise. Second, it does not require \\textit{a priori} bounds on the expansion tail in order to be implemented. In particular, the truncation strategy we introduce as part of this framework is independent of the function being approximated, provided the "},"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":"1503.02352","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-09T01:10:29Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"9e5e9efd300c02240c762c2db29eeae556371afdf68ae4894042da795956bd51","abstract_canon_sha256":"6d90a45c0f5677f1200fcfb2f4de7901dcce062b97e3836286d9dbea93c77e58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.284950Z","signature_b64":"6U3OKqQ7Q/m/h9EE6NN2GGbeiwn8BZ4jzOqseblmeFu0qaw4dZ2eYbxqXgseFLMzKO+LNV3oAhcy440XgGjMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bf0b6cb8e369d538a5485391fd50d52756dbec8662afa16065f88d660834297","last_reissued_at":"2026-05-18T00:54:58.284482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.284482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite-dimensional $\\ell^1$ minimization and function approximation from pointwise data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.NA","authors_text":"Ben Adcock","submitted_at":"2015-03-09T01:10:29Z","abstract_excerpt":"We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three advantages of this approach are as follows. First, it provides interpolatory approximations in the absence of noise. Second, it does not require \\textit{a priori} bounds on the expansion tail in order to be implemented. In particular, the truncation strategy we introduce as part of this framework is independent of the function being approximated, provided the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02352","kind":"arxiv","version":4},"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":"1503.02352","created_at":"2026-05-18T00:54:58.284573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02352v4","created_at":"2026-05-18T00:54:58.284573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02352","created_at":"2026-05-18T00:54:58.284573+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPYLNS4OG2OV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPYLNS4OG2OVHCSU","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPYLNS4O","created_at":"2026-05-18T12:29:27.538025+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/JPYLNS4OG2OVHCSUQU4R7VINKJ","json":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ.json","graph_json":"https://pith.science/api/pith-number/JPYLNS4OG2OVHCSUQU4R7VINKJ/graph.json","events_json":"https://pith.science/api/pith-number/JPYLNS4OG2OVHCSUQU4R7VINKJ/events.json","paper":"https://pith.science/paper/JPYLNS4O"},"agent_actions":{"view_html":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ","download_json":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ.json","view_paper":"https://pith.science/paper/JPYLNS4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02352&json=true","fetch_graph":"https://pith.science/api/pith-number/JPYLNS4OG2OVHCSUQU4R7VINKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JPYLNS4OG2OVHCSUQU4R7VINKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ/action/storage_attestation","attest_author":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ/action/author_attestation","sign_citation":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ/action/citation_signature","submit_replication":"https://pith.science/pith/JPYLNS4OG2OVHCSUQU4R7VINKJ/action/replication_record"}},"created_at":"2026-05-18T00:54:58.284573+00:00","updated_at":"2026-05-18T00:54:58.284573+00:00"}