{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R5CHXQ7452XFIJSHWA3ZD3ZK3H","short_pith_number":"pith:R5CHXQ74","schema_version":"1.0","canonical_sha256":"8f447bc3fceeae542647b03791ef2ad9fd29a88bd486a50453bc0d2d9e3e5fd1","source":{"kind":"arxiv","id":"1612.04464","version":4},"attestation_state":"computed","paper":{"title":"Frames and numerical approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ben Adcock, Daan Huybrechs","submitted_at":"2016-12-14T02:49:06Z","abstract_excerpt":"Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using the more general notion of frames: that is, complete systems that are generally redundant but provide infinite representations with bounded coefficients. While frames are well-known in image and signal processing, coding theory and other areas of applied mathematics, their use in numerical analysis is far less widespread. Yet, as we show via a series of examp"},"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":"1612.04464","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-14T02:49:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"f5bb7e3d4ece2260c69fe3f6c395149a4e63f5c33c37b10a9af71ac37e4aa9da","abstract_canon_sha256":"2b31f8a0f8d3ab7b29a19f3fb5418c7be10a407ea3b0d6c753802ec0422f9ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:30.688448Z","signature_b64":"8FGdKNUHjIKWkDxd2UhtQCU8byabH30c+eIuaxsHRuR0GahdEAb7Q9VV3FoAbDnJhGEBMS/S0w7eDc/rcJ91DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f447bc3fceeae542647b03791ef2ad9fd29a88bd486a50453bc0d2d9e3e5fd1","last_reissued_at":"2026-05-18T00:01:30.688041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:30.688041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frames and numerical approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ben Adcock, Daan Huybrechs","submitted_at":"2016-12-14T02:49:06Z","abstract_excerpt":"Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using the more general notion of frames: that is, complete systems that are generally redundant but provide infinite representations with bounded coefficients. While frames are well-known in image and signal processing, coding theory and other areas of applied mathematics, their use in numerical analysis is far less widespread. Yet, as we show via a series of examp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04464","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":"1612.04464","created_at":"2026-05-18T00:01:30.688102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04464v4","created_at":"2026-05-18T00:01:30.688102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04464","created_at":"2026-05-18T00:01:30.688102+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5CHXQ7452XF","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5CHXQ7452XFIJSH","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5CHXQ74","created_at":"2026-05-18T12:30:41.710351+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/R5CHXQ7452XFIJSHWA3ZD3ZK3H","json":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H.json","graph_json":"https://pith.science/api/pith-number/R5CHXQ7452XFIJSHWA3ZD3ZK3H/graph.json","events_json":"https://pith.science/api/pith-number/R5CHXQ7452XFIJSHWA3ZD3ZK3H/events.json","paper":"https://pith.science/paper/R5CHXQ74"},"agent_actions":{"view_html":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H","download_json":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H.json","view_paper":"https://pith.science/paper/R5CHXQ74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04464&json=true","fetch_graph":"https://pith.science/api/pith-number/R5CHXQ7452XFIJSHWA3ZD3ZK3H/graph.json","fetch_events":"https://pith.science/api/pith-number/R5CHXQ7452XFIJSHWA3ZD3ZK3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H/action/storage_attestation","attest_author":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H/action/author_attestation","sign_citation":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H/action/citation_signature","submit_replication":"https://pith.science/pith/R5CHXQ7452XFIJSHWA3ZD3ZK3H/action/replication_record"}},"created_at":"2026-05-18T00:01:30.688102+00:00","updated_at":"2026-05-18T00:01:30.688102+00:00"}