{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3TIHAY25POPPWGYED5BOOGP2CG","short_pith_number":"pith:3TIHAY25","schema_version":"1.0","canonical_sha256":"dcd070635d7b9efb1b041f42e719fa11b05a1128062f0dd80fa3bb61c5cd4201","source":{"kind":"arxiv","id":"1406.6158","version":1},"attestation_state":"computed","paper":{"title":"GPU accelerated Hybrid Tree Algorithm for Collision-less N-body Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.comp-ph"],"primary_cat":"astro-ph.IM","authors_text":"Naohito Nakasato, Tsuyoshi Watanabe","submitted_at":"2014-06-24T07:43:27Z","abstract_excerpt":"We propose a hybrid tree algorithm for reducing calculation and communication cost of collision-less N-body simulations. The concept of our algorithm is that we split interaction force into two parts: hard-force from neighbor particles and soft-force from distant particles, and applying different time integration for the forces. For hard-force calculation, we can efficiently reduce the calculation and communication cost of the parallel tree code because we only need data of neighbor particles for this part. We implement the algorithm on GPU clusters to accelerate force calculation for both har"},"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":"1406.6158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2014-06-24T07:43:27Z","cross_cats_sorted":["cs.DC","physics.comp-ph"],"title_canon_sha256":"b43b0bb3926dc312dd7ee00b0b84218c32e3bf3a9c8f7f099bf85198e1f3fb7e","abstract_canon_sha256":"4d486a2431f7ce0762e0c0f9103571802d28f8b170549b6a076b8c446fdb477f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.974499Z","signature_b64":"ALyNxNTmwEdlQG5t3gqreicgECHvAyF7COkx21dujFQZnwD62LSehndTXeJd7sWgV1CbrsnpXLzWgSIYlx4CDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcd070635d7b9efb1b041f42e719fa11b05a1128062f0dd80fa3bb61c5cd4201","last_reissued_at":"2026-05-18T02:49:03.974048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.974048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU accelerated Hybrid Tree Algorithm for Collision-less N-body Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.comp-ph"],"primary_cat":"astro-ph.IM","authors_text":"Naohito Nakasato, Tsuyoshi Watanabe","submitted_at":"2014-06-24T07:43:27Z","abstract_excerpt":"We propose a hybrid tree algorithm for reducing calculation and communication cost of collision-less N-body simulations. The concept of our algorithm is that we split interaction force into two parts: hard-force from neighbor particles and soft-force from distant particles, and applying different time integration for the forces. For hard-force calculation, we can efficiently reduce the calculation and communication cost of the parallel tree code because we only need data of neighbor particles for this part. We implement the algorithm on GPU clusters to accelerate force calculation for both har"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6158","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":"1406.6158","created_at":"2026-05-18T02:49:03.974116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6158v1","created_at":"2026-05-18T02:49:03.974116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6158","created_at":"2026-05-18T02:49:03.974116+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TIHAY25POPP","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TIHAY25POPPWGYE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TIHAY25","created_at":"2026-05-18T12:28:11.866339+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/3TIHAY25POPPWGYED5BOOGP2CG","json":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG.json","graph_json":"https://pith.science/api/pith-number/3TIHAY25POPPWGYED5BOOGP2CG/graph.json","events_json":"https://pith.science/api/pith-number/3TIHAY25POPPWGYED5BOOGP2CG/events.json","paper":"https://pith.science/paper/3TIHAY25"},"agent_actions":{"view_html":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG","download_json":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG.json","view_paper":"https://pith.science/paper/3TIHAY25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6158&json=true","fetch_graph":"https://pith.science/api/pith-number/3TIHAY25POPPWGYED5BOOGP2CG/graph.json","fetch_events":"https://pith.science/api/pith-number/3TIHAY25POPPWGYED5BOOGP2CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG/action/storage_attestation","attest_author":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG/action/author_attestation","sign_citation":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG/action/citation_signature","submit_replication":"https://pith.science/pith/3TIHAY25POPPWGYED5BOOGP2CG/action/replication_record"}},"created_at":"2026-05-18T02:49:03.974116+00:00","updated_at":"2026-05-18T02:49:03.974116+00:00"}