{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VVISH4NX5VDOCS6MEAYCSZSBFQ","short_pith_number":"pith:VVISH4NX","schema_version":"1.0","canonical_sha256":"ad5123f1b7ed46e14bcc20302966412c17cd75e8581f7f2a508c85a440e80534","source":{"kind":"arxiv","id":"1705.04567","version":3},"attestation_state":"computed","paper":{"title":"Optimal Monte Carlo Methods for $L^2$-Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Krieg","submitted_at":"2017-05-12T13:46:35Z","abstract_excerpt":"We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the preasymptotic behavior of the error of any algorithm sampling $n$ pieces of arbitrary linear information, including function values."},"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":"1705.04567","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-12T13:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"3515e08f4c5f3a2dc115b360ea3c52e66b458265ce46423577a611d6d3a12fdd","abstract_canon_sha256":"5f301a77b4611d8e40742d8d93e0727a261a32046076854e4ca8edf198ce1da1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.443798Z","signature_b64":"BqAK6QmUPMqgqGXmN+e6z4mBpe1ekzyXYcZSfidvHMy5CUt105EV6XEtiLX65mdeCWZrmMX8b3CUI/793GVfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5123f1b7ed46e14bcc20302966412c17cd75e8581f7f2a508c85a440e80534","last_reissued_at":"2026-05-18T00:20:56.443355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.443355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Monte Carlo Methods for $L^2$-Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Krieg","submitted_at":"2017-05-12T13:46:35Z","abstract_excerpt":"We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the preasymptotic behavior of the error of any algorithm sampling $n$ pieces of arbitrary linear information, including function values."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04567","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":""},"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":"1705.04567","created_at":"2026-05-18T00:20:56.443425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04567v3","created_at":"2026-05-18T00:20:56.443425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04567","created_at":"2026-05-18T00:20:56.443425+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVISH4NX5VDO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVISH4NX5VDOCS6M","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVISH4NX","created_at":"2026-05-18T12:31:49.984773+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/VVISH4NX5VDOCS6MEAYCSZSBFQ","json":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ.json","graph_json":"https://pith.science/api/pith-number/VVISH4NX5VDOCS6MEAYCSZSBFQ/graph.json","events_json":"https://pith.science/api/pith-number/VVISH4NX5VDOCS6MEAYCSZSBFQ/events.json","paper":"https://pith.science/paper/VVISH4NX"},"agent_actions":{"view_html":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ","download_json":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ.json","view_paper":"https://pith.science/paper/VVISH4NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04567&json=true","fetch_graph":"https://pith.science/api/pith-number/VVISH4NX5VDOCS6MEAYCSZSBFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VVISH4NX5VDOCS6MEAYCSZSBFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ/action/storage_attestation","attest_author":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ/action/author_attestation","sign_citation":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ/action/citation_signature","submit_replication":"https://pith.science/pith/VVISH4NX5VDOCS6MEAYCSZSBFQ/action/replication_record"}},"created_at":"2026-05-18T00:20:56.443425+00:00","updated_at":"2026-05-18T00:20:56.443425+00:00"}