{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BWF56XSVA5A43PRD5IMPHN4QZO","short_pith_number":"pith:BWF56XSV","schema_version":"1.0","canonical_sha256":"0d8bdf5e550741cdbe23ea18f3b790cbbce0648e57b2a1dd1b90174c09b054e5","source":{"kind":"arxiv","id":"1810.09898","version":1},"attestation_state":"computed","paper":{"title":"Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"astro-ph.IM","authors_text":"Antonio Ragagnin, Klaus Dolag, Michael Bader, Nicolay J. Hammer, Nikola Tchipev","submitted_at":"2018-10-23T15:00:46Z","abstract_excerpt":"Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming parts. Thus, a considerable speedup can be expected from improvements of the u\\ nderlying algorithms. In this work we propose a novel approach for speeding up the Neighbour Search which takes advantage of the space-filling-curve particle ordering. Instead of performing Neighbour Search for all particles individually, nearby active particles can be grouped and on"},"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":"1810.09898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2018-10-23T15:00:46Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"7a17877d36ea91fa316faa59b2151f21935ffa328253a27191160f201dcc65a0","abstract_canon_sha256":"3449d546277d9e3690471b12e9c03d277ecdccd817bf31ff5a34963646b6eb86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:26.043691Z","signature_b64":"gsOK1EF0U0pdNPLVjxru9maNIRek2SExYbwc1ABnS7ygYiL0k2khhUIdvlMDmnPsrexEd6UZbu2gpcgDS8RvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8bdf5e550741cdbe23ea18f3b790cbbce0648e57b2a1dd1b90174c09b054e5","last_reissued_at":"2026-05-18T00:01:26.043181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:26.043181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"astro-ph.IM","authors_text":"Antonio Ragagnin, Klaus Dolag, Michael Bader, Nicolay J. Hammer, Nikola Tchipev","submitted_at":"2018-10-23T15:00:46Z","abstract_excerpt":"Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming parts. Thus, a considerable speedup can be expected from improvements of the u\\ nderlying algorithms. In this work we propose a novel approach for speeding up the Neighbour Search which takes advantage of the space-filling-curve particle ordering. Instead of performing Neighbour Search for all particles individually, nearby active particles can be grouped and on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09898","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":"1810.09898","created_at":"2026-05-18T00:01:26.043265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09898v1","created_at":"2026-05-18T00:01:26.043265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09898","created_at":"2026-05-18T00:01:26.043265+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWF56XSVA5A4","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWF56XSVA5A43PRD","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWF56XSV","created_at":"2026-05-18T12:32:16.446611+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/BWF56XSVA5A43PRD5IMPHN4QZO","json":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO.json","graph_json":"https://pith.science/api/pith-number/BWF56XSVA5A43PRD5IMPHN4QZO/graph.json","events_json":"https://pith.science/api/pith-number/BWF56XSVA5A43PRD5IMPHN4QZO/events.json","paper":"https://pith.science/paper/BWF56XSV"},"agent_actions":{"view_html":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO","download_json":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO.json","view_paper":"https://pith.science/paper/BWF56XSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09898&json=true","fetch_graph":"https://pith.science/api/pith-number/BWF56XSVA5A43PRD5IMPHN4QZO/graph.json","fetch_events":"https://pith.science/api/pith-number/BWF56XSVA5A43PRD5IMPHN4QZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO/action/storage_attestation","attest_author":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO/action/author_attestation","sign_citation":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO/action/citation_signature","submit_replication":"https://pith.science/pith/BWF56XSVA5A43PRD5IMPHN4QZO/action/replication_record"}},"created_at":"2026-05-18T00:01:26.043265+00:00","updated_at":"2026-05-18T00:01:26.043265+00:00"}