{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7ZHI47SKKBXMSFRE3AVQHZF42H","short_pith_number":"pith:7ZHI47SK","canonical_record":{"source":{"id":"1805.08124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T15:31:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"25e6a970aa51b67e5917c8a2655eb4fc4384b65f3f2877fa4ae411464bc3abff","abstract_canon_sha256":"5d70f388caeb7d9c1cffc52c4245cc0de8366fd231d13e8826c4e6511e6346bc"},"schema_version":"1.0"},"canonical_sha256":"fe4e8e7e4a506ec91624d82b03e4bcd1d2af4edcfaf0110ad8c216cc2c5defb5","source":{"kind":"arxiv","id":"1805.08124","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08124","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08124v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08124","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"7ZHI47SKKBXM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7ZHI47SKKBXMSFRE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7ZHI47SK","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7ZHI47SKKBXMSFRE3AVQHZF42H","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T15:31:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"25e6a970aa51b67e5917c8a2655eb4fc4384b65f3f2877fa4ae411464bc3abff","abstract_canon_sha256":"5d70f388caeb7d9c1cffc52c4245cc0de8366fd231d13e8826c4e6511e6346bc"},"schema_version":"1.0"},"canonical_sha256":"fe4e8e7e4a506ec91624d82b03e4bcd1d2af4edcfaf0110ad8c216cc2c5defb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.453061Z","signature_b64":"EuZbMLnOdWeNcRDkoXqYfv5lTjfLgdYwqpcw2JveEgB2/v5TgqImM4Uzg60XpcSF6Kl/J3tYSwHx/LIgX9UnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4e8e7e4a506ec91624d82b03e4bcd1d2af4edcfaf0110ad8c216cc2c5defb5","last_reissued_at":"2026-05-17T23:54:48.452493Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.452493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08124","source_version":2,"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-17T23:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9ngKsf9NlkUDWngWGTxaqw5BgOiOj/67YM+Q20opzi8ITMc9dPL4haFyfR2X36eiKPzWg1FG2W43oh86LUiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:52:28.033268Z"},"content_sha256":"66d710ca1a65e26dd9daf094d9d4452b23a8be3dae55f24fe26c24b34c8d4ca3","schema_version":"1.0","event_id":"sha256:66d710ca1a65e26dd9daf094d9d4452b23a8be3dae55f24fe26c24b34c8d4ca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7ZHI47SKKBXMSFRE3AVQHZF42H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","submitted_at":"2018-05-21T15:31:23Z","abstract_excerpt":"The betweenness centrality (BC) of a node in a network (or graph) is a measure of its importance in the network. BC is widely used in a large number of environments such as social networks, transport networks, security/mobile networks and more. We present an O(n)-round distributed algorithm for computing BC of every vertex as well as all pairs shortest paths (APSP) in a directed unweighted network, where n is the number of vertices and m is the number of edges. We also present O(n)-round distributed algorithms for computing APSP and BC in a weighted directed acyclic graph (dag). Our algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08124","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"},"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-17T23:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPlO58nTlWrRYRzdZABm2cUKVvHmpP25Hdtj32SVEe28FYVVKJqTUUw7y4qI8xs4HZx6158lK4JB/i8SQI3JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:52:28.033676Z"},"content_sha256":"e5077b78d603117abe5c254e693cbeec3a4aeb161e7c3ea486e7a795decf1281","schema_version":"1.0","event_id":"sha256:e5077b78d603117abe5c254e693cbeec3a4aeb161e7c3ea486e7a795decf1281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/bundle.json","state_url":"https://pith.science/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/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-06-24T21:52:28Z","links":{"resolver":"https://pith.science/pith/7ZHI47SKKBXMSFRE3AVQHZF42H","bundle":"https://pith.science/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/bundle.json","state":"https://pith.science/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZHI47SKKBXMSFRE3AVQHZF42H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7ZHI47SKKBXMSFRE3AVQHZF42H","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":"5d70f388caeb7d9c1cffc52c4245cc0de8366fd231d13e8826c4e6511e6346bc","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T15:31:23Z","title_canon_sha256":"25e6a970aa51b67e5917c8a2655eb4fc4384b65f3f2877fa4ae411464bc3abff"},"schema_version":"1.0","source":{"id":"1805.08124","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08124","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08124v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08124","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"7ZHI47SKKBXM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7ZHI47SKKBXMSFRE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7ZHI47SK","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:e5077b78d603117abe5c254e693cbeec3a4aeb161e7c3ea486e7a795decf1281","target":"graph","created_at":"2026-05-17T23:54:48Z","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":"The betweenness centrality (BC) of a node in a network (or graph) is a measure of its importance in the network. BC is widely used in a large number of environments such as social networks, transport networks, security/mobile networks and more. We present an O(n)-round distributed algorithm for computing BC of every vertex as well as all pairs shortest paths (APSP) in a directed unweighted network, where n is the number of vertices and m is the number of edges. We also present O(n)-round distributed algorithms for computing APSP and BC in a weighted directed acyclic graph (dag). Our algorithms","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T15:31:23Z","title":"Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08124","kind":"arxiv","version":2},"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:66d710ca1a65e26dd9daf094d9d4452b23a8be3dae55f24fe26c24b34c8d4ca3","target":"record","created_at":"2026-05-17T23:54:48Z","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":"5d70f388caeb7d9c1cffc52c4245cc0de8366fd231d13e8826c4e6511e6346bc","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T15:31:23Z","title_canon_sha256":"25e6a970aa51b67e5917c8a2655eb4fc4384b65f3f2877fa4ae411464bc3abff"},"schema_version":"1.0","source":{"id":"1805.08124","kind":"arxiv","version":2}},"canonical_sha256":"fe4e8e7e4a506ec91624d82b03e4bcd1d2af4edcfaf0110ad8c216cc2c5defb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe4e8e7e4a506ec91624d82b03e4bcd1d2af4edcfaf0110ad8c216cc2c5defb5","first_computed_at":"2026-05-17T23:54:48.452493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:48.452493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EuZbMLnOdWeNcRDkoXqYfv5lTjfLgdYwqpcw2JveEgB2/v5TgqImM4Uzg60XpcSF6Kl/J3tYSwHx/LIgX9UnCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:48.453061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08124","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66d710ca1a65e26dd9daf094d9d4452b23a8be3dae55f24fe26c24b34c8d4ca3","sha256:e5077b78d603117abe5c254e693cbeec3a4aeb161e7c3ea486e7a795decf1281"],"state_sha256":"f92bbde57ca8545a94838a58afefb7f6ed54c4dfdc55d28f602edd69c9487829"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gt/PjAiXWAFNfJBT6q8urCloAS2l1/B8+UD7ghGdqZ0RxcWy9ZQiueIms4cPyxpQIeztGqYHAedg3Jaw5zqsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:52:28.035690Z","bundle_sha256":"224c294711b3cb0424a748ecf919c354ec26dc90f55f2d531095bfddcae6c8af"}}