{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5LWKU3NMHSHBFG2T4OJBAJL557","short_pith_number":"pith:5LWKU3NM","canonical_record":{"source":{"id":"1409.0035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T21:16:24Z","cross_cats_sorted":[],"title_canon_sha256":"0b8781255cbed915becbc39822735c158541edde044d5c906e847aaf3dfee55e","abstract_canon_sha256":"26aea92dfd0a95243df5e634959e38f8e333c4b206e353ebd8ac56fe9303cd3e"},"schema_version":"1.0"},"canonical_sha256":"eaecaa6dac3c8e129b53e39210257defd4133f5568297530872eba7ad7c59c6c","source":{"kind":"arxiv","id":"1409.0035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0035","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0035v1","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0035","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"5LWKU3NMHSHB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LWKU3NMHSHBFG2T","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LWKU3NM","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5LWKU3NMHSHBFG2T4OJBAJL557","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T21:16:24Z","cross_cats_sorted":[],"title_canon_sha256":"0b8781255cbed915becbc39822735c158541edde044d5c906e847aaf3dfee55e","abstract_canon_sha256":"26aea92dfd0a95243df5e634959e38f8e333c4b206e353ebd8ac56fe9303cd3e"},"schema_version":"1.0"},"canonical_sha256":"eaecaa6dac3c8e129b53e39210257defd4133f5568297530872eba7ad7c59c6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:53.516138Z","signature_b64":"m3Om8hOCwmB0t3TjxueOCAcA29AQqewLrc1PPPCZ5VLD14vxC+lddq3wFiUV9KtPnb7dQ23K72skv6q+e9EXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaecaa6dac3c8e129b53e39210257defd4133f5568297530872eba7ad7c59c6c","last_reissued_at":"2026-05-18T02:43:53.515762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:53.515762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0035","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:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+rnfTPpo1orkJ5fWVa8xrI7WmOz9h4uVT4vz2JrZJ6oguRib8skMrECEZL/JOM58PZmStH3IlPLykGGhJ7cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:30:12.184793Z"},"content_sha256":"1c6e8194e488a00639159302245dad19f9b3d156195fc478a40bc7b6588f38d1","schema_version":"1.0","event_id":"sha256:1c6e8194e488a00639159302245dad19f9b3d156195fc478a40bc7b6588f38d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5LWKU3NMHSHBFG2T4OJBAJL557","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Classic Closeness Centrality, at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Delling, Edith Cohen, Renato F. Werneck, Thomas Pajor","submitted_at":"2014-08-29T21:16:24Z","abstract_excerpt":"Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The classic definition, proposed by Bavelas (1950), Beauchamp (1965), and Sabidussi (1966), is (the inverse of) the average distance to all other nodes.\n  We propose the first highly scalable (near linear-time processing and linear space overhead) algorithm for estimating, within a small relative error, the classic closeness centralities of all nodes in the graph. Our algorithm applies to undirected graphs, as well as for ce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0035","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:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6sv0PukGLMfV4ulPsIgTGIShHZNeRMXiPJiUgPSN1h2YCwUCPhAFXM/5xNWRA5tSoJ3xu6NKfq9WAkRmxVOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:30:12.185504Z"},"content_sha256":"822f05ec2308622799e7b037d4c6c9b0ff1425480f78757426a3fd8fa98af358","schema_version":"1.0","event_id":"sha256:822f05ec2308622799e7b037d4c6c9b0ff1425480f78757426a3fd8fa98af358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LWKU3NMHSHBFG2T4OJBAJL557/bundle.json","state_url":"https://pith.science/pith/5LWKU3NMHSHBFG2T4OJBAJL557/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LWKU3NMHSHBFG2T4OJBAJL557/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-10T07:30:12Z","links":{"resolver":"https://pith.science/pith/5LWKU3NMHSHBFG2T4OJBAJL557","bundle":"https://pith.science/pith/5LWKU3NMHSHBFG2T4OJBAJL557/bundle.json","state":"https://pith.science/pith/5LWKU3NMHSHBFG2T4OJBAJL557/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LWKU3NMHSHBFG2T4OJBAJL557/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5LWKU3NMHSHBFG2T4OJBAJL557","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":"26aea92dfd0a95243df5e634959e38f8e333c4b206e353ebd8ac56fe9303cd3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T21:16:24Z","title_canon_sha256":"0b8781255cbed915becbc39822735c158541edde044d5c906e847aaf3dfee55e"},"schema_version":"1.0","source":{"id":"1409.0035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0035","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0035v1","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0035","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"5LWKU3NMHSHB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LWKU3NMHSHBFG2T","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LWKU3NM","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:822f05ec2308622799e7b037d4c6c9b0ff1425480f78757426a3fd8fa98af358","target":"graph","created_at":"2026-05-18T02:43:53Z","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":"Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The classic definition, proposed by Bavelas (1950), Beauchamp (1965), and Sabidussi (1966), is (the inverse of) the average distance to all other nodes.\n  We propose the first highly scalable (near linear-time processing and linear space overhead) algorithm for estimating, within a small relative error, the classic closeness centralities of all nodes in the graph. Our algorithm applies to undirected graphs, as well as for ce","authors_text":"Daniel Delling, Edith Cohen, Renato F. Werneck, Thomas Pajor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T21:16:24Z","title":"Computing Classic Closeness Centrality, at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0035","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:1c6e8194e488a00639159302245dad19f9b3d156195fc478a40bc7b6588f38d1","target":"record","created_at":"2026-05-18T02:43:53Z","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":"26aea92dfd0a95243df5e634959e38f8e333c4b206e353ebd8ac56fe9303cd3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T21:16:24Z","title_canon_sha256":"0b8781255cbed915becbc39822735c158541edde044d5c906e847aaf3dfee55e"},"schema_version":"1.0","source":{"id":"1409.0035","kind":"arxiv","version":1}},"canonical_sha256":"eaecaa6dac3c8e129b53e39210257defd4133f5568297530872eba7ad7c59c6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaecaa6dac3c8e129b53e39210257defd4133f5568297530872eba7ad7c59c6c","first_computed_at":"2026-05-18T02:43:53.515762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:53.515762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3Om8hOCwmB0t3TjxueOCAcA29AQqewLrc1PPPCZ5VLD14vxC+lddq3wFiUV9KtPnb7dQ23K72skv6q+e9EXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:53.516138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c6e8194e488a00639159302245dad19f9b3d156195fc478a40bc7b6588f38d1","sha256:822f05ec2308622799e7b037d4c6c9b0ff1425480f78757426a3fd8fa98af358"],"state_sha256":"17c0bf2fffc0de958389fac996673b9f86402755a14328634011bb676f27b61b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7skanfMQOTBPOUrLig4gczddPjdm+hweN50G8EDXtxzFytH6A/zcwz0sAC+untLSYs9WZjSZWKGKgf6Zt4ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:30:12.189768Z","bundle_sha256":"0a37a795b4a743a613de299d3d99f14272e367bb0b272721007594754d56f658"}}