{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IX3X6XYA7Y3QHPL45Z5U7GOGCE","short_pith_number":"pith:IX3X6XYA","schema_version":"1.0","canonical_sha256":"45f77f5f00fe3703bd7cee7b4f99c6112282fa50c39dccc1bcecbaf9a2695ae6","source":{"kind":"arxiv","id":"1603.08273","version":1},"attestation_state":"computed","paper":{"title":"Collective Influence Algorithm to find influencers via optimal percolation in massively large social media","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Byungjoon Min, Flaviano Morone, Hernan A. Makse, Lin Bo, Romain Mari","submitted_at":"2016-03-28T00:44:51Z","abstract_excerpt":"We elaborate on a linear time implementation of the Collective Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in a network via optimal percolation. We show that the computational complexity of CI is O(N log N) when removing nodes one-by-one, with N the number of nodes. This is made possible by using an appropriate data structure to process the CI values, and by the finite radius l of the CI sphere. Furthermore, we introduce a simple extension of CI when l is infinite, the CI propagation (CI_P) algorithm, that considers the glo"},"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":"1603.08273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-03-28T00:44:51Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"764f95db1db661479e04a5d00940ed25a18505752d1a6c72f240ae3f26b12838","abstract_canon_sha256":"bba8b614aba47a70e567d08af620adacadb40ce16c293319b7dc55a824387f0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:12.668397Z","signature_b64":"grUe1QgwatoRnmDi0r8wnfLKetoupM5pzDPUGIF3+Ako1V07EM4uD0FIpONBKp2wsCD7dew488AfF8hv9PmeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f77f5f00fe3703bd7cee7b4f99c6112282fa50c39dccc1bcecbaf9a2695ae6","last_reissued_at":"2026-05-18T01:18:12.667816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:12.667816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collective Influence Algorithm to find influencers via optimal percolation in massively large social media","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Byungjoon Min, Flaviano Morone, Hernan A. Makse, Lin Bo, Romain Mari","submitted_at":"2016-03-28T00:44:51Z","abstract_excerpt":"We elaborate on a linear time implementation of the Collective Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in a network via optimal percolation. We show that the computational complexity of CI is O(N log N) when removing nodes one-by-one, with N the number of nodes. This is made possible by using an appropriate data structure to process the CI values, and by the finite radius l of the CI sphere. Furthermore, we introduce a simple extension of CI when l is infinite, the CI propagation (CI_P) algorithm, that considers the glo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08273","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":"1603.08273","created_at":"2026-05-18T01:18:12.667908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08273v1","created_at":"2026-05-18T01:18:12.667908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08273","created_at":"2026-05-18T01:18:12.667908+00:00"},{"alias_kind":"pith_short_12","alias_value":"IX3X6XYA7Y3Q","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IX3X6XYA7Y3QHPL4","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IX3X6XYA","created_at":"2026-05-18T12:30:22.444734+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/IX3X6XYA7Y3QHPL45Z5U7GOGCE","json":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE.json","graph_json":"https://pith.science/api/pith-number/IX3X6XYA7Y3QHPL45Z5U7GOGCE/graph.json","events_json":"https://pith.science/api/pith-number/IX3X6XYA7Y3QHPL45Z5U7GOGCE/events.json","paper":"https://pith.science/paper/IX3X6XYA"},"agent_actions":{"view_html":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE","download_json":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE.json","view_paper":"https://pith.science/paper/IX3X6XYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08273&json=true","fetch_graph":"https://pith.science/api/pith-number/IX3X6XYA7Y3QHPL45Z5U7GOGCE/graph.json","fetch_events":"https://pith.science/api/pith-number/IX3X6XYA7Y3QHPL45Z5U7GOGCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE/action/storage_attestation","attest_author":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE/action/author_attestation","sign_citation":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE/action/citation_signature","submit_replication":"https://pith.science/pith/IX3X6XYA7Y3QHPL45Z5U7GOGCE/action/replication_record"}},"created_at":"2026-05-18T01:18:12.667908+00:00","updated_at":"2026-05-18T01:18:12.667908+00:00"}