{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2HKVJLF5VSARI65BOJE2IYBK4D","short_pith_number":"pith:2HKVJLF5","schema_version":"1.0","canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","source":{"kind":"arxiv","id":"1901.05917","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds on the Minimum Size of a Dynamic Monopoly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Ahad N. Zehmakan","submitted_at":"2018-12-28T08:57:22Z","abstract_excerpt":"Assume that you are given a graph $G=(V,E)$ with an initial coloring, where each node is black or white. Then, in discrete-time rounds all nodes simultaneously update their color following a predefined deterministic rule. This process is called two-way $r$-bootstrap percolation, for some integer $r$, if a node with at least $r$ black neighbors gets black and white otherwise. Similarly, in two-way $\\alpha$-bootstrap percolation, for some $0<\\alpha<1$, a node gets black if at least $\\alpha$ fraction of its neighbors are black, and white otherwise. The two aforementioned processes are called resp"},"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":"1901.05917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T08:57:22Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"795828e3f8c92bc34f1d805fbb18e25f224dc088e86c0cb4bf3efbae570fb011","abstract_canon_sha256":"918102a926629b9ff134648774722194e03d20060225e4f9ce0d70cebf11458a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.810140Z","signature_b64":"s/zDNnXWWxWsbq55IlhrtwljAZfd2ielJxUqGAA9QCHQmYCO7D1z4YLeiiLuyDNMkARUHLo2g3kQ+uB+gJcDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","last_reissued_at":"2026-05-17T23:56:05.809469Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.809469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds on the Minimum Size of a Dynamic Monopoly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Ahad N. Zehmakan","submitted_at":"2018-12-28T08:57:22Z","abstract_excerpt":"Assume that you are given a graph $G=(V,E)$ with an initial coloring, where each node is black or white. Then, in discrete-time rounds all nodes simultaneously update their color following a predefined deterministic rule. This process is called two-way $r$-bootstrap percolation, for some integer $r$, if a node with at least $r$ black neighbors gets black and white otherwise. Similarly, in two-way $\\alpha$-bootstrap percolation, for some $0<\\alpha<1$, a node gets black if at least $\\alpha$ fraction of its neighbors are black, and white otherwise. The two aforementioned processes are called resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05917","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":"1901.05917","created_at":"2026-05-17T23:56:05.809582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05917v1","created_at":"2026-05-17T23:56:05.809582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05917","created_at":"2026-05-17T23:56:05.809582+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HKVJLF5VSAR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HKVJLF5VSARI65B","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HKVJLF5","created_at":"2026-05-18T12:32:02.567920+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/2HKVJLF5VSARI65BOJE2IYBK4D","json":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D.json","graph_json":"https://pith.science/api/pith-number/2HKVJLF5VSARI65BOJE2IYBK4D/graph.json","events_json":"https://pith.science/api/pith-number/2HKVJLF5VSARI65BOJE2IYBK4D/events.json","paper":"https://pith.science/paper/2HKVJLF5"},"agent_actions":{"view_html":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D","download_json":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D.json","view_paper":"https://pith.science/paper/2HKVJLF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05917&json=true","fetch_graph":"https://pith.science/api/pith-number/2HKVJLF5VSARI65BOJE2IYBK4D/graph.json","fetch_events":"https://pith.science/api/pith-number/2HKVJLF5VSARI65BOJE2IYBK4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/action/storage_attestation","attest_author":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/action/author_attestation","sign_citation":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/action/citation_signature","submit_replication":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/action/replication_record"}},"created_at":"2026-05-17T23:56:05.809582+00:00","updated_at":"2026-05-17T23:56:05.809582+00:00"}