{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E3KEC3GO5PEXMOXBA6CWASMXUU","short_pith_number":"pith:E3KEC3GO","schema_version":"1.0","canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","source":{"kind":"arxiv","id":"1404.3033","version":5},"attestation_state":"computed","paper":{"title":"How to go Viral: Cheaply and Quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.SI","authors_text":"Ferdinando Cicalese, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Martin Milanic, Ugo Vaccaro","submitted_at":"2014-04-11T08:43:46Z","abstract_excerpt":"Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in $S$ are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve --- even in the approximate sense --- we p"},"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":"1404.3033","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-11T08:43:46Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"f2ad1d592a9666d4a0822d16d4137108b304b169cda68a37bea7d8df6e9830fe","abstract_canon_sha256":"5fc84e4da773c946e16c22f8dfecff56d9aca1bf7d07cbdeab25e6d5476a4304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.535358Z","signature_b64":"xkUNwiJUHLlo/m3xDtgK2s3HHGiDVO+d2n6/WOC7Bro57KRI0d8Pek+AGo2gPX3M87efNRUzZDbsWBf4dQUUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d4416cceebc9763ae10785604997a527773b5a6680a7120fa7580feab451eb","last_reissued_at":"2026-05-18T02:27:05.534939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.534939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to go Viral: Cheaply and Quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.SI","authors_text":"Ferdinando Cicalese, Gennaro Cordasco, Joseph Peters, Luisa Gargano, Martin Milanic, Ugo Vaccaro","submitted_at":"2014-04-11T08:43:46Z","abstract_excerpt":"Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in $S$ are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve --- even in the approximate sense --- we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3033","kind":"arxiv","version":5},"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":"1404.3033","created_at":"2026-05-18T02:27:05.535005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3033v5","created_at":"2026-05-18T02:27:05.535005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3033","created_at":"2026-05-18T02:27:05.535005+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3KEC3GO5PEX","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3KEC3GO5PEXMOXB","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3KEC3GO","created_at":"2026-05-18T12:28:25.294606+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/E3KEC3GO5PEXMOXBA6CWASMXUU","json":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU.json","graph_json":"https://pith.science/api/pith-number/E3KEC3GO5PEXMOXBA6CWASMXUU/graph.json","events_json":"https://pith.science/api/pith-number/E3KEC3GO5PEXMOXBA6CWASMXUU/events.json","paper":"https://pith.science/paper/E3KEC3GO"},"agent_actions":{"view_html":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU","download_json":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU.json","view_paper":"https://pith.science/paper/E3KEC3GO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3033&json=true","fetch_graph":"https://pith.science/api/pith-number/E3KEC3GO5PEXMOXBA6CWASMXUU/graph.json","fetch_events":"https://pith.science/api/pith-number/E3KEC3GO5PEXMOXBA6CWASMXUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/action/storage_attestation","attest_author":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/action/author_attestation","sign_citation":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/action/citation_signature","submit_replication":"https://pith.science/pith/E3KEC3GO5PEXMOXBA6CWASMXUU/action/replication_record"}},"created_at":"2026-05-18T02:27:05.535005+00:00","updated_at":"2026-05-18T02:27:05.535005+00:00"}