{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMFABDXO533KPJJAPZSTFI4IK4","short_pith_number":"pith:MMFABDXO","schema_version":"1.0","canonical_sha256":"630a008eeeeef6a7a5207e6532a38857242d196955cc1ec64e5250e7c75669a8","source":{"kind":"arxiv","id":"1703.06334","version":2},"attestation_state":"computed","paper":{"title":"Successive Coordinate Search and Component-by-Component Construction of Rank-1 Lattice Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Adrian Ebert, Dirk Nuyens, Hernan Le\\\"ovey","submitted_at":"2017-03-18T18:45:47Z","abstract_excerpt":"The (fast) component-by-component (CBC) algorithm is an efficient tool for the construction of generating vectors for quasi-Monte Carlo rank-1 lattice rules in weighted reproducing kernel Hilbert spaces. We consider product weights, which assigns a weight to each dimension. These weights encode the effect a certain variable (or a group of variables by the product of the individual weights) has. Smaller weights indicate less importance. Kuo (2003) proved that the CBC algorithm achieves the optimal rate of convergence in the respective function spaces, but this does not imply the algorithm will "},"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":"1703.06334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-18T18:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"885a5df098dfed462ab3a697dbe3d8d0cf55f8b93e03d9989fba121262fc5988","abstract_canon_sha256":"825ad9aa02b2dc1112a143d6d0568d36895b45fe83772b5ea6a5ac8563635225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.817426Z","signature_b64":"hl0FD30+rATrlZ6p0iRcagg+D6M5cOu5s132TQnhn12KmpdvBMVv8sn4UQhevlEpIbTDolnJfhaoDY/v52LwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630a008eeeeef6a7a5207e6532a38857242d196955cc1ec64e5250e7c75669a8","last_reissued_at":"2026-05-18T00:31:23.816905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.816905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Coordinate Search and Component-by-Component Construction of Rank-1 Lattice Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Adrian Ebert, Dirk Nuyens, Hernan Le\\\"ovey","submitted_at":"2017-03-18T18:45:47Z","abstract_excerpt":"The (fast) component-by-component (CBC) algorithm is an efficient tool for the construction of generating vectors for quasi-Monte Carlo rank-1 lattice rules in weighted reproducing kernel Hilbert spaces. We consider product weights, which assigns a weight to each dimension. These weights encode the effect a certain variable (or a group of variables by the product of the individual weights) has. Smaller weights indicate less importance. Kuo (2003) proved that the CBC algorithm achieves the optimal rate of convergence in the respective function spaces, but this does not imply the algorithm will "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06334","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06334","created_at":"2026-05-18T00:31:23.816976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06334v2","created_at":"2026-05-18T00:31:23.816976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06334","created_at":"2026-05-18T00:31:23.816976+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMFABDXO533K","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMFABDXO533KPJJA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMFABDXO","created_at":"2026-05-18T12:31:31.346846+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/MMFABDXO533KPJJAPZSTFI4IK4","json":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4.json","graph_json":"https://pith.science/api/pith-number/MMFABDXO533KPJJAPZSTFI4IK4/graph.json","events_json":"https://pith.science/api/pith-number/MMFABDXO533KPJJAPZSTFI4IK4/events.json","paper":"https://pith.science/paper/MMFABDXO"},"agent_actions":{"view_html":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4","download_json":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4.json","view_paper":"https://pith.science/paper/MMFABDXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06334&json=true","fetch_graph":"https://pith.science/api/pith-number/MMFABDXO533KPJJAPZSTFI4IK4/graph.json","fetch_events":"https://pith.science/api/pith-number/MMFABDXO533KPJJAPZSTFI4IK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4/action/storage_attestation","attest_author":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4/action/author_attestation","sign_citation":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4/action/citation_signature","submit_replication":"https://pith.science/pith/MMFABDXO533KPJJAPZSTFI4IK4/action/replication_record"}},"created_at":"2026-05-18T00:31:23.816976+00:00","updated_at":"2026-05-18T00:31:23.816976+00:00"}