{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NTILMP6X4Y6FHILE7U5QQ3VXRP","short_pith_number":"pith:NTILMP6X","schema_version":"1.0","canonical_sha256":"6cd0b63fd7e63c53a164fd3b086eb78bf8bd894fd89a76e500257c8e831cfdae","source":{"kind":"arxiv","id":"2506.24054","version":1},"attestation_state":"computed","paper":{"title":"Sparse grids vs. random points for high-dimensional polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Elias Mindlberger, Jakob Eggl, Mario Ullrich","submitted_at":"2025-06-30T16:59:26Z","abstract_excerpt":"We study polynomial approximation on a $d$-cube, where $d$ is large, and compare interpolation on sparse grids, aka Smolyak's algorithm (SA), with a simple least squares method based on randomly generated points (LS) using standard benchmark functions. Our main motivation is the influential paper [Barthelmann, Novak, Ritter: High dimensional polynomial interpolation on sparse grids, Adv. Comput. Math. 12, 2000]. We repeat and extend their theoretical analysis and numerical experiments for SA and compare to LS in dimensions up to 100. Our extensive experiments demonstrate that LS, even with onl"},"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":"2506.24054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-06-30T16:59:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d1d7981ef0b5b2b6852bbd2d2c0487f1a55538043a54fc39bd4a55d9d40f42ad","abstract_canon_sha256":"2ac61a6094917599615410176c1200c6588e89158a52f78b871b7ecc1624464e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:32.388593Z","signature_b64":"bOxCaeX4YGu8ibDINqXV+BJNmgN3+yuPolXWyBS589kUIdIK2NyjItzRlgPGYmMfDVZQjWG0zpTQTWBohSC5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd0b63fd7e63c53a164fd3b086eb78bf8bd894fd89a76e500257c8e831cfdae","last_reissued_at":"2026-07-05T11:29:32.388019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:32.388019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse grids vs. random points for high-dimensional polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Elias Mindlberger, Jakob Eggl, Mario Ullrich","submitted_at":"2025-06-30T16:59:26Z","abstract_excerpt":"We study polynomial approximation on a $d$-cube, where $d$ is large, and compare interpolation on sparse grids, aka Smolyak's algorithm (SA), with a simple least squares method based on randomly generated points (LS) using standard benchmark functions. Our main motivation is the influential paper [Barthelmann, Novak, Ritter: High dimensional polynomial interpolation on sparse grids, Adv. Comput. Math. 12, 2000]. We repeat and extend their theoretical analysis and numerical experiments for SA and compare to LS in dimensions up to 100. Our extensive experiments demonstrate that LS, even with onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.24054","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.24054/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":"2506.24054","created_at":"2026-07-05T11:29:32.388108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.24054v1","created_at":"2026-07-05T11:29:32.388108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.24054","created_at":"2026-07-05T11:29:32.388108+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTILMP6X4Y6F","created_at":"2026-07-05T11:29:32.388108+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTILMP6X4Y6FHILE","created_at":"2026-07-05T11:29:32.388108+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTILMP6X","created_at":"2026-07-05T11:29:32.388108+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/NTILMP6X4Y6FHILE7U5QQ3VXRP","json":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP.json","graph_json":"https://pith.science/api/pith-number/NTILMP6X4Y6FHILE7U5QQ3VXRP/graph.json","events_json":"https://pith.science/api/pith-number/NTILMP6X4Y6FHILE7U5QQ3VXRP/events.json","paper":"https://pith.science/paper/NTILMP6X"},"agent_actions":{"view_html":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP","download_json":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP.json","view_paper":"https://pith.science/paper/NTILMP6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.24054&json=true","fetch_graph":"https://pith.science/api/pith-number/NTILMP6X4Y6FHILE7U5QQ3VXRP/graph.json","fetch_events":"https://pith.science/api/pith-number/NTILMP6X4Y6FHILE7U5QQ3VXRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP/action/storage_attestation","attest_author":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP/action/author_attestation","sign_citation":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP/action/citation_signature","submit_replication":"https://pith.science/pith/NTILMP6X4Y6FHILE7U5QQ3VXRP/action/replication_record"}},"created_at":"2026-07-05T11:29:32.388108+00:00","updated_at":"2026-07-05T11:29:32.388108+00:00"}