{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EIKNIQYG4DZMCWM4O2DGSCLU5O","short_pith_number":"pith:EIKNIQYG","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"},"canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","source":{"kind":"arxiv","id":"1604.00261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00261","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00261v1","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00261","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"EIKNIQYG4DZM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIKNIQYG4DZMCWM4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIKNIQYG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EIKNIQYG4DZMCWM4O2DGSCLU5O","target":"record","payload":{"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"},"canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","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"},"source_kind":"arxiv","source_id":"1604.00261","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMh8rr7ywt7Z2urdIGOW/WPZvzGmB4TwswlyvztO2rG0aqyBB4JyIAP9E85Z9h41p5pXDSEWAF8uVJpipVhLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:09:54.223445Z"},"content_sha256":"87a99b986bbee5c5692dd0966d8fb39bce84d0c6c415e943e2e99e88bc71ae6c","schema_version":"1.0","event_id":"sha256:87a99b986bbee5c5692dd0966d8fb39bce84d0c6c415e943e2e99e88bc71ae6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EIKNIQYG4DZMCWM4O2DGSCLU5O","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ero53DwCOp6qSSPDsJ1HO2q/ZRBqdgPN4exqH3HpsxLKsImh61HjXsK51JypOgE0wN0MJ9d/wXT4u4i88uo6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:09:54.224207Z"},"content_sha256":"d8d3493eae74e8270f2bd747c053c1c61c4c767372b9d75ded358f30a23ba339","schema_version":"1.0","event_id":"sha256:d8d3493eae74e8270f2bd747c053c1c61c4c767372b9d75ded358f30a23ba339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/bundle.json","state_url":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T22:09:54Z","links":{"resolver":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O","bundle":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/bundle.json","state":"https://pith.science/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIKNIQYG4DZMCWM4O2DGSCLU5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EIKNIQYG4DZMCWM4O2DGSCLU5O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96f706dfa1d182dc94eb38f4ea16f6a4ad31da96ae9ef0b55b0183d26d5cfe93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-01T14:26:38Z","title_canon_sha256":"1180cd5b68645eb092a810690137d7ffd0ef72f2feef15cb05d09f0de83f7327"},"schema_version":"1.0","source":{"id":"1604.00261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00261","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00261v1","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00261","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"EIKNIQYG4DZM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIKNIQYG4DZMCWM4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIKNIQYG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:d8d3493eae74e8270f2bd747c053c1c61c4c767372b9d75ded358f30a23ba339","target":"graph","created_at":"2026-05-18T00:41:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aicke Hinrichs, Erich Novak, Henryk Wozniakowski, Mario Ullrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-01T14:26:38Z","title":"Product rules are optimal for numerical integration in classical smoothness spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00261","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87a99b986bbee5c5692dd0966d8fb39bce84d0c6c415e943e2e99e88bc71ae6c","target":"record","created_at":"2026-05-18T00:41:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96f706dfa1d182dc94eb38f4ea16f6a4ad31da96ae9ef0b55b0183d26d5cfe93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-01T14:26:38Z","title_canon_sha256":"1180cd5b68645eb092a810690137d7ffd0ef72f2feef15cb05d09f0de83f7327"},"schema_version":"1.0","source":{"id":"1604.00261","kind":"arxiv","version":1}},"canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2214d44306e0f2c1599c7686690974eb8e4140a9aacb3ace801ce856c37f9809","first_computed_at":"2026-05-18T00:41:58.454424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:58.454424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezapd6OjxS8dqGOqdbz5j3d+vDpNQ2WROK6PJ7SHgQxVddFlB+kdXhP6kQmblBqwdng7alYar6uiPqo4XQcqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:58.454890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87a99b986bbee5c5692dd0966d8fb39bce84d0c6c415e943e2e99e88bc71ae6c","sha256:d8d3493eae74e8270f2bd747c053c1c61c4c767372b9d75ded358f30a23ba339"],"state_sha256":"32b548fc9dd044df6bbddefb6c851b5becab26fe98483fce4ed457faec442efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"preVt+6OOkrybi2RRauYhVDC+glnHGkT8s13UN8iqWgxSb0APsnYcjLeyhWFlvPnKjeCaLm1LJXMziINBVauAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:09:54.228869Z","bundle_sha256":"58d6175e80ce5fe38bb03d4aa8d63a78f0a0521575e92b53d9e7f6642be90304"}}