{"paper":{"title":"Latency-Bounded Target Set Selection in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"cs.DS","authors_text":"Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, M. Milanic, Ugo Vaccaro","submitted_at":"2013-03-27T10:52:32Z","abstract_excerpt":"Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario one is given a graph $G=(V,E)$, integer values $t(v)$ for each vertex $v$ (\\emph{thresholds}), and the objective is to determine a small set of vertices (\\emph{target set}) that activates a given number (or a given subset) of vertices of $G$ \\emph{within} a prescribed number of rounds. The activation process in $G$ proceeds as follows: initially, at round 0, all vertices in the target set are activated; subsequently "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6785","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"}