{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EJ3OYZ3EYFMTOIRK3SPJ5J2XNV","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":"ba2060b247c081a11c8d1aaa8ef67acf53475a80dc940d2adadbe2d36afe7895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:32:51Z","title_canon_sha256":"65b1b5e380378b63d0cdb1d0b826db45855e758a2269ef1f3789c4f3ef294f04"},"schema_version":"1.0","source":{"id":"1710.01143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01143","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01143v1","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01143","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"pith_short_12","alias_value":"EJ3OYZ3EYFMT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJ3OYZ3EYFMTOIRK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJ3OYZ3E","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:63f104a33ae788d151d8c3f3d6a7ef4675704626faf219e8da9bef8fbdf94785","target":"graph","created_at":"2026-05-18T00:33:45Z","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 is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than computing closeness for all nodes in real-world networks. However, for networks that evolve over time, no dynamic top-k closeness algorithm exists that improves on static recomputation. In this paper, we prese","authors_text":"Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke, Patrick Bisenius","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:32:51Z","title":"Computing Top-k Closeness Centrality in Fully-dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01143","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:8604e963dba1f25f1723aec66fd68820d8fd65f62a9da52968eeef18e8e3d4f0","target":"record","created_at":"2026-05-18T00:33:45Z","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":"ba2060b247c081a11c8d1aaa8ef67acf53475a80dc940d2adadbe2d36afe7895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:32:51Z","title_canon_sha256":"65b1b5e380378b63d0cdb1d0b826db45855e758a2269ef1f3789c4f3ef294f04"},"schema_version":"1.0","source":{"id":"1710.01143","kind":"arxiv","version":1}},"canonical_sha256":"2276ec6764c15937222adc9e9ea7576d72567774d3fc78ceef87a3463573a65f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2276ec6764c15937222adc9e9ea7576d72567774d3fc78ceef87a3463573a65f","first_computed_at":"2026-05-18T00:33:45.162269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:45.162269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1qhiReagCczOwZUjZWhHrurq4pIlHXYIsZlEuudhRL/gU36ldXe3TfnHKjgWOmazJQTlTWJaiuqb0ETrtyONAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:45.162828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8604e963dba1f25f1723aec66fd68820d8fd65f62a9da52968eeef18e8e3d4f0","sha256:63f104a33ae788d151d8c3f3d6a7ef4675704626faf219e8da9bef8fbdf94785"],"state_sha256":"7d4dbd8e9320f0291d8b3f5b0ca225332fedcbade9a9bd194a1dd23091c74b0a"}