{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q7OZUZWS4FAQLNTIR2O5BSFUU5","short_pith_number":"pith:Q7OZUZWS","schema_version":"1.0","canonical_sha256":"87dd9a66d2e14105b6688e9dd0c8b4a779caea4a5c3ef96d3bb4b15efb035b9b","source":{"kind":"arxiv","id":"1710.02141","version":3},"attestation_state":"computed","paper":{"title":"Fast Budgeted Influence Maximization over Multi-Action Event Logs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hang Li, Qilian Yu, Shuguang Cui, Yun Liao","submitted_at":"2017-10-05T05:59:48Z","abstract_excerpt":"In a social network, influence maximization is the problem of identifying a set of users that own the maximum {\\it influence ability} across the network. In this paper, a novel credit distribution (CD) based model, termed as the multi-action CD (mCD) model, is introduced to quantify the influence ability of each user, which works with practical datasets where one type of action could be recorded for multiple times. Based on this model, influence maximization is formulated as a submodular maximization problem under a general knapsack constraint, which is NP-hard. An efficient streaming algorith"},"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":"1710.02141","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-05T05:59:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"224ad324bf3f4d2dfef305fdf00c108782dcf6d11245332a917e33f029002f17","abstract_canon_sha256":"5935e06e98648034567f036d9860ef58bcdd468c2af621b1471bb39f73513c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:03.874268Z","signature_b64":"LtJNejPdZx77eVA5Z9rriuysTGWLOje0i2ECVOwu0nHrmYklFZ7yG2oIdQXItvn8cZcFDg056kE++jGPeK3RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87dd9a66d2e14105b6688e9dd0c8b4a779caea4a5c3ef96d3bb4b15efb035b9b","last_reissued_at":"2026-05-18T00:25:03.873825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:03.873825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Budgeted Influence Maximization over Multi-Action Event Logs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hang Li, Qilian Yu, Shuguang Cui, Yun Liao","submitted_at":"2017-10-05T05:59:48Z","abstract_excerpt":"In a social network, influence maximization is the problem of identifying a set of users that own the maximum {\\it influence ability} across the network. In this paper, a novel credit distribution (CD) based model, termed as the multi-action CD (mCD) model, is introduced to quantify the influence ability of each user, which works with practical datasets where one type of action could be recorded for multiple times. Based on this model, influence maximization is formulated as a submodular maximization problem under a general knapsack constraint, which is NP-hard. An efficient streaming algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02141","kind":"arxiv","version":3},"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":"1710.02141","created_at":"2026-05-18T00:25:03.873902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02141v3","created_at":"2026-05-18T00:25:03.873902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02141","created_at":"2026-05-18T00:25:03.873902+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7OZUZWS4FAQ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7OZUZWS4FAQLNTI","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7OZUZWS","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/Q7OZUZWS4FAQLNTIR2O5BSFUU5","json":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5.json","graph_json":"https://pith.science/api/pith-number/Q7OZUZWS4FAQLNTIR2O5BSFUU5/graph.json","events_json":"https://pith.science/api/pith-number/Q7OZUZWS4FAQLNTIR2O5BSFUU5/events.json","paper":"https://pith.science/paper/Q7OZUZWS"},"agent_actions":{"view_html":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5","download_json":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5.json","view_paper":"https://pith.science/paper/Q7OZUZWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02141&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7OZUZWS4FAQLNTIR2O5BSFUU5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7OZUZWS4FAQLNTIR2O5BSFUU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5/action/storage_attestation","attest_author":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5/action/author_attestation","sign_citation":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5/action/citation_signature","submit_replication":"https://pith.science/pith/Q7OZUZWS4FAQLNTIR2O5BSFUU5/action/replication_record"}},"created_at":"2026-05-18T00:25:03.873902+00:00","updated_at":"2026-05-18T00:25:03.873902+00:00"}