{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AOLT2GQQ7LOHJH3VR43S6KJPMW","short_pith_number":"pith:AOLT2GQQ","schema_version":"1.0","canonical_sha256":"03973d1a10fadc749f758f372f292f65a809c5dc0dc06e2f8c2101eb472deec7","source":{"kind":"arxiv","id":"2509.18712","version":3},"attestation_state":"computed","paper":{"title":"Optimality of quasi-Monte Carlo methods and suboptimality of the sparse-grid Gauss--Hermite rule in Gaussian Sobolev spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Takashi Goda, Yoshihito Kazashi, Yuya Suzuki","submitted_at":"2025-09-23T06:52:34Z","abstract_excerpt":"Optimality of several quasi-Monte Carlo methods and suboptimality of the sparse-grid quadrature based on the univariate Gauss--Hermite rule is proved in the Sobolev spaces of mixed dominating smoothness of order $\\alpha$, where the optimality is in the sense of worst-case convergence rate. For sparse-grid Gauss--Hermite quadrature, lower and upper bounds are established, with rates coinciding up to a logarithmic factor. The dominant rate is found to be only $N^{-\\alpha/2}$ with $N$ function evaluations, although the optimal rate is known to be $N^{-\\alpha}(\\ln N)^{(d-1)/2}$. The lower bound is"},"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":"2509.18712","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-09-23T06:52:34Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"03c9df15ea9a9f0ac8c87d0d76fcfa1f343bca41fddbd2a5b1b30a1fcc7dfbd8","abstract_canon_sha256":"44265398ae3811626e7a7fcff9c37ec5acd4f127dff54d2194a8627cc112d677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:09.430458Z","signature_b64":"fimLj/ECMSoOOG2eu3+/03Gn1lUEq9XOuR+oUumrZvZ7oWNYGiLj9Ctrfx6lT7hFlAiz6BcdWRtSR5f9sVPgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03973d1a10fadc749f758f372f292f65a809c5dc0dc06e2f8c2101eb472deec7","last_reissued_at":"2026-06-09T01:05:09.429917Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:09.429917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of quasi-Monte Carlo methods and suboptimality of the sparse-grid Gauss--Hermite rule in Gaussian Sobolev spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Takashi Goda, Yoshihito Kazashi, Yuya Suzuki","submitted_at":"2025-09-23T06:52:34Z","abstract_excerpt":"Optimality of several quasi-Monte Carlo methods and suboptimality of the sparse-grid quadrature based on the univariate Gauss--Hermite rule is proved in the Sobolev spaces of mixed dominating smoothness of order $\\alpha$, where the optimality is in the sense of worst-case convergence rate. For sparse-grid Gauss--Hermite quadrature, lower and upper bounds are established, with rates coinciding up to a logarithmic factor. The dominant rate is found to be only $N^{-\\alpha/2}$ with $N$ function evaluations, although the optimal rate is known to be $N^{-\\alpha}(\\ln N)^{(d-1)/2}$. The lower bound is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.18712","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/2509.18712/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":"2509.18712","created_at":"2026-06-09T01:05:09.429973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.18712v3","created_at":"2026-06-09T01:05:09.429973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.18712","created_at":"2026-06-09T01:05:09.429973+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOLT2GQQ7LOH","created_at":"2026-06-09T01:05:09.429973+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOLT2GQQ7LOHJH3V","created_at":"2026-06-09T01:05:09.429973+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOLT2GQQ","created_at":"2026-06-09T01:05:09.429973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27758","citing_title":"M\\\"obius-transformed trapezoidal rule for polynomial weights","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW","json":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW.json","graph_json":"https://pith.science/api/pith-number/AOLT2GQQ7LOHJH3VR43S6KJPMW/graph.json","events_json":"https://pith.science/api/pith-number/AOLT2GQQ7LOHJH3VR43S6KJPMW/events.json","paper":"https://pith.science/paper/AOLT2GQQ"},"agent_actions":{"view_html":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW","download_json":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW.json","view_paper":"https://pith.science/paper/AOLT2GQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.18712&json=true","fetch_graph":"https://pith.science/api/pith-number/AOLT2GQQ7LOHJH3VR43S6KJPMW/graph.json","fetch_events":"https://pith.science/api/pith-number/AOLT2GQQ7LOHJH3VR43S6KJPMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW/action/storage_attestation","attest_author":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW/action/author_attestation","sign_citation":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW/action/citation_signature","submit_replication":"https://pith.science/pith/AOLT2GQQ7LOHJH3VR43S6KJPMW/action/replication_record"}},"created_at":"2026-06-09T01:05:09.429973+00:00","updated_at":"2026-06-09T01:05:09.429973+00:00"}