{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:W535B75O2SAC57TTCG6LMJPPRW","short_pith_number":"pith:W535B75O","canonical_record":{"source":{"id":"1112.4539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-12-20T00:59:41Z","cross_cats_sorted":["astro-ph.GA","cs.PF"],"title_canon_sha256":"ce83d8bfa7f34f7132073400129f152b6be142ebb8f936cf054f8794de3a550a","abstract_canon_sha256":"c632e2aa180b06063f444be8020551c328aace9f3109f2fdd6f8ea94998cd24d"},"schema_version":"1.0"},"canonical_sha256":"b777d0ffaed4802efe7311bcb625ef8d9d191278a0980a78c5ae1596287bc23c","source":{"kind":"arxiv","id":"1112.4539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4539","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4539v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4539","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"W535B75O2SAC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W535B75O2SAC57TT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W535B75O","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:W535B75O2SAC57TTCG6LMJPPRW","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-12-20T00:59:41Z","cross_cats_sorted":["astro-ph.GA","cs.PF"],"title_canon_sha256":"ce83d8bfa7f34f7132073400129f152b6be142ebb8f936cf054f8794de3a550a","abstract_canon_sha256":"c632e2aa180b06063f444be8020551c328aace9f3109f2fdd6f8ea94998cd24d"},"schema_version":"1.0"},"canonical_sha256":"b777d0ffaed4802efe7311bcb625ef8d9d191278a0980a78c5ae1596287bc23c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:58.623732Z","signature_b64":"YorXt9cGHmLXyVadhfV3mel5kc8NCkGKglmBMKwGYJETV2qTX/VtZpzoPdMMJgBnNaYZVFgM3CJejQbgHjVjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b777d0ffaed4802efe7311bcb625ef8d9d191278a0980a78c5ae1596287bc23c","last_reissued_at":"2026-05-18T04:05:58.623013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:58.623013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4539","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXhctRwURTrVMixhTV1b2shC1yEGG4++xXNKghSRQzeb8qfVZLJ1isdG5JbHHOvSC4C+Ah0LTa1V7TkxExmoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:14:53.614810Z"},"content_sha256":"56493b6fda33e8a3c88e3a557a5bad506a8ec4b60484f0064c3f579ff89d1cd8","schema_version":"1.0","event_id":"sha256:56493b6fda33e8a3c88e3a557a5bad506a8ec4b60484f0064c3f579ff89d1cd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:W535B75O2SAC57TTCG6LMJPPRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementation of a Parallel Tree Method on a GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.GA","cs.PF"],"primary_cat":"astro-ph.IM","authors_text":"Naohito Nakasato","submitted_at":"2011-12-20T00:59:41Z","abstract_excerpt":"The kd-tree is a fundamental tool in computer science. Among other applications, the application of kd-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O(N^2) for a brute force method to O(N log N) for the tree method, where N is the number of particles. In this paper, we present a parallel implementation of the tree method running on a graphics processing unit (GPU). We present a detailed description of how we have implemented the tree method on a Cypre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4539","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGBjiZpg58LpXSrE6k5WZEBW8/vt7c0R0Sm7ZdO/cIQbWPISv97ZJuLYdPXoA4YVXxz04OKGanmOmvUyiRJCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:14:53.615424Z"},"content_sha256":"e4ea6022106c2ede3663fe7d512b4cc8bc16c08d67372d413b28fced1578e9ab","schema_version":"1.0","event_id":"sha256:e4ea6022106c2ede3663fe7d512b4cc8bc16c08d67372d413b28fced1578e9ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W535B75O2SAC57TTCG6LMJPPRW/bundle.json","state_url":"https://pith.science/pith/W535B75O2SAC57TTCG6LMJPPRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W535B75O2SAC57TTCG6LMJPPRW/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-07T12:14:53Z","links":{"resolver":"https://pith.science/pith/W535B75O2SAC57TTCG6LMJPPRW","bundle":"https://pith.science/pith/W535B75O2SAC57TTCG6LMJPPRW/bundle.json","state":"https://pith.science/pith/W535B75O2SAC57TTCG6LMJPPRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W535B75O2SAC57TTCG6LMJPPRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:W535B75O2SAC57TTCG6LMJPPRW","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":"c632e2aa180b06063f444be8020551c328aace9f3109f2fdd6f8ea94998cd24d","cross_cats_sorted":["astro-ph.GA","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-12-20T00:59:41Z","title_canon_sha256":"ce83d8bfa7f34f7132073400129f152b6be142ebb8f936cf054f8794de3a550a"},"schema_version":"1.0","source":{"id":"1112.4539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4539","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4539v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4539","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"W535B75O2SAC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W535B75O2SAC57TT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W535B75O","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:e4ea6022106c2ede3663fe7d512b4cc8bc16c08d67372d413b28fced1578e9ab","target":"graph","created_at":"2026-05-18T04:05:58Z","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":"The kd-tree is a fundamental tool in computer science. Among other applications, the application of kd-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O(N^2) for a brute force method to O(N log N) for the tree method, where N is the number of particles. In this paper, we present a parallel implementation of the tree method running on a graphics processing unit (GPU). We present a detailed description of how we have implemented the tree method on a Cypre","authors_text":"Naohito Nakasato","cross_cats":["astro-ph.GA","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-12-20T00:59:41Z","title":"Implementation of a Parallel Tree Method on a GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4539","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:56493b6fda33e8a3c88e3a557a5bad506a8ec4b60484f0064c3f579ff89d1cd8","target":"record","created_at":"2026-05-18T04:05:58Z","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":"c632e2aa180b06063f444be8020551c328aace9f3109f2fdd6f8ea94998cd24d","cross_cats_sorted":["astro-ph.GA","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-12-20T00:59:41Z","title_canon_sha256":"ce83d8bfa7f34f7132073400129f152b6be142ebb8f936cf054f8794de3a550a"},"schema_version":"1.0","source":{"id":"1112.4539","kind":"arxiv","version":1}},"canonical_sha256":"b777d0ffaed4802efe7311bcb625ef8d9d191278a0980a78c5ae1596287bc23c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b777d0ffaed4802efe7311bcb625ef8d9d191278a0980a78c5ae1596287bc23c","first_computed_at":"2026-05-18T04:05:58.623013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:58.623013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YorXt9cGHmLXyVadhfV3mel5kc8NCkGKglmBMKwGYJETV2qTX/VtZpzoPdMMJgBnNaYZVFgM3CJejQbgHjVjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:58.623732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56493b6fda33e8a3c88e3a557a5bad506a8ec4b60484f0064c3f579ff89d1cd8","sha256:e4ea6022106c2ede3663fe7d512b4cc8bc16c08d67372d413b28fced1578e9ab"],"state_sha256":"26573b948ce876300a4d774553f1528090af0d98432342773b92d24cbdb5af35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxh9ugfvp4sx6TyEZQVL3HKLSXCDdhB7Hg4/00iB6SB75f/2EQ2BbIXVVovH4kDIBT2wjqCsZUw4hg2bkK2pAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:14:53.618337Z","bundle_sha256":"d380a79d989df9d19582008b058f9e03b5225cd58e0e4ec8edc18d1bd02befe5"}}