{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J2UI2ER23QQ4FT6G3GYQPTCD73","short_pith_number":"pith:J2UI2ER2","canonical_record":{"source":{"id":"1106.1900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-06-09T20:00:07Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ea60a5294de19a9db8ed354f56ae1b722d022ecf415b84fda966380d5fa38eb","abstract_canon_sha256":"3b741b55c2f0419747eafdcd145dbcf1c6b29a891778e0ffa2778f48d2d4c9f6"},"schema_version":"1.0"},"canonical_sha256":"4ea88d123adc21c2cfc6d9b107cc43fefd9aee45990dd19d6cb028f7faac5d7b","source":{"kind":"arxiv","id":"1106.1900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1900","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1900v2","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1900","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"J2UI2ER23QQ4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J2UI2ER23QQ4FT6G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J2UI2ER2","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J2UI2ER23QQ4FT6G3GYQPTCD73","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-06-09T20:00:07Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ea60a5294de19a9db8ed354f56ae1b722d022ecf415b84fda966380d5fa38eb","abstract_canon_sha256":"3b741b55c2f0419747eafdcd145dbcf1c6b29a891778e0ffa2778f48d2d4c9f6"},"schema_version":"1.0"},"canonical_sha256":"4ea88d123adc21c2cfc6d9b107cc43fefd9aee45990dd19d6cb028f7faac5d7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:14.136914Z","signature_b64":"HK/+y7pHbm/DjHeto6509vIgJIrtJDJMm+OMIkCJcBCvxH9mEX4qX5sL4liy/Q/lReliNgMwgAxfpzEFjxsvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ea88d123adc21c2cfc6d9b107cc43fefd9aee45990dd19d6cb028f7faac5d7b","last_reissued_at":"2026-05-18T03:58:14.136113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:14.136113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1900","source_version":2,"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-18T03:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8gYOy4nAR1KK/LBdDjDOhsVQNFXY8rMgAeJOqepOXGwqDVK430VHvBDSRD+ugWsgkjrb+4ubD14cKVRvHCfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:15:19.799166Z"},"content_sha256":"69a3be86c6dbd72b47b1c9586f17a41eb312f265068d426c3c6c2b3c30e85a02","schema_version":"1.0","event_id":"sha256:69a3be86c6dbd72b47b1c9586f17a41eb312f265068d426c3c6c2b3c30e85a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J2UI2ER23QQ4FT6G3GYQPTCD73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sparse octree gravitational N-body code that runs entirely on the GPU processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"astro-ph.IM","authors_text":"Evghenii Gaburov, Jeroen B\\'edorf, Simon Portegies Zwart","submitted_at":"2011-06-09T20:00:07Z","abstract_excerpt":"We present parallel algorithms for constructing and traversing sparse octrees on graphics processing units (GPUs). The algorithms are based on parallel-scan and sort methods. To test the performance and feasibility, we implemented them in CUDA in the form of a gravitational tree-code which completely runs on the GPU.(The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html) The tree construction and traverse algorithms are portable to many-core devices which have support for CUDA or OpenCL programming languages. The gravitational tree-code outperforms tuned CPU code du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1900","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"},"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-18T03:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyRnV3PiXRk+m9VhEekRBfruHjeVuVqRVLOXtBR4hQkERq1XGvUwPAcReqGIZnEVIghr7mNBIlCW+T1oO1lzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:15:19.799924Z"},"content_sha256":"f7d36eec3895b4637d29a6a2c88ad7086d8b56807143c2a65a8be947ae9a4ecf","schema_version":"1.0","event_id":"sha256:f7d36eec3895b4637d29a6a2c88ad7086d8b56807143c2a65a8be947ae9a4ecf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/bundle.json","state_url":"https://pith.science/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/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-08T05:15:19Z","links":{"resolver":"https://pith.science/pith/J2UI2ER23QQ4FT6G3GYQPTCD73","bundle":"https://pith.science/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/bundle.json","state":"https://pith.science/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2UI2ER23QQ4FT6G3GYQPTCD73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J2UI2ER23QQ4FT6G3GYQPTCD73","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":"3b741b55c2f0419747eafdcd145dbcf1c6b29a891778e0ffa2778f48d2d4c9f6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-06-09T20:00:07Z","title_canon_sha256":"0ea60a5294de19a9db8ed354f56ae1b722d022ecf415b84fda966380d5fa38eb"},"schema_version":"1.0","source":{"id":"1106.1900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1900","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1900v2","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1900","created_at":"2026-05-18T03:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"J2UI2ER23QQ4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J2UI2ER23QQ4FT6G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J2UI2ER2","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:f7d36eec3895b4637d29a6a2c88ad7086d8b56807143c2a65a8be947ae9a4ecf","target":"graph","created_at":"2026-05-18T03:58:14Z","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":"We present parallel algorithms for constructing and traversing sparse octrees on graphics processing units (GPUs). The algorithms are based on parallel-scan and sort methods. To test the performance and feasibility, we implemented them in CUDA in the form of a gravitational tree-code which completely runs on the GPU.(The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html) The tree construction and traverse algorithms are portable to many-core devices which have support for CUDA or OpenCL programming languages. The gravitational tree-code outperforms tuned CPU code du","authors_text":"Evghenii Gaburov, Jeroen B\\'edorf, Simon Portegies Zwart","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-06-09T20:00:07Z","title":"A sparse octree gravitational N-body code that runs entirely on the GPU processor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1900","kind":"arxiv","version":2},"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:69a3be86c6dbd72b47b1c9586f17a41eb312f265068d426c3c6c2b3c30e85a02","target":"record","created_at":"2026-05-18T03:58:14Z","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":"3b741b55c2f0419747eafdcd145dbcf1c6b29a891778e0ffa2778f48d2d4c9f6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2011-06-09T20:00:07Z","title_canon_sha256":"0ea60a5294de19a9db8ed354f56ae1b722d022ecf415b84fda966380d5fa38eb"},"schema_version":"1.0","source":{"id":"1106.1900","kind":"arxiv","version":2}},"canonical_sha256":"4ea88d123adc21c2cfc6d9b107cc43fefd9aee45990dd19d6cb028f7faac5d7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ea88d123adc21c2cfc6d9b107cc43fefd9aee45990dd19d6cb028f7faac5d7b","first_computed_at":"2026-05-18T03:58:14.136113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:14.136113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HK/+y7pHbm/DjHeto6509vIgJIrtJDJMm+OMIkCJcBCvxH9mEX4qX5sL4liy/Q/lReliNgMwgAxfpzEFjxsvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:14.136914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69a3be86c6dbd72b47b1c9586f17a41eb312f265068d426c3c6c2b3c30e85a02","sha256:f7d36eec3895b4637d29a6a2c88ad7086d8b56807143c2a65a8be947ae9a4ecf"],"state_sha256":"7f283b5c883fbff0608f505342ce73073d236f334849551c2e9e9b0f531728a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvlS9S2Z8IytCLxumzEEHoPsTS8uLri2tFjWLdrJsM5gM10LhewWine9sKVPMRszaoT2maw2eVRdz4uEXrJhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:15:19.804121Z","bundle_sha256":"52f0594c8e87c21151056cc0d99c473b5bbcda229d78e34415eee192eb5b68c2"}}