{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LTPRHGVCYQCJ75BSRM2BE7ETR3","short_pith_number":"pith:LTPRHGVC","schema_version":"1.0","canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","source":{"kind":"arxiv","id":"1507.01490","version":1},"attestation_state":"computed","paper":{"title":"Fast and Simple Computation of Top-k Closeness Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Marino, Michele Borassi, Pierluigi Crescenzi","submitted_at":"2015-07-06T14:58:24Z","abstract_excerpt":"Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respect to this measure has been deeply analyzed in the last decade. However, even for not very large networks, this problem is computationally intractable in practice: indeed, Abboud et al have recently shown that its complexity is strictly related to the complexity of the All-Pairs Shortest Path (in short, APSP) problem, for which no subcubic \"combinatorial\" algorithm is known. In this paper, we propose a new algorithm "},"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":"1507.01490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T14:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"4786cc8e7dc05d32c2181f4e80151bf87450c188ebf515d62f4919e5ccb744ed","abstract_canon_sha256":"2fd5faece34998005da6fff7d67ab7d41b26694480d7ec3fae3ff8ef853de2fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:16.803623Z","signature_b64":"mmJhn7XOuU8R02CLlOiBApj5s/+62zcH8a+wSZOnz5l59JDhPoMrrBw8oAwKMvoOZvQ1ASqrEt3XV2kKmGvKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","last_reissued_at":"2026-05-18T01:37:16.802997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:16.802997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Simple Computation of Top-k Closeness Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Marino, Michele Borassi, Pierluigi Crescenzi","submitted_at":"2015-07-06T14:58:24Z","abstract_excerpt":"Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respect to this measure has been deeply analyzed in the last decade. However, even for not very large networks, this problem is computationally intractable in practice: indeed, Abboud et al have recently shown that its complexity is strictly related to the complexity of the All-Pairs Shortest Path (in short, APSP) problem, for which no subcubic \"combinatorial\" algorithm is known. In this paper, we propose a new algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01490","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01490","created_at":"2026-05-18T01:37:16.803103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01490v1","created_at":"2026-05-18T01:37:16.803103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01490","created_at":"2026-05-18T01:37:16.803103+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTPRHGVCYQCJ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTPRHGVCYQCJ75BS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTPRHGVC","created_at":"2026-05-18T12:29:29.992203+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/LTPRHGVCYQCJ75BSRM2BE7ETR3","json":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3.json","graph_json":"https://pith.science/api/pith-number/LTPRHGVCYQCJ75BSRM2BE7ETR3/graph.json","events_json":"https://pith.science/api/pith-number/LTPRHGVCYQCJ75BSRM2BE7ETR3/events.json","paper":"https://pith.science/paper/LTPRHGVC"},"agent_actions":{"view_html":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3","download_json":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3.json","view_paper":"https://pith.science/paper/LTPRHGVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01490&json=true","fetch_graph":"https://pith.science/api/pith-number/LTPRHGVCYQCJ75BSRM2BE7ETR3/graph.json","fetch_events":"https://pith.science/api/pith-number/LTPRHGVCYQCJ75BSRM2BE7ETR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/action/storage_attestation","attest_author":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/action/author_attestation","sign_citation":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/action/citation_signature","submit_replication":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/action/replication_record"}},"created_at":"2026-05-18T01:37:16.803103+00:00","updated_at":"2026-05-18T01:37:16.803103+00:00"}