{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DQL5BOS5XL3E7KJGCR2V62I47O","short_pith_number":"pith:DQL5BOS5","canonical_record":{"source":{"id":"1804.06540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-18T03:28:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1b1bbce346e5a2ef1c98baa12b6bb649231ead67fe91e99d317fbec15e18571f","abstract_canon_sha256":"03d9484f5297e4599e8bc3a243a9c67d91e733d768cc796cfab205b543e5d75b"},"schema_version":"1.0"},"canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","source":{"kind":"arxiv","id":"1804.06540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06540","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06540v1","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06540","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"DQL5BOS5XL3E","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQL5BOS5XL3E7KJG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQL5BOS5","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DQL5BOS5XL3E7KJGCR2V62I47O","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-18T03:28:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1b1bbce346e5a2ef1c98baa12b6bb649231ead67fe91e99d317fbec15e18571f","abstract_canon_sha256":"03d9484f5297e4599e8bc3a243a9c67d91e733d768cc796cfab205b543e5d75b"},"schema_version":"1.0"},"canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:06.345997Z","signature_b64":"yNCjGn+UXsq+Fzu5tC1zyTMGgrnh9HIXnjUBkGhaOqQ+akYB33zdjdInGas6oducty1CR+ZlK0CI+BNaSLBrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","last_reissued_at":"2026-05-18T00:18:06.345390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:06.345390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06540","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-05-18T00:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mG1Dc1cFDfQjRgF6TCFVA0wjJqv67qNKBH2A0lvRr0GaTLuYIatclEyKe9tF5eVLV15qscBnbrKg6+TLfAZeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:43:54.926724Z"},"content_sha256":"9f0f2b1f79cbce602d47cc157963078b4f59a5775ef027f71157c0dbc6bfecbd","schema_version":"1.0","event_id":"sha256:9f0f2b1f79cbce602d47cc157963078b4f59a5775ef027f71157c0dbc6bfecbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DQL5BOS5XL3E7KJGCR2V62I47O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving information centrality of a node in complex networks by adding edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Liren Shan, Yuhao Yi, Zhongzhi Zhang","submitted_at":"2018-04-18T03:28:26Z","abstract_excerpt":"The problem of increasing the centrality of a network node arises in many practical applications. In this paper, we study the optimization problem of maximizing the information centrality $I_v$ of a given node $v$ in a network with $n$ nodes and $m$ edges, by creating $k$ new edges incident to $v$. Since $I_v$ is the reciprocal of the sum of resistance distance $\\mathcal{R}_v$ between $v$ and all nodes, we alternatively consider the problem of minimizing $\\mathcal{R}_v$ by adding $k$ new edges linked to $v$. We show that the objective function is monotone and supermodular. We provide a simple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06540","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":""},"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:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE+VuIeOR4O4wwzC0HfJTDh+H68SkMNCud87wgAs03obdiQlPr0GRdyR/C7Luv8p9WTL5493iIpd3qAmQDC2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:43:54.927057Z"},"content_sha256":"3628e71582da8f2de9fae0aef14a99a7021be4372d371f0c7c1353c0366e7950","schema_version":"1.0","event_id":"sha256:3628e71582da8f2de9fae0aef14a99a7021be4372d371f0c7c1353c0366e7950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/bundle.json","state_url":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQL5BOS5XL3E7KJGCR2V62I47O/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-02T20:43:54Z","links":{"resolver":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O","bundle":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/bundle.json","state":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQL5BOS5XL3E7KJGCR2V62I47O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DQL5BOS5XL3E7KJGCR2V62I47O","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":"03d9484f5297e4599e8bc3a243a9c67d91e733d768cc796cfab205b543e5d75b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-18T03:28:26Z","title_canon_sha256":"1b1bbce346e5a2ef1c98baa12b6bb649231ead67fe91e99d317fbec15e18571f"},"schema_version":"1.0","source":{"id":"1804.06540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06540","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06540v1","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06540","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"DQL5BOS5XL3E","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQL5BOS5XL3E7KJG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQL5BOS5","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:3628e71582da8f2de9fae0aef14a99a7021be4372d371f0c7c1353c0366e7950","target":"graph","created_at":"2026-05-18T00:18:06Z","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":"The problem of increasing the centrality of a network node arises in many practical applications. In this paper, we study the optimization problem of maximizing the information centrality $I_v$ of a given node $v$ in a network with $n$ nodes and $m$ edges, by creating $k$ new edges incident to $v$. Since $I_v$ is the reciprocal of the sum of resistance distance $\\mathcal{R}_v$ between $v$ and all nodes, we alternatively consider the problem of minimizing $\\mathcal{R}_v$ by adding $k$ new edges linked to $v$. We show that the objective function is monotone and supermodular. We provide a simple ","authors_text":"Liren Shan, Yuhao Yi, Zhongzhi Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-18T03:28:26Z","title":"Improving information centrality of a node in complex networks by adding edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06540","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:9f0f2b1f79cbce602d47cc157963078b4f59a5775ef027f71157c0dbc6bfecbd","target":"record","created_at":"2026-05-18T00:18:06Z","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":"03d9484f5297e4599e8bc3a243a9c67d91e733d768cc796cfab205b543e5d75b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-18T03:28:26Z","title_canon_sha256":"1b1bbce346e5a2ef1c98baa12b6bb649231ead67fe91e99d317fbec15e18571f"},"schema_version":"1.0","source":{"id":"1804.06540","kind":"arxiv","version":1}},"canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","first_computed_at":"2026-05-18T00:18:06.345390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:06.345390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yNCjGn+UXsq+Fzu5tC1zyTMGgrnh9HIXnjUBkGhaOqQ+akYB33zdjdInGas6oducty1CR+ZlK0CI+BNaSLBrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:06.345997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f0f2b1f79cbce602d47cc157963078b4f59a5775ef027f71157c0dbc6bfecbd","sha256:3628e71582da8f2de9fae0aef14a99a7021be4372d371f0c7c1353c0366e7950"],"state_sha256":"4365293e825a50b954e4c2e210a094b5cbd39182bf36feeb5e703f0653c74cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WISfsCG6soydg3C41LDUxlwHPhCcj/nd6bIx3DvjHfR8JcNtNYCZ9JFNL6BRu2roKA8pYMOeuxkcVhqR5dyHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T20:43:54.928932Z","bundle_sha256":"aa2ff140b6061b2b6c14f8f838a80f6d12cbe9ae0d846ec78bc8781835d4e88e"}}