{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KZUAJWTPCZYYTJIN3HCTVXFHYR","short_pith_number":"pith:KZUAJWTP","schema_version":"1.0","canonical_sha256":"566804da6f167189a50dd9c53adca7c448fa3581c76c0bcf6f6226e46b4aca65","source":{"kind":"arxiv","id":"2605.18134","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sampling for Kernel Quadrature on Unbounded Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Constructs an n-dependent kernel-agnostic sampling distribution achieving minimax worst-case error rates for quadrature over smoothness classes on unbounded domains.","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christian Robert (CEREMADE), Edoardo Bandoni (CEREMADE), Julien Stoehr (CEREMADE)","submitted_at":"2026-05-18T09:39:11Z","abstract_excerpt":"Kernel quadrature is widely used to approximate integrals of smooth functions, with worst-case error typically decaying at the minimax rate $n^{-\\alpha/d}$ for smoothness $\\alpha$ in dimension $d$. Existing rate-optimal methods often depend on deterministic point sets tailored to a specific kernel, making them sensitive to misspecification and less robust in practice. In this work, we study randomized quadrature methods with a focus on robustness rather than kernel-specific optimality. We construct an explicit, $n$-dependent sampling distribution that achieves minimax rates for worst-case erro"},"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":"2605.18134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-18T09:39:11Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"4a9a40c8e64b7318eb1a64888a8ad5b0f4d2bcab23b55e5e817391918eabb878","abstract_canon_sha256":"9fbb3067bc341f5c9f72388e1ec394f429f3aaa3581868c47f20b285a5ab2257"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:17.732129Z","signature_b64":"C3/Fq49q6h7v8r0N/yE7gvgHhmFZ/lJAUDS+ktggan3LigZ3CDfE3g5CjS47WkqnvIMEwesbGKui4Ji8E5HcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"566804da6f167189a50dd9c53adca7c448fa3581c76c0bcf6f6226e46b4aca65","last_reissued_at":"2026-05-20T00:05:17.731213Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:17.731213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sampling for Kernel Quadrature on Unbounded Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Constructs an n-dependent kernel-agnostic sampling distribution achieving minimax worst-case error rates for quadrature over smoothness classes on unbounded domains.","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christian Robert (CEREMADE), Edoardo Bandoni (CEREMADE), Julien Stoehr (CEREMADE)","submitted_at":"2026-05-18T09:39:11Z","abstract_excerpt":"Kernel quadrature is widely used to approximate integrals of smooth functions, with worst-case error typically decaying at the minimax rate $n^{-\\alpha/d}$ for smoothness $\\alpha$ in dimension $d$. Existing rate-optimal methods often depend on deterministic point sets tailored to a specific kernel, making them sensitive to misspecification and less robust in practice. In this work, we study randomized quadrature methods with a focus on robustness rather than kernel-specific optimality. We construct an explicit, $n$-dependent sampling distribution that achieves minimax rates for worst-case erro"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We construct an explicit, n-dependent sampling distribution that achieves minimax rates for worst-case error over smoothness classes without requiring knowledge of the kernel.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The existence and explicit constructibility of an n-dependent sampling distribution whose worst-case error matches the minimax rate over the smoothness class, independent of the kernel, for the chosen unbounded measures (Gaussian, Student-t).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Constructs an n-dependent kernel-agnostic sampling distribution achieving minimax worst-case error rates for quadrature over smoothness classes on unbounded domains.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"47019c14211ef73069d8e986bca5cf128a52e59b39006f8396cb7d567894ebf5"},"source":{"id":"2605.18134","kind":"arxiv","version":1},"verdict":{"id":"e749e5d8-3881-4cc6-8e45-05871a3dc8f2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:00:43.490572Z","strongest_claim":"We construct an explicit, n-dependent sampling distribution that achieves minimax rates for worst-case error over smoothness classes without requiring knowledge of the kernel.","one_line_summary":"Constructs an n-dependent kernel-agnostic sampling distribution achieving minimax worst-case error rates for quadrature over smoothness classes on unbounded domains.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The existence and explicit constructibility of an n-dependent sampling distribution whose worst-case error matches the minimax rate over the smoothness class, independent of the kernel, for the chosen unbounded measures (Gaussian, Student-t).","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18134/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.121219Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.389712Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7ce35f2bae2697c8150db4a92dedd993422fed10aba3ecb6f4a010284bdaa481"},"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":"2605.18134","created_at":"2026-05-20T00:05:17.731371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18134v1","created_at":"2026-05-20T00:05:17.731371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18134","created_at":"2026-05-20T00:05:17.731371+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZUAJWTPCZYY","created_at":"2026-05-20T00:05:17.731371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZUAJWTPCZYYTJIN","created_at":"2026-05-20T00:05:17.731371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZUAJWTP","created_at":"2026-05-20T00:05:17.731371+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/KZUAJWTPCZYYTJIN3HCTVXFHYR","json":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR.json","graph_json":"https://pith.science/api/pith-number/KZUAJWTPCZYYTJIN3HCTVXFHYR/graph.json","events_json":"https://pith.science/api/pith-number/KZUAJWTPCZYYTJIN3HCTVXFHYR/events.json","paper":"https://pith.science/paper/KZUAJWTP"},"agent_actions":{"view_html":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR","download_json":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR.json","view_paper":"https://pith.science/paper/KZUAJWTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18134&json=true","fetch_graph":"https://pith.science/api/pith-number/KZUAJWTPCZYYTJIN3HCTVXFHYR/graph.json","fetch_events":"https://pith.science/api/pith-number/KZUAJWTPCZYYTJIN3HCTVXFHYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR/action/storage_attestation","attest_author":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR/action/author_attestation","sign_citation":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR/action/citation_signature","submit_replication":"https://pith.science/pith/KZUAJWTPCZYYTJIN3HCTVXFHYR/action/replication_record"}},"created_at":"2026-05-20T00:05:17.731371+00:00","updated_at":"2026-05-20T00:05:17.731371+00:00"}