{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2EOJ7O4CS3VVVTXDLNJZCCW35U","short_pith_number":"pith:2EOJ7O4C","schema_version":"1.0","canonical_sha256":"d11c9fbb8296eb5acee35b53910adbed3e835ae7fa4c02e3772bb0fe87b78921","source":{"kind":"arxiv","id":"1802.03754","version":1},"attestation_state":"computed","paper":{"title":"Partial immunization of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Lucia D. Penso, Mitre C. Dourado, Stefan Ehard","submitted_at":"2018-02-11T15:47:42Z","abstract_excerpt":"For a graph $G$ and an integer-valued function $\\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the vertex set of $G$. We study the problem of maximizing the minimum order of a dynamic monopoly by increasing the threshold values of individual vertices subject to vertex-dependent lower and upper bounds, and fixing the total increase. We solve this problem efficiently for trees, which extends a result of Khoshkhah and Zaker (On the largest dynamic monopoli"},"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":"1802.03754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-11T15:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"8e231312569cee4d9296aa6161e065deadfb0e46524e1fd708687737d2e9ea9d","abstract_canon_sha256":"f58e9c81f0764dc83504fd09756686331a9d44e8c418d3973f0bf0976d92e89b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:50.559622Z","signature_b64":"2dEsR2zgh08auI+v2friRlw/Pv7hKxHdvKnNP+qzXB3jfT8RqZcPy1XcTPRDS6DY7w5qwOSKoa6h4+wHFR05CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11c9fbb8296eb5acee35b53910adbed3e835ae7fa4c02e3772bb0fe87b78921","last_reissued_at":"2026-05-18T00:23:50.558958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:50.558958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial immunization of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Lucia D. Penso, Mitre C. Dourado, Stefan Ehard","submitted_at":"2018-02-11T15:47:42Z","abstract_excerpt":"For a graph $G$ and an integer-valued function $\\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the vertex set of $G$. We study the problem of maximizing the minimum order of a dynamic monopoly by increasing the threshold values of individual vertices subject to vertex-dependent lower and upper bounds, and fixing the total increase. We solve this problem efficiently for trees, which extends a result of Khoshkhah and Zaker (On the largest dynamic monopoli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03754","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":"1802.03754","created_at":"2026-05-18T00:23:50.559060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03754v1","created_at":"2026-05-18T00:23:50.559060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03754","created_at":"2026-05-18T00:23:50.559060+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EOJ7O4CS3VV","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EOJ7O4CS3VVVTXD","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EOJ7O4C","created_at":"2026-05-18T12:31:59.375834+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/2EOJ7O4CS3VVVTXDLNJZCCW35U","json":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U.json","graph_json":"https://pith.science/api/pith-number/2EOJ7O4CS3VVVTXDLNJZCCW35U/graph.json","events_json":"https://pith.science/api/pith-number/2EOJ7O4CS3VVVTXDLNJZCCW35U/events.json","paper":"https://pith.science/paper/2EOJ7O4C"},"agent_actions":{"view_html":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U","download_json":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U.json","view_paper":"https://pith.science/paper/2EOJ7O4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03754&json=true","fetch_graph":"https://pith.science/api/pith-number/2EOJ7O4CS3VVVTXDLNJZCCW35U/graph.json","fetch_events":"https://pith.science/api/pith-number/2EOJ7O4CS3VVVTXDLNJZCCW35U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U/action/storage_attestation","attest_author":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U/action/author_attestation","sign_citation":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U/action/citation_signature","submit_replication":"https://pith.science/pith/2EOJ7O4CS3VVVTXDLNJZCCW35U/action/replication_record"}},"created_at":"2026-05-18T00:23:50.559060+00:00","updated_at":"2026-05-18T00:23:50.559060+00:00"}