{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FVMKRXTYOQI6I34U54NXX4DD5L","short_pith_number":"pith:FVMKRXTY","canonical_record":{"source":{"id":"1510.06156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T07:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"2644fde84f705ec9be609ba2194cd4c4e1432c0f2775f88fe07e5d5b75d6e520","abstract_canon_sha256":"86ac542c181f34a19e34a9b2935de91dbc37d833443d9d0f76389366f3a9cfea"},"schema_version":"1.0"},"canonical_sha256":"2d58a8de787411e46f94ef1b7bf063eaf4d8e857fa85565b9ecd8329f3546c4a","source":{"kind":"arxiv","id":"1510.06156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06156","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06156v2","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06156","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"FVMKRXTYOQI6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVMKRXTYOQI6I34U","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVMKRXTY","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FVMKRXTYOQI6I34U54NXX4DD5L","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T07:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"2644fde84f705ec9be609ba2194cd4c4e1432c0f2775f88fe07e5d5b75d6e520","abstract_canon_sha256":"86ac542c181f34a19e34a9b2935de91dbc37d833443d9d0f76389366f3a9cfea"},"schema_version":"1.0"},"canonical_sha256":"2d58a8de787411e46f94ef1b7bf063eaf4d8e857fa85565b9ecd8329f3546c4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:31.177021Z","signature_b64":"gnMHnX92sWcndjAer0tWDUlyVRrOKWMa+rhtG+RcgfW3WG8H0geB++8akZ/Si3g949pFDH7volfJyuDa0AT/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d58a8de787411e46f94ef1b7bf063eaf4d8e857fa85565b9ecd8329f3546c4a","last_reissued_at":"2026-05-18T01:26:31.176310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:31.176310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06156","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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90nmg0XsxTGKNtHLIyhqAJf9MgBzkGD/6Y7kWnJ95E6HGLJg1opcClXsy6Wq7u4XULu4rKt6X7ZoAcAw/kIKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:03:24.964413Z"},"content_sha256":"ab3da1440fe1c4e69fb02ea3eac1931cc1b041b47397b419175a8d4f6b115de9","schema_version":"1.0","event_id":"sha256:ab3da1440fe1c4e69fb02ea3eac1931cc1b041b47397b419175a8d4f6b115de9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FVMKRXTYOQI6I34U54NXX4DD5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Saturation Time of Graph Bootstrap Percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kilian Matzke","submitted_at":"2015-10-21T07:40:43Z","abstract_excerpt":"The process of $H$-bootstrap percolation for a graph $H$ is a cellular automaton, where, given a subset of the edges of $K_n$ as initial set, an edge is added at time $t$ if it is the only missing edge in a copy of $H$ in the graph obtained through this process at time $t-1$. We discuss an extremal question about the time of $K_r$-bootstrap percolation, namely determining maximal times for an $n$-vertex graph before the process stops. We determine exact values for $r=4$ and find a lower bound for the asymptotics for $r \\geq 5$ by giving an explicit construction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06156","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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAsBGPrOj4GhwZq87AHMhTfVbONWKGqJ+zRM2nbqp53/SfpuneuJT2KEetu60ccP7P++wHGKf5XJCD3qEZcfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:03:24.965122Z"},"content_sha256":"e2e82c2f457db9a0637fcab73daa8cc889f73df70c6f176c88615e470d349c52","schema_version":"1.0","event_id":"sha256:e2e82c2f457db9a0637fcab73daa8cc889f73df70c6f176c88615e470d349c52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVMKRXTYOQI6I34U54NXX4DD5L/bundle.json","state_url":"https://pith.science/pith/FVMKRXTYOQI6I34U54NXX4DD5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVMKRXTYOQI6I34U54NXX4DD5L/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-24T11:03:24Z","links":{"resolver":"https://pith.science/pith/FVMKRXTYOQI6I34U54NXX4DD5L","bundle":"https://pith.science/pith/FVMKRXTYOQI6I34U54NXX4DD5L/bundle.json","state":"https://pith.science/pith/FVMKRXTYOQI6I34U54NXX4DD5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVMKRXTYOQI6I34U54NXX4DD5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FVMKRXTYOQI6I34U54NXX4DD5L","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":"86ac542c181f34a19e34a9b2935de91dbc37d833443d9d0f76389366f3a9cfea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T07:40:43Z","title_canon_sha256":"2644fde84f705ec9be609ba2194cd4c4e1432c0f2775f88fe07e5d5b75d6e520"},"schema_version":"1.0","source":{"id":"1510.06156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06156","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06156v2","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06156","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"FVMKRXTYOQI6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVMKRXTYOQI6I34U","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVMKRXTY","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e2e82c2f457db9a0637fcab73daa8cc889f73df70c6f176c88615e470d349c52","target":"graph","created_at":"2026-05-18T01:26:31Z","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":"The process of $H$-bootstrap percolation for a graph $H$ is a cellular automaton, where, given a subset of the edges of $K_n$ as initial set, an edge is added at time $t$ if it is the only missing edge in a copy of $H$ in the graph obtained through this process at time $t-1$. We discuss an extremal question about the time of $K_r$-bootstrap percolation, namely determining maximal times for an $n$-vertex graph before the process stops. We determine exact values for $r=4$ and find a lower bound for the asymptotics for $r \\geq 5$ by giving an explicit construction.","authors_text":"Kilian Matzke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T07:40:43Z","title":"The Saturation Time of Graph Bootstrap Percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06156","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:ab3da1440fe1c4e69fb02ea3eac1931cc1b041b47397b419175a8d4f6b115de9","target":"record","created_at":"2026-05-18T01:26:31Z","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":"86ac542c181f34a19e34a9b2935de91dbc37d833443d9d0f76389366f3a9cfea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T07:40:43Z","title_canon_sha256":"2644fde84f705ec9be609ba2194cd4c4e1432c0f2775f88fe07e5d5b75d6e520"},"schema_version":"1.0","source":{"id":"1510.06156","kind":"arxiv","version":2}},"canonical_sha256":"2d58a8de787411e46f94ef1b7bf063eaf4d8e857fa85565b9ecd8329f3546c4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d58a8de787411e46f94ef1b7bf063eaf4d8e857fa85565b9ecd8329f3546c4a","first_computed_at":"2026-05-18T01:26:31.176310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:31.176310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gnMHnX92sWcndjAer0tWDUlyVRrOKWMa+rhtG+RcgfW3WG8H0geB++8akZ/Si3g949pFDH7volfJyuDa0AT/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:31.177021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab3da1440fe1c4e69fb02ea3eac1931cc1b041b47397b419175a8d4f6b115de9","sha256:e2e82c2f457db9a0637fcab73daa8cc889f73df70c6f176c88615e470d349c52"],"state_sha256":"5ab20b6c49de6d295cc8584e4c0bb195e47e3a2e2b4e221eb9818468d4ec1794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7dQWvLRqOKk13UBACK/XbSEE96uzKHnu52ghRQXV0ankYyhwDL13k35CUBjV2eqZlffS+fLUT+rPTEbhXGYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:03:24.969020Z","bundle_sha256":"f78f9b6e11620ba44dde3262b78c81f580f538d07ed207392a917542e46daae5"}}