{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GN2H3V7ZNCZDYBDMVNMNYFMEL4","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":"2bd8a040908df7426bec6b26c1b24f15e10a3293906738a24d3a22d19f1d3ec5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T08:05:49Z","title_canon_sha256":"09428d17f5b2ad0c7e22de0af7fb72a4fa9caec493c3b1584ed270b8b5aacf17"},"schema_version":"1.0","source":{"id":"1907.04559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04559","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04559v1","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04559","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"GN2H3V7ZNCZD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GN2H3V7ZNCZDYBDM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GN2H3V7Z","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:efc5c3113fcd2951febca99b5d6d04e2666628903b251ae74308afc7837dbf2f","target":"graph","created_at":"2026-05-17T23:40:59Z","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":"Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollob\\'as in 1968. In this process, we start with initial \"infected\" set of edges $E_0$, and we infect new edges according to a predetermined rule. Given a graph $H$ and a set of previously infected edges $E_t\\subseteq E(K_n)$, we infect a non-infected edge $e$ if it completes a new copy of $H$ in $G=([n],E_t\\cup e)$. A question raised by Bollob\\'as asks for the maximum time the process can run before it stabilizes. Bollob\\'as, Przykucki, Riordan, and Sahasrabudhe considered this problem for the most natural case wh","authors_text":"Alexey Pokrovskiy, Gal Kronenberg, J\\'ozsef Balogh, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T08:05:49Z","title":"The maximum length of $K_r$-Bootstrap Percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04559","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:569b400ad59bf3cdb8953d6d4b6db73dedec40086a3cbcc32ac1ae442a6cde4b","target":"record","created_at":"2026-05-17T23:40:59Z","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":"2bd8a040908df7426bec6b26c1b24f15e10a3293906738a24d3a22d19f1d3ec5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T08:05:49Z","title_canon_sha256":"09428d17f5b2ad0c7e22de0af7fb72a4fa9caec493c3b1584ed270b8b5aacf17"},"schema_version":"1.0","source":{"id":"1907.04559","kind":"arxiv","version":1}},"canonical_sha256":"33747dd7f968b23c046cab58dc15845f35e5793807527b29dec35bc547ef082b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33747dd7f968b23c046cab58dc15845f35e5793807527b29dec35bc547ef082b","first_computed_at":"2026-05-17T23:40:59.885826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:59.885826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qpZPC0kTO4Z5cyf6NZHc9SPlv0V/OPFvGVlJImWOsWWhHxl7ZTNv9YbNqt1lidhtTVrOkx9f8JJycbPcmaqXDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:59.886296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:569b400ad59bf3cdb8953d6d4b6db73dedec40086a3cbcc32ac1ae442a6cde4b","sha256:efc5c3113fcd2951febca99b5d6d04e2666628903b251ae74308afc7837dbf2f"],"state_sha256":"f9caa5f05f56baecf6e6241f64c645e517dbeb00f199020224d31ce37f9c0e7a"}