{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I4CDDGNV4KSRQWEUEINLKRLIVE","short_pith_number":"pith:I4CDDGNV","schema_version":"1.0","canonical_sha256":"47043199b5e2a5185894221ab54568a90aac412cbb0620fd3b2aa7ba98ae0de9","source":{"kind":"arxiv","id":"1312.2164","version":2},"attestation_state":"computed","paper":{"title":"Budgeted Influence Maximization for Multiple Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Le Song, Maria Florina Balcan, Nan Du, Yingyu Liang","submitted_at":"2013-12-08T01:58:39Z","abstract_excerpt":"The typical algorithmic problem in viral marketing aims to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network and trigger a large cascade of adoptions. However, the host (the owner of an online social platform) often faces more constraints than a single product, endless user attentions, unlimited budget and unbounded time; in reality, multiple products need to be advertised, each user can tolerate only a small number of recommendations, influencing user has a cost and advertisers have only limited budgets,"},"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":"1312.2164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-08T01:58:39Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"9a0fe43e234c8003a66f448eb3eedd6d7b351fad206348e5031d2309151dd933","abstract_canon_sha256":"368a7e472cb9385b8f9c02b349025705b320d26fbeb1e6118c20481570b5d321"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:06.935881Z","signature_b64":"yPQDpL3Phzlk6if55B09FUcr2x2K2CDMvqATy/vR+HEuJjBNPZBmht+2l5AcGOzppNfXGGcwJE9RsdtV4MeBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47043199b5e2a5185894221ab54568a90aac412cbb0620fd3b2aa7ba98ae0de9","last_reissued_at":"2026-05-18T02:54:06.935344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:06.935344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budgeted Influence Maximization for Multiple Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Le Song, Maria Florina Balcan, Nan Du, Yingyu Liang","submitted_at":"2013-12-08T01:58:39Z","abstract_excerpt":"The typical algorithmic problem in viral marketing aims to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network and trigger a large cascade of adoptions. However, the host (the owner of an online social platform) often faces more constraints than a single product, endless user attentions, unlimited budget and unbounded time; in reality, multiple products need to be advertised, each user can tolerate only a small number of recommendations, influencing user has a cost and advertisers have only limited budgets,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2164","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":"1312.2164","created_at":"2026-05-18T02:54:06.935431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2164v2","created_at":"2026-05-18T02:54:06.935431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2164","created_at":"2026-05-18T02:54:06.935431+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4CDDGNV4KSR","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4CDDGNV4KSRQWEU","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4CDDGNV","created_at":"2026-05-18T12:27:46.883200+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/I4CDDGNV4KSRQWEUEINLKRLIVE","json":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE.json","graph_json":"https://pith.science/api/pith-number/I4CDDGNV4KSRQWEUEINLKRLIVE/graph.json","events_json":"https://pith.science/api/pith-number/I4CDDGNV4KSRQWEUEINLKRLIVE/events.json","paper":"https://pith.science/paper/I4CDDGNV"},"agent_actions":{"view_html":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE","download_json":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE.json","view_paper":"https://pith.science/paper/I4CDDGNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2164&json=true","fetch_graph":"https://pith.science/api/pith-number/I4CDDGNV4KSRQWEUEINLKRLIVE/graph.json","fetch_events":"https://pith.science/api/pith-number/I4CDDGNV4KSRQWEUEINLKRLIVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE/action/storage_attestation","attest_author":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE/action/author_attestation","sign_citation":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE/action/citation_signature","submit_replication":"https://pith.science/pith/I4CDDGNV4KSRQWEUEINLKRLIVE/action/replication_record"}},"created_at":"2026-05-18T02:54:06.935431+00:00","updated_at":"2026-05-18T02:54:06.935431+00:00"}