{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WTMCPNWNCP3DHV3TFYB5ST3QN6","short_pith_number":"pith:WTMCPNWN","schema_version":"1.0","canonical_sha256":"b4d827b6cd13f633d7732e03d94f706f9bf35b2145726b1495f086d96272efb6","source":{"kind":"arxiv","id":"1703.00557","version":2},"attestation_state":"computed","paper":{"title":"Model-Independent Online Learning for Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Laks Lakshmanan, Mark Schmidt, Mohammad Ghavamzadeh, Sharan Vaswani, Zheng Wen","submitted_at":"2017-03-01T23:54:40Z","abstract_excerpt":"We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of \"seed\" users to expose the product to. While prior work assumes a known model of information diffusion, we propose a novel parametrization that not only makes our framework agnostic to the underlying diffusion model, but also statistically efficient to learn from data. We give a corresponding monotone, submodular surrogate function, and show that it is a good approximation to the original IM objective. We also consider the case "},"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":"1703.00557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T23:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"b08e886e654a9ab4a5808c1ca8ccbe87db9fc9b2efc0d0d72ffdc9fe880ea273","abstract_canon_sha256":"47b715dce657f942c77728a720a5264da0384f6803d10f611148bca589b3fe31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.620357Z","signature_b64":"KGC1eik6RK0eIeHs3yXc2Wi5h76dJXWK9tAYugC/wSXf+SYDEsifEgv5XYAIjAPzy/YOaEJTg+IGAD99trQqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d827b6cd13f633d7732e03d94f706f9bf35b2145726b1495f086d96272efb6","last_reissued_at":"2026-05-18T00:15:05.619877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.619877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Independent Online Learning for Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Laks Lakshmanan, Mark Schmidt, Mohammad Ghavamzadeh, Sharan Vaswani, Zheng Wen","submitted_at":"2017-03-01T23:54:40Z","abstract_excerpt":"We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of \"seed\" users to expose the product to. While prior work assumes a known model of information diffusion, we propose a novel parametrization that not only makes our framework agnostic to the underlying diffusion model, but also statistically efficient to learn from data. We give a corresponding monotone, submodular surrogate function, and show that it is a good approximation to the original IM objective. We also consider the case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00557","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":"1703.00557","created_at":"2026-05-18T00:15:05.619949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00557v2","created_at":"2026-05-18T00:15:05.619949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00557","created_at":"2026-05-18T00:15:05.619949+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTMCPNWNCP3D","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTMCPNWNCP3DHV3T","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTMCPNWN","created_at":"2026-05-18T12:31:53.515858+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/WTMCPNWNCP3DHV3TFYB5ST3QN6","json":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6.json","graph_json":"https://pith.science/api/pith-number/WTMCPNWNCP3DHV3TFYB5ST3QN6/graph.json","events_json":"https://pith.science/api/pith-number/WTMCPNWNCP3DHV3TFYB5ST3QN6/events.json","paper":"https://pith.science/paper/WTMCPNWN"},"agent_actions":{"view_html":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6","download_json":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6.json","view_paper":"https://pith.science/paper/WTMCPNWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00557&json=true","fetch_graph":"https://pith.science/api/pith-number/WTMCPNWNCP3DHV3TFYB5ST3QN6/graph.json","fetch_events":"https://pith.science/api/pith-number/WTMCPNWNCP3DHV3TFYB5ST3QN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6/action/storage_attestation","attest_author":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6/action/author_attestation","sign_citation":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6/action/citation_signature","submit_replication":"https://pith.science/pith/WTMCPNWNCP3DHV3TFYB5ST3QN6/action/replication_record"}},"created_at":"2026-05-18T00:15:05.619949+00:00","updated_at":"2026-05-18T00:15:05.619949+00:00"}