{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2HKVJLF5VSARI65BOJE2IYBK4D","short_pith_number":"pith:2HKVJLF5","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"},"canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","source":{"kind":"arxiv","id":"1901.05917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05917","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05917v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05917","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HKVJLF5VSAR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2HKVJLF5VSARI65B","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2HKVJLF5","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2HKVJLF5VSARI65BOJE2IYBK4D","target":"record","payload":{"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"},"canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","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"},"source_kind":"arxiv","source_id":"1901.05917","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ao5BOfMyfziOv2N42q3uSHSgSo4JkJkc4sbfwosuSMJKm175W6azaxidHzf6IsDBjky6C7836rIFOy/ebLvcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:52:09.290151Z"},"content_sha256":"cc93ca42a3fd1c8024f77658f5f1e05869284600260fa896840245ffc49d7c12","schema_version":"1.0","event_id":"sha256:cc93ca42a3fd1c8024f77658f5f1e05869284600260fa896840245ffc49d7c12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2HKVJLF5VSARI65BOJE2IYBK4D","target":"graph","payload":{"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"},"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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcXZErk7ecPXLP4qAYzioL9QX+VDU4xqqZlY9Yn3jbJ3HlTqn9ggbvvsCj2cbs1pKI75qr5rai35m+J8yNs/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:52:09.290526Z"},"content_sha256":"7b9e488e702b4e090821221ccb251aa9f498b740ffa29baafeaea48d8bfe6241","schema_version":"1.0","event_id":"sha256:7b9e488e702b4e090821221ccb251aa9f498b740ffa29baafeaea48d8bfe6241"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/bundle.json","state_url":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HKVJLF5VSARI65BOJE2IYBK4D/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-20T06:52:09Z","links":{"resolver":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D","bundle":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/bundle.json","state":"https://pith.science/pith/2HKVJLF5VSARI65BOJE2IYBK4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HKVJLF5VSARI65BOJE2IYBK4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2HKVJLF5VSARI65BOJE2IYBK4D","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":"918102a926629b9ff134648774722194e03d20060225e4f9ce0d70cebf11458a","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T08:57:22Z","title_canon_sha256":"795828e3f8c92bc34f1d805fbb18e25f224dc088e86c0cb4bf3efbae570fb011"},"schema_version":"1.0","source":{"id":"1901.05917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05917","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05917v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05917","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HKVJLF5VSAR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2HKVJLF5VSARI65B","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2HKVJLF5","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:7b9e488e702b4e090821221ccb251aa9f498b740ffa29baafeaea48d8bfe6241","target":"graph","created_at":"2026-05-17T23:56:05Z","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":"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","authors_text":"Ahad N. Zehmakan","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T08:57:22Z","title":"Tight Bounds on the Minimum Size of a Dynamic Monopoly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05917","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:cc93ca42a3fd1c8024f77658f5f1e05869284600260fa896840245ffc49d7c12","target":"record","created_at":"2026-05-17T23:56:05Z","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":"918102a926629b9ff134648774722194e03d20060225e4f9ce0d70cebf11458a","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T08:57:22Z","title_canon_sha256":"795828e3f8c92bc34f1d805fbb18e25f224dc088e86c0cb4bf3efbae570fb011"},"schema_version":"1.0","source":{"id":"1901.05917","kind":"arxiv","version":1}},"canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d554acbdac81147ba17249a4602ae0c80276dba0515872c9a2b8a6744b6e7b","first_computed_at":"2026-05-17T23:56:05.809469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.809469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/zDNnXWWxWsbq55IlhrtwljAZfd2ielJxUqGAA9QCHQmYCO7D1z4YLeiiLuyDNMkARUHLo2g3kQ+uB+gJcDDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.810140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc93ca42a3fd1c8024f77658f5f1e05869284600260fa896840245ffc49d7c12","sha256:7b9e488e702b4e090821221ccb251aa9f498b740ffa29baafeaea48d8bfe6241"],"state_sha256":"588f0d48213d5f687ae607f755417f5daacd4a3a70706e6d0a72bbe35cd1b5c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+b4HVb1sMxg9q3xhfOJLCd/caHRhVsDN9eKiDIlZ0ISd4ohHjasYSHF9kxLWJtqUUzUB/n7zZo3RDzlawE1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:52:09.292433Z","bundle_sha256":"6fff7397fd2709e3a30b9e11e2cd6f9536ac16de7a01a3f6f671f4af9f3c19c9"}}