{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NJDROVEAJZCDECXNMI4ZNAPQ2P","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":"d9dd6817fac882b66557e88ca493d4fa931f05394c855d591f51a6090b582767","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-30T18:36:44Z","title_canon_sha256":"a7ed76ca6ee07650e346345f6cbb341db4ed3a0c4e15d7edc87d2afd643d96b3"},"schema_version":"1.0","source":{"id":"2311.18786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.18786","created_at":"2026-07-05T09:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"2311.18786v2","created_at":"2026-07-05T09:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18786","created_at":"2026-07-05T09:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"NJDROVEAJZCD","created_at":"2026-07-05T09:50:00Z"},{"alias_kind":"pith_short_16","alias_value":"NJDROVEAJZCDECXN","created_at":"2026-07-05T09:50:00Z"},{"alias_kind":"pith_short_8","alias_value":"NJDROVEA","created_at":"2026-07-05T09:50:00Z"}],"graph_snapshots":[{"event_id":"sha256:6d749249a5e4aea0190eba669062cdf75431c6bb0d852e0a344f33c0836b1d13","target":"graph","created_at":"2026-07-05T09:50:00Z","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/2311.18786/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap process on $G$ is the process which starts with $G$ and, at every time step, adds any missing edges on the vertices of $G$ that complete a copy of $H$. This process eventually stabilises and we are interested in the extremal question raised by Bollob\\'as of determining the maximum running time (number of time steps before stabilising) of this process over all possible choices of $n$-vertex graph $G$. In this paper, we initiate a systematic study of the asymptotics of this parameter, denoted $M_H(n)$, and its dependence on propertie","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-11-30T18:36:44Z","title":"Slow graph bootstrap percolation II: Accelerating properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18786","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:1fe358cb11fdfb01ed31eef01dbfe43180f986e4fd56448064c74bc95bb8369c","target":"record","created_at":"2026-07-05T09:50:00Z","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":"d9dd6817fac882b66557e88ca493d4fa931f05394c855d591f51a6090b582767","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-30T18:36:44Z","title_canon_sha256":"a7ed76ca6ee07650e346345f6cbb341db4ed3a0c4e15d7edc87d2afd643d96b3"},"schema_version":"1.0","source":{"id":"2311.18786","kind":"arxiv","version":2}},"canonical_sha256":"6a471754804e44320aed62399681f0d3f20a68b010f5fe6115941b3dcf6eafb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a471754804e44320aed62399681f0d3f20a68b010f5fe6115941b3dcf6eafb4","first_computed_at":"2026-07-05T09:50:00.560471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:00.560471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZhrTQPO6p11ouDQaaMAAcREw6WCFKg66DttKvSA+IaQt4nc2NY4suexwEcPjeVmcmETW4rIluOAZW6WNy173AA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:00.560942Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.18786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fe358cb11fdfb01ed31eef01dbfe43180f986e4fd56448064c74bc95bb8369c","sha256:6d749249a5e4aea0190eba669062cdf75431c6bb0d852e0a344f33c0836b1d13"],"state_sha256":"68bb005bbb774bc86393c08f1434363343d0fd9c4828738d4212d6e5069c775f"}