{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5CXEK4LWDFUCWZRYQJN7LNWBHT","short_pith_number":"pith:5CXEK4LW","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"},"canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","source":{"kind":"arxiv","id":"1710.01144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01144","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01144v2","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01144","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"5CXEK4LWDFUC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CXEK4LWDFUCWZRY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CXEK4LW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5CXEK4LWDFUCWZRYQJN7LNWBHT","target":"record","payload":{"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"},"canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","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"},"source_kind":"arxiv","source_id":"1710.01144","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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0/scbvMmiKNyVeL2gusyXaEqiachm8X3cNlnkfqtn0Xe4lqY2JfE16v11qMen0Om1cAvGEI9T/LX/a1eGm2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:10.803124Z"},"content_sha256":"ec1063b9397d2ce1f404cfd56d3a91e2f6b61472a6fb83ad63f6c728cd3f6e9e","schema_version":"1.0","event_id":"sha256:ec1063b9397d2ce1f404cfd56d3a91e2f6b61472a6fb83ad63f6c728cd3f6e9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5CXEK4LWDFUCWZRYQJN7LNWBHT","target":"graph","payload":{"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"},"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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MggJnNVfLvA9NlUTUTihoIu6DrNLjrq1f7iEYz7J+ZYxRryIIHwIVou7M2TLKPMaWr+BSmdmw4yiypYecikDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:10.803501Z"},"content_sha256":"594dce8a16671875a7f716d5031b5af5932697705945ed13b343f84cbc56818c","schema_version":"1.0","event_id":"sha256:594dce8a16671875a7f716d5031b5af5932697705945ed13b343f84cbc56818c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/bundle.json","state_url":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/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-06-02T07:53:10Z","links":{"resolver":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT","bundle":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/bundle.json","state":"https://pith.science/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CXEK4LWDFUCWZRYQJN7LNWBHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5CXEK4LWDFUCWZRYQJN7LNWBHT","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":"b74f1e532d081c18daaac91821943aa5eaffe0b32cdabe2bf498ef329bd0b0b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:35:28Z","title_canon_sha256":"aeaad72f835fa9a37c26c7b1d24cda092f7788d31d7f0effc1b20bbafff36c8d"},"schema_version":"1.0","source":{"id":"1710.01144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01144","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01144v2","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01144","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"5CXEK4LWDFUC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CXEK4LWDFUCWZRY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CXEK4LW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:594dce8a16671875a7f716d5031b5af5932697705945ed13b343f84cbc56818c","target":"graph","created_at":"2026-05-17T23:46:11Z","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 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","authors_text":"Elisabetta Bergamini, Henning Meyerhenke, Tanya Gonser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:35:28Z","title":"Scaling up Group Closeness Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01144","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:ec1063b9397d2ce1f404cfd56d3a91e2f6b61472a6fb83ad63f6c728cd3f6e9e","target":"record","created_at":"2026-05-17T23:46:11Z","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":"b74f1e532d081c18daaac91821943aa5eaffe0b32cdabe2bf498ef329bd0b0b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T13:35:28Z","title_canon_sha256":"aeaad72f835fa9a37c26c7b1d24cda092f7788d31d7f0effc1b20bbafff36c8d"},"schema_version":"1.0","source":{"id":"1710.01144","kind":"arxiv","version":2}},"canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8ae45717619682b6638825bf5b6c13ce1276e3c51f67c14b0d47c7f49b4df53","first_computed_at":"2026-05-17T23:46:11.301364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:11.301364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vp7FuyuBGi9ReCSTx51qlepZUH85kr1xnfF7gwOogqf/F7PcYYKYrghQ2QwBkEfLrmE28y0JFcG+LsJtrxiCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:11.301710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec1063b9397d2ce1f404cfd56d3a91e2f6b61472a6fb83ad63f6c728cd3f6e9e","sha256:594dce8a16671875a7f716d5031b5af5932697705945ed13b343f84cbc56818c"],"state_sha256":"8e2d8712ec1996015d096a9bb265f07a9db4eb80ed742db6f9d285b80b5b06cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3qPMAToITvFKkX0vRDkgbF2FsgcGPmGHdAtZvhUeHUT06xsU8MVBP+h1Kp7G7HlK2fA6c8QYfvyzk6khEawDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:53:10.805469Z","bundle_sha256":"e62b85432c609ac4897f64c6585e041f6aae28dba76f69ef536fcbc9108c522f"}}