{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T4LABE6K7GHSZ3T4MLJY5LT6RJ","short_pith_number":"pith:T4LABE6K","schema_version":"1.0","canonical_sha256":"9f160093caf98f2cee7c62d38eae7e8a5d7a45b99da35cf64b10f07bd65a66b1","source":{"kind":"arxiv","id":"1503.04359","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Direction-Optimized Breadth First Search on Hybrid Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdullah Gharaibeh, Matei Ripeanu, Scott Sallinen","submitted_at":"2015-03-14T22:47:53Z","abstract_excerpt":"Large scale-free graphs are famously difficult to process efficiently: the skewed vertex degree distribution makes it difficult to obtain balanced partitioning. Our research instead aims to turn this into an advantage by partitioning the workload to match the strength of the individual computing elements in a Hybrid, GPU-accelerated architecture. As a proof of concept we focus on the direction-optimized breadth first search algorithm. We present the key graph partitioning, workload allocation, and communication strategies required for massive concurrency and good overall performance. We show t"},"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":"1503.04359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-14T22:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"00d71e16c1b5f8e13921cc66ace302d0653e0b45289f172be8b840191d1965d8","abstract_canon_sha256":"801b1ca9316b0f773e5e0861a4e5ff621f72c310c27308e5037852bd705615ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:18.817727Z","signature_b64":"xrWemNNaB49UeGAlhFWigwKt4cjONJyG+toSg3gG9l3HxLM9eLu0sbXtPdOBN+z4ru97IJ2cxjsKTd23lb26Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f160093caf98f2cee7c62d38eae7e8a5d7a45b99da35cf64b10f07bd65a66b1","last_reissued_at":"2026-05-18T01:31:18.817095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:18.817095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Direction-Optimized Breadth First Search on Hybrid Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdullah Gharaibeh, Matei Ripeanu, Scott Sallinen","submitted_at":"2015-03-14T22:47:53Z","abstract_excerpt":"Large scale-free graphs are famously difficult to process efficiently: the skewed vertex degree distribution makes it difficult to obtain balanced partitioning. Our research instead aims to turn this into an advantage by partitioning the workload to match the strength of the individual computing elements in a Hybrid, GPU-accelerated architecture. As a proof of concept we focus on the direction-optimized breadth first search algorithm. We present the key graph partitioning, workload allocation, and communication strategies required for massive concurrency and good overall performance. We show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04359","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04359","created_at":"2026-05-18T01:31:18.817179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04359v2","created_at":"2026-05-18T01:31:18.817179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04359","created_at":"2026-05-18T01:31:18.817179+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4LABE6K7GHS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4LABE6K7GHSZ3T4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4LABE6K","created_at":"2026-05-18T12:29:42.218222+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/T4LABE6K7GHSZ3T4MLJY5LT6RJ","json":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ.json","graph_json":"https://pith.science/api/pith-number/T4LABE6K7GHSZ3T4MLJY5LT6RJ/graph.json","events_json":"https://pith.science/api/pith-number/T4LABE6K7GHSZ3T4MLJY5LT6RJ/events.json","paper":"https://pith.science/paper/T4LABE6K"},"agent_actions":{"view_html":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ","download_json":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ.json","view_paper":"https://pith.science/paper/T4LABE6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04359&json=true","fetch_graph":"https://pith.science/api/pith-number/T4LABE6K7GHSZ3T4MLJY5LT6RJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T4LABE6K7GHSZ3T4MLJY5LT6RJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ/action/storage_attestation","attest_author":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ/action/author_attestation","sign_citation":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ/action/citation_signature","submit_replication":"https://pith.science/pith/T4LABE6K7GHSZ3T4MLJY5LT6RJ/action/replication_record"}},"created_at":"2026-05-18T01:31:18.817179+00:00","updated_at":"2026-05-18T01:31:18.817179+00:00"}