{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JDVED46X6E6JKOIZUALR2YNJIB","short_pith_number":"pith:JDVED46X","schema_version":"1.0","canonical_sha256":"48ea41f3d7f13c953919a0171d61a94064ceacf5d54f3dcc2b3f1cf1a76c5fcb","source":{"kind":"arxiv","id":"1408.2773","version":3},"attestation_state":"computed","paper":{"title":"On Integration Methods Based on Scrambled Nets of Arbitrary Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"stat.CO","authors_text":"Mathieu Gerber","submitted_at":"2014-08-12T16:46:49Z","abstract_excerpt":"We consider the problem of evaluating $I(\\varphi):=\\int_{[0,1)^s}\\varphi(x) dx$ for a function $\\varphi \\in L^2[0,1)^{s}$. In situations where $I(\\varphi)$ can be approximated by an estimate of the form $N^{-1}\\sum_{n=0}^{N-1}\\varphi(x^n)$, with $\\{x^n\\}_{n=0}^{N-1}$ a point set in $[0,1)^s$, it is now well known that the $O_P(N^{-1/2})$ Monte Carlo convergence rate can be improved by taking for $\\{x^n\\}_{n=0}^{N-1}$ the first $N=\\lambda b^m$ points, $\\lambda\\in\\{1,\\dots,b-1\\}$, of a scrambled $(t,s)$-sequence in base $b\\geq 2$. In this paper we derive a bound for the variance of scrambled net"},"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":"1408.2773","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-08-12T16:46:49Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"511a48dcab6b064560187e4f8eebb8c4169c743290f6e938d81685fc54645b91","abstract_canon_sha256":"a5a0b296df87aead8c1bbab7137d2dbe04872a99c8edaf550965d72749c97afe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:53.253564Z","signature_b64":"vmwhoU8nAolNh5gRv4Yr7yPd03mYHAxWH+SzF/kQ4JRUlnHMA5J5z79RENPO1NeKumKHkUYYRMZxNw1/4exbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ea41f3d7f13c953919a0171d61a94064ceacf5d54f3dcc2b3f1cf1a76c5fcb","last_reissued_at":"2026-05-18T01:55:53.253137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:53.253137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integration Methods Based on Scrambled Nets of Arbitrary Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"stat.CO","authors_text":"Mathieu Gerber","submitted_at":"2014-08-12T16:46:49Z","abstract_excerpt":"We consider the problem of evaluating $I(\\varphi):=\\int_{[0,1)^s}\\varphi(x) dx$ for a function $\\varphi \\in L^2[0,1)^{s}$. In situations where $I(\\varphi)$ can be approximated by an estimate of the form $N^{-1}\\sum_{n=0}^{N-1}\\varphi(x^n)$, with $\\{x^n\\}_{n=0}^{N-1}$ a point set in $[0,1)^s$, it is now well known that the $O_P(N^{-1/2})$ Monte Carlo convergence rate can be improved by taking for $\\{x^n\\}_{n=0}^{N-1}$ the first $N=\\lambda b^m$ points, $\\lambda\\in\\{1,\\dots,b-1\\}$, of a scrambled $(t,s)$-sequence in base $b\\geq 2$. In this paper we derive a bound for the variance of scrambled net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2773","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":"1408.2773","created_at":"2026-05-18T01:55:53.253196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2773v3","created_at":"2026-05-18T01:55:53.253196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2773","created_at":"2026-05-18T01:55:53.253196+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDVED46X6E6J","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDVED46X6E6JKOIZ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDVED46X","created_at":"2026-05-18T12:28:33.132498+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/JDVED46X6E6JKOIZUALR2YNJIB","json":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB.json","graph_json":"https://pith.science/api/pith-number/JDVED46X6E6JKOIZUALR2YNJIB/graph.json","events_json":"https://pith.science/api/pith-number/JDVED46X6E6JKOIZUALR2YNJIB/events.json","paper":"https://pith.science/paper/JDVED46X"},"agent_actions":{"view_html":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB","download_json":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB.json","view_paper":"https://pith.science/paper/JDVED46X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2773&json=true","fetch_graph":"https://pith.science/api/pith-number/JDVED46X6E6JKOIZUALR2YNJIB/graph.json","fetch_events":"https://pith.science/api/pith-number/JDVED46X6E6JKOIZUALR2YNJIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB/action/storage_attestation","attest_author":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB/action/author_attestation","sign_citation":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB/action/citation_signature","submit_replication":"https://pith.science/pith/JDVED46X6E6JKOIZUALR2YNJIB/action/replication_record"}},"created_at":"2026-05-18T01:55:53.253196+00:00","updated_at":"2026-05-18T01:55:53.253196+00:00"}