{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PWYN56RWMFEKHWX6EICG4PFVYL","short_pith_number":"pith:PWYN56RW","schema_version":"1.0","canonical_sha256":"7db0defa366148a3dafe22046e3cb5c2f3ed48adeffdad2bf96e2300d01a9e04","source":{"kind":"arxiv","id":"1705.10442","version":2},"attestation_state":"computed","paper":{"title":"Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jing Tang, Junsong Yuan, Xueyan Tang","submitted_at":"2017-05-30T03:04:16Z","abstract_excerpt":"Influence Maximization is an extensively-studied problem that targets at selecting a set of initial seed nodes in the Online Social Networks (OSNs) to spread the influence as widely as possible. However, it remains an open challenge to design fast and accurate algorithms to find solutions in large-scale OSNs. Prior Monte-Carlo-simulation-based methods are slow and not scalable, while other heuristic algorithms do not have any theoretical guarantee and they have been shown to produce poor solutions for quite some cases. In this paper, we propose hop-based algorithms that can easily scale to mil"},"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":"1705.10442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-30T03:04:16Z","cross_cats_sorted":[],"title_canon_sha256":"7eb8a7f7feb7485233022028e5798dba7cdf421bab75ba0a8bd41285c6183750","abstract_canon_sha256":"afebe623ed1ea8a53402a79279ad236c41c32fa72f781170afc717ce442db3d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.588776Z","signature_b64":"BXRKwlfTu2xr9kSohnyMyZokBbkwGTBPXzb7Y0Ia2Oo0nCZls1jQqbVdX05+jIh/XDU1z3V/mP8pBFPfvgn2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7db0defa366148a3dafe22046e3cb5c2f3ed48adeffdad2bf96e2300d01a9e04","last_reissued_at":"2026-05-18T00:38:35.588355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.588355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jing Tang, Junsong Yuan, Xueyan Tang","submitted_at":"2017-05-30T03:04:16Z","abstract_excerpt":"Influence Maximization is an extensively-studied problem that targets at selecting a set of initial seed nodes in the Online Social Networks (OSNs) to spread the influence as widely as possible. However, it remains an open challenge to design fast and accurate algorithms to find solutions in large-scale OSNs. Prior Monte-Carlo-simulation-based methods are slow and not scalable, while other heuristic algorithms do not have any theoretical guarantee and they have been shown to produce poor solutions for quite some cases. In this paper, we propose hop-based algorithms that can easily scale to mil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10442","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":"1705.10442","created_at":"2026-05-18T00:38:35.588419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10442v2","created_at":"2026-05-18T00:38:35.588419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10442","created_at":"2026-05-18T00:38:35.588419+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWYN56RWMFEK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWYN56RWMFEKHWX6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWYN56RW","created_at":"2026-05-18T12:31:37.085036+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/PWYN56RWMFEKHWX6EICG4PFVYL","json":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL.json","graph_json":"https://pith.science/api/pith-number/PWYN56RWMFEKHWX6EICG4PFVYL/graph.json","events_json":"https://pith.science/api/pith-number/PWYN56RWMFEKHWX6EICG4PFVYL/events.json","paper":"https://pith.science/paper/PWYN56RW"},"agent_actions":{"view_html":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL","download_json":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL.json","view_paper":"https://pith.science/paper/PWYN56RW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10442&json=true","fetch_graph":"https://pith.science/api/pith-number/PWYN56RWMFEKHWX6EICG4PFVYL/graph.json","fetch_events":"https://pith.science/api/pith-number/PWYN56RWMFEKHWX6EICG4PFVYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL/action/storage_attestation","attest_author":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL/action/author_attestation","sign_citation":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL/action/citation_signature","submit_replication":"https://pith.science/pith/PWYN56RWMFEKHWX6EICG4PFVYL/action/replication_record"}},"created_at":"2026-05-18T00:38:35.588419+00:00","updated_at":"2026-05-18T00:38:35.588419+00:00"}