{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZQFRIIJUDCZGW3AVBTDP653G5K","short_pith_number":"pith:ZQFRIIJU","schema_version":"1.0","canonical_sha256":"cc0b14213418b26b6c150cc6ff7766ea983e67948403409b7f3b280822c4d464","source":{"kind":"arxiv","id":"1008.2005","version":4},"attestation_state":"computed","paper":{"title":"Approximation Analysis of Influence Spread in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DM","authors_text":"Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan, Suresh Venkatasubramanian","submitted_at":"2010-08-11T20:35:56Z","abstract_excerpt":"In the context of influence propagation in a social graph, we can identify three orthogonal dimensions - the number of seed nodes activated at the beginning (known as budget), the expected number of activated nodes at the end of the propagation (known as expected spread or coverage), and the time taken for the propagation. We can constrain one or two of these and try to optimize the third. In their seminal paper, Kempe et al. constrained the budget, left time unconstrained, and maximized the coverage: this problem is known as Influence Maximization.\n  In this paper, we study alternative optimi"},"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":"1008.2005","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-11T20:35:56Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"53d0da99c2ce6a1e01629eaf5e49073ee071d5823e7184cc0ec798f3a0c2c374","abstract_canon_sha256":"f00bb6a473c3c1c615a9d7ecba758bac2e251540a32e52e16862b4c16f3c3dc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.075980Z","signature_b64":"rOekvfO39hTMC2bThrJuekm8q6Yk/qRnKjm7yE9vIwvNcHR85/sVxA2td9tPKQ36UPYyzYeMusEA/1aFmvvaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0b14213418b26b6c150cc6ff7766ea983e67948403409b7f3b280822c4d464","last_reissued_at":"2026-05-18T04:09:35.075543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.075543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Analysis of Influence Spread in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DM","authors_text":"Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan, Suresh Venkatasubramanian","submitted_at":"2010-08-11T20:35:56Z","abstract_excerpt":"In the context of influence propagation in a social graph, we can identify three orthogonal dimensions - the number of seed nodes activated at the beginning (known as budget), the expected number of activated nodes at the end of the propagation (known as expected spread or coverage), and the time taken for the propagation. We can constrain one or two of these and try to optimize the third. In their seminal paper, Kempe et al. constrained the budget, left time unconstrained, and maximized the coverage: this problem is known as Influence Maximization.\n  In this paper, we study alternative optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2005","kind":"arxiv","version":4},"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":"1008.2005","created_at":"2026-05-18T04:09:35.075608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2005v4","created_at":"2026-05-18T04:09:35.075608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2005","created_at":"2026-05-18T04:09:35.075608+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQFRIIJUDCZG","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQFRIIJUDCZGW3AV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQFRIIJU","created_at":"2026-05-18T12:26:18.847500+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/ZQFRIIJUDCZGW3AVBTDP653G5K","json":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K.json","graph_json":"https://pith.science/api/pith-number/ZQFRIIJUDCZGW3AVBTDP653G5K/graph.json","events_json":"https://pith.science/api/pith-number/ZQFRIIJUDCZGW3AVBTDP653G5K/events.json","paper":"https://pith.science/paper/ZQFRIIJU"},"agent_actions":{"view_html":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K","download_json":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K.json","view_paper":"https://pith.science/paper/ZQFRIIJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2005&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQFRIIJUDCZGW3AVBTDP653G5K/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQFRIIJUDCZGW3AVBTDP653G5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K/action/storage_attestation","attest_author":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K/action/author_attestation","sign_citation":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K/action/citation_signature","submit_replication":"https://pith.science/pith/ZQFRIIJUDCZGW3AVBTDP653G5K/action/replication_record"}},"created_at":"2026-05-18T04:09:35.075608+00:00","updated_at":"2026-05-18T04:09:35.075608+00:00"}