{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EIKNIQYG4DZMCWM4O2DGSCLU5O","short_pith_number":"pith:EIKNIQYG","schema_version":"1.0","canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","source":{"kind":"arxiv","id":"1604.00261","version":1},"attestation_state":"computed","paper":{"title":"Product rules are optimal for numerical integration in classical smoothness spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Aicke Hinrichs, Erich Novak, Henryk Wozniakowski, Mario Ullrich","submitted_at":"2016-04-01T14:26:38Z","abstract_excerpt":"We mainly study numerical integration of real valued functions defined on the $d$-dimensional unit cube with all partial derivatives up to some finite order $r\\ge1$ bounded by one. It is well known that optimal algorithms that use $n$ function values achieve the error rate $n^{-r/d}$, where the hidden constant depends on $r$ and $d$. Here we prove explicit error bounds without hidden constants and, in particular, show that the optimal order of the error is $\\min \\bigl\\{1, d \\, n^{-r/d}\\bigr\\}$, where now the hidden constant only depends on $r$, not on $d$. For $n=m^d$, this optimal order can b"},"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":"1604.00261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-01T14:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"1180cd5b68645eb092a810690137d7ffd0ef72f2feef15cb05d09f0de83f7327","abstract_canon_sha256":"96f706dfa1d182dc94eb38f4ea16f6a4ad31da96ae9ef0b55b0183d26d5cfe93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:58.454890Z","signature_b64":"ezapd6OjxS8dqGOqdbz5j3d+vDpNQ2WROK6PJ7SHgQxVddFlB+kdXhP6kQmblBqwdng7alYar6uiPqo4XQcqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","last_reissued_at":"2026-05-18T00:41:58.454424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:58.454424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Product rules are optimal for numerical integration in classical smoothness spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Aicke Hinrichs, Erich Novak, Henryk Wozniakowski, Mario Ullrich","submitted_at":"2016-04-01T14:26:38Z","abstract_excerpt":"We mainly study numerical integration of real valued functions defined on the $d$-dimensional unit cube with all partial derivatives up to some finite order $r\\ge1$ bounded by one. It is well known that optimal algorithms that use $n$ function values achieve the error rate $n^{-r/d}$, where the hidden constant depends on $r$ and $d$. Here we prove explicit error bounds without hidden constants and, in particular, show that the optimal order of the error is $\\min \\bigl\\{1, d \\, n^{-r/d}\\bigr\\}$, where now the hidden constant only depends on $r$, not on $d$. For $n=m^d$, this optimal order can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00261","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1604.00261","created_at":"2026-05-18T00:41:58.454496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00261v1","created_at":"2026-05-18T00:41:58.454496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00261","created_at":"2026-05-18T00:41:58.454496+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIKNIQYG4DZM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIKNIQYG4DZMCWM4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIKNIQYG","created_at":"2026-05-18T12:30:12.583610+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/EIKNIQYG4DZMCWM4O2DGSCLU5O","json":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O.json","graph_json":"https://pith.science/api/pith-number/EIKNIQYG4DZMCWM4O2DGSCLU5O/graph.json","events_json":"https://pith.science/api/pith-number/EIKNIQYG4DZMCWM4O2DGSCLU5O/events.json","paper":"https://pith.science/paper/EIKNIQYG"},"agent_actions":{"view_html":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O","download_json":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O.json","view_paper":"https://pith.science/paper/EIKNIQYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00261&json=true","fetch_graph":"https://pith.science/api/pith-number/EIKNIQYG4DZMCWM4O2DGSCLU5O/graph.json","fetch_events":"https://pith.science/api/pith-number/EIKNIQYG4DZMCWM4O2DGSCLU5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/action/storage_attestation","attest_author":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/action/author_attestation","sign_citation":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/action/citation_signature","submit_replication":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/action/replication_record"}},"created_at":"2026-05-18T00:41:58.454496+00:00","updated_at":"2026-05-18T00:41:58.454496+00:00"}