{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7DDTJ7AEVBACOFKWKASTKAPHDD","short_pith_number":"pith:7DDTJ7AE","schema_version":"1.0","canonical_sha256":"f8c734fc04a84027155650253501e718d5d6a8a6305117037eb6bd47dedd1b97","source":{"kind":"arxiv","id":"1303.6785","version":2},"attestation_state":"computed","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 "},"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":"1303.6785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T10:52:32Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"8b23f9a42ff41aba38ae2aea78eb412bcdef7e33f03c4e56507d59b16817e2fd","abstract_canon_sha256":"5653742b898ab348763ae174a60721373ff97ebe20d1cf6d6665d87f859b3b15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:05.261566Z","signature_b64":"cBLWLQ7pfYroHHmaMbIwgtNjg5OUb5qBVUD6NiKBPPqV+6oUVk9V2LBo8HGgs1MjHjXlu+85WIXzaM5qZLQpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c734fc04a84027155650253501e718d5d6a8a6305117037eb6bd47dedd1b97","last_reissued_at":"2026-05-18T02:54:05.261002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:05.261002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.6785","created_at":"2026-05-18T02:54:05.261090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6785v2","created_at":"2026-05-18T02:54:05.261090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6785","created_at":"2026-05-18T02:54:05.261090+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DDTJ7AEVBAC","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DDTJ7AEVBACOFKW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DDTJ7AE","created_at":"2026-05-18T12:27:36.564083+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/7DDTJ7AEVBACOFKWKASTKAPHDD","json":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD.json","graph_json":"https://pith.science/api/pith-number/7DDTJ7AEVBACOFKWKASTKAPHDD/graph.json","events_json":"https://pith.science/api/pith-number/7DDTJ7AEVBACOFKWKASTKAPHDD/events.json","paper":"https://pith.science/paper/7DDTJ7AE"},"agent_actions":{"view_html":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD","download_json":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD.json","view_paper":"https://pith.science/paper/7DDTJ7AE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6785&json=true","fetch_graph":"https://pith.science/api/pith-number/7DDTJ7AEVBACOFKWKASTKAPHDD/graph.json","fetch_events":"https://pith.science/api/pith-number/7DDTJ7AEVBACOFKWKASTKAPHDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD/action/storage_attestation","attest_author":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD/action/author_attestation","sign_citation":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD/action/citation_signature","submit_replication":"https://pith.science/pith/7DDTJ7AEVBACOFKWKASTKAPHDD/action/replication_record"}},"created_at":"2026-05-18T02:54:05.261090+00:00","updated_at":"2026-05-18T02:54:05.261090+00:00"}