{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y72QTGCNTBBYBJLCGBZJEXFHJ3","short_pith_number":"pith:Y72QTGCN","canonical_record":{"source":{"id":"1801.08705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T08:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"37ededbb524d4c6e4a482ab622be4d83176415631c8c89b1a289f44c85632140","abstract_canon_sha256":"c5e250e52362372c57d4d89bb467fdb183a8a469e49f94baa16b54045f83dc49"},"schema_version":"1.0"},"canonical_sha256":"c7f509984d984380a5623072925ca74eec624cd443e04ed6a61f5c090b4918e6","source":{"kind":"arxiv","id":"1801.08705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08705","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08705v1","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08705","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y72QTGCNTBBY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y72QTGCNTBBYBJLC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y72QTGCN","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y72QTGCNTBBYBJLCGBZJEXFHJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T08:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"37ededbb524d4c6e4a482ab622be4d83176415631c8c89b1a289f44c85632140","abstract_canon_sha256":"c5e250e52362372c57d4d89bb467fdb183a8a469e49f94baa16b54045f83dc49"},"schema_version":"1.0"},"canonical_sha256":"c7f509984d984380a5623072925ca74eec624cd443e04ed6a61f5c090b4918e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:03.216555Z","signature_b64":"5rCwUnQePbOMfyZVZpLRgGpljzmmCGOLP7uM7isI7Syhn6sVYGQ/ln6qtiqFLElL8uAG62q6MKga3BEkztwNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7f509984d984380a5623072925ca74eec624cd443e04ed6a61f5c090b4918e6","last_reissued_at":"2026-05-18T00:25:03.215890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:03.215890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08705","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJQHk64ErYN4Ad2l9QW38LvE7p/i5d02iblIn5qjV9My6fUNkNBsYA0n/SpihYXt9VXWNbseDutz7xiKjHtpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:16:48.334470Z"},"content_sha256":"cbde286ddade4d6891b0a0af33322e6deca6bf511a9ebc32102cb9adc922105c","schema_version":"1.0","event_id":"sha256:cbde286ddade4d6891b0a0af33322e6deca6bf511a9ebc32102cb9adc922105c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y72QTGCNTBBYBJLCGBZJEXFHJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vaccinate your trees!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Stefan Ehard","submitted_at":"2018-01-26T08:14:25Z","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 two vaccination problems, where the goal is to maximize the minimum order of such a dynamic monopoly either by increasing the threshold value of $b$ vertices beyond their degree, or by removing $b$ vertices from $G$, where $b$ is a given non-negative integer corresponding to a budget. We show how to solve these problems efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08705","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQVjUM5A8iTw9aZCtnVOdZ7w/mTVNwtSY7voyihYzBOTi901fQadwCaP37tCkFK8KPdRxa7uvZtzsHV38BAHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:16:48.335259Z"},"content_sha256":"b6b1e13bc49bf5e75226fbc917d6d3520ee73ee9ed1210510ad414748279cef5","schema_version":"1.0","event_id":"sha256:b6b1e13bc49bf5e75226fbc917d6d3520ee73ee9ed1210510ad414748279cef5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/bundle.json","state_url":"https://pith.science/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T11:16:48Z","links":{"resolver":"https://pith.science/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3","bundle":"https://pith.science/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/bundle.json","state":"https://pith.science/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y72QTGCNTBBYBJLCGBZJEXFHJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y72QTGCNTBBYBJLCGBZJEXFHJ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c5e250e52362372c57d4d89bb467fdb183a8a469e49f94baa16b54045f83dc49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T08:14:25Z","title_canon_sha256":"37ededbb524d4c6e4a482ab622be4d83176415631c8c89b1a289f44c85632140"},"schema_version":"1.0","source":{"id":"1801.08705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08705","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08705v1","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08705","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y72QTGCNTBBY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y72QTGCNTBBYBJLC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y72QTGCN","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b6b1e13bc49bf5e75226fbc917d6d3520ee73ee9ed1210510ad414748279cef5","target":"graph","created_at":"2026-05-18T00:25:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 two vaccination problems, where the goal is to maximize the minimum order of such a dynamic monopoly either by increasing the threshold value of $b$ vertices beyond their degree, or by removing $b$ vertices from $G$, where $b$ is a given non-negative integer corresponding to a budget. We show how to solve these problems efficien","authors_text":"Dieter Rautenbach, Stefan Ehard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T08:14:25Z","title":"Vaccinate your trees!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08705","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cbde286ddade4d6891b0a0af33322e6deca6bf511a9ebc32102cb9adc922105c","target":"record","created_at":"2026-05-18T00:25:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c5e250e52362372c57d4d89bb467fdb183a8a469e49f94baa16b54045f83dc49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T08:14:25Z","title_canon_sha256":"37ededbb524d4c6e4a482ab622be4d83176415631c8c89b1a289f44c85632140"},"schema_version":"1.0","source":{"id":"1801.08705","kind":"arxiv","version":1}},"canonical_sha256":"c7f509984d984380a5623072925ca74eec624cd443e04ed6a61f5c090b4918e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7f509984d984380a5623072925ca74eec624cd443e04ed6a61f5c090b4918e6","first_computed_at":"2026-05-18T00:25:03.215890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:03.215890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rCwUnQePbOMfyZVZpLRgGpljzmmCGOLP7uM7isI7Syhn6sVYGQ/ln6qtiqFLElL8uAG62q6MKga3BEkztwNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:03.216555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbde286ddade4d6891b0a0af33322e6deca6bf511a9ebc32102cb9adc922105c","sha256:b6b1e13bc49bf5e75226fbc917d6d3520ee73ee9ed1210510ad414748279cef5"],"state_sha256":"4e7f9823adf444f71ef1eccc65c4c9398727b30a30eaa508dc78ecb06c9d7733"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pf/7TGjAGcz0GrnFjTIrbqsMzjb6WAgO/jzSdic+NGwFHjO6ieIm3gEE/94UOOKBR8PCLj1D1qaKqnW9JQuPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:16:48.339455Z","bundle_sha256":"6b236421115289e239060c37d801afd8fb95c7dc73d9f581befacb2e1fe62993"}}