{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GEQB7ZITWYOGPE7BE6SRR6FTS5","short_pith_number":"pith:GEQB7ZIT","schema_version":"1.0","canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","source":{"kind":"arxiv","id":"1704.08213","version":1},"attestation_state":"computed","paper":{"title":"High-Dimensional Function Approximation: Breaking the Curse with Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert J. Kunsch","submitted_at":"2017-04-26T16:56:10Z","abstract_excerpt":"In this dissertation we study the tractability of the information-based complexity $n(\\varepsilon,d)$ for $d$-variate function approximation problems. In the deterministic setting for many unweighted problems the curse of dimensionality holds, that means, for some fixed error tolerance $\\varepsilon>0$ the complexity $n(\\varepsilon,d)$ grows exponentially in $d$. For integration problems one can usually break the curse with the standard Monte Carlo method. For function approximation problems, however, similar effects of randomization have been unknown so far.\n  The thesis contains results on th"},"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":"1704.08213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-26T16:56:10Z","cross_cats_sorted":[],"title_canon_sha256":"8399db283fbb76d9d749584d1aa3ac506bdc1fa4d4fdea8c548c7a5c87bace38","abstract_canon_sha256":"cbc019dd591c839865fc6b83a95f6905034eead549dc021c14c206841d68ff1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.916715Z","signature_b64":"g/nBN6MECwhA3QhuzT15FAI2PiWeNALOmy/yIBEFYfMsXxkZNRIDW05rR0Px3CFpevA3+Tq65doEVrIv0VIuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","last_reissued_at":"2026-05-18T00:45:30.916251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.916251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Function Approximation: Breaking the Curse with Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert J. Kunsch","submitted_at":"2017-04-26T16:56:10Z","abstract_excerpt":"In this dissertation we study the tractability of the information-based complexity $n(\\varepsilon,d)$ for $d$-variate function approximation problems. In the deterministic setting for many unweighted problems the curse of dimensionality holds, that means, for some fixed error tolerance $\\varepsilon>0$ the complexity $n(\\varepsilon,d)$ grows exponentially in $d$. For integration problems one can usually break the curse with the standard Monte Carlo method. For function approximation problems, however, similar effects of randomization have been unknown so far.\n  The thesis contains results on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08213","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":"1704.08213","created_at":"2026-05-18T00:45:30.916325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08213v1","created_at":"2026-05-18T00:45:30.916325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08213","created_at":"2026-05-18T00:45:30.916325+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEQB7ZITWYOG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEQB7ZITWYOGPE7B","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEQB7ZIT","created_at":"2026-05-18T12:31:15.632608+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/GEQB7ZITWYOGPE7BE6SRR6FTS5","json":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5.json","graph_json":"https://pith.science/api/pith-number/GEQB7ZITWYOGPE7BE6SRR6FTS5/graph.json","events_json":"https://pith.science/api/pith-number/GEQB7ZITWYOGPE7BE6SRR6FTS5/events.json","paper":"https://pith.science/paper/GEQB7ZIT"},"agent_actions":{"view_html":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5","download_json":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5.json","view_paper":"https://pith.science/paper/GEQB7ZIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08213&json=true","fetch_graph":"https://pith.science/api/pith-number/GEQB7ZITWYOGPE7BE6SRR6FTS5/graph.json","fetch_events":"https://pith.science/api/pith-number/GEQB7ZITWYOGPE7BE6SRR6FTS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/action/storage_attestation","attest_author":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/action/author_attestation","sign_citation":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/action/citation_signature","submit_replication":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/action/replication_record"}},"created_at":"2026-05-18T00:45:30.916325+00:00","updated_at":"2026-05-18T00:45:30.916325+00:00"}