{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KGDSSJ25PENIVE7ANMCVH77Q44","short_pith_number":"pith:KGDSSJ25","schema_version":"1.0","canonical_sha256":"518729275d791a8a93e06b0553fff0e704e344ee70111a980ca2c97e83a24f06","source":{"kind":"arxiv","id":"1701.08462","version":3},"attestation_state":"computed","paper":{"title":"TipTop: (Almost) Exact Solutions for Influence Maximization in Billion-scale Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"J. David Smith, My T. Thai, Thang N. Dinh, Xiang Li","submitted_at":"2017-01-30T02:49:40Z","abstract_excerpt":"In this paper, we study the Cost-aware Target Viral Marketing (CTVM) problem, a generalization of Influence Maximization (IM). CTVM asks for the most cost-effective users to influence the most relevant users. In contrast to the vast literature, we attempt to offer exact solutions. As the problem is NP-hard, thus, exact solutions are intractable, we propose TipTop, a $(1-\\epsilon)$-optimal solution for arbitrary $\\epsilon>0$ that scales to very large networks such as Twitter. At the heart of TipTop lies an innovative technique that reduces the number of samples as much as possible. This allows "},"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":"1701.08462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T02:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"9ef5d68779477e65cf07ab52657332b75cbd71b4342989727fd08d91b6e8a655","abstract_canon_sha256":"e5b3197c7d85f0619c860c10b062f8946134003417a74c793e414e4ca1699643"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:36.916434Z","signature_b64":"cSCjfOWlYCg/xVv/nMU35TsnTDilpfAeUU/TxJGA9Vp5biiD2H4VudXS7i0iYqJb1rdLHKkpPGJUU51xj2hQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"518729275d791a8a93e06b0553fff0e704e344ee70111a980ca2c97e83a24f06","last_reissued_at":"2026-05-17T23:54:36.915748Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:36.915748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TipTop: (Almost) Exact Solutions for Influence Maximization in Billion-scale Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"J. David Smith, My T. Thai, Thang N. Dinh, Xiang Li","submitted_at":"2017-01-30T02:49:40Z","abstract_excerpt":"In this paper, we study the Cost-aware Target Viral Marketing (CTVM) problem, a generalization of Influence Maximization (IM). CTVM asks for the most cost-effective users to influence the most relevant users. In contrast to the vast literature, we attempt to offer exact solutions. As the problem is NP-hard, thus, exact solutions are intractable, we propose TipTop, a $(1-\\epsilon)$-optimal solution for arbitrary $\\epsilon>0$ that scales to very large networks such as Twitter. At the heart of TipTop lies an innovative technique that reduces the number of samples as much as possible. This allows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08462","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":"1701.08462","created_at":"2026-05-17T23:54:36.915861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08462v3","created_at":"2026-05-17T23:54:36.915861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08462","created_at":"2026-05-17T23:54:36.915861+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGDSSJ25PENI","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGDSSJ25PENIVE7A","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGDSSJ25","created_at":"2026-05-18T12:31:24.725408+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/KGDSSJ25PENIVE7ANMCVH77Q44","json":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44.json","graph_json":"https://pith.science/api/pith-number/KGDSSJ25PENIVE7ANMCVH77Q44/graph.json","events_json":"https://pith.science/api/pith-number/KGDSSJ25PENIVE7ANMCVH77Q44/events.json","paper":"https://pith.science/paper/KGDSSJ25"},"agent_actions":{"view_html":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44","download_json":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44.json","view_paper":"https://pith.science/paper/KGDSSJ25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08462&json=true","fetch_graph":"https://pith.science/api/pith-number/KGDSSJ25PENIVE7ANMCVH77Q44/graph.json","fetch_events":"https://pith.science/api/pith-number/KGDSSJ25PENIVE7ANMCVH77Q44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44/action/storage_attestation","attest_author":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44/action/author_attestation","sign_citation":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44/action/citation_signature","submit_replication":"https://pith.science/pith/KGDSSJ25PENIVE7ANMCVH77Q44/action/replication_record"}},"created_at":"2026-05-17T23:54:36.915861+00:00","updated_at":"2026-05-17T23:54:36.915861+00:00"}