{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EB7BONDHJXWOYKX2ME7RPVSNSA","short_pith_number":"pith:EB7BONDH","canonical_record":{"source":{"id":"1802.02556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-07T18:30:40Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0f6300c569df7fcbfdf81eb7a7971795e553d19bd8c09d0109cd57eaad5135e1","abstract_canon_sha256":"d7c9b1781372539c8cf99483aaa5314055f63626d70537886f63e5e5a71c56c8"},"schema_version":"1.0"},"canonical_sha256":"207e1734674decec2afa613f17d64d900b4467a388ab0b0d4fe747512590ea4b","source":{"kind":"arxiv","id":"1802.02556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02556","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02556v2","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02556","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"EB7BONDHJXWO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EB7BONDHJXWOYKX2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EB7BONDH","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EB7BONDHJXWOYKX2ME7RPVSNSA","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-07T18:30:40Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0f6300c569df7fcbfdf81eb7a7971795e553d19bd8c09d0109cd57eaad5135e1","abstract_canon_sha256":"d7c9b1781372539c8cf99483aaa5314055f63626d70537886f63e5e5a71c56c8"},"schema_version":"1.0"},"canonical_sha256":"207e1734674decec2afa613f17d64d900b4467a388ab0b0d4fe747512590ea4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:01.288639Z","signature_b64":"KzaQBSN7Mbbe8WNyz44xKeL4ZRmFhhSppSBqAy+AKuwyQkOAtP/ZVydOXU2UAB2ioBCXWqo4QtoQldWHeX79Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"207e1734674decec2afa613f17d64d900b4467a388ab0b0d4fe747512590ea4b","last_reissued_at":"2026-05-17T23:53:01.288068Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:01.288068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02556","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:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBwgwBTkaD4sBeFttrC8WfcyAp6+BUk0g3D6FT1rAyU3skC+dbL3Ho12/v2kYMj0JHe9xJbsttK6SvxSACdLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:28:31.579982Z"},"content_sha256":"0eb45870a4a0ebf6254cf03ef5d67110d032939786c595f4769bffa8c6bac41d","schema_version":"1.0","event_id":"sha256:0eb45870a4a0ebf6254cf03ef5d67110d032939786c595f4769bffa8c6bac41d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EB7BONDHJXWOYKX2ME7RPVSNSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Current Flow Group Closeness Centrality for Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Huan Li, Liren Shan, Richard Peng, Yuhao Yi, Zhongzhi Zhang","submitted_at":"2018-02-07T18:30:40Z","abstract_excerpt":"Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC $C(S)$, both theoretically and experimentally. We show that the problem is NP-hard, but propose two greedy algorithms for minimizing the reciprocal of $C(S)$ with provable guarantees using the monotoncity and supermodularity. The first is a deterministic algorithm with an approximation fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02556","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:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAk7xLuWRYryMPDeZNdRhPgt/6V2NPjZzdcPOOzFd8Hji0ndeZ+seCq5D8Q+IvKUCi2ASg0QDoj+AzG5PCpPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:28:31.580343Z"},"content_sha256":"c05f8c51d2bd57f865dc0e52ff8fa446c623709be136e0406aaa57b81c5dbc90","schema_version":"1.0","event_id":"sha256:c05f8c51d2bd57f865dc0e52ff8fa446c623709be136e0406aaa57b81c5dbc90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/bundle.json","state_url":"https://pith.science/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/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-07-02T01:28:31Z","links":{"resolver":"https://pith.science/pith/EB7BONDHJXWOYKX2ME7RPVSNSA","bundle":"https://pith.science/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/bundle.json","state":"https://pith.science/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EB7BONDHJXWOYKX2ME7RPVSNSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EB7BONDHJXWOYKX2ME7RPVSNSA","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":"d7c9b1781372539c8cf99483aaa5314055f63626d70537886f63e5e5a71c56c8","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-07T18:30:40Z","title_canon_sha256":"0f6300c569df7fcbfdf81eb7a7971795e553d19bd8c09d0109cd57eaad5135e1"},"schema_version":"1.0","source":{"id":"1802.02556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02556","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02556v2","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02556","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"EB7BONDHJXWO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EB7BONDHJXWOYKX2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EB7BONDH","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:c05f8c51d2bd57f865dc0e52ff8fa446c623709be136e0406aaa57b81c5dbc90","target":"graph","created_at":"2026-05-17T23:53:01Z","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":"Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC $C(S)$, both theoretically and experimentally. We show that the problem is NP-hard, but propose two greedy algorithms for minimizing the reciprocal of $C(S)$ with provable guarantees using the monotoncity and supermodularity. The first is a deterministic algorithm with an approximation fac","authors_text":"Huan Li, Liren Shan, Richard Peng, Yuhao Yi, Zhongzhi Zhang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-07T18:30:40Z","title":"Current Flow Group Closeness Centrality for Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02556","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:0eb45870a4a0ebf6254cf03ef5d67110d032939786c595f4769bffa8c6bac41d","target":"record","created_at":"2026-05-17T23:53:01Z","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":"d7c9b1781372539c8cf99483aaa5314055f63626d70537886f63e5e5a71c56c8","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-07T18:30:40Z","title_canon_sha256":"0f6300c569df7fcbfdf81eb7a7971795e553d19bd8c09d0109cd57eaad5135e1"},"schema_version":"1.0","source":{"id":"1802.02556","kind":"arxiv","version":2}},"canonical_sha256":"207e1734674decec2afa613f17d64d900b4467a388ab0b0d4fe747512590ea4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"207e1734674decec2afa613f17d64d900b4467a388ab0b0d4fe747512590ea4b","first_computed_at":"2026-05-17T23:53:01.288068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:01.288068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzaQBSN7Mbbe8WNyz44xKeL4ZRmFhhSppSBqAy+AKuwyQkOAtP/ZVydOXU2UAB2ioBCXWqo4QtoQldWHeX79Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:01.288639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eb45870a4a0ebf6254cf03ef5d67110d032939786c595f4769bffa8c6bac41d","sha256:c05f8c51d2bd57f865dc0e52ff8fa446c623709be136e0406aaa57b81c5dbc90"],"state_sha256":"ef62fc038f8e9bd1f4bef4207a00554e958d91b48d809dd10e73453f40e8df83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKDSG99eM3Q/4GxoaZboB4L05G6i48byrKjnx1bLoyKpp+AmkmjZPna27wA18CNdZMHj/hsnhWKQnxafVtPBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T01:28:31.582284Z","bundle_sha256":"5d5a7337da1c89dc372b2211337af087c0114061dae8bcc80bee53dc5bb9f946"}}