{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GZX7FHIF2KH4IQPL23XUOOSBP6","short_pith_number":"pith:GZX7FHIF","schema_version":"1.0","canonical_sha256":"366ff29d05d28fc441ebd6ef473a417f8f15be9c2e3d12c1e9eaf510f9c48dff","source":{"kind":"arxiv","id":"1404.5497","version":1},"attestation_state":"computed","paper":{"title":"A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Friedrich Pillichshammer, Gunther Leobacher, Josef Dick, Peter Kritzer","submitted_at":"2014-04-22T13:49:50Z","abstract_excerpt":"Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to resort to computer search algorithms. The fast component-by-component approach is a useful algorithm for finding suitable quadrature rules.\n  We present a modification of the fast component-by-component algorithm which yields savings of the construction cost for (polynomial) lattice rules in weighted function spaces. The idea is to reduce the size of the sea"},"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":"1404.5497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-22T13:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"7379fa8f21dcc1261e08fc325c6813de0fc3f047cbf8e544f137d918b69626a1","abstract_canon_sha256":"f4b2a001152ede57fc501ba4726ace889591d9e7453335b6c3f42e145ef8d464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.223515Z","signature_b64":"mIWIFork6dl262LkTbYQDBD26DzDkvrTc3pK7FHajihbh2RVfv0oJHw1rR9IaiVbeTh3pgev1hgHmubtUxkaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"366ff29d05d28fc441ebd6ef473a417f8f15be9c2e3d12c1e9eaf510f9c48dff","last_reissued_at":"2026-05-18T02:53:31.222592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.222592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Friedrich Pillichshammer, Gunther Leobacher, Josef Dick, Peter Kritzer","submitted_at":"2014-04-22T13:49:50Z","abstract_excerpt":"Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to resort to computer search algorithms. The fast component-by-component approach is a useful algorithm for finding suitable quadrature rules.\n  We present a modification of the fast component-by-component algorithm which yields savings of the construction cost for (polynomial) lattice rules in weighted function spaces. The idea is to reduce the size of the sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5497","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":"1404.5497","created_at":"2026-05-18T02:53:31.222744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5497v1","created_at":"2026-05-18T02:53:31.222744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5497","created_at":"2026-05-18T02:53:31.222744+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZX7FHIF2KH4","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZX7FHIF2KH4IQPL","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZX7FHIF","created_at":"2026-05-18T12:28:30.664211+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/GZX7FHIF2KH4IQPL23XUOOSBP6","json":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6.json","graph_json":"https://pith.science/api/pith-number/GZX7FHIF2KH4IQPL23XUOOSBP6/graph.json","events_json":"https://pith.science/api/pith-number/GZX7FHIF2KH4IQPL23XUOOSBP6/events.json","paper":"https://pith.science/paper/GZX7FHIF"},"agent_actions":{"view_html":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6","download_json":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6.json","view_paper":"https://pith.science/paper/GZX7FHIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5497&json=true","fetch_graph":"https://pith.science/api/pith-number/GZX7FHIF2KH4IQPL23XUOOSBP6/graph.json","fetch_events":"https://pith.science/api/pith-number/GZX7FHIF2KH4IQPL23XUOOSBP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6/action/storage_attestation","attest_author":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6/action/author_attestation","sign_citation":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6/action/citation_signature","submit_replication":"https://pith.science/pith/GZX7FHIF2KH4IQPL23XUOOSBP6/action/replication_record"}},"created_at":"2026-05-18T02:53:31.222744+00:00","updated_at":"2026-05-18T02:53:31.222744+00:00"}