{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A6T6HFNVS5EUYCD7QWFQKLVXKA","short_pith_number":"pith:A6T6HFNV","canonical_record":{"source":{"id":"1702.05284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T10:00:58Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5639a577eaffb8c273dcca4887620b59225dce929347106945f1fab3d9db6bc3","abstract_canon_sha256":"0d69804baa0ea0c2646a1a59c32eb568cd7494e81de1a0d00ac530900261a0b1"},"schema_version":"1.0"},"canonical_sha256":"07a7e395b597494c087f858b052eb75027be906fc7fdc9e73294ae9506f4120b","source":{"kind":"arxiv","id":"1702.05284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05284","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05284v2","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05284","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"A6T6HFNVS5EU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6T6HFNVS5EUYCD7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6T6HFNV","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A6T6HFNVS5EUYCD7QWFQKLVXKA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T10:00:58Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5639a577eaffb8c273dcca4887620b59225dce929347106945f1fab3d9db6bc3","abstract_canon_sha256":"0d69804baa0ea0c2646a1a59c32eb568cd7494e81de1a0d00ac530900261a0b1"},"schema_version":"1.0"},"canonical_sha256":"07a7e395b597494c087f858b052eb75027be906fc7fdc9e73294ae9506f4120b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:10.143220Z","signature_b64":"bBHizy48gSqYjZ70wKG2zc95huP/V+X0LRNXoRlIIW4ZukDMc02vsAeVUdf2+XyzXqwFMFBCaIEIwqho3YE7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a7e395b597494c087f858b052eb75027be906fc7fdc9e73294ae9506f4120b","last_reissued_at":"2026-05-18T00:09:10.142702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:10.142702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05284","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-18T00:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiIB+GmZevNd/cEK8lHMWGHU0TKVFaNbU1wKO5pgmWW9Q2vRT6dDxP2axs/MEYPBMPmYsxFfokRqN5XxgpJ8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:09.833076Z"},"content_sha256":"3a1c033bfe61660ff0330c25ba4e4698c439a4f7464f1b349b5b03fe787c1bd9","schema_version":"1.0","event_id":"sha256:3a1c033bfe61660ff0330c25ba4e4698c439a4f7464f1b349b5b03fe787c1bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A6T6HFNVS5EUYCD7QWFQKLVXKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the betweenness centrality of a node by adding links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Elisabetta Bergamini, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Pierluigi Crescenzi, Yllka Velaj","submitted_at":"2017-02-17T10:00:58Z","abstract_excerpt":"Betweenness is a well-known centrality measure that ranks the nodes according to their participation in the shortest paths of a network. In several scenarios, having a high betweenness can have a positive impact on the node itself. Hence, in this paper we consider the problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. In particular, we study the problem of maximizing the betweenness score of a given node -- Maximum Betweenness Improvement (MBI) -- and that of maximizing the ranking of a given node -- Maximum Ranking Im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05284","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-18T00:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOVv1iaycfZH5pJJuOd9nU6/KUfsxGiAEHui2nkohqI0t07pmMSiKOPhxfCUB8m+Cg9d4Gm/uT+Oecw05HSmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:09.833902Z"},"content_sha256":"42de7ff59fbb8b68280bf0c35aec1e1e57cadb77f4043dafbe923044a6feecab","schema_version":"1.0","event_id":"sha256:42de7ff59fbb8b68280bf0c35aec1e1e57cadb77f4043dafbe923044a6feecab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/bundle.json","state_url":"https://pith.science/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/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-30T16:43:09Z","links":{"resolver":"https://pith.science/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA","bundle":"https://pith.science/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/bundle.json","state":"https://pith.science/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6T6HFNVS5EUYCD7QWFQKLVXKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A6T6HFNVS5EUYCD7QWFQKLVXKA","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":"0d69804baa0ea0c2646a1a59c32eb568cd7494e81de1a0d00ac530900261a0b1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T10:00:58Z","title_canon_sha256":"5639a577eaffb8c273dcca4887620b59225dce929347106945f1fab3d9db6bc3"},"schema_version":"1.0","source":{"id":"1702.05284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05284","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05284v2","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05284","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"A6T6HFNVS5EU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6T6HFNVS5EUYCD7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6T6HFNV","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:42de7ff59fbb8b68280bf0c35aec1e1e57cadb77f4043dafbe923044a6feecab","target":"graph","created_at":"2026-05-18T00:09:10Z","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":"Betweenness is a well-known centrality measure that ranks the nodes according to their participation in the shortest paths of a network. In several scenarios, having a high betweenness can have a positive impact on the node itself. Hence, in this paper we consider the problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. In particular, we study the problem of maximizing the betweenness score of a given node -- Maximum Betweenness Improvement (MBI) -- and that of maximizing the ranking of a given node -- Maximum Ranking Im","authors_text":"Elisabetta Bergamini, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Pierluigi Crescenzi, Yllka Velaj","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T10:00:58Z","title":"Improving the betweenness centrality of a node by adding links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05284","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:3a1c033bfe61660ff0330c25ba4e4698c439a4f7464f1b349b5b03fe787c1bd9","target":"record","created_at":"2026-05-18T00:09:10Z","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":"0d69804baa0ea0c2646a1a59c32eb568cd7494e81de1a0d00ac530900261a0b1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T10:00:58Z","title_canon_sha256":"5639a577eaffb8c273dcca4887620b59225dce929347106945f1fab3d9db6bc3"},"schema_version":"1.0","source":{"id":"1702.05284","kind":"arxiv","version":2}},"canonical_sha256":"07a7e395b597494c087f858b052eb75027be906fc7fdc9e73294ae9506f4120b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07a7e395b597494c087f858b052eb75027be906fc7fdc9e73294ae9506f4120b","first_computed_at":"2026-05-18T00:09:10.142702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:10.142702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBHizy48gSqYjZ70wKG2zc95huP/V+X0LRNXoRlIIW4ZukDMc02vsAeVUdf2+XyzXqwFMFBCaIEIwqho3YE7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:10.143220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a1c033bfe61660ff0330c25ba4e4698c439a4f7464f1b349b5b03fe787c1bd9","sha256:42de7ff59fbb8b68280bf0c35aec1e1e57cadb77f4043dafbe923044a6feecab"],"state_sha256":"4d781800746c36935d7feabe4f04b45f666070a15c691871c98b77098d0a42d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBuSEfMFVDvknlNX7P26m75Gz6KiPvcXZnM/9bIMlQTQakh+MjloDUHLzJlfcsaeb2AXP0y5QI0EABYYB0uVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:43:09.836758Z","bundle_sha256":"013884a00d89cd5fae4772ae9b44f623df82ca8235aa148c897b3e486059a599"}}