{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5CXEK4LWDFUCWZRYQJN7LNWBHT","short_pith_number":"pith:5CXEK4LW","schema_version":"1.0","canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","source":{"kind":"arxiv","id":"1710.01144","version":2},"attestation_state":"computed","paper":{"title":"Scaling up Group Closeness Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elisabetta Bergamini, Henning Meyerhenke, Tanya Gonser","submitted_at":"2017-10-03T13:35:28Z","abstract_excerpt":"Closeness is a widely-used centrality measure in social network analysis. For a node it indicates the reciprocal of the average shortest-path distance to the other nodes of the network. While the identification of the k nodes with highest closeness received significant attention, many applications are actually interested in finding a group of nodes that is central as a whole. For this problem, only recently a greedy algorithm has been proposed [Chen et al., ADC 2016]. The approximation factor of (1 - 1/e) proposed by Chen et al. for this algorithm does not hold, though, as we show in this vers"},"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":"1710.01144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"aeaad72f835fa9a37c26c7b1d24cda092f7788d31d7f0effc1b20bbafff36c8d","abstract_canon_sha256":"b74f1e532d081c18daaac91821943aa5eaffe0b32cdabe2bf498ef329bd0b0b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:11.301710Z","signature_b64":"/vp7FuyuBGi9ReCSTx51qlepZUH85kr1xnfF7gwOogqf/F7PcYYKYrghQ2QwBkEfLrmE28y0JFcG+LsJtrxiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","last_reissued_at":"2026-05-17T23:46:11.301364Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:11.301364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling up Group Closeness Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elisabetta Bergamini, Henning Meyerhenke, Tanya Gonser","submitted_at":"2017-10-03T13:35:28Z","abstract_excerpt":"Closeness is a widely-used centrality measure in social network analysis. For a node it indicates the reciprocal of the average shortest-path distance to the other nodes of the network. While the identification of the k nodes with highest closeness received significant attention, many applications are actually interested in finding a group of nodes that is central as a whole. For this problem, only recently a greedy algorithm has been proposed [Chen et al., ADC 2016]. The approximation factor of (1 - 1/e) proposed by Chen et al. for this algorithm does not hold, though, as we show in this vers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01144","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":"1710.01144","created_at":"2026-05-17T23:46:11.301412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01144v2","created_at":"2026-05-17T23:46:11.301412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01144","created_at":"2026-05-17T23:46:11.301412+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CXEK4LWDFUC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CXEK4LWDFUCWZRY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CXEK4LW","created_at":"2026-05-18T12:31:00.734936+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/5CXEK4LWDFUCWZRYQJN7LNWBHT","json":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT.json","graph_json":"https://pith.science/api/pith-number/5CXEK4LWDFUCWZRYQJN7LNWBHT/graph.json","events_json":"https://pith.science/api/pith-number/5CXEK4LWDFUCWZRYQJN7LNWBHT/events.json","paper":"https://pith.science/paper/5CXEK4LW"},"agent_actions":{"view_html":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT","download_json":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT.json","view_paper":"https://pith.science/paper/5CXEK4LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01144&json=true","fetch_graph":"https://pith.science/api/pith-number/5CXEK4LWDFUCWZRYQJN7LNWBHT/graph.json","fetch_events":"https://pith.science/api/pith-number/5CXEK4LWDFUCWZRYQJN7LNWBHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/action/storage_attestation","attest_author":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/action/author_attestation","sign_citation":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/action/citation_signature","submit_replication":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/action/replication_record"}},"created_at":"2026-05-17T23:46:11.301412+00:00","updated_at":"2026-05-17T23:46:11.301412+00:00"}