{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CPVZEHNBM47XRGK72EPL3DWUZS","short_pith_number":"pith:CPVZEHNB","schema_version":"1.0","canonical_sha256":"13eb921da1673f78995fd11ebd8ed4cca0989f87c2ba529e7a3d4226822ef847","source":{"kind":"arxiv","id":"1901.08088","version":2},"attestation_state":"computed","paper":{"title":"Quantized bounding volume hierarchies for neighbor search in molecular simulations on graphics processing units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Antonia Statt, Athanassios Z. Panagiotopoulos, Felix Madutsa, Michael P. Howard, Thomas M. Truskett","submitted_at":"2019-01-23T19:21:26Z","abstract_excerpt":"We present an algorithm for neighbor search in molecular simulations on graphics processing units (GPUs) based on bounding volume hierarchies (BVHs). The BVH is compressed into a low-precision, quantized representation to increase the BVH traversal speed compared to a previous implementation. We find that neighbor search using the quantized BVH is roughly two to four times faster than current state-of-the-art methods using uniform grids (cell lists) for a suite of benchmarks for common molecular simulation models. Based on the benchmark results, we recommend using the BVH instead of a single c"},"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":"1901.08088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2019-01-23T19:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"f91f506255c71346576005f2522de54e67e13050f440b7e82cd7e75e696f64f5","abstract_canon_sha256":"92c0f5e645814127c7a9be07d96ecd198496c4bd123b4f3415000fbb74f783a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:39.527531Z","signature_b64":"/o66BkAjE/yGI02IayEcA6t23VJHU+pGXue7zh+aM7yeCWPp4Zill1VGROpggZeQAKT6/ndWcPoSX1Ui1MIbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13eb921da1673f78995fd11ebd8ed4cca0989f87c2ba529e7a3d4226822ef847","last_reissued_at":"2026-05-17T23:48:39.527013Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:39.527013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantized bounding volume hierarchies for neighbor search in molecular simulations on graphics processing units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Antonia Statt, Athanassios Z. Panagiotopoulos, Felix Madutsa, Michael P. Howard, Thomas M. Truskett","submitted_at":"2019-01-23T19:21:26Z","abstract_excerpt":"We present an algorithm for neighbor search in molecular simulations on graphics processing units (GPUs) based on bounding volume hierarchies (BVHs). The BVH is compressed into a low-precision, quantized representation to increase the BVH traversal speed compared to a previous implementation. We find that neighbor search using the quantized BVH is roughly two to four times faster than current state-of-the-art methods using uniform grids (cell lists) for a suite of benchmarks for common molecular simulation models. Based on the benchmark results, we recommend using the BVH instead of a single c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08088","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":"1901.08088","created_at":"2026-05-17T23:48:39.527090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08088v2","created_at":"2026-05-17T23:48:39.527090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08088","created_at":"2026-05-17T23:48:39.527090+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPVZEHNBM47X","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPVZEHNBM47XRGK7","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPVZEHNB","created_at":"2026-05-18T12:33:15.570797+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/CPVZEHNBM47XRGK72EPL3DWUZS","json":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS.json","graph_json":"https://pith.science/api/pith-number/CPVZEHNBM47XRGK72EPL3DWUZS/graph.json","events_json":"https://pith.science/api/pith-number/CPVZEHNBM47XRGK72EPL3DWUZS/events.json","paper":"https://pith.science/paper/CPVZEHNB"},"agent_actions":{"view_html":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS","download_json":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS.json","view_paper":"https://pith.science/paper/CPVZEHNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08088&json=true","fetch_graph":"https://pith.science/api/pith-number/CPVZEHNBM47XRGK72EPL3DWUZS/graph.json","fetch_events":"https://pith.science/api/pith-number/CPVZEHNBM47XRGK72EPL3DWUZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS/action/storage_attestation","attest_author":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS/action/author_attestation","sign_citation":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS/action/citation_signature","submit_replication":"https://pith.science/pith/CPVZEHNBM47XRGK72EPL3DWUZS/action/replication_record"}},"created_at":"2026-05-17T23:48:39.527090+00:00","updated_at":"2026-05-17T23:48:39.527090+00:00"}