{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HXEBNN2EDCPX3TFYUMDEXKXOGO","short_pith_number":"pith:HXEBNN2E","canonical_record":{"source":{"id":"1804.06231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T13:31:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e588e34a9e28b57e5acd9eae5ec55f4481bf363a762ca142eda6b87c9cd47826","abstract_canon_sha256":"6bafdeb9d826d8cc9ad506832a4af448d349bf8d85b97d413b63c581dbb64b49"},"schema_version":"1.0"},"canonical_sha256":"3dc816b744189f7dccb8a3064baaee339e2c0a9ca126599304a006bd50ad03d6","source":{"kind":"arxiv","id":"1804.06231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06231","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06231v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06231","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"HXEBNN2EDCPX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXEBNN2EDCPX3TFY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXEBNN2E","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HXEBNN2EDCPX3TFYUMDEXKXOGO","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T13:31:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e588e34a9e28b57e5acd9eae5ec55f4481bf363a762ca142eda6b87c9cd47826","abstract_canon_sha256":"6bafdeb9d826d8cc9ad506832a4af448d349bf8d85b97d413b63c581dbb64b49"},"schema_version":"1.0"},"canonical_sha256":"3dc816b744189f7dccb8a3064baaee339e2c0a9ca126599304a006bd50ad03d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.304328Z","signature_b64":"HCkBYhnlMSNkNe/lnbCzJpsihWtQc8TLd70jOKx0wM2tFvN/jQwmegBuZGfJh7eL9yL4BHCYaw7CH2V8j4ExCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dc816b744189f7dccb8a3064baaee339e2c0a9ca126599304a006bd50ad03d6","last_reissued_at":"2026-05-18T00:18:21.303588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.303588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06231","source_version":1,"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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sI7CliFbIX3jOiZsbqSOQRhtrzDVWWqudv+9AxXPBuqO7iHN79O6UM5kpL2FsVrtmB3hTywB2B+ON8JOLwfaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:38.022885Z"},"content_sha256":"bf7f6ed299a813b6679ce11826455432799febd7f401c50cfab209fd059252e7","schema_version":"1.0","event_id":"sha256:bf7f6ed299a813b6679ce11826455432799febd7f401c50cfab209fd059252e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HXEBNN2EDCPX3TFYUMDEXKXOGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient SIMD Implementation of Pseudo-Verlet Lists for Neighbour Interactions in Particle-Based Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"James S. Willis, Matthieu Schaller, Pedro Gonnet, Peter W. Draper, Richard G. Bower","submitted_at":"2018-04-17T13:31:28Z","abstract_excerpt":"In particle-based simulations, neighbour finding (i.e finding pairs of particles to interact within a given range) is the most time consuming part of the computation. One of the best such algorithms, which can be used for both Molecular Dynamics (MD) and Smoothed Particle Hydrodynamics (SPH) simulations, is the pseudo-Verlet list algorithm. This algorithm, however, does not vectorise trivially, and hence makes it difficult to exploit SIMD-parallel architectures. In this paper, we present several novel modifications as well as a vectorisation strategy for the algorithm which lead to overall spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06231","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"},"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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KIPKqgoSq7m4eBXz0VMcUT0kjGySaxkn5T+oc43bl+rW7/k8kW8wKsUYNB8+GeL43qbSK4bZ2DpbI9AknZdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:38.023221Z"},"content_sha256":"e29269f6bd15f20c22fbbcb5ccedb5809881928488d9185ae2b5632b20268691","schema_version":"1.0","event_id":"sha256:e29269f6bd15f20c22fbbcb5ccedb5809881928488d9185ae2b5632b20268691"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/bundle.json","state_url":"https://pith.science/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/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-06-01T21:48:38Z","links":{"resolver":"https://pith.science/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO","bundle":"https://pith.science/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/bundle.json","state":"https://pith.science/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXEBNN2EDCPX3TFYUMDEXKXOGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HXEBNN2EDCPX3TFYUMDEXKXOGO","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":"6bafdeb9d826d8cc9ad506832a4af448d349bf8d85b97d413b63c581dbb64b49","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T13:31:28Z","title_canon_sha256":"e588e34a9e28b57e5acd9eae5ec55f4481bf363a762ca142eda6b87c9cd47826"},"schema_version":"1.0","source":{"id":"1804.06231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06231","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06231v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06231","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"HXEBNN2EDCPX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXEBNN2EDCPX3TFY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXEBNN2E","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e29269f6bd15f20c22fbbcb5ccedb5809881928488d9185ae2b5632b20268691","target":"graph","created_at":"2026-05-18T00:18:21Z","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":"In particle-based simulations, neighbour finding (i.e finding pairs of particles to interact within a given range) is the most time consuming part of the computation. One of the best such algorithms, which can be used for both Molecular Dynamics (MD) and Smoothed Particle Hydrodynamics (SPH) simulations, is the pseudo-Verlet list algorithm. This algorithm, however, does not vectorise trivially, and hence makes it difficult to exploit SIMD-parallel architectures. In this paper, we present several novel modifications as well as a vectorisation strategy for the algorithm which lead to overall spe","authors_text":"James S. Willis, Matthieu Schaller, Pedro Gonnet, Peter W. Draper, Richard G. Bower","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T13:31:28Z","title":"An Efficient SIMD Implementation of Pseudo-Verlet Lists for Neighbour Interactions in Particle-Based Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06231","kind":"arxiv","version":1},"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:bf7f6ed299a813b6679ce11826455432799febd7f401c50cfab209fd059252e7","target":"record","created_at":"2026-05-18T00:18:21Z","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":"6bafdeb9d826d8cc9ad506832a4af448d349bf8d85b97d413b63c581dbb64b49","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T13:31:28Z","title_canon_sha256":"e588e34a9e28b57e5acd9eae5ec55f4481bf363a762ca142eda6b87c9cd47826"},"schema_version":"1.0","source":{"id":"1804.06231","kind":"arxiv","version":1}},"canonical_sha256":"3dc816b744189f7dccb8a3064baaee339e2c0a9ca126599304a006bd50ad03d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dc816b744189f7dccb8a3064baaee339e2c0a9ca126599304a006bd50ad03d6","first_computed_at":"2026-05-18T00:18:21.303588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:21.303588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCkBYhnlMSNkNe/lnbCzJpsihWtQc8TLd70jOKx0wM2tFvN/jQwmegBuZGfJh7eL9yL4BHCYaw7CH2V8j4ExCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:21.304328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf7f6ed299a813b6679ce11826455432799febd7f401c50cfab209fd059252e7","sha256:e29269f6bd15f20c22fbbcb5ccedb5809881928488d9185ae2b5632b20268691"],"state_sha256":"ecc34d27ea4460759791e5767ece77e2b0dc12331154dc969612f8379866b931"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt0muZN/e/bjRgf06ux+StgkuOOT9FMXUlsCF8oKnIV23tDvPyqJzC31jZQMUBXm3nfpU3QFxNHSIvQntP+xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:48:38.025087Z","bundle_sha256":"a18b8c3525ecd0b35db43697c80a791f979ea4a6561385e1c260ffac7738f256"}}