{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WHCUUZUFUGLJV7BGBCKXL6C5FQ","short_pith_number":"pith:WHCUUZUF","schema_version":"1.0","canonical_sha256":"b1c54a6685a1969afc26089575f85d2c021d3777e4c55fe1b7033cc407a0b1a5","source":{"kind":"arxiv","id":"1504.06236","version":2},"attestation_state":"computed","paper":{"title":"Improving detection of influential nodes in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Amir Sheikhahmadi, Arman Shokrollahi, Mohammad A. Nematbakhsh","submitted_at":"2015-04-23T16:01:35Z","abstract_excerpt":"Recently an increasing amount of research is devoted to the question of how the most influential nodes (seeds) can be found effectively in a complex network. There are a number of measures proposed for this purpose, for instance, high-degree centrality measure reflects the importance of the network topology and has a reasonable runtime performance to find a set of nodes with highest degree, but they do not have a satisfactory dissemination potentiality in the network due to having many common neighbors ($\\mbox{CN}^{(1)}$) and common neighbors of neighbors ($\\mbox{CN}^{(2)}$). This flaw holds i"},"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":"1504.06236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-23T16:01:35Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ced7632e2965f5e4fa7e3eab8460be9aa68e3c0b04c703fa39736f3de9e4c1da","abstract_canon_sha256":"7ed156316ec3bceac11b4b8b77ed27add9430a2d0b656decd466d3deb3ad3c76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.268631Z","signature_b64":"moRd+WZscJ9ucWhaplHVQi4SnaDp5SAf1c/jTTnA3/8IRvtpUK7HOrf2M/dMeFfMuSFhvbBGDrjnwq57RsptDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1c54a6685a1969afc26089575f85d2c021d3777e4c55fe1b7033cc407a0b1a5","last_reissued_at":"2026-05-18T02:07:26.267981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.267981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving detection of influential nodes in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Amir Sheikhahmadi, Arman Shokrollahi, Mohammad A. Nematbakhsh","submitted_at":"2015-04-23T16:01:35Z","abstract_excerpt":"Recently an increasing amount of research is devoted to the question of how the most influential nodes (seeds) can be found effectively in a complex network. There are a number of measures proposed for this purpose, for instance, high-degree centrality measure reflects the importance of the network topology and has a reasonable runtime performance to find a set of nodes with highest degree, but they do not have a satisfactory dissemination potentiality in the network due to having many common neighbors ($\\mbox{CN}^{(1)}$) and common neighbors of neighbors ($\\mbox{CN}^{(2)}$). This flaw holds i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06236","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.06236","created_at":"2026-05-18T02:07:26.268077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06236v2","created_at":"2026-05-18T02:07:26.268077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06236","created_at":"2026-05-18T02:07:26.268077+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHCUUZUFUGLJ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHCUUZUFUGLJV7BG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHCUUZUF","created_at":"2026-05-18T12:29:47.479230+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/WHCUUZUFUGLJV7BGBCKXL6C5FQ","json":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ.json","graph_json":"https://pith.science/api/pith-number/WHCUUZUFUGLJV7BGBCKXL6C5FQ/graph.json","events_json":"https://pith.science/api/pith-number/WHCUUZUFUGLJV7BGBCKXL6C5FQ/events.json","paper":"https://pith.science/paper/WHCUUZUF"},"agent_actions":{"view_html":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ","download_json":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ.json","view_paper":"https://pith.science/paper/WHCUUZUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06236&json=true","fetch_graph":"https://pith.science/api/pith-number/WHCUUZUFUGLJV7BGBCKXL6C5FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WHCUUZUFUGLJV7BGBCKXL6C5FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ/action/storage_attestation","attest_author":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ/action/author_attestation","sign_citation":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ/action/citation_signature","submit_replication":"https://pith.science/pith/WHCUUZUFUGLJV7BGBCKXL6C5FQ/action/replication_record"}},"created_at":"2026-05-18T02:07:26.268077+00:00","updated_at":"2026-05-18T02:07:26.268077+00:00"}