{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YBM67GJ7TIZITPSFR65UJZBGPI","short_pith_number":"pith:YBM67GJ7","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"},"canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","source":{"kind":"arxiv","id":"1411.1460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1460","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1460v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1460","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"YBM67GJ7TIZI","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBM67GJ7TIZITPSF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBM67GJ7","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YBM67GJ7TIZITPSFR65UJZBGPI","target":"record","payload":{"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"},"canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","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"},"source_kind":"arxiv","source_id":"1411.1460","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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gA1WUOimPH06jU7kTOX8eOVB7rDzzJu4VEuodJQJZuvbhGZQVWjqCNsPBtFbwKdy8GQwLypn5vfVBzgInn3MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:56:37.096894Z"},"content_sha256":"34e6cecdeb11bf6764abd12597fa974f0cccb568323bdf271a36a7220bbf8598","schema_version":"1.0","event_id":"sha256:34e6cecdeb11bf6764abd12597fa974f0cccb568323bdf271a36a7220bbf8598"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YBM67GJ7TIZITPSFR65UJZBGPI","target":"graph","payload":{"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"},"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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuahNT3dX54g/K8sczmPJ6vqoD5wKpXQu6iz2vJsA4xcg/tvga72mkmfSjYnguaHCBmRFtyx+fKxWQA8pHwGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:56:37.097501Z"},"content_sha256":"42828d54067aaa391728fbcbdab2089e89f811f5485c69084631280648437b97","schema_version":"1.0","event_id":"sha256:42828d54067aaa391728fbcbdab2089e89f811f5485c69084631280648437b97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/bundle.json","state_url":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBM67GJ7TIZITPSFR65UJZBGPI/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-27T03:56:37Z","links":{"resolver":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI","bundle":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/bundle.json","state":"https://pith.science/pith/YBM67GJ7TIZITPSFR65UJZBGPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBM67GJ7TIZITPSFR65UJZBGPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YBM67GJ7TIZITPSFR65UJZBGPI","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":"5190fe999445eb506bcd1363a32d2f91c7c2a80bbf36db50f2b6af222b5af2ff","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-06T00:36:24Z","title_canon_sha256":"1a806d9f750a485a6add2d6f6128038809962e7f29f48ffbb3aaedbbccf1175b"},"schema_version":"1.0","source":{"id":"1411.1460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1460","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1460v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1460","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"YBM67GJ7TIZI","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBM67GJ7TIZITPSF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBM67GJ7","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:42828d54067aaa391728fbcbdab2089e89f811f5485c69084631280648437b97","target":"graph","created_at":"2026-05-18T02:38:08Z","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":"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","authors_text":"Marat Dukhan, Oded Green, Richard Vuduc","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-06T00:36:24Z","title":"Branch-Avoiding Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1460","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:34e6cecdeb11bf6764abd12597fa974f0cccb568323bdf271a36a7220bbf8598","target":"record","created_at":"2026-05-18T02:38:08Z","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":"5190fe999445eb506bcd1363a32d2f91c7c2a80bbf36db50f2b6af222b5af2ff","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-06T00:36:24Z","title_canon_sha256":"1a806d9f750a485a6add2d6f6128038809962e7f29f48ffbb3aaedbbccf1175b"},"schema_version":"1.0","source":{"id":"1411.1460","kind":"arxiv","version":1}},"canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c059ef993f9a3289be458fbb44e4267a2637cf4422560a828665c0d2ccfac7e8","first_computed_at":"2026-05-18T02:38:08.736489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:08.736489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbPB9Re7PG1gJtFoJ79UoW+5pqK3afKs0J7xagZxSz4IN+WIt3wym8I5P2xST2Nc1GlMHwMw4quy2y4W0VeVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:08.737092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e6cecdeb11bf6764abd12597fa974f0cccb568323bdf271a36a7220bbf8598","sha256:42828d54067aaa391728fbcbdab2089e89f811f5485c69084631280648437b97"],"state_sha256":"92fe1f3224a8c0cea3e9bcea015b4b223cbfa87b2d566896c137f2afa619a99b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fV1OricC4zZRwZPOHj16RyIqAeNk+n0lIBcaLfVzCm0Zr1rNSId7F54k3LJjI/+WJNAbtMiNhLjh6Etz2vPODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:56:37.102525Z","bundle_sha256":"77b74f9e7b00401d3da24b62e1c84b92136bd3fc4ace6e15d8dffab350f218e7"}}