{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YBM67GJ7TIZITPSFR65UJZBGPI","short_pith_number":"pith:YBM67GJ7","schema_version":"1.0","canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","source":{"kind":"arxiv","id":"1411.1460","version":1},"attestation_state":"computed","paper":{"title":"Branch-Avoiding Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Marat Dukhan, Oded Green, Richard Vuduc","submitted_at":"2014-11-06T00:36:24Z","abstract_excerpt":"This paper quantifies the impact of branches and branch mispredictions on the single-core performance for two classes of graph problems. Specifically, we consider classical algorithms for computing connected components and breadth-first search (BFS). We show that branch mispredictions are costly and can reduce performance by as much as 30%-50%. This insight suggests that one should seek graph algorithms and implementations that avoid branches.\n  As a proof-of-concept, we devise such implementations for both the classic top-down algorithm for BFS and the Shiloach-Vishkin algorithm for connected"},"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":"1411.1460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-06T00:36:24Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"1a806d9f750a485a6add2d6f6128038809962e7f29f48ffbb3aaedbbccf1175b","abstract_canon_sha256":"5190fe999445eb506bcd1363a32d2f91c7c2a80bbf36db50f2b6af222b5af2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.737092Z","signature_b64":"nbPB9Re7PG1gJtFoJ79UoW+5pqK3afKs0J7xagZxSz4IN+WIt3wym8I5P2xST2Nc1GlMHwMw4quy2y4W0VeVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","last_reissued_at":"2026-05-18T02:38:08.736489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.736489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Branch-Avoiding Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Marat Dukhan, Oded Green, Richard Vuduc","submitted_at":"2014-11-06T00:36:24Z","abstract_excerpt":"This paper quantifies the impact of branches and branch mispredictions on the single-core performance for two classes of graph problems. Specifically, we consider classical algorithms for computing connected components and breadth-first search (BFS). We show that branch mispredictions are costly and can reduce performance by as much as 30%-50%. This insight suggests that one should seek graph algorithms and implementations that avoid branches.\n  As a proof-of-concept, we devise such implementations for both the classic top-down algorithm for BFS and the Shiloach-Vishkin algorithm for connected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1460","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.1460","created_at":"2026-05-18T02:38:08.736579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1460v1","created_at":"2026-05-18T02:38:08.736579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1460","created_at":"2026-05-18T02:38:08.736579+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBM67GJ7TIZI","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBM67GJ7TIZITPSF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBM67GJ7","created_at":"2026-05-18T12:28:57.508820+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/YBM67GJ7TIZITPSFR65UJZBGPI","json":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI.json","graph_json":"https://pith.science/api/pith-number/YBM67GJ7TIZITPSFR65UJZBGPI/graph.json","events_json":"https://pith.science/api/pith-number/YBM67GJ7TIZITPSFR65UJZBGPI/events.json","paper":"https://pith.science/paper/YBM67GJ7"},"agent_actions":{"view_html":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI","download_json":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI.json","view_paper":"https://pith.science/paper/YBM67GJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1460&json=true","fetch_graph":"https://pith.science/api/pith-number/YBM67GJ7TIZITPSFR65UJZBGPI/graph.json","fetch_events":"https://pith.science/api/pith-number/YBM67GJ7TIZITPSFR65UJZBGPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/action/storage_attestation","attest_author":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/action/author_attestation","sign_citation":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/action/citation_signature","submit_replication":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/action/replication_record"}},"created_at":"2026-05-18T02:38:08.736579+00:00","updated_at":"2026-05-18T02:38:08.736579+00:00"}