{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LTPRHGVCYQCJ75BSRM2BE7ETR3","short_pith_number":"pith:LTPRHGVC","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"},"canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","source":{"kind":"arxiv","id":"1507.01490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01490","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01490v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01490","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"LTPRHGVCYQCJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTPRHGVCYQCJ75BS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTPRHGVC","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LTPRHGVCYQCJ75BSRM2BE7ETR3","target":"record","payload":{"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"},"canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","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"},"source_kind":"arxiv","source_id":"1507.01490","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-18T01:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZ8W9mP4vd3ODZ6grUnAj9kQ2hSEIl4r9PQnDBRwtb4YrDzmIo5huIcfBmOUReshwmBamlUpjKDL+VTzj/I1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:38:23.018928Z"},"content_sha256":"27899436ec23bd4f616bf8091a5f0026e7647f1c6c1e6bb5a0a9f776ebfc1121","schema_version":"1.0","event_id":"sha256:27899436ec23bd4f616bf8091a5f0026e7647f1c6c1e6bb5a0a9f776ebfc1121"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LTPRHGVCYQCJ75BSRM2BE7ETR3","target":"graph","payload":{"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"},"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-18T01:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKKdjA/8hRkZAzvONK8835r6axGe/1L73mAF/BMauGUJDjvd0Co82noB6Gde/GQ0+ouJtXSz2RXBDkAnPX4BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:38:23.019274Z"},"content_sha256":"a5f9a60b44fa75f619d69da503c531a467a3c96c34e22a14a81721ce30658a0c","schema_version":"1.0","event_id":"sha256:a5f9a60b44fa75f619d69da503c531a467a3c96c34e22a14a81721ce30658a0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/bundle.json","state_url":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/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-20T14:38:23Z","links":{"resolver":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3","bundle":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/bundle.json","state":"https://pith.science/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTPRHGVCYQCJ75BSRM2BE7ETR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LTPRHGVCYQCJ75BSRM2BE7ETR3","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":"2fd5faece34998005da6fff7d67ab7d41b26694480d7ec3fae3ff8ef853de2fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T14:58:24Z","title_canon_sha256":"4786cc8e7dc05d32c2181f4e80151bf87450c188ebf515d62f4919e5ccb744ed"},"schema_version":"1.0","source":{"id":"1507.01490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01490","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01490v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01490","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"LTPRHGVCYQCJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTPRHGVCYQCJ75BS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTPRHGVC","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:a5f9a60b44fa75f619d69da503c531a467a3c96c34e22a14a81721ce30658a0c","target":"graph","created_at":"2026-05-18T01:37:16Z","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 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 ","authors_text":"Andrea Marino, Michele Borassi, Pierluigi Crescenzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T14:58:24Z","title":"Fast and Simple Computation of Top-k Closeness Centralities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01490","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:27899436ec23bd4f616bf8091a5f0026e7647f1c6c1e6bb5a0a9f776ebfc1121","target":"record","created_at":"2026-05-18T01:37:16Z","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":"2fd5faece34998005da6fff7d67ab7d41b26694480d7ec3fae3ff8ef853de2fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T14:58:24Z","title_canon_sha256":"4786cc8e7dc05d32c2181f4e80151bf87450c188ebf515d62f4919e5ccb744ed"},"schema_version":"1.0","source":{"id":"1507.01490","kind":"arxiv","version":1}},"canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cdf139aa2c4049ff4328b34127c938edcc0bb48afa356469ebf44542e91da50","first_computed_at":"2026-05-18T01:37:16.802997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:16.802997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmJhn7XOuU8R02CLlOiBApj5s/+62zcH8a+wSZOnz5l59JDhPoMrrBw8oAwKMvoOZvQ1ASqrEt3XV2kKmGvKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:16.803623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27899436ec23bd4f616bf8091a5f0026e7647f1c6c1e6bb5a0a9f776ebfc1121","sha256:a5f9a60b44fa75f619d69da503c531a467a3c96c34e22a14a81721ce30658a0c"],"state_sha256":"6d8a962e37ba5dce99431e7420a4722cb83821bf259c119df895aa6b7fe8ab24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfwu/M1mqTZZBh+9uMaZTl3TU3liTeLOL5QPzccGZEOgdE/JGanm44RkpgRNyUntOxnUSz7YtOtnIBjNwEiKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:38:23.021219Z","bundle_sha256":"454dae5dd41163d83a1efd0fe2ecd1102afc2e811eee1b929e73e288ded2883f"}}