{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5ZM6XMH2ADBM44UHF7H7GEFBHK","short_pith_number":"pith:5ZM6XMH2","schema_version":"1.0","canonical_sha256":"ee59ebb0fa00c2ce72872fcff310a13a9d1ced935b2c1e7999085b655e27b813","source":{"kind":"arxiv","id":"1805.07392","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Monopolies in Reversible Bootstrap Percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ahad N. Zehmakan, Clemens Jeger","submitted_at":"2018-05-05T16:09:53Z","abstract_excerpt":"We study an extremal question for the (reversible) $r-$bootstrap percolation processes. Given a graph and an initial configuration where each vertex is active or inactive, in the $r-$bootstrap percolation process the following rule is applied in discrete-time rounds: each vertex gets active if it has at least $r$ active neighbors, and an active vertex stays active forever. In the reversible $r$-bootstrap percolation, each vertex gets active if it has at least $r$ active neighbors, and inactive otherwise. We consider the following question on the $d$-dimensional torus: how many vertices should "},"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":"1805.07392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T16:09:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9c14c9209b10435e60098e4d99b85f9ffc03b0ec45039289c7f0b3ba73e82bd7","abstract_canon_sha256":"48b3850fe66b01cb239fbec1ff4b5bf84807da44c68c93411b29c0e694a915d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:58.100648Z","signature_b64":"0Gxoafl3ghVQqi6hGwhH2BNASfTvPcF7/BD48VO+5Ah9/XVX38u5IRD2GxpZLktNcpqXriTHbIEk7Z+u8OIODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee59ebb0fa00c2ce72872fcff310a13a9d1ced935b2c1e7999085b655e27b813","last_reissued_at":"2026-05-17T23:45:58.099733Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:58.099733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Monopolies in Reversible Bootstrap Percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ahad N. Zehmakan, Clemens Jeger","submitted_at":"2018-05-05T16:09:53Z","abstract_excerpt":"We study an extremal question for the (reversible) $r-$bootstrap percolation processes. Given a graph and an initial configuration where each vertex is active or inactive, in the $r-$bootstrap percolation process the following rule is applied in discrete-time rounds: each vertex gets active if it has at least $r$ active neighbors, and an active vertex stays active forever. In the reversible $r$-bootstrap percolation, each vertex gets active if it has at least $r$ active neighbors, and inactive otherwise. We consider the following question on the $d$-dimensional torus: how many vertices should "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07392","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":"1805.07392","created_at":"2026-05-17T23:45:58.099865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07392v1","created_at":"2026-05-17T23:45:58.099865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07392","created_at":"2026-05-17T23:45:58.099865+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZM6XMH2ADBM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZM6XMH2ADBM44UH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZM6XMH2","created_at":"2026-05-18T12:32:08.215937+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/5ZM6XMH2ADBM44UHF7H7GEFBHK","json":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK.json","graph_json":"https://pith.science/api/pith-number/5ZM6XMH2ADBM44UHF7H7GEFBHK/graph.json","events_json":"https://pith.science/api/pith-number/5ZM6XMH2ADBM44UHF7H7GEFBHK/events.json","paper":"https://pith.science/paper/5ZM6XMH2"},"agent_actions":{"view_html":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK","download_json":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK.json","view_paper":"https://pith.science/paper/5ZM6XMH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07392&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZM6XMH2ADBM44UHF7H7GEFBHK/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZM6XMH2ADBM44UHF7H7GEFBHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK/action/storage_attestation","attest_author":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK/action/author_attestation","sign_citation":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK/action/citation_signature","submit_replication":"https://pith.science/pith/5ZM6XMH2ADBM44UHF7H7GEFBHK/action/replication_record"}},"created_at":"2026-05-17T23:45:58.099865+00:00","updated_at":"2026-05-17T23:45:58.099865+00:00"}