{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5C2UIMXK6FA3RRUUEHRR63BIMD","short_pith_number":"pith:5C2UIMXK","schema_version":"1.0","canonical_sha256":"e8b54432eaf141b8c69421e31f6c2860f8f7334efef51008462eed8294b8ba2f","source":{"kind":"arxiv","id":"1107.1381","version":2},"attestation_state":"computed","paper":{"title":"Graph bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, J\\'ozsef Balogh, Robert Morris","submitted_at":"2011-07-07T13:44:52Z","abstract_excerpt":"Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollob\\'as in 1968, and is defined as follows. Given a graph $H$, and a set $G \\subset E(K_n)$ of initially `infected' edges, we infect, at each time step, a new edge $e$ if there is a copy of $H$ in $K_n$ such that $e$ is the only not-yet infected edge of $H$. We say that $G$ percolates in the $H$-bootstrap process if eventually every edge of $K_n$ is infected. The extremal questions for this model, when $H$ is the complete graph $K_r$, were solved (independently) by Alon, Kalai and Frankl almost thirty "},"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":"1107.1381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:44:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ee39ec6ef2bff39b988e7eb6cd88e73055e3d96eeca31ce5ab36653ff4105a4b","abstract_canon_sha256":"32398df15664f2a2cda20a8bebabafd8d5e126f2422d44590a815c45fa3c473e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:03.390581Z","signature_b64":"yy8AbQgDBiHuoR9sGUeDsAGTCzBPM+Nyhl49odpmAm5jptHUHagL3DG8r8jbBD3gadZGWdo9ZLjFUVV6nWO4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b54432eaf141b8c69421e31f6c2860f8f7334efef51008462eed8294b8ba2f","last_reissued_at":"2026-05-18T03:40:03.390043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:03.390043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, J\\'ozsef Balogh, Robert Morris","submitted_at":"2011-07-07T13:44:52Z","abstract_excerpt":"Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollob\\'as in 1968, and is defined as follows. Given a graph $H$, and a set $G \\subset E(K_n)$ of initially `infected' edges, we infect, at each time step, a new edge $e$ if there is a copy of $H$ in $K_n$ such that $e$ is the only not-yet infected edge of $H$. We say that $G$ percolates in the $H$-bootstrap process if eventually every edge of $K_n$ is infected. The extremal questions for this model, when $H$ is the complete graph $K_r$, were solved (independently) by Alon, Kalai and Frankl almost thirty "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1381","kind":"arxiv","version":2},"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":"1107.1381","created_at":"2026-05-18T03:40:03.390126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1381v2","created_at":"2026-05-18T03:40:03.390126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1381","created_at":"2026-05-18T03:40:03.390126+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C2UIMXK6FA3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C2UIMXK6FA3RRUU","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C2UIMXK","created_at":"2026-05-18T12:26:20.644004+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/5C2UIMXK6FA3RRUUEHRR63BIMD","json":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD.json","graph_json":"https://pith.science/api/pith-number/5C2UIMXK6FA3RRUUEHRR63BIMD/graph.json","events_json":"https://pith.science/api/pith-number/5C2UIMXK6FA3RRUUEHRR63BIMD/events.json","paper":"https://pith.science/paper/5C2UIMXK"},"agent_actions":{"view_html":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD","download_json":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD.json","view_paper":"https://pith.science/paper/5C2UIMXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1381&json=true","fetch_graph":"https://pith.science/api/pith-number/5C2UIMXK6FA3RRUUEHRR63BIMD/graph.json","fetch_events":"https://pith.science/api/pith-number/5C2UIMXK6FA3RRUUEHRR63BIMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD/action/storage_attestation","attest_author":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD/action/author_attestation","sign_citation":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD/action/citation_signature","submit_replication":"https://pith.science/pith/5C2UIMXK6FA3RRUUEHRR63BIMD/action/replication_record"}},"created_at":"2026-05-18T03:40:03.390126+00:00","updated_at":"2026-05-18T03:40:03.390126+00:00"}