{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GEQB7ZITWYOGPE7BE6SRR6FTS5","short_pith_number":"pith:GEQB7ZIT","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"},"canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","source":{"kind":"arxiv","id":"1704.08213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08213","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08213v1","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08213","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"GEQB7ZITWYOG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEQB7ZITWYOGPE7B","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEQB7ZIT","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GEQB7ZITWYOGPE7BE6SRR6FTS5","target":"record","payload":{"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"},"canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","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"},"source_kind":"arxiv","source_id":"1704.08213","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NaC9jRhnCDW+INt61etMj5c6YVpmDWGU2roO6BS4ZwbUyLWjBkLa0iVw4MRNroP3NdNKV2Wty6UfHT4DICBFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:11:17.388932Z"},"content_sha256":"fb0e8d03a6cd05e7a6998c7fd9ce69f7f53eff2b80563ab0a2974086ebc757e9","schema_version":"1.0","event_id":"sha256:fb0e8d03a6cd05e7a6998c7fd9ce69f7f53eff2b80563ab0a2974086ebc757e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GEQB7ZITWYOGPE7BE6SRR6FTS5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIWJyOFQ4+w6ui6ttc4AdVKhIW329ora+nqx6vt2Se+fhcIm5Q2LLgAPU/Y97B+/MGJWbnn+gL1hxRjC+2TXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:11:17.389354Z"},"content_sha256":"47d37e1b6cb80ba52d12b6f0720888640fbb61f4f779f4b16485b931179e5902","schema_version":"1.0","event_id":"sha256:47d37e1b6cb80ba52d12b6f0720888640fbb61f4f779f4b16485b931179e5902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/bundle.json","state_url":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T02:11:17Z","links":{"resolver":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5","bundle":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/bundle.json","state":"https://pith.science/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEQB7ZITWYOGPE7BE6SRR6FTS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GEQB7ZITWYOGPE7BE6SRR6FTS5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cbc019dd591c839865fc6b83a95f6905034eead549dc021c14c206841d68ff1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-26T16:56:10Z","title_canon_sha256":"8399db283fbb76d9d749584d1aa3ac506bdc1fa4d4fdea8c548c7a5c87bace38"},"schema_version":"1.0","source":{"id":"1704.08213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08213","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08213v1","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08213","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"GEQB7ZITWYOG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEQB7ZITWYOGPE7B","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEQB7ZIT","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:47d37e1b6cb80ba52d12b6f0720888640fbb61f4f779f4b16485b931179e5902","target":"graph","created_at":"2026-05-18T00:45:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Robert J. Kunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-26T16:56:10Z","title":"High-Dimensional Function Approximation: Breaking the Curse with Monte Carlo Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08213","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fb0e8d03a6cd05e7a6998c7fd9ce69f7f53eff2b80563ab0a2974086ebc757e9","target":"record","created_at":"2026-05-18T00:45:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cbc019dd591c839865fc6b83a95f6905034eead549dc021c14c206841d68ff1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-26T16:56:10Z","title_canon_sha256":"8399db283fbb76d9d749584d1aa3ac506bdc1fa4d4fdea8c548c7a5c87bace38"},"schema_version":"1.0","source":{"id":"1704.08213","kind":"arxiv","version":1}},"canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31201fe513b61c6793e127a518f8b3976cc46df3695ae55916b06e0f3bc5d49b","first_computed_at":"2026-05-18T00:45:30.916251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:30.916251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/nBN6MECwhA3QhuzT15FAI2PiWeNALOmy/yIBEFYfMsXxkZNRIDW05rR0Px3CFpevA3+Tq65doEVrIv0VIuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:30.916715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb0e8d03a6cd05e7a6998c7fd9ce69f7f53eff2b80563ab0a2974086ebc757e9","sha256:47d37e1b6cb80ba52d12b6f0720888640fbb61f4f779f4b16485b931179e5902"],"state_sha256":"3f83fd85efbbb5f03c6c5cdf0ecdd5eb7bcb028e9363eb890591a957abdcf8d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVLShuA+K6vRAAZ0oEdC4Oaj8lwlxe/5wHdUwd8N5b2cBGPBhj1k70ifoedwgwX6Vn7ULPvMbpEHyIELXmqwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:11:17.391429Z","bundle_sha256":"3ee8742672029e4c3dd0887b4ac9044ff8d04e79db92a5b1ecb61562052cdd35"}}