{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WCB5QGRNLC6VZVRXVZXLLACBKQ","short_pith_number":"pith:WCB5QGRN","schema_version":"1.0","canonical_sha256":"b083d81a2d58bd5cd637ae6eb58041541b9fae998af1553639907d9f1b92fa93","source":{"kind":"arxiv","id":"2011.06446","version":1},"attestation_state":"computed","paper":{"title":"Subgroup-based Rank-1 Lattice Quasi-Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Ivor W. Tsang, Yuan Yuan, Yueming Lyu","submitted_at":"2020-10-29T03:42:30Z","abstract_excerpt":"Quasi-Monte Carlo (QMC) is an essential tool for integral approximation, Bayesian inference, and sampling for simulation in science, etc. In the QMC area, the rank-1 lattice is important due to its simple operation, and nice properties for point set construction. However, the construction of the generating vector of the rank-1 lattice is usually time-consuming because of an exhaustive computer search. To address this issue, we propose a simple closed-form rank-1 lattice construction method based on group theory. Our method reduces the number of distinct pairwise distance values to generate a m"},"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":"2011.06446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-10-29T03:42:30Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"415542dbce16fc4903ffa47731b37adc5d33f57eea1435c24a09dae1f92787fe","abstract_canon_sha256":"94766f85219576ab627e7d193c9f0a80e94cb1a419e33d2334c67d26bb6c01a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:15.054140Z","signature_b64":"Xv17S3yDZqVMFFmTci8u4a2wN7FnpygJl+yhGgH+7Lw3Koet2KNzylkZ4baMmaArS30OM83itpyM4lhkMZPNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b083d81a2d58bd5cd637ae6eb58041541b9fae998af1553639907d9f1b92fa93","last_reissued_at":"2026-07-05T01:51:15.053811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:15.053811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgroup-based Rank-1 Lattice Quasi-Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Ivor W. Tsang, Yuan Yuan, Yueming Lyu","submitted_at":"2020-10-29T03:42:30Z","abstract_excerpt":"Quasi-Monte Carlo (QMC) is an essential tool for integral approximation, Bayesian inference, and sampling for simulation in science, etc. In the QMC area, the rank-1 lattice is important due to its simple operation, and nice properties for point set construction. However, the construction of the generating vector of the rank-1 lattice is usually time-consuming because of an exhaustive computer search. To address this issue, we propose a simple closed-form rank-1 lattice construction method based on group theory. Our method reduces the number of distinct pairwise distance values to generate a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06446","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.06446/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.06446","created_at":"2026-07-05T01:51:15.053862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06446v1","created_at":"2026-07-05T01:51:15.053862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06446","created_at":"2026-07-05T01:51:15.053862+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCB5QGRNLC6V","created_at":"2026-07-05T01:51:15.053862+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCB5QGRNLC6VZVRX","created_at":"2026-07-05T01:51:15.053862+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCB5QGRN","created_at":"2026-07-05T01:51:15.053862+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/WCB5QGRNLC6VZVRXVZXLLACBKQ","json":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ.json","graph_json":"https://pith.science/api/pith-number/WCB5QGRNLC6VZVRXVZXLLACBKQ/graph.json","events_json":"https://pith.science/api/pith-number/WCB5QGRNLC6VZVRXVZXLLACBKQ/events.json","paper":"https://pith.science/paper/WCB5QGRN"},"agent_actions":{"view_html":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ","download_json":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ.json","view_paper":"https://pith.science/paper/WCB5QGRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06446&json=true","fetch_graph":"https://pith.science/api/pith-number/WCB5QGRNLC6VZVRXVZXLLACBKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WCB5QGRNLC6VZVRXVZXLLACBKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ/action/storage_attestation","attest_author":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ/action/author_attestation","sign_citation":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ/action/citation_signature","submit_replication":"https://pith.science/pith/WCB5QGRNLC6VZVRXVZXLLACBKQ/action/replication_record"}},"created_at":"2026-07-05T01:51:15.053862+00:00","updated_at":"2026-07-05T01:51:15.053862+00:00"}