{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:332UOK6IV7S4V7LZNAOSLLFDDY","short_pith_number":"pith:332UOK6I","canonical_record":{"source":{"id":"1105.2599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T02:31:20Z","cross_cats_sorted":[],"title_canon_sha256":"87b3a0475dadf729683cba11fccacdab6dfa9da0177f8c1026f5ab0cf253cfe2","abstract_canon_sha256":"1e0ad5a932d3afee07b299c3ae56a0815041eadd8561d1b81479dda202afcfca"},"schema_version":"1.0"},"canonical_sha256":"def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69","source":{"kind":"arxiv","id":"1105.2599","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2599","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2599v2","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2599","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"332UOK6IV7S4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"332UOK6IV7S4V7LZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"332UOK6I","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:332UOK6IV7S4V7LZNAOSLLFDDY","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T02:31:20Z","cross_cats_sorted":[],"title_canon_sha256":"87b3a0475dadf729683cba11fccacdab6dfa9da0177f8c1026f5ab0cf253cfe2","abstract_canon_sha256":"1e0ad5a932d3afee07b299c3ae56a0815041eadd8561d1b81479dda202afcfca"},"schema_version":"1.0"},"canonical_sha256":"def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:45.623235Z","signature_b64":"MSZjfu2qhZaJWs4QKgpiMA9xi3IKCFpOeiSHkbeQbT1c0pkR/ZATR8GqUz/9vv3Le+oMK1Y9CbgqAw4pc7kuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69","last_reissued_at":"2026-05-18T03:15:45.622544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:45.622544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2599","source_version":2,"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-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9oscbVHVQmcFkXL1CwyCa7tlVi5e/fx0nwJdHfDS/OU5FMJhLOo5RX+DiTeohgY6aqAxRhDBHxrkSZj26apCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:24:23.752771Z"},"content_sha256":"429b9006a0118290b80e0d9ecf0ebb35c1f6e29ab5097380768fc68493f02629","schema_version":"1.0","event_id":"sha256:429b9006a0118290b80e0d9ecf0ebb35c1f6e29ab5097380768fc68493f02629"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:332UOK6IV7S4V7LZNAOSLLFDDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dirk Nuyens, Friedrich Pillichshammer, Gunther Leobacher, Jan Baldeaux, Josef Dick","submitted_at":"2011-05-13T02:31:20Z","abstract_excerpt":"We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve the near optimal order of convergence. The main problem addressed in this paper is to find an efficient way of computing the worst-case error. A general algorithm is presented and explicit expressions for base~2 are given. To obtain an efficient component-by-component construction algorithm we exploit the structure of the underlying cyclic group.\n  We compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2599","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":""},"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-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcLfuLtuH2RZ3hjhFf+ZjsY9Qtut+C3FRxMoyUv+EpFX0tGRhPjwiADkY/TeHOVeOdGDHC5F21HbT356atFKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:24:23.753149Z"},"content_sha256":"76e2bd3df84bd39b6ca88f145baebe3e663ad5cbd7844d73236985c619475780","schema_version":"1.0","event_id":"sha256:76e2bd3df84bd39b6ca88f145baebe3e663ad5cbd7844d73236985c619475780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY/bundle.json","state_url":"https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/332UOK6IV7S4V7LZNAOSLLFDDY/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-27T04:24:23Z","links":{"resolver":"https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY","bundle":"https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY/bundle.json","state":"https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/332UOK6IV7S4V7LZNAOSLLFDDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:332UOK6IV7S4V7LZNAOSLLFDDY","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":"1e0ad5a932d3afee07b299c3ae56a0815041eadd8561d1b81479dda202afcfca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T02:31:20Z","title_canon_sha256":"87b3a0475dadf729683cba11fccacdab6dfa9da0177f8c1026f5ab0cf253cfe2"},"schema_version":"1.0","source":{"id":"1105.2599","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2599","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2599v2","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2599","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"332UOK6IV7S4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"332UOK6IV7S4V7LZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"332UOK6I","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:76e2bd3df84bd39b6ca88f145baebe3e663ad5cbd7844d73236985c619475780","target":"graph","created_at":"2026-05-18T03:15:45Z","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 show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve the near optimal order of convergence. The main problem addressed in this paper is to find an efficient way of computing the worst-case error. A general algorithm is presented and explicit expressions for base~2 are given. To obtain an efficient component-by-component construction algorithm we exploit the structure of the underlying cyclic group.\n  We compar","authors_text":"Dirk Nuyens, Friedrich Pillichshammer, Gunther Leobacher, Jan Baldeaux, Josef Dick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T02:31:20Z","title":"Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2599","kind":"arxiv","version":2},"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:429b9006a0118290b80e0d9ecf0ebb35c1f6e29ab5097380768fc68493f02629","target":"record","created_at":"2026-05-18T03:15:45Z","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":"1e0ad5a932d3afee07b299c3ae56a0815041eadd8561d1b81479dda202afcfca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T02:31:20Z","title_canon_sha256":"87b3a0475dadf729683cba11fccacdab6dfa9da0177f8c1026f5ab0cf253cfe2"},"schema_version":"1.0","source":{"id":"1105.2599","kind":"arxiv","version":2}},"canonical_sha256":"def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69","first_computed_at":"2026-05-18T03:15:45.622544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:45.622544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MSZjfu2qhZaJWs4QKgpiMA9xi3IKCFpOeiSHkbeQbT1c0pkR/ZATR8GqUz/9vv3Le+oMK1Y9CbgqAw4pc7kuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:45.623235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2599","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:429b9006a0118290b80e0d9ecf0ebb35c1f6e29ab5097380768fc68493f02629","sha256:76e2bd3df84bd39b6ca88f145baebe3e663ad5cbd7844d73236985c619475780"],"state_sha256":"b462c637665234938cef7355c1630eb696ddcf481e209214319519b442a26581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTcrekck5NZkbuznMHrn1+PqVj3NNyUserquhtVTP8uVx8PzrsXXTtWF8Kgu/z2W+XM7d29JNo4+BlH6aXWfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:24:23.755691Z","bundle_sha256":"0deaee48d0b1a0e03099391b20318ebe47bd342368e9a6467580a75bdcd42cdd"}}