{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VBSGWO25IIMYNMTHF4NFGMNQBB","short_pith_number":"pith:VBSGWO25","canonical_record":{"source":{"id":"1803.03922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T08:18:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f16693ec066930a036878bae1ad8e32681e9d0e0dd5cc4216e489fd55f3f358b","abstract_canon_sha256":"89919eb270ee3a9071717e9b6108220e3dac369b96955f2b09eca0660b312669"},"schema_version":"1.0"},"canonical_sha256":"a8646b3b5d421986b2672f1a5331b008704c2b21162d4a7a8f36e961876cd358","source":{"kind":"arxiv","id":"1803.03922","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03922","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03922v2","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03922","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"VBSGWO25IIMY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VBSGWO25IIMYNMTH","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VBSGWO25","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VBSGWO25IIMYNMTHF4NFGMNQBB","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T08:18:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f16693ec066930a036878bae1ad8e32681e9d0e0dd5cc4216e489fd55f3f358b","abstract_canon_sha256":"89919eb270ee3a9071717e9b6108220e3dac369b96955f2b09eca0660b312669"},"schema_version":"1.0"},"canonical_sha256":"a8646b3b5d421986b2672f1a5331b008704c2b21162d4a7a8f36e961876cd358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:11.007405Z","signature_b64":"I0xoBqijDw/TlJ+wzEj01Si9yj2Ps+IdGXofVlXVyTbJTauLVBqcWjr6qsHYylw0RIUeo4bq6hP9cIBup9DxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8646b3b5d421986b2672f1a5331b008704c2b21162d4a7a8f36e961876cd358","last_reissued_at":"2026-05-18T00:19:11.006907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:11.006907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03922","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-18T00:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETlsuqV1vsh2AxUT2VF38Ixoq16uqw5dZRFl1aArOkyG0KBG/Do4P5Fen3FqIhqb2FY4gFbrfs50oZSe41M4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:00:18.563767Z"},"content_sha256":"54ea725435678b897227006a62edaaefd36fd34f54a64b6db0e5c467ac63fede","schema_version":"1.0","event_id":"sha256:54ea725435678b897227006a62edaaefd36fd34f54a64b6db0e5c467ac63fede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VBSGWO25IIMYNMTHF4NFGMNQBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Breadth-First Search on a GPU Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"John D. Owens, Roger Pearce, Yuechao Pan","submitted_at":"2018-03-11T08:18:51Z","abstract_excerpt":"On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadth-first search (BFS) on a scale-free graph extremely challenging. By separating high and low out-degree vertices, we present an implementation with scalable computation and a model for scalable communication for BFS and direction-optimized BFS. Our communication model uses global reduction for high-degree vertices, and point-to-point transmission for low-degree vertices. Leveraging the characteristics of degree separation, we reduce the graph size to one third of the conventional edge list repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03922","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-18T00:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Ic6Gp4kHypKJ2I9AuL4RzwgdmtDtnZNY8M/qjZWWOGIYyA2Bxnx/FNVsSkoAjoU/uolMGisZobUl7jdg7jyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:00:18.564468Z"},"content_sha256":"3b196dbed996ed42bec99b81abaf9cf746413607f68f08874b339260275f9cb6","schema_version":"1.0","event_id":"sha256:3b196dbed996ed42bec99b81abaf9cf746413607f68f08874b339260275f9cb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/bundle.json","state_url":"https://pith.science/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/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-05-30T16:00:18Z","links":{"resolver":"https://pith.science/pith/VBSGWO25IIMYNMTHF4NFGMNQBB","bundle":"https://pith.science/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/bundle.json","state":"https://pith.science/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBSGWO25IIMYNMTHF4NFGMNQBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VBSGWO25IIMYNMTHF4NFGMNQBB","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":"89919eb270ee3a9071717e9b6108220e3dac369b96955f2b09eca0660b312669","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T08:18:51Z","title_canon_sha256":"f16693ec066930a036878bae1ad8e32681e9d0e0dd5cc4216e489fd55f3f358b"},"schema_version":"1.0","source":{"id":"1803.03922","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03922","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03922v2","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03922","created_at":"2026-05-18T00:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"VBSGWO25IIMY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VBSGWO25IIMYNMTH","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VBSGWO25","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:3b196dbed996ed42bec99b81abaf9cf746413607f68f08874b339260275f9cb6","target":"graph","created_at":"2026-05-18T00:19:11Z","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":"On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadth-first search (BFS) on a scale-free graph extremely challenging. By separating high and low out-degree vertices, we present an implementation with scalable computation and a model for scalable communication for BFS and direction-optimized BFS. Our communication model uses global reduction for high-degree vertices, and point-to-point transmission for low-degree vertices. Leveraging the characteristics of degree separation, we reduce the graph size to one third of the conventional edge list repres","authors_text":"John D. Owens, Roger Pearce, Yuechao Pan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T08:18:51Z","title":"Scalable Breadth-First Search on a GPU Cluster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03922","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:54ea725435678b897227006a62edaaefd36fd34f54a64b6db0e5c467ac63fede","target":"record","created_at":"2026-05-18T00:19:11Z","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":"89919eb270ee3a9071717e9b6108220e3dac369b96955f2b09eca0660b312669","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T08:18:51Z","title_canon_sha256":"f16693ec066930a036878bae1ad8e32681e9d0e0dd5cc4216e489fd55f3f358b"},"schema_version":"1.0","source":{"id":"1803.03922","kind":"arxiv","version":2}},"canonical_sha256":"a8646b3b5d421986b2672f1a5331b008704c2b21162d4a7a8f36e961876cd358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8646b3b5d421986b2672f1a5331b008704c2b21162d4a7a8f36e961876cd358","first_computed_at":"2026-05-18T00:19:11.006907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:11.006907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I0xoBqijDw/TlJ+wzEj01Si9yj2Ps+IdGXofVlXVyTbJTauLVBqcWjr6qsHYylw0RIUeo4bq6hP9cIBup9DxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:11.007405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03922","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54ea725435678b897227006a62edaaefd36fd34f54a64b6db0e5c467ac63fede","sha256:3b196dbed996ed42bec99b81abaf9cf746413607f68f08874b339260275f9cb6"],"state_sha256":"9c9952bee29538685dcfef2800a4bb88e399d1cee40d6cd47674662f9ca296e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o94U723W2DFnJvpUR8cbqt7TrGFUJ3TMAchYUyhM2iGy2nZA+geetivmWMO5wgKjnZZK4/bstyr4VtdFD7dKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:00:18.568370Z","bundle_sha256":"c3c2479feae3e33808335e482eaec57abcd0b1119dd4adf36d9a6e92a56ae7de"}}