{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NJDROVEAJZCDECXNMI4ZNAPQ2P","short_pith_number":"pith:NJDROVEA","canonical_record":{"source":{"id":"2311.18786","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-30T18:36:44Z","cross_cats_sorted":[],"title_canon_sha256":"a7ed76ca6ee07650e346345f6cbb341db4ed3a0c4e15d7edc87d2afd643d96b3","abstract_canon_sha256":"d9dd6817fac882b66557e88ca493d4fa931f05394c855d591f51a6090b582767"},"schema_version":"1.0"},"canonical_sha256":"6a471754804e44320aed62399681f0d3f20a68b010f5fe6115941b3dcf6eafb4","source":{"kind":"arxiv","id":"2311.18786","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NJDROVEAJZCDECXNMI4ZNAPQ2P","target":"record","payload":{"canonical_record":{"source":{"id":"2311.18786","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-30T18:36:44Z","cross_cats_sorted":[],"title_canon_sha256":"a7ed76ca6ee07650e346345f6cbb341db4ed3a0c4e15d7edc87d2afd643d96b3","abstract_canon_sha256":"d9dd6817fac882b66557e88ca493d4fa931f05394c855d591f51a6090b582767"},"schema_version":"1.0"},"canonical_sha256":"6a471754804e44320aed62399681f0d3f20a68b010f5fe6115941b3dcf6eafb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:00.560942Z","signature_b64":"ZhrTQPO6p11ouDQaaMAAcREw6WCFKg66DttKvSA+IaQt4nc2NY4suexwEcPjeVmcmETW4rIluOAZW6WNy173AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a471754804e44320aed62399681f0d3f20a68b010f5fe6115941b3dcf6eafb4","last_reissued_at":"2026-07-05T09:50:00.560471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:00.560471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.18786","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-07-05T09:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFn5mP0iC1guVQeLt7Nho4GgNKIXmmLVhiYgpysfVy/ySvHU4jLn9l4IIjQef8m692MJSPyvp9LUXzlfEraqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:51:24.190098Z"},"content_sha256":"1fe358cb11fdfb01ed31eef01dbfe43180f986e4fd56448064c74bc95bb8369c","schema_version":"1.0","event_id":"sha256:1fe358cb11fdfb01ed31eef01dbfe43180f986e4fd56448064c74bc95bb8369c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NJDROVEAJZCDECXNMI4ZNAPQ2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slow graph bootstrap percolation II: Accelerating properties","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-11-30T18:36:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18786","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.18786/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-07-05T09:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G1PBZlUL2fIUzeGn7TpcMmuVOYwar5JmvczIXpiR2pCB4A0KRI07JbOQzjTsvl608ZASy9rQ++tQ3Eon1y0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:51:24.190999Z"},"content_sha256":"6d749249a5e4aea0190eba669062cdf75431c6bb0d852e0a344f33c0836b1d13","schema_version":"1.0","event_id":"sha256:6d749249a5e4aea0190eba669062cdf75431c6bb0d852e0a344f33c0836b1d13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/bundle.json","state_url":"https://pith.science/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/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-08-04T16:51:24Z","links":{"resolver":"https://pith.science/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P","bundle":"https://pith.science/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/bundle.json","state":"https://pith.science/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJDROVEAJZCDECXNMI4ZNAPQ2P/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6BkY72lvbMA97wk9mjB0XhBEt+4eRdrf3QZLZP3zEVLYUVkRS0ykOhKHizVQb8NvupEPmdWDOze+DCyQGeRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T16:51:24.199600Z","bundle_sha256":"578554b2e8cac2404728fa8a6ce38651a9983b457b455a70bd6f732e00ab8d47"}}