{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LRPHYFQAS55BGLSUHNL3QIMNYX","short_pith_number":"pith:LRPHYFQA","schema_version":"1.0","canonical_sha256":"5c5e7c1600977a132e543b57b8218dc5e51b2a8ae9cf82a5ea171d2f352b2763","source":{"kind":"arxiv","id":"1602.00070","version":2},"attestation_state":"computed","paper":{"title":"Identifying a set of influential spreaders in complex networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Duan-Bing Chen, Jian-Xiong Zhang, Qiang Dong, Zhi-Dan Zhao","submitted_at":"2016-01-30T04:24:32Z","abstract_excerpt":"Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-$r$ ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and $k$-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effec"},"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":"1602.00070","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-30T04:24:32Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b28f3199c70c52e90d38c113fc1a650b03d370b4af553f98b986d353559c0fb2","abstract_canon_sha256":"070d13ea51138ebf31f064ab5f8f7f794d3231e8358413d63750a413ed158723"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.438145Z","signature_b64":"GT1jNKF0lQS8DRTDiujPeSBBS4xgEIN8329BP0DuUJ8QeaFGDMTrI1JSYXUq2rsFrts3CmXVsP4DpYXDlOQACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c5e7c1600977a132e543b57b8218dc5e51b2a8ae9cf82a5ea171d2f352b2763","last_reissued_at":"2026-05-18T01:10:59.437633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.437633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying a set of influential spreaders in complex networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Duan-Bing Chen, Jian-Xiong Zhang, Qiang Dong, Zhi-Dan Zhao","submitted_at":"2016-01-30T04:24:32Z","abstract_excerpt":"Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-$r$ ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and $k$-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00070","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":"1602.00070","created_at":"2026-05-18T01:10:59.437713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00070v2","created_at":"2026-05-18T01:10:59.437713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00070","created_at":"2026-05-18T01:10:59.437713+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRPHYFQAS55B","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRPHYFQAS55BGLSU","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRPHYFQA","created_at":"2026-05-18T12:30:29.479603+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/LRPHYFQAS55BGLSUHNL3QIMNYX","json":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX.json","graph_json":"https://pith.science/api/pith-number/LRPHYFQAS55BGLSUHNL3QIMNYX/graph.json","events_json":"https://pith.science/api/pith-number/LRPHYFQAS55BGLSUHNL3QIMNYX/events.json","paper":"https://pith.science/paper/LRPHYFQA"},"agent_actions":{"view_html":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX","download_json":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX.json","view_paper":"https://pith.science/paper/LRPHYFQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00070&json=true","fetch_graph":"https://pith.science/api/pith-number/LRPHYFQAS55BGLSUHNL3QIMNYX/graph.json","fetch_events":"https://pith.science/api/pith-number/LRPHYFQAS55BGLSUHNL3QIMNYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX/action/storage_attestation","attest_author":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX/action/author_attestation","sign_citation":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX/action/citation_signature","submit_replication":"https://pith.science/pith/LRPHYFQAS55BGLSUHNL3QIMNYX/action/replication_record"}},"created_at":"2026-05-18T01:10:59.437713+00:00","updated_at":"2026-05-18T01:10:59.437713+00:00"}