{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RAVVPNGNCTJGK6OIOV2OVPOHNF","short_pith_number":"pith:RAVVPNGN","canonical_record":{"source":{"id":"1510.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:50:51Z","cross_cats_sorted":["cs.SI","stat.AP"],"title_canon_sha256":"9245f640fb6bfc181d3797f577ddd53f26375619faccf7cb9bf30779913c5081","abstract_canon_sha256":"8b84bae94498e3cec426ec71c6950ff1f5dea7bc0a105e4679fea7a9479c4839"},"schema_version":"1.0"},"canonical_sha256":"882b57b4cd14d26579c87574eabdc7694bda1eeaa5a42e84ce0c601859394a3c","source":{"kind":"arxiv","id":"1510.04597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04597","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04597v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04597","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"RAVVPNGNCTJG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAVVPNGNCTJGK6OI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAVVPNGN","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RAVVPNGNCTJGK6OIOV2OVPOHNF","target":"record","payload":{"canonical_record":{"source":{"id":"1510.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:50:51Z","cross_cats_sorted":["cs.SI","stat.AP"],"title_canon_sha256":"9245f640fb6bfc181d3797f577ddd53f26375619faccf7cb9bf30779913c5081","abstract_canon_sha256":"8b84bae94498e3cec426ec71c6950ff1f5dea7bc0a105e4679fea7a9479c4839"},"schema_version":"1.0"},"canonical_sha256":"882b57b4cd14d26579c87574eabdc7694bda1eeaa5a42e84ce0c601859394a3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.362780Z","signature_b64":"AYx0S/nbR12YsBwmSMlCSBYdbGMWoS1hdlnamcW9OzbSnFQCh8Q2suC60MJW8UT25XAqkeJwpBUwRoNSS++iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882b57b4cd14d26579c87574eabdc7694bda1eeaa5a42e84ce0c601859394a3c","last_reissued_at":"2026-05-18T01:25:56.362276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.362276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.04597","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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdwXrJOgIhQj/Q6KyynjfmcIGa77+X7A4Q5/lejOopfzeBKPBbLyngcEMhvSsTYx/XPmtldZu1Af7mo+Ehu2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:12.952695Z"},"content_sha256":"4a0e4676fcb28be789b789b5bb5d19aa59425ffef6e62d7421d5d328d525d664","schema_version":"1.0","event_id":"sha256:4a0e4676fcb28be789b789b5bb5d19aa59425ffef6e62d7421d5d328d525d664"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RAVVPNGNCTJGK6OIOV2OVPOHNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predictive partitioning for efficient BFS traversal in social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.AP"],"primary_cat":"cs.DS","authors_text":"Damien Fay","submitted_at":"2015-10-15T15:50:51Z","abstract_excerpt":"In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph traversal techniques). In particular, we address parallel implementations where the bottleneck is the number of messages between processors emitted at the peak iteration. First, we derive an expression for the expected degree distribution of vertices in the frontier of the algorithm which is shown to be highly skewed. Subsequently, we derive an expression for the expected message along an edge in a particular iteration. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04597","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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrcH8+VZCx5724PnDx2MvHvROpbpByBTWjO022cisYlPWnrf3Ppbk3XP8jPxMREUmT96Du8OqSO7uG5t107fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:12.953382Z"},"content_sha256":"feadc7876ed33aabd712c619f482cff191534395dc5457cc22aa30b9a36cfbb8","schema_version":"1.0","event_id":"sha256:feadc7876ed33aabd712c619f482cff191534395dc5457cc22aa30b9a36cfbb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/bundle.json","state_url":"https://pith.science/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/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-27T10:35:12Z","links":{"resolver":"https://pith.science/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF","bundle":"https://pith.science/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/bundle.json","state":"https://pith.science/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAVVPNGNCTJGK6OIOV2OVPOHNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RAVVPNGNCTJGK6OIOV2OVPOHNF","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":"8b84bae94498e3cec426ec71c6950ff1f5dea7bc0a105e4679fea7a9479c4839","cross_cats_sorted":["cs.SI","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:50:51Z","title_canon_sha256":"9245f640fb6bfc181d3797f577ddd53f26375619faccf7cb9bf30779913c5081"},"schema_version":"1.0","source":{"id":"1510.04597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04597","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04597v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04597","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"RAVVPNGNCTJG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAVVPNGNCTJGK6OI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAVVPNGN","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:feadc7876ed33aabd712c619f482cff191534395dc5457cc22aa30b9a36cfbb8","target":"graph","created_at":"2026-05-18T01:25:56Z","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":"In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph traversal techniques). In particular, we address parallel implementations where the bottleneck is the number of messages between processors emitted at the peak iteration. First, we derive an expression for the expected degree distribution of vertices in the frontier of the algorithm which is shown to be highly skewed. Subsequently, we derive an expression for the expected message along an edge in a particular iteration. Thi","authors_text":"Damien Fay","cross_cats":["cs.SI","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:50:51Z","title":"Predictive partitioning for efficient BFS traversal in social networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04597","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:4a0e4676fcb28be789b789b5bb5d19aa59425ffef6e62d7421d5d328d525d664","target":"record","created_at":"2026-05-18T01:25:56Z","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":"8b84bae94498e3cec426ec71c6950ff1f5dea7bc0a105e4679fea7a9479c4839","cross_cats_sorted":["cs.SI","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T15:50:51Z","title_canon_sha256":"9245f640fb6bfc181d3797f577ddd53f26375619faccf7cb9bf30779913c5081"},"schema_version":"1.0","source":{"id":"1510.04597","kind":"arxiv","version":1}},"canonical_sha256":"882b57b4cd14d26579c87574eabdc7694bda1eeaa5a42e84ce0c601859394a3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882b57b4cd14d26579c87574eabdc7694bda1eeaa5a42e84ce0c601859394a3c","first_computed_at":"2026-05-18T01:25:56.362276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.362276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYx0S/nbR12YsBwmSMlCSBYdbGMWoS1hdlnamcW9OzbSnFQCh8Q2suC60MJW8UT25XAqkeJwpBUwRoNSS++iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.362780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a0e4676fcb28be789b789b5bb5d19aa59425ffef6e62d7421d5d328d525d664","sha256:feadc7876ed33aabd712c619f482cff191534395dc5457cc22aa30b9a36cfbb8"],"state_sha256":"978960d97247ddbddae579c77a7d33fb808586ab15a892861f6e8260f8ba4cfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbfYNWuLGwC37HcWCY1ETBJdNxOCrsXNHmwS7y8PDc91RLlo4L9O2DiBvVjAfdZnaCYxdXe4IYcbvVCKGFhwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:35:12.956786Z","bundle_sha256":"ba76228de4a105c1815a7986974bc0f4f31cb16331f2ee54d7123a4b11db3ad2"}}