{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7JBXUFVBK7NAHUM3OD2YW2K3TX","short_pith_number":"pith:7JBXUFVB","canonical_record":{"source":{"id":"2308.00498","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-01T12:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"0e0535e4670686ad000eb021bbb2eec77b2ef2b6fe72cbf266e3f572f872d880","abstract_canon_sha256":"5e44baf593547cac5a3d7df0aa860231616a98ebc403f8c3e66ea9e6cf6ddaed"},"schema_version":"1.0"},"canonical_sha256":"fa437a16a157da03d19b70f58b695b9deaced38eecd40598be5607d603b1293f","source":{"kind":"arxiv","id":"2308.00498","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00498","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00498v3","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00498","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"7JBXUFVBK7NA","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"7JBXUFVBK7NAHUM3","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"7JBXUFVB","created_at":"2026-06-23T03:13:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7JBXUFVBK7NAHUM3OD2YW2K3TX","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00498","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-01T12:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"0e0535e4670686ad000eb021bbb2eec77b2ef2b6fe72cbf266e3f572f872d880","abstract_canon_sha256":"5e44baf593547cac5a3d7df0aa860231616a98ebc403f8c3e66ea9e6cf6ddaed"},"schema_version":"1.0"},"canonical_sha256":"fa437a16a157da03d19b70f58b695b9deaced38eecd40598be5607d603b1293f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.711867Z","signature_b64":"dvC7fZtPe7QBrIftXLSTyjdiaYiL0XWdwc6jEWMjlEe5Q1RW+RxWGz0KIBU8rWIHQ4Rgx2oiOFmsR4oDo2uQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa437a16a157da03d19b70f58b695b9deaced38eecd40598be5607d603b1293f","last_reissued_at":"2026-06-23T03:13:42.711473Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.711473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00498","source_version":3,"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-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTM7vCW8K5T7cdkmqU4bZ9BpfCxcjSsvJT0Qm6OWmbno0/sjL9kiCdGmn7d9nkmfEAbWZ2z5WRVO+Gmq3MB6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:27:16.806136Z"},"content_sha256":"da4428c0f8cb82765436c720a8686be8805421c82db966dc450435808bc07029","schema_version":"1.0","event_id":"sha256:da4428c0f8cb82765436c720a8686be8805421c82db966dc450435808bc07029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7JBXUFVBK7NAHUM3OD2YW2K3TX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slow graph bootstrap percolation I: Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Fabian, Patrick Morris, Tibor Szab\\'o","submitted_at":"2023-08-01T12:34:26Z","abstract_excerpt":"Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$\\emph{-bootstrap percolation process} on $G$ is defined to be the sequence of graphs $G_i$, $i\\geq 0$ which starts with $G_0 := G$ and in which $G_{i+1}$ is obtained from $G_i$ by adding every edge that completes a copy of $H$. We are interested in $M_H(n)$ which is the maximum number of steps, over all $n$-vertex graphs $G$, that this process takes to stabilise. We determine this maximum running time precisely when $H$ is a cycle, giving the first infinite family of graphs $H$ for which an exact solution is known. We find that $M_{C_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00498","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.00498/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJQn6pgH/Yx5a1Lbgvk5ne7AAUj+jD3rqjRKINb69K87IJYy5o8peOvzyN4gWMSaf7oAZg42hQPt3jX+7rBfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:27:16.806525Z"},"content_sha256":"e2265b2530773545e94eaa99bd1008eef429f519b01dd9cddd1d89caa6aa89e6","schema_version":"1.0","event_id":"sha256:e2265b2530773545e94eaa99bd1008eef429f519b01dd9cddd1d89caa6aa89e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/bundle.json","state_url":"https://pith.science/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/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-06-25T06:27:16Z","links":{"resolver":"https://pith.science/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX","bundle":"https://pith.science/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/bundle.json","state":"https://pith.science/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JBXUFVBK7NAHUM3OD2YW2K3TX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7JBXUFVBK7NAHUM3OD2YW2K3TX","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":"5e44baf593547cac5a3d7df0aa860231616a98ebc403f8c3e66ea9e6cf6ddaed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-01T12:34:26Z","title_canon_sha256":"0e0535e4670686ad000eb021bbb2eec77b2ef2b6fe72cbf266e3f572f872d880"},"schema_version":"1.0","source":{"id":"2308.00498","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00498","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00498v3","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00498","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"7JBXUFVBK7NA","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"7JBXUFVBK7NAHUM3","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"7JBXUFVB","created_at":"2026-06-23T03:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:e2265b2530773545e94eaa99bd1008eef429f519b01dd9cddd1d89caa6aa89e6","target":"graph","created_at":"2026-06-23T03:13:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.00498/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$\\emph{-bootstrap percolation process} on $G$ is defined to be the sequence of graphs $G_i$, $i\\geq 0$ which starts with $G_0 := G$ and in which $G_{i+1}$ is obtained from $G_i$ by adding every edge that completes a copy of $H$. We are interested in $M_H(n)$ which is the maximum number of steps, over all $n$-vertex graphs $G$, that this process takes to stabilise. We determine this maximum running time precisely when $H$ is a cycle, giving the first infinite family of graphs $H$ for which an exact solution is known. We find that $M_{C_","authors_text":"David Fabian, Patrick Morris, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-01T12:34:26Z","title":"Slow graph bootstrap percolation I: Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00498","kind":"arxiv","version":3},"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:da4428c0f8cb82765436c720a8686be8805421c82db966dc450435808bc07029","target":"record","created_at":"2026-06-23T03:13:42Z","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":"5e44baf593547cac5a3d7df0aa860231616a98ebc403f8c3e66ea9e6cf6ddaed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-01T12:34:26Z","title_canon_sha256":"0e0535e4670686ad000eb021bbb2eec77b2ef2b6fe72cbf266e3f572f872d880"},"schema_version":"1.0","source":{"id":"2308.00498","kind":"arxiv","version":3}},"canonical_sha256":"fa437a16a157da03d19b70f58b695b9deaced38eecd40598be5607d603b1293f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa437a16a157da03d19b70f58b695b9deaced38eecd40598be5607d603b1293f","first_computed_at":"2026-06-23T03:13:42.711473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:13:42.711473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dvC7fZtPe7QBrIftXLSTyjdiaYiL0XWdwc6jEWMjlEe5Q1RW+RxWGz0KIBU8rWIHQ4Rgx2oiOFmsR4oDo2uQDQ==","signature_status":"signed_v1","signed_at":"2026-06-23T03:13:42.711867Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00498","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da4428c0f8cb82765436c720a8686be8805421c82db966dc450435808bc07029","sha256:e2265b2530773545e94eaa99bd1008eef429f519b01dd9cddd1d89caa6aa89e6"],"state_sha256":"77b57b7fce646c32d5612ac175103a7eb6dc30daed7b84be4d17a838898b4f69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOdZRa3is4CYxtHZ4Wro5jmoP119BoJOJx2I6b39tVZghqwUnKlm0kfQOaPZFR0Ug71OYCQT8nHgfXHtzABCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:27:16.809034Z","bundle_sha256":"f34e57e21d81a7c11255b750bd29e40b9fa75ce9d75c9a350f6759252c47877a"}}