{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7OCKGPWJ24JHMZL7QQ3YG56T4O","short_pith_number":"pith:7OCKGPWJ","schema_version":"1.0","canonical_sha256":"fb84a33ec9d71276657f84378377d3e381e8375fe181048e91e2d0a5e4f7d3a5","source":{"kind":"arxiv","id":"2305.06151","version":3},"attestation_state":"computed","paper":{"title":"Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.ST","stat.CO","stat.TH"],"primary_cat":"math.NA","authors_text":"Aigerim Zhuman, Fran\\c{c}ois Portier, Johan Segers, R\\'emi Leluc","submitted_at":"2023-05-10T13:50:25Z","abstract_excerpt":"A novel linear integration rule called $\\textit{control neighbors}$ is proposed in which nearest neighbor estimates act as control variates to speed up the convergence rate of the Monte Carlo procedure on metric spaces. The main result is the $\\mathcal{O}(n^{-1/2} n^{-s/d})$ convergence rate -- where $n$ stands for the number of evaluations of the integrand and $d$ for the dimension of the domain -- of this estimate for H\\\"older functions with regularity $s \\in (0,1]$, a rate which, in some sense, is optimal. Several numerical experiments validate the complexity bound and highlight the good pe"},"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":"2305.06151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-05-10T13:50:25Z","cross_cats_sorted":["cs.NA","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"8287458012e1f720a55b7733c2f523869090d2716d6bf20f07764daa73ec9167","abstract_canon_sha256":"884c039411be118182ba86cb1c331eaa09a8618f6204e06edf8feafb1d91e299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:12.562030Z","signature_b64":"74U4zlchuwbv7ZCfY4pRK1DH6mvzlPM4swnkM5ppFi46BCEQcHsR3kjsvp4mQ76HXjkb5YUqAQbsGdVE2pxuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb84a33ec9d71276657f84378377d3e381e8375fe181048e91e2d0a5e4f7d3a5","last_reissued_at":"2026-07-05T08:04:12.561534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:12.561534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.ST","stat.CO","stat.TH"],"primary_cat":"math.NA","authors_text":"Aigerim Zhuman, Fran\\c{c}ois Portier, Johan Segers, R\\'emi Leluc","submitted_at":"2023-05-10T13:50:25Z","abstract_excerpt":"A novel linear integration rule called $\\textit{control neighbors}$ is proposed in which nearest neighbor estimates act as control variates to speed up the convergence rate of the Monte Carlo procedure on metric spaces. The main result is the $\\mathcal{O}(n^{-1/2} n^{-s/d})$ convergence rate -- where $n$ stands for the number of evaluations of the integrand and $d$ for the dimension of the domain -- of this estimate for H\\\"older functions with regularity $s \\in (0,1]$, a rate which, in some sense, is optimal. Several numerical experiments validate the complexity bound and highlight the good pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06151","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.06151/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":"2305.06151","created_at":"2026-07-05T08:04:12.561597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06151v3","created_at":"2026-07-05T08:04:12.561597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06151","created_at":"2026-07-05T08:04:12.561597+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OCKGPWJ24JH","created_at":"2026-07-05T08:04:12.561597+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OCKGPWJ24JHMZL7","created_at":"2026-07-05T08:04:12.561597+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OCKGPWJ","created_at":"2026-07-05T08:04:12.561597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01091","citing_title":"Ensemble Control Variates","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O","json":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O.json","graph_json":"https://pith.science/api/pith-number/7OCKGPWJ24JHMZL7QQ3YG56T4O/graph.json","events_json":"https://pith.science/api/pith-number/7OCKGPWJ24JHMZL7QQ3YG56T4O/events.json","paper":"https://pith.science/paper/7OCKGPWJ"},"agent_actions":{"view_html":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O","download_json":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O.json","view_paper":"https://pith.science/paper/7OCKGPWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06151&json=true","fetch_graph":"https://pith.science/api/pith-number/7OCKGPWJ24JHMZL7QQ3YG56T4O/graph.json","fetch_events":"https://pith.science/api/pith-number/7OCKGPWJ24JHMZL7QQ3YG56T4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O/action/storage_attestation","attest_author":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O/action/author_attestation","sign_citation":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O/action/citation_signature","submit_replication":"https://pith.science/pith/7OCKGPWJ24JHMZL7QQ3YG56T4O/action/replication_record"}},"created_at":"2026-07-05T08:04:12.561597+00:00","updated_at":"2026-07-05T08:04:12.561597+00:00"}