{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UZ2VXPTPJ5JQMCVVHG3Z32B4JM","short_pith_number":"pith:UZ2VXPTP","canonical_record":{"source":{"id":"1409.7764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-27T04:57:30Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"28d121951db79bb3a015f75df3103ba1001de5b51a3f575ce74c29e104c8dd30","abstract_canon_sha256":"e2de55e5c7b2af40e01a6beec689088fbd9b331857f7f38068caa57ebfc230db"},"schema_version":"1.0"},"canonical_sha256":"a6755bbe6f4f53060ab539b79de83c4b39ce8596a3d1f230819117e4a08c3de0","source":{"kind":"arxiv","id":"1409.7764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7764","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7764v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7764","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"UZ2VXPTPJ5JQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZ2VXPTPJ5JQMCVV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZ2VXPTP","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UZ2VXPTPJ5JQMCVVHG3Z32B4JM","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-27T04:57:30Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"28d121951db79bb3a015f75df3103ba1001de5b51a3f575ce74c29e104c8dd30","abstract_canon_sha256":"e2de55e5c7b2af40e01a6beec689088fbd9b331857f7f38068caa57ebfc230db"},"schema_version":"1.0"},"canonical_sha256":"a6755bbe6f4f53060ab539b79de83c4b39ce8596a3d1f230819117e4a08c3de0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.690105Z","signature_b64":"oidIEis7QFRvWZSO3K4zJSZN+g98egGHrUNITnfpI2fd7i6sCQZAQO1db/ZwroUpbwgDx0cHa7TWWmKgG0nSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6755bbe6f4f53060ab539b79de83c4b39ce8596a3d1f230819117e4a08c3de0","last_reissued_at":"2026-05-18T02:41:40.689453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.689453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7764","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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hu5sRnLx0rn79Ft5fBC0SaHS8hbDetPn9hltYtXYjBXNZaqFW/H8JJNZxAC3DZTKl8yoqlVkQlGwKto6QcB6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:10:43.460545Z"},"content_sha256":"2e5940490ce8a3b7067c551368474eb36a7b085ec9cf393ba1710f0324011c28","schema_version":"1.0","event_id":"sha256:2e5940490ce8a3b7067c551368474eb36a7b085ec9cf393ba1710f0324011c28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UZ2VXPTPJ5JQMCVVHG3Z32B4JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A (Somewhat Dated) Comparative Study of Betweenness Centrality Algorithms on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.SI","authors_text":"Saad Quader","submitted_at":"2014-09-27T04:57:30Z","abstract_excerpt":"The problem of computing the Betweenness Centrality (BC) is important in analyzing graphs in many practical applications like social networks, biological networks, transportation networks, electrical circuits, etc. Since this problem is computation intensive, researchers have been developing algorithms using high performance computing resources like supercomputers, clusters, and Graphics Processing Units (GPUs). Current GPU algorithms for computing BC employ Brandes' sequential algorithm with different trade-offs for thread scheduling, data structures, and atomic operations. In this paper, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7764","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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5hniCi7kYo8+LEjTnr8kEenQaT1yDKlNMhul26qhLmyx1m+6tEyXxm4ObELQCxSY4peDzkdl84AEuL3TXv1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:10:43.461222Z"},"content_sha256":"449f1b3dfc5009b71efda22f572fb0489983a9d79de03e8779610c6c9f7c7c7f","schema_version":"1.0","event_id":"sha256:449f1b3dfc5009b71efda22f572fb0489983a9d79de03e8779610c6c9f7c7c7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/bundle.json","state_url":"https://pith.science/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/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-28T21:10:43Z","links":{"resolver":"https://pith.science/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM","bundle":"https://pith.science/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/bundle.json","state":"https://pith.science/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZ2VXPTPJ5JQMCVVHG3Z32B4JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UZ2VXPTPJ5JQMCVVHG3Z32B4JM","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":"e2de55e5c7b2af40e01a6beec689088fbd9b331857f7f38068caa57ebfc230db","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-27T04:57:30Z","title_canon_sha256":"28d121951db79bb3a015f75df3103ba1001de5b51a3f575ce74c29e104c8dd30"},"schema_version":"1.0","source":{"id":"1409.7764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7764","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7764v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7764","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"UZ2VXPTPJ5JQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZ2VXPTPJ5JQMCVV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZ2VXPTP","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:449f1b3dfc5009b71efda22f572fb0489983a9d79de03e8779610c6c9f7c7c7f","target":"graph","created_at":"2026-05-18T02:41:40Z","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 problem of computing the Betweenness Centrality (BC) is important in analyzing graphs in many practical applications like social networks, biological networks, transportation networks, electrical circuits, etc. Since this problem is computation intensive, researchers have been developing algorithms using high performance computing resources like supercomputers, clusters, and Graphics Processing Units (GPUs). Current GPU algorithms for computing BC employ Brandes' sequential algorithm with different trade-offs for thread scheduling, data structures, and atomic operations. In this paper, we ","authors_text":"Saad Quader","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-27T04:57:30Z","title":"A (Somewhat Dated) Comparative Study of Betweenness Centrality Algorithms on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7764","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:2e5940490ce8a3b7067c551368474eb36a7b085ec9cf393ba1710f0324011c28","target":"record","created_at":"2026-05-18T02:41:40Z","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":"e2de55e5c7b2af40e01a6beec689088fbd9b331857f7f38068caa57ebfc230db","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-27T04:57:30Z","title_canon_sha256":"28d121951db79bb3a015f75df3103ba1001de5b51a3f575ce74c29e104c8dd30"},"schema_version":"1.0","source":{"id":"1409.7764","kind":"arxiv","version":1}},"canonical_sha256":"a6755bbe6f4f53060ab539b79de83c4b39ce8596a3d1f230819117e4a08c3de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6755bbe6f4f53060ab539b79de83c4b39ce8596a3d1f230819117e4a08c3de0","first_computed_at":"2026-05-18T02:41:40.689453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:40.689453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oidIEis7QFRvWZSO3K4zJSZN+g98egGHrUNITnfpI2fd7i6sCQZAQO1db/ZwroUpbwgDx0cHa7TWWmKgG0nSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:40.690105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e5940490ce8a3b7067c551368474eb36a7b085ec9cf393ba1710f0324011c28","sha256:449f1b3dfc5009b71efda22f572fb0489983a9d79de03e8779610c6c9f7c7c7f"],"state_sha256":"767d7a4e0e20d1724cf04badf7bb572c765b9116e86a1a06622176c6733089ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MVolpFvGLQRusSmzKpcI0VwRD5nPnSmaAMytb3StskuuSHMMbL4/rLzgLR0ui9S5ScJSWJ0LceUm+/PUlElnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:10:43.465503Z","bundle_sha256":"2f20bbb9c1c1cad9467825cfecc79c57f04ab75597384c2ed7e4cfc05be901a4"}}