{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:77BH3B7VRKMJDVZHQEYLS6AQ3Y","short_pith_number":"pith:77BH3B7V","canonical_record":{"source":{"id":"1704.01077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-04T15:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"ff057eca683ee33a04ca250ce81dc8b52edc28b53269d1299d07da35008dec47","abstract_canon_sha256":"1b18e8364c6b65729a0e497990bde801b8f85b0f3624d852e143bafe9cc32a46"},"schema_version":"1.0"},"canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","source":{"kind":"arxiv","id":"1704.01077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01077","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01077v2","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01077","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"pith_short_12","alias_value":"77BH3B7VRKMJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77BH3B7VRKMJDVZH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77BH3B7V","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:77BH3B7VRKMJDVZHQEYLS6AQ3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-04T15:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"ff057eca683ee33a04ca250ce81dc8b52edc28b53269d1299d07da35008dec47","abstract_canon_sha256":"1b18e8364c6b65729a0e497990bde801b8f85b0f3624d852e143bafe9cc32a46"},"schema_version":"1.0"},"canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:29.924739Z","signature_b64":"CPr1bWPKx5kGZyCmnnX6RhNrU0uIL5Fif0rGw3y6Y+7X3Pof4xLRwwPM/6HVoZoaMW8Dy44pKpqdOePfYDppAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","last_reissued_at":"2026-05-18T00:45:29.924330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:29.924330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01077","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-18T00:45:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hwm1u/gLBv3noTGvd5LzSAbnmGznTYMLooCnuoTuJdNZ95gDxNtbYXkdXoyW/JtvILohsBWhexRhI/qC6hT/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:13:12.100527Z"},"content_sha256":"a4a51557d317513337b10f3423b1051ceb6331b249ae1ac7236cac4a203fd48c","schema_version":"1.0","event_id":"sha256:a4a51557d317513337b10f3423b1051ceb6331b249ae1ac7236cac4a203fd48c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:77BH3B7VRKMJDVZHQEYLS6AQ3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing top-k Closeness Centrality Faster in Unweighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Marino, Elisabetta Bergamini, Henning Meyerhenke, Michele Borassi, Pierluigi Crescenzi","submitted_at":"2017-04-04T15:48:55Z","abstract_excerpt":"Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\\frac{n-1}{\\sum_{w \\in V} d(v,w)}$. This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the $k$ most central vertices has been deeply analysed in the last decade. However, this problem is computationally not easy, especially for large networks: in the first part of the paper, we prove that it is not solvable in time $\\O(|E|^{2-\\epsilon})$ on directed graphs, for any constant $\\epsilon>0$, under reasonable complexity assumptions. Furthermore, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01077","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-18T00:45:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hApcMWurXyYMNRPds5kbkPY7h1KAGTXxdmaW1uCfQMbqULq6IKC0H9/gl7chxKTUElBSz9Jl7GWtcQuQsvdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:13:12.101162Z"},"content_sha256":"fd3f89ed6d77afd25e89eff866d47c982cb26701125aef767e0c501f3354ebe5","schema_version":"1.0","event_id":"sha256:fd3f89ed6d77afd25e89eff866d47c982cb26701125aef767e0c501f3354ebe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/bundle.json","state_url":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/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-20T18:13:12Z","links":{"resolver":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y","bundle":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/bundle.json","state":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:77BH3B7VRKMJDVZHQEYLS6AQ3Y","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":"1b18e8364c6b65729a0e497990bde801b8f85b0f3624d852e143bafe9cc32a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-04T15:48:55Z","title_canon_sha256":"ff057eca683ee33a04ca250ce81dc8b52edc28b53269d1299d07da35008dec47"},"schema_version":"1.0","source":{"id":"1704.01077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01077","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01077v2","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01077","created_at":"2026-05-18T00:45:29Z"},{"alias_kind":"pith_short_12","alias_value":"77BH3B7VRKMJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77BH3B7VRKMJDVZH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77BH3B7V","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:fd3f89ed6d77afd25e89eff866d47c982cb26701125aef767e0c501f3354ebe5","target":"graph","created_at":"2026-05-18T00:45:29Z","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":"Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\\frac{n-1}{\\sum_{w \\in V} d(v,w)}$. This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the $k$ most central vertices has been deeply analysed in the last decade. However, this problem is computationally not easy, especially for large networks: in the first part of the paper, we prove that it is not solvable in time $\\O(|E|^{2-\\epsilon})$ on directed graphs, for any constant $\\epsilon>0$, under reasonable complexity assumptions. Furthermore, we propose","authors_text":"Andrea Marino, Elisabetta Bergamini, Henning Meyerhenke, Michele Borassi, Pierluigi Crescenzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-04T15:48:55Z","title":"Computing top-k Closeness Centrality Faster in Unweighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01077","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:a4a51557d317513337b10f3423b1051ceb6331b249ae1ac7236cac4a203fd48c","target":"record","created_at":"2026-05-18T00:45:29Z","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":"1b18e8364c6b65729a0e497990bde801b8f85b0f3624d852e143bafe9cc32a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-04T15:48:55Z","title_canon_sha256":"ff057eca683ee33a04ca250ce81dc8b52edc28b53269d1299d07da35008dec47"},"schema_version":"1.0","source":{"id":"1704.01077","kind":"arxiv","version":2}},"canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","first_computed_at":"2026-05-18T00:45:29.924330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:29.924330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CPr1bWPKx5kGZyCmnnX6RhNrU0uIL5Fif0rGw3y6Y+7X3Pof4xLRwwPM/6HVoZoaMW8Dy44pKpqdOePfYDppAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:29.924739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4a51557d317513337b10f3423b1051ceb6331b249ae1ac7236cac4a203fd48c","sha256:fd3f89ed6d77afd25e89eff866d47c982cb26701125aef767e0c501f3354ebe5"],"state_sha256":"0837d3cc70293d8fd16029f97f6274c5cd2f06195702bc6ea0016543ed5d8dfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TG7h7Rxle0PLY12rOSPi/BqVQVPp3rXQLKLpgFjLmdFpEtpZqJkJ2n6N+kqZ0v9w2tjpDbcvxJhHzdJ4YU8ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:13:12.103676Z","bundle_sha256":"f3d6599bae41d8c3b227ab408614ef825a10fc7c9392897da20aee621c5521a0"}}