{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HNW4GTGWHXONL67PBLBBCF76J3","short_pith_number":"pith:HNW4GTGW","schema_version":"1.0","canonical_sha256":"3b6dc34cd63ddcd5fbef0ac21117fe4ed62e4fa78703fb3fb5d5bb9803e1dc99","source":{"kind":"arxiv","id":"1802.01950","version":3},"attestation_state":"computed","paper":{"title":"Frames and numerical approximation II: generalized sampling","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":"2018-02-06T14:03:19Z","abstract_excerpt":"In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but ill-conditioning often prevents the numerical computation of best approximations. We showed that, in spite of said ill-conditioning, approximations with regularization may still provide accuracy up to order $\\sqrt{\\epsilon}$, where $\\epsilon$ is a small truncation threshold. When using frames, i.e. complete systems that are generally redundant but which provide i"},"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":"1802.01950","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-02-06T14:03:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"eb8f1d00c89202c5e2b4fba6279a4eff1ee292b759d4010b431f4e2589b63eaf","abstract_canon_sha256":"8f317793364068e20f8b1cf594a6993bb10adac1c2c64edf1d2f93872f3be395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:36.660495Z","signature_b64":"mpNzmAhUzjXHvd3KNKojeeYNFPsgydkEMcWtZkLgApp1REX9FBmdKTym4V7E4ueq57ubOeDc2f5jUIsp7fGPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6dc34cd63ddcd5fbef0ac21117fe4ed62e4fa78703fb3fb5d5bb9803e1dc99","last_reissued_at":"2026-07-05T01:17:36.660113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:36.660113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frames and numerical approximation II: generalized sampling","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":"2018-02-06T14:03:19Z","abstract_excerpt":"In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but ill-conditioning often prevents the numerical computation of best approximations. We showed that, in spite of said ill-conditioning, approximations with regularization may still provide accuracy up to order $\\sqrt{\\epsilon}$, where $\\epsilon$ is a small truncation threshold. When using frames, i.e. complete systems that are generally redundant but which provide i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01950","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1802.01950/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1802.01950","created_at":"2026-07-05T01:17:36.660168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01950v3","created_at":"2026-07-05T01:17:36.660168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01950","created_at":"2026-07-05T01:17:36.660168+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNW4GTGWHXON","created_at":"2026-07-05T01:17:36.660168+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNW4GTGWHXONL67P","created_at":"2026-07-05T01:17:36.660168+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNW4GTGW","created_at":"2026-07-05T01:17:36.660168+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01249","citing_title":"Near-optimal sampling strategies for multivariate function approximation on general domains","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3","json":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3.json","graph_json":"https://pith.science/api/pith-number/HNW4GTGWHXONL67PBLBBCF76J3/graph.json","events_json":"https://pith.science/api/pith-number/HNW4GTGWHXONL67PBLBBCF76J3/events.json","paper":"https://pith.science/paper/HNW4GTGW"},"agent_actions":{"view_html":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3","download_json":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3.json","view_paper":"https://pith.science/paper/HNW4GTGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01950&json=true","fetch_graph":"https://pith.science/api/pith-number/HNW4GTGWHXONL67PBLBBCF76J3/graph.json","fetch_events":"https://pith.science/api/pith-number/HNW4GTGWHXONL67PBLBBCF76J3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3/action/storage_attestation","attest_author":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3/action/author_attestation","sign_citation":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3/action/citation_signature","submit_replication":"https://pith.science/pith/HNW4GTGWHXONL67PBLBBCF76J3/action/replication_record"}},"created_at":"2026-07-05T01:17:36.660168+00:00","updated_at":"2026-07-05T01:17:36.660168+00:00"}