{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VEMN2DHKJIPK33QOV53XSMNWXH","short_pith_number":"pith:VEMN2DHK","canonical_record":{"source":{"id":"2010.15435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-29T09:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"64ac8385990c0b91ea25344b888317bb7ce52bd9e4c1c578211ef897ef2ef0b2","abstract_canon_sha256":"0b56bed696c5b7ee185a9dea3282ffb0dddb00f00377cb873dffecae270584ed"},"schema_version":"1.0"},"canonical_sha256":"a918dd0cea4a1eadee0eaf777931b6b9d2adbf00a74efc707d90dd5f75556507","source":{"kind":"arxiv","id":"2010.15435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.15435","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"2010.15435v1","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15435","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"VEMN2DHKJIPK","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_16","alias_value":"VEMN2DHKJIPK33QO","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_8","alias_value":"VEMN2DHK","created_at":"2026-07-05T01:47:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VEMN2DHKJIPK33QOV53XSMNWXH","target":"record","payload":{"canonical_record":{"source":{"id":"2010.15435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-29T09:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"64ac8385990c0b91ea25344b888317bb7ce52bd9e4c1c578211ef897ef2ef0b2","abstract_canon_sha256":"0b56bed696c5b7ee185a9dea3282ffb0dddb00f00377cb873dffecae270584ed"},"schema_version":"1.0"},"canonical_sha256":"a918dd0cea4a1eadee0eaf777931b6b9d2adbf00a74efc707d90dd5f75556507","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:36.990461Z","signature_b64":"4eWng/mnITFkA8KTSjDbhorw/kC7olH6/lufEe15EObmr8SzT7eqOR+hBqWvZGZafU01iX2IErvW7aDBDb77AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a918dd0cea4a1eadee0eaf777931b6b9d2adbf00a74efc707d90dd5f75556507","last_reissued_at":"2026-07-05T01:47:36.990079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:36.990079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.15435","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-07-05T01:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XO+aFPuOEMfHAgek+zyzbN3COUhn8TRvdr8lnqdway7jZEP1Jwt8n30INBwUFUfcHeZvL+M7douVzk5+jx8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:45:29.260480Z"},"content_sha256":"3b96a03823d7dfd55194448868d0109c3c61d254b12bab42c75dcf30b0b1ca77","schema_version":"1.0","event_id":"sha256:3b96a03823d7dfd55194448868d0109c3c61d254b12bab42c75dcf30b0b1ca77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VEMN2DHKJIPK33QOV53XSMNWXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander van der Grinten, Eugenio Angriman, Gianlorenzo D'Angelo, Henning Meyerhenke, Hugo Gilbert, Ruben Becker","submitted_at":"2020-10-29T09:13:43Z","abstract_excerpt":"Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems occur. In this work, we study two such problems, group-harmonic maximization and group-closeness maximization both from a theoretical and from an algorithm engineering perspective.\n  On the theoretical side, we obtain the following results. For group-harmonic maximization, unless $P=NP$, there is no polynomial-time algorithm that achieves an approximation factor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.15435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.15435/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ypql2+fG2PzphWHhBJaLQKp4LTC5UOohdhaV8Nq2hu6Z1IBu6oUpObAGtLLhdDWM1th+3ja3G9Rcbz8fj1MVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:45:29.260857Z"},"content_sha256":"dc38ca315740b417663e7b89ad4cdabccde7f6bb4a255b17646528c738ed7745","schema_version":"1.0","event_id":"sha256:dc38ca315740b417663e7b89ad4cdabccde7f6bb4a255b17646528c738ed7745"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEMN2DHKJIPK33QOV53XSMNWXH/bundle.json","state_url":"https://pith.science/pith/VEMN2DHKJIPK33QOV53XSMNWXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEMN2DHKJIPK33QOV53XSMNWXH/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-06T08:45:29Z","links":{"resolver":"https://pith.science/pith/VEMN2DHKJIPK33QOV53XSMNWXH","bundle":"https://pith.science/pith/VEMN2DHKJIPK33QOV53XSMNWXH/bundle.json","state":"https://pith.science/pith/VEMN2DHKJIPK33QOV53XSMNWXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEMN2DHKJIPK33QOV53XSMNWXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VEMN2DHKJIPK33QOV53XSMNWXH","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":"0b56bed696c5b7ee185a9dea3282ffb0dddb00f00377cb873dffecae270584ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-29T09:13:43Z","title_canon_sha256":"64ac8385990c0b91ea25344b888317bb7ce52bd9e4c1c578211ef897ef2ef0b2"},"schema_version":"1.0","source":{"id":"2010.15435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.15435","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"2010.15435v1","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15435","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"VEMN2DHKJIPK","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_16","alias_value":"VEMN2DHKJIPK33QO","created_at":"2026-07-05T01:47:36Z"},{"alias_kind":"pith_short_8","alias_value":"VEMN2DHK","created_at":"2026-07-05T01:47:36Z"}],"graph_snapshots":[{"event_id":"sha256:dc38ca315740b417663e7b89ad4cdabccde7f6bb4a255b17646528c738ed7745","target":"graph","created_at":"2026-07-05T01:47:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.15435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems occur. In this work, we study two such problems, group-harmonic maximization and group-closeness maximization both from a theoretical and from an algorithm engineering perspective.\n  On the theoretical side, we obtain the following results. For group-harmonic maximization, unless $P=NP$, there is no polynomial-time algorithm that achieves an approximation factor","authors_text":"Alexander van der Grinten, Eugenio Angriman, Gianlorenzo D'Angelo, Henning Meyerhenke, Hugo Gilbert, Ruben Becker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-29T09:13:43Z","title":"Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.15435","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:3b96a03823d7dfd55194448868d0109c3c61d254b12bab42c75dcf30b0b1ca77","target":"record","created_at":"2026-07-05T01:47:36Z","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":"0b56bed696c5b7ee185a9dea3282ffb0dddb00f00377cb873dffecae270584ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-29T09:13:43Z","title_canon_sha256":"64ac8385990c0b91ea25344b888317bb7ce52bd9e4c1c578211ef897ef2ef0b2"},"schema_version":"1.0","source":{"id":"2010.15435","kind":"arxiv","version":1}},"canonical_sha256":"a918dd0cea4a1eadee0eaf777931b6b9d2adbf00a74efc707d90dd5f75556507","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a918dd0cea4a1eadee0eaf777931b6b9d2adbf00a74efc707d90dd5f75556507","first_computed_at":"2026-07-05T01:47:36.990079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:36.990079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4eWng/mnITFkA8KTSjDbhorw/kC7olH6/lufEe15EObmr8SzT7eqOR+hBqWvZGZafU01iX2IErvW7aDBDb77AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:36.990461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.15435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b96a03823d7dfd55194448868d0109c3c61d254b12bab42c75dcf30b0b1ca77","sha256:dc38ca315740b417663e7b89ad4cdabccde7f6bb4a255b17646528c738ed7745"],"state_sha256":"9b112c6d50585489dc28b8e9fe332be1a1e5fc578a137e773dc994e895df9b12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A49XdRaLcBkjloOosbdTC21prVSRUYpzeQk3EFFoEhImwz9D7M3xU5t4yxuQnoe1O5Ro1AJhhOUWiF+UmEqhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:45:29.262786Z","bundle_sha256":"8f9b2437f0b72b92777656c17f184284797b5a2d93d11a44a8caab1c22b74021"}}