{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DQL5BOS5XL3E7KJGCR2V62I47O","short_pith_number":"pith:DQL5BOS5","schema_version":"1.0","canonical_sha256":"1c17d0ba5dbaf64fa92614755f691cfb87d4fe4a6ffe845911c6a0d6279bbf18","source":{"kind":"arxiv","id":"1804.06540","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.06540","created_at":"2026-05-18T00:18:06.345483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06540v1","created_at":"2026-05-18T00:18:06.345483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06540","created_at":"2026-05-18T00:18:06.345483+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQL5BOS5XL3E","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQL5BOS5XL3E7KJG","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQL5BOS5","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O","json":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O.json","graph_json":"https://pith.science/api/pith-number/DQL5BOS5XL3E7KJGCR2V62I47O/graph.json","events_json":"https://pith.science/api/pith-number/DQL5BOS5XL3E7KJGCR2V62I47O/events.json","paper":"https://pith.science/paper/DQL5BOS5"},"agent_actions":{"view_html":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O","download_json":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O.json","view_paper":"https://pith.science/paper/DQL5BOS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06540&json=true","fetch_graph":"https://pith.science/api/pith-number/DQL5BOS5XL3E7KJGCR2V62I47O/graph.json","fetch_events":"https://pith.science/api/pith-number/DQL5BOS5XL3E7KJGCR2V62I47O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/action/storage_attestation","attest_author":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/action/author_attestation","sign_citation":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/action/citation_signature","submit_replication":"https://pith.science/pith/DQL5BOS5XL3E7KJGCR2V62I47O/action/replication_record"}},"created_at":"2026-05-18T00:18:06.345483+00:00","updated_at":"2026-05-18T00:18:06.345483+00:00"}