{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AUYX2BISV4HJWBSX637KGZ6V7B","short_pith_number":"pith:AUYX2BIS","schema_version":"1.0","canonical_sha256":"05317d0512af0e9b0657f6fea367d5f84f7436e0797952094443ebfeb66a9c8f","source":{"kind":"arxiv","id":"1603.08638","version":2},"attestation_state":"computed","paper":{"title":"Optimal order quadrature error bounds for infinite-dimensional higher order digital sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Kosuke Suzuki, Takashi Goda, Takehito Yoshiki","submitted_at":"2016-03-29T04:41:08Z","abstract_excerpt":"Quasi-Monte Carlo (QMC) quadrature rules using higher order digital nets and sequences have been shown to achieve the almost optimal rate of convergence of the worst-case error in Sobolev spaces of arbitrary fixed smoothness $\\alpha\\in \\mathbb{N}$, $\\alpha\\geq 2$. In a recent paper by the authors, it was proved that randomly-digitally-shifted order $2\\alpha$ digital nets in prime base $b$ achieve the best possible rate of convergence of the root mean square worst-case error of order $N^{-\\alpha}(\\log N)^{(s-1)/2}$ for $N=b^m$, where $N$ and $s$ denote the number of points and the dimension, re"},"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":"1603.08638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-29T04:41:08Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"3994ebbfee0dc5a64972ee62f7dca198e86142cc9406baf97772e907e6e8f1c6","abstract_canon_sha256":"0145a8c07244839834c62d75f1b4f211a9e2238461022b23fc67e16c7ea4ef6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T17:10:08.298113Z","signature_b64":"OcBUTt/nXSAq2LHB0m/Wfox+UUDX+9J9sk3nhgSqAn/Qga9Fao+hUzGPPFnzBnukVf5rVP9ElZNp9ZM4XdSdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05317d0512af0e9b0657f6fea367d5f84f7436e0797952094443ebfeb66a9c8f","last_reissued_at":"2026-06-04T17:10:08.297696Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T17:10:08.297696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal order quadrature error bounds for infinite-dimensional higher order digital sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Kosuke Suzuki, Takashi Goda, Takehito Yoshiki","submitted_at":"2016-03-29T04:41:08Z","abstract_excerpt":"Quasi-Monte Carlo (QMC) quadrature rules using higher order digital nets and sequences have been shown to achieve the almost optimal rate of convergence of the worst-case error in Sobolev spaces of arbitrary fixed smoothness $\\alpha\\in \\mathbb{N}$, $\\alpha\\geq 2$. In a recent paper by the authors, it was proved that randomly-digitally-shifted order $2\\alpha$ digital nets in prime base $b$ achieve the best possible rate of convergence of the root mean square worst-case error of order $N^{-\\alpha}(\\log N)^{(s-1)/2}$ for $N=b^m$, where $N$ and $s$ denote the number of points and the dimension, re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08638","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/1603.08638/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":"1603.08638","created_at":"2026-06-04T17:10:08.297759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08638v2","created_at":"2026-06-04T17:10:08.297759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08638","created_at":"2026-06-04T17:10:08.297759+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUYX2BISV4HJ","created_at":"2026-06-04T17:10:08.297759+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUYX2BISV4HJWBSX","created_at":"2026-06-04T17:10:08.297759+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUYX2BIS","created_at":"2026-06-04T17:10:08.297759+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/AUYX2BISV4HJWBSX637KGZ6V7B","json":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B.json","graph_json":"https://pith.science/api/pith-number/AUYX2BISV4HJWBSX637KGZ6V7B/graph.json","events_json":"https://pith.science/api/pith-number/AUYX2BISV4HJWBSX637KGZ6V7B/events.json","paper":"https://pith.science/paper/AUYX2BIS"},"agent_actions":{"view_html":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B","download_json":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B.json","view_paper":"https://pith.science/paper/AUYX2BIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08638&json=true","fetch_graph":"https://pith.science/api/pith-number/AUYX2BISV4HJWBSX637KGZ6V7B/graph.json","fetch_events":"https://pith.science/api/pith-number/AUYX2BISV4HJWBSX637KGZ6V7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B/action/storage_attestation","attest_author":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B/action/author_attestation","sign_citation":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B/action/citation_signature","submit_replication":"https://pith.science/pith/AUYX2BISV4HJWBSX637KGZ6V7B/action/replication_record"}},"created_at":"2026-06-04T17:10:08.297759+00:00","updated_at":"2026-06-04T17:10:08.297759+00:00"}