{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:77BH3B7VRKMJDVZHQEYLS6AQ3Y","short_pith_number":"pith:77BH3B7V","schema_version":"1.0","canonical_sha256":"ffc27d87f58a9891d7278130b97810de36566d2d4f8b473aed0ac17c20e49f96","source":{"kind":"arxiv","id":"1704.01077","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.01077","created_at":"2026-05-18T00:45:29.924394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01077v2","created_at":"2026-05-18T00:45:29.924394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01077","created_at":"2026-05-18T00:45:29.924394+00:00"},{"alias_kind":"pith_short_12","alias_value":"77BH3B7VRKMJ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"77BH3B7VRKMJDVZH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"77BH3B7V","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y","json":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y.json","graph_json":"https://pith.science/api/pith-number/77BH3B7VRKMJDVZHQEYLS6AQ3Y/graph.json","events_json":"https://pith.science/api/pith-number/77BH3B7VRKMJDVZHQEYLS6AQ3Y/events.json","paper":"https://pith.science/paper/77BH3B7V"},"agent_actions":{"view_html":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y","download_json":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y.json","view_paper":"https://pith.science/paper/77BH3B7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01077&json=true","fetch_graph":"https://pith.science/api/pith-number/77BH3B7VRKMJDVZHQEYLS6AQ3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/77BH3B7VRKMJDVZHQEYLS6AQ3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/action/storage_attestation","attest_author":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/action/author_attestation","sign_citation":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/action/citation_signature","submit_replication":"https://pith.science/pith/77BH3B7VRKMJDVZHQEYLS6AQ3Y/action/replication_record"}},"created_at":"2026-05-18T00:45:29.924394+00:00","updated_at":"2026-05-18T00:45:29.924394+00:00"}