{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VZUXEV2EA2VQCPIAYK2AMBGT2G","short_pith_number":"pith:VZUXEV2E","schema_version":"1.0","canonical_sha256":"ae6972574406ab013d00c2b40604d3d19283af16a43832c13012c158a1ad8628","source":{"kind":"arxiv","id":"2311.13548","version":2},"attestation_state":"computed","paper":{"title":"Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Sampling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Antoine Chatalic, Ernesto De Vito, Lorenzo Rosasco, Nicolas Schreuder","submitted_at":"2023-11-22T17:44:18Z","abstract_excerpt":"In this work we consider the problem of numerical integration, i.e., approximating integrals with respect to a target probability measure using only pointwise evaluations of the integrand. We focus on the setting in which the target distribution is only accessible through a set of $n$ i.i.d. observations, and the integrand belongs to a reproducing kernel Hilbert space. We propose an efficient procedure which exploits a small i.i.d. random subset of $m<n$ samples drawn either uniformly or using approximate leverage scores from the initial observations. Our main result is an upper bound on the a"},"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":"2311.13548","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2023-11-22T17:44:18Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"758afd4673c16a3c1c3bb3530fde94d591373925227ab6ec651a55e78ba9052b","abstract_canon_sha256":"05b03dec4c882ee4b78370659817d86cff7adea1a312b8045301d19e9e99bac8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:15.195743Z","signature_b64":"Qz7fpnZdroTXufwm8C0ppRZWMtLtsLSl6UHI4baP+pxn/ClNs/kDKgvMzXL/2W+b94HtJflS+RM24f/V9Ty6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae6972574406ab013d00c2b40604d3d19283af16a43832c13012c158a1ad8628","last_reissued_at":"2026-07-05T11:22:15.195217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:15.195217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Sampling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Antoine Chatalic, Ernesto De Vito, Lorenzo Rosasco, Nicolas Schreuder","submitted_at":"2023-11-22T17:44:18Z","abstract_excerpt":"In this work we consider the problem of numerical integration, i.e., approximating integrals with respect to a target probability measure using only pointwise evaluations of the integrand. We focus on the setting in which the target distribution is only accessible through a set of $n$ i.i.d. observations, and the integrand belongs to a reproducing kernel Hilbert space. We propose an efficient procedure which exploits a small i.i.d. random subset of $m<n$ samples drawn either uniformly or using approximate leverage scores from the initial observations. Our main result is an upper bound on the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13548","kind":"arxiv","version":2},"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/2311.13548/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":"2311.13548","created_at":"2026-07-05T11:22:15.195283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13548v2","created_at":"2026-07-05T11:22:15.195283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13548","created_at":"2026-07-05T11:22:15.195283+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZUXEV2EA2VQ","created_at":"2026-07-05T11:22:15.195283+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZUXEV2EA2VQCPIA","created_at":"2026-07-05T11:22:15.195283+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZUXEV2E","created_at":"2026-07-05T11:22:15.195283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.10600","citing_title":"Weighted quantization using MMD: From mean field to mean shift via gradient flows","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2505.20754","citing_title":"Stationary MMD Points","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G","json":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G.json","graph_json":"https://pith.science/api/pith-number/VZUXEV2EA2VQCPIAYK2AMBGT2G/graph.json","events_json":"https://pith.science/api/pith-number/VZUXEV2EA2VQCPIAYK2AMBGT2G/events.json","paper":"https://pith.science/paper/VZUXEV2E"},"agent_actions":{"view_html":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G","download_json":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G.json","view_paper":"https://pith.science/paper/VZUXEV2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13548&json=true","fetch_graph":"https://pith.science/api/pith-number/VZUXEV2EA2VQCPIAYK2AMBGT2G/graph.json","fetch_events":"https://pith.science/api/pith-number/VZUXEV2EA2VQCPIAYK2AMBGT2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G/action/storage_attestation","attest_author":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G/action/author_attestation","sign_citation":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G/action/citation_signature","submit_replication":"https://pith.science/pith/VZUXEV2EA2VQCPIAYK2AMBGT2G/action/replication_record"}},"created_at":"2026-07-05T11:22:15.195283+00:00","updated_at":"2026-07-05T11:22:15.195283+00:00"}