{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VHERE547IC5K523M4D7JGP5XPO","short_pith_number":"pith:VHERE547","schema_version":"1.0","canonical_sha256":"a9c912779f40baaeeb6ce0fe933fb77b9a7a63ca100a2ec2cc5e2bdb5ec457cf","source":{"kind":"arxiv","id":"1502.05599","version":2},"attestation_state":"computed","paper":{"title":"Spread of Influence in Weighted Networks under Time and Budget Constraints","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":"2015-02-15T09:19:11Z","abstract_excerpt":"Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible. The dynamic that governs 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. We prove that the problem is NP-hard, even in simple networks like complete graphs and trees."},"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":"1502.05599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-02-15T09:19:11Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"534ea7d7f78f94c7ef5a2fec188a59bec5bd486f0cb53bcb8c4508c148a2011e","abstract_canon_sha256":"7afdde72e5e9e75abae7bbf11791f9de7ac1e933e91e6d3fc6690ea85840539f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.993096Z","signature_b64":"th345gHscJkL34uWWrx0/e28G/TJW1QhEfAX7pZTJ4W4shpVkh5rqDnKET+aLMX+qJndlarsfkenW5jksbBqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9c912779f40baaeeb6ce0fe933fb77b9a7a63ca100a2ec2cc5e2bdb5ec457cf","last_reissued_at":"2026-05-18T02:26:44.992646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.992646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spread of Influence in Weighted Networks under Time and Budget Constraints","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":"2015-02-15T09:19:11Z","abstract_excerpt":"Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible. The dynamic that governs 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. We prove that the problem is NP-hard, even in simple networks like complete graphs and trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05599","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":"1502.05599","created_at":"2026-05-18T02:26:44.992718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05599v2","created_at":"2026-05-18T02:26:44.992718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05599","created_at":"2026-05-18T02:26:44.992718+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHERE547IC5K","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHERE547IC5K523M","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHERE547","created_at":"2026-05-18T12:29:44.643036+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/VHERE547IC5K523M4D7JGP5XPO","json":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO.json","graph_json":"https://pith.science/api/pith-number/VHERE547IC5K523M4D7JGP5XPO/graph.json","events_json":"https://pith.science/api/pith-number/VHERE547IC5K523M4D7JGP5XPO/events.json","paper":"https://pith.science/paper/VHERE547"},"agent_actions":{"view_html":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO","download_json":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO.json","view_paper":"https://pith.science/paper/VHERE547","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05599&json=true","fetch_graph":"https://pith.science/api/pith-number/VHERE547IC5K523M4D7JGP5XPO/graph.json","fetch_events":"https://pith.science/api/pith-number/VHERE547IC5K523M4D7JGP5XPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO/action/storage_attestation","attest_author":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO/action/author_attestation","sign_citation":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO/action/citation_signature","submit_replication":"https://pith.science/pith/VHERE547IC5K523M4D7JGP5XPO/action/replication_record"}},"created_at":"2026-05-18T02:26:44.992718+00:00","updated_at":"2026-05-18T02:26:44.992718+00:00"}