{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NSTPOG3UB4A6IVF72OUDZNRSTR","short_pith_number":"pith:NSTPOG3U","schema_version":"1.0","canonical_sha256":"6ca6f71b740f01e454bfd3a83cb6329c45918c24256ad8e119c6bd162167033f","source":{"kind":"arxiv","id":"1009.3619","version":1},"attestation_state":"computed","paper":{"title":"Influence is a Matter of Degree: New Algorithms for Activation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Reichman","submitted_at":"2010-09-19T08:30:24Z","abstract_excerpt":"We consider the target set selection problem. In this problem, a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $k$ active neighbors ($k$ is identical for all vertices of the graph). Our goal is to find a set of minimum size whose activation will result with the entire graph being activated. Call such a set \\emph{contagious}. We prove that if $G=(V,E)$ is an undirected graph, the size of a contagious set is bounded by $\\sum_{v\\in V}{\\min \\{1,\\frac{k}{d(v)+1}\\}}$ (where $d(v)$ is the degree of $v$). We present a simple and effi"},"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":"1009.3619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-19T08:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"88e1056dd7f9b7394b42845e412b12d3cee9da070e877f202b4f6832471a4bf7","abstract_canon_sha256":"7e3a0ff061a513755726bd5e757a6e6dacd5846d37ab6ebf3ed41e9b9afef480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:44.394468Z","signature_b64":"mpmgHxaZkM33iqh6GkwHOW6Fo4HSp/3j1YOIe8+hVq/oFRttcmd6JgobWtt6Y/9huQ373QhUlYs+sotClciMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca6f71b740f01e454bfd3a83cb6329c45918c24256ad8e119c6bd162167033f","last_reissued_at":"2026-05-18T04:40:44.393761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:44.393761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence is a Matter of Degree: New Algorithms for Activation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Reichman","submitted_at":"2010-09-19T08:30:24Z","abstract_excerpt":"We consider the target set selection problem. In this problem, a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $k$ active neighbors ($k$ is identical for all vertices of the graph). Our goal is to find a set of minimum size whose activation will result with the entire graph being activated. Call such a set \\emph{contagious}. We prove that if $G=(V,E)$ is an undirected graph, the size of a contagious set is bounded by $\\sum_{v\\in V}{\\min \\{1,\\frac{k}{d(v)+1}\\}}$ (where $d(v)$ is the degree of $v$). We present a simple and effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3619","kind":"arxiv","version":1},"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":"1009.3619","created_at":"2026-05-18T04:40:44.393887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3619v1","created_at":"2026-05-18T04:40:44.393887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3619","created_at":"2026-05-18T04:40:44.393887+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSTPOG3UB4A6","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSTPOG3UB4A6IVF7","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSTPOG3U","created_at":"2026-05-18T12:26:10.704358+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/NSTPOG3UB4A6IVF72OUDZNRSTR","json":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR.json","graph_json":"https://pith.science/api/pith-number/NSTPOG3UB4A6IVF72OUDZNRSTR/graph.json","events_json":"https://pith.science/api/pith-number/NSTPOG3UB4A6IVF72OUDZNRSTR/events.json","paper":"https://pith.science/paper/NSTPOG3U"},"agent_actions":{"view_html":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR","download_json":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR.json","view_paper":"https://pith.science/paper/NSTPOG3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3619&json=true","fetch_graph":"https://pith.science/api/pith-number/NSTPOG3UB4A6IVF72OUDZNRSTR/graph.json","fetch_events":"https://pith.science/api/pith-number/NSTPOG3UB4A6IVF72OUDZNRSTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR/action/storage_attestation","attest_author":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR/action/author_attestation","sign_citation":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR/action/citation_signature","submit_replication":"https://pith.science/pith/NSTPOG3UB4A6IVF72OUDZNRSTR/action/replication_record"}},"created_at":"2026-05-18T04:40:44.393887+00:00","updated_at":"2026-05-18T04:40:44.393887+00:00"}