{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P2STLTMTSWUMBXEU6WOLOZJJJM","short_pith_number":"pith:P2STLTMT","canonical_record":{"source":{"id":"1503.01454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T20:52:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5a78d86494139a41044cb48d2e99f7dc2120c03763d33398af09b8fd28974a64","abstract_canon_sha256":"a5aa60387934d72a2c2c206e4040b7bc2fe88320f6ee11a6a794d6d2cedd0c4e"},"schema_version":"1.0"},"canonical_sha256":"7ea535cd9395a8c0dc94f59cb765294b1e4943d904d46563fd01eca6263b418f","source":{"kind":"arxiv","id":"1503.01454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01454","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01454v2","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01454","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"P2STLTMTSWUM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P2STLTMTSWUMBXEU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P2STLTMT","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P2STLTMTSWUMBXEU6WOLOZJJJM","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T20:52:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5a78d86494139a41044cb48d2e99f7dc2120c03763d33398af09b8fd28974a64","abstract_canon_sha256":"a5aa60387934d72a2c2c206e4040b7bc2fe88320f6ee11a6a794d6d2cedd0c4e"},"schema_version":"1.0"},"canonical_sha256":"7ea535cd9395a8c0dc94f59cb765294b1e4943d904d46563fd01eca6263b418f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:01.796168Z","signature_b64":"p0YBUv3G2uyPnRWe76hT7AqiC4c4RiBg5axGvhSKu2KeLAXdjzEqe3DE9nSO/9QwEibqWJPMyTAR8PzykUyGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ea535cd9395a8c0dc94f59cb765294b1e4943d904d46563fd01eca6263b418f","last_reissued_at":"2026-05-18T01:20:01.795447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:01.795447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01454","source_version":2,"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-18T01:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h73r58raeV694mk5BtpWsVYQFlf/rqJpNvsR3XTqpr8Ark4yWID6a6XAWrQXNI/kcq6G9CJtHc+DGEqdz0WJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:42.009834Z"},"content_sha256":"9f6fd8f62ce12279484357c95709229d6f7dc83a7d4154cf5c1ed39fe2d6c533","schema_version":"1.0","event_id":"sha256:9f6fd8f62ce12279484357c95709229d6f7dc83a7d4154cf5c1ed39fe2d6c533"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P2STLTMTSWUMBXEU6WOLOZJJJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The time of graph bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Karen Gunderson, Micha{\\l} Przykucki, Sebastian Koch","submitted_at":"2015-03-04T20:52:41Z","abstract_excerpt":"Graph bootstrap percolation, introduced by Bollob\\'as in 1968, is a cellular automaton defined as follows. Given a \"small\" graph $H$ and a \"large\" graph $G = G_0 \\subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding to it all new edges $e$ such that $G_t \\cup e$ contains a new copy of $H$. We say that $G$ percolates if for some $t \\geq 0$, we have $G_t = K_n$.\n  For $H = K_r$, the question about the size of the smallest percolating graphs was independently answered by Alon, Frankl and Kalai in the 1980's. Recently, Balogh, Bollob\\'as and Morris considered graph bootstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01454","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"},"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-18T01:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUSY1nq2299dHcvzr5cmMIQxwXaI7frzzcrK/K+EC60JoixH+3zh2AwrvEy41ED4rqilaLpx3SWvQo2hcq8iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:42.010490Z"},"content_sha256":"1a9c204d011c9a36ce23df4638a73bdffcc27041b724f58e387b2a5f45dca88f","schema_version":"1.0","event_id":"sha256:1a9c204d011c9a36ce23df4638a73bdffcc27041b724f58e387b2a5f45dca88f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/bundle.json","state_url":"https://pith.science/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/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-05-29T14:43:42Z","links":{"resolver":"https://pith.science/pith/P2STLTMTSWUMBXEU6WOLOZJJJM","bundle":"https://pith.science/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/bundle.json","state":"https://pith.science/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2STLTMTSWUMBXEU6WOLOZJJJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P2STLTMTSWUMBXEU6WOLOZJJJM","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":"a5aa60387934d72a2c2c206e4040b7bc2fe88320f6ee11a6a794d6d2cedd0c4e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T20:52:41Z","title_canon_sha256":"5a78d86494139a41044cb48d2e99f7dc2120c03763d33398af09b8fd28974a64"},"schema_version":"1.0","source":{"id":"1503.01454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01454","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01454v2","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01454","created_at":"2026-05-18T01:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"P2STLTMTSWUM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P2STLTMTSWUMBXEU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P2STLTMT","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:1a9c204d011c9a36ce23df4638a73bdffcc27041b724f58e387b2a5f45dca88f","target":"graph","created_at":"2026-05-18T01:20:01Z","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, introduced by Bollob\\'as in 1968, is a cellular automaton defined as follows. Given a \"small\" graph $H$ and a \"large\" graph $G = G_0 \\subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding to it all new edges $e$ such that $G_t \\cup e$ contains a new copy of $H$. We say that $G$ percolates if for some $t \\geq 0$, we have $G_t = K_n$.\n  For $H = K_r$, the question about the size of the smallest percolating graphs was independently answered by Alon, Frankl and Kalai in the 1980's. Recently, Balogh, Bollob\\'as and Morris considered graph bootstra","authors_text":"Karen Gunderson, Micha{\\l} Przykucki, Sebastian Koch","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T20:52:41Z","title":"The time of graph bootstrap percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01454","kind":"arxiv","version":2},"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:9f6fd8f62ce12279484357c95709229d6f7dc83a7d4154cf5c1ed39fe2d6c533","target":"record","created_at":"2026-05-18T01:20:01Z","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":"a5aa60387934d72a2c2c206e4040b7bc2fe88320f6ee11a6a794d6d2cedd0c4e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T20:52:41Z","title_canon_sha256":"5a78d86494139a41044cb48d2e99f7dc2120c03763d33398af09b8fd28974a64"},"schema_version":"1.0","source":{"id":"1503.01454","kind":"arxiv","version":2}},"canonical_sha256":"7ea535cd9395a8c0dc94f59cb765294b1e4943d904d46563fd01eca6263b418f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ea535cd9395a8c0dc94f59cb765294b1e4943d904d46563fd01eca6263b418f","first_computed_at":"2026-05-18T01:20:01.795447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:01.795447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0YBUv3G2uyPnRWe76hT7AqiC4c4RiBg5axGvhSKu2KeLAXdjzEqe3DE9nSO/9QwEibqWJPMyTAR8PzykUyGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:01.796168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f6fd8f62ce12279484357c95709229d6f7dc83a7d4154cf5c1ed39fe2d6c533","sha256:1a9c204d011c9a36ce23df4638a73bdffcc27041b724f58e387b2a5f45dca88f"],"state_sha256":"b21fc9b86c6fee0ba670c593e53d94629f3ae8f33994633a10056530038a4fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBPmi2IPtV0sranLi1quWwkMo9/ShQJeKUl7RG+KEJrOhe6PQ2XknLlzzvMb8bWvfwli2xyeIq0WmWze47imCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:43:42.014035Z","bundle_sha256":"eaea55e2a4b33ac612bb2cb797464cacc3a0a7fe18b6f837706a361721ffe0b5"}}