{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:X72G4VW6XFH2C4J2BFVGNVOVSV","short_pith_number":"pith:X72G4VW6","schema_version":"1.0","canonical_sha256":"bff46e56deb94fa1713a096a66d5d59550c1b81e1eb4305292a78d3bbc892385","source":{"kind":"arxiv","id":"2008.05718","version":1},"attestation_state":"computed","paper":{"title":"A Fine-Grained Hybrid CPU-GPU Algorithm for Betweenness Centrality Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ashirbad Mishra, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar","submitted_at":"2020-08-13T06:41:56Z","abstract_excerpt":"Betweenness centrality (BC) is an important graph analytical application for large-scale graphs. While there are many efforts for parallelizing betweenness centrality algorithms on multi-core CPUs and many-core GPUs, in this work, we propose a novel fine-grained CPU-GPU hybrid algorithm that partitions a graph into CPU and GPU partitions, and performs BC computations for the graph on both the CPU and GPU resources simultaneously with very small number of CPU-GPU communications. The forward phase in our hybrid BC algorithm leverages the multi-source property inherent in the BC problem. We also "},"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":"2008.05718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-13T06:41:56Z","cross_cats_sorted":[],"title_canon_sha256":"0b1e650218cc99b093f1682262573bdb3b2caa0e0d1d9d9c6a6a220ceea063a8","abstract_canon_sha256":"8867dc8ad3bfdc0c539128a055c109133e3b0e796f6997302821f45e28648255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:56.568238Z","signature_b64":"7/Ah4TKfrEE7aWbnNB1KsNT82+uHP+aOu2DsYv0QtNZIeiSVXLJpavdQhz+goBq0bnDczvZVIkk5fn19jniaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff46e56deb94fa1713a096a66d5d59550c1b81e1eb4305292a78d3bbc892385","last_reissued_at":"2026-07-05T01:26:56.567813Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:56.567813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fine-Grained Hybrid CPU-GPU Algorithm for Betweenness Centrality Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ashirbad Mishra, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar","submitted_at":"2020-08-13T06:41:56Z","abstract_excerpt":"Betweenness centrality (BC) is an important graph analytical application for large-scale graphs. While there are many efforts for parallelizing betweenness centrality algorithms on multi-core CPUs and many-core GPUs, in this work, we propose a novel fine-grained CPU-GPU hybrid algorithm that partitions a graph into CPU and GPU partitions, and performs BC computations for the graph on both the CPU and GPU resources simultaneously with very small number of CPU-GPU communications. The forward phase in our hybrid BC algorithm leverages the multi-source property inherent in the BC problem. We also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.05718/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.05718","created_at":"2026-07-05T01:26:56.567864+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05718v1","created_at":"2026-07-05T01:26:56.567864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05718","created_at":"2026-07-05T01:26:56.567864+00:00"},{"alias_kind":"pith_short_12","alias_value":"X72G4VW6XFH2","created_at":"2026-07-05T01:26:56.567864+00:00"},{"alias_kind":"pith_short_16","alias_value":"X72G4VW6XFH2C4J2","created_at":"2026-07-05T01:26:56.567864+00:00"},{"alias_kind":"pith_short_8","alias_value":"X72G4VW6","created_at":"2026-07-05T01:26:56.567864+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/X72G4VW6XFH2C4J2BFVGNVOVSV","json":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV.json","graph_json":"https://pith.science/api/pith-number/X72G4VW6XFH2C4J2BFVGNVOVSV/graph.json","events_json":"https://pith.science/api/pith-number/X72G4VW6XFH2C4J2BFVGNVOVSV/events.json","paper":"https://pith.science/paper/X72G4VW6"},"agent_actions":{"view_html":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV","download_json":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV.json","view_paper":"https://pith.science/paper/X72G4VW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05718&json=true","fetch_graph":"https://pith.science/api/pith-number/X72G4VW6XFH2C4J2BFVGNVOVSV/graph.json","fetch_events":"https://pith.science/api/pith-number/X72G4VW6XFH2C4J2BFVGNVOVSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV/action/storage_attestation","attest_author":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV/action/author_attestation","sign_citation":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV/action/citation_signature","submit_replication":"https://pith.science/pith/X72G4VW6XFH2C4J2BFVGNVOVSV/action/replication_record"}},"created_at":"2026-07-05T01:26:56.567864+00:00","updated_at":"2026-07-05T01:26:56.567864+00:00"}