{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ICIYY5ZQTVTWOZCWHWSEOXCBDK","short_pith_number":"pith:ICIYY5ZQ","canonical_record":{"source":{"id":"2508.03835","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T18:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"c5b65bf881235f1a8430093bdb7b80348d78211885d49fffbe5e7d91b274992a","abstract_canon_sha256":"32222509bcb54b6cac854dda568dff9db77b92bbdf02b3b92d9220cd1ab11fe2"},"schema_version":"1.0"},"canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","source":{"kind":"arxiv","id":"2508.03835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03835","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03835v1","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03835","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"ICIYY5ZQTVTW","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_16","alias_value":"ICIYY5ZQTVTWOZCW","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_8","alias_value":"ICIYY5ZQ","created_at":"2026-07-05T11:49:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ICIYY5ZQTVTWOZCWHWSEOXCBDK","target":"record","payload":{"canonical_record":{"source":{"id":"2508.03835","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T18:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"c5b65bf881235f1a8430093bdb7b80348d78211885d49fffbe5e7d91b274992a","abstract_canon_sha256":"32222509bcb54b6cac854dda568dff9db77b92bbdf02b3b92d9220cd1ab11fe2"},"schema_version":"1.0"},"canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:16.029996Z","signature_b64":"cJrP/tTn/Dnk/bWCPfO+VgqriJ+NzNRKnMUfZWB4SwSj7uXy5Uqst43h3BmOUuB18eZpWzYM9V/w0/RdpskJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","last_reissued_at":"2026-07-05T11:49:16.029474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:16.029474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.03835","source_version":1,"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-05T11:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P65ReiO6C/wWXiYv1iRG9tlDtkaGzN/dKmrJQLRgt+wO6YMAuIcuvfhzrx0x3lfuVMvLPc/fVT0SPjYLt9VAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:04:42.922890Z"},"content_sha256":"553322b3f0839f5dfd3297a79dc2b515ee1a11d614a30f75572f06f07886d677","schema_version":"1.0","event_id":"sha256:553322b3f0839f5dfd3297a79dc2b515ee1a11d614a30f75572f06f07886d677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ICIYY5ZQTVTWOZCWHWSEOXCBDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slow graph bootstrap percolation III: Chain constructions","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":"2025-08-05T18:28:35Z","abstract_excerpt":"For graphs $H$, we study the extremal function $M_H(n)$ which is the maximum running time (until stabilisation) of an $H$-bootstrap percolation process on $n$ vertices. Building on previous work in the clique case $H=K_k$, we develop a general framework of chain constructions. We demonstrate the flexibility of this framework by applying several variations of the method to give lower bounds on $M_H(n)$ for a wide variety of different graphs $H$ including dense graphs, random graphs and complete bipartite graphs. In particular, we focus on the question of whether $M_H(n)$ is (almost) quadratic o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03835","kind":"arxiv","version":1},"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/2508.03835/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-05T11:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnEnPz1OkC2YccbGInU6Jnllj02L9gjfM6nzLw3Zv4LvA4SxSgDiwfB3YAiknFxOEmO+ClkejADncp+o3CLTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:04:42.923257Z"},"content_sha256":"68c45544bb4b1b1dcc9b000a570858c8333f625366824d1bf2d749920fd08464","schema_version":"1.0","event_id":"sha256:68c45544bb4b1b1dcc9b000a570858c8333f625366824d1bf2d749920fd08464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/bundle.json","state_url":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/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-04T21:04:42Z","links":{"resolver":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK","bundle":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/bundle.json","state":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ICIYY5ZQTVTWOZCWHWSEOXCBDK","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":"32222509bcb54b6cac854dda568dff9db77b92bbdf02b3b92d9220cd1ab11fe2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T18:28:35Z","title_canon_sha256":"c5b65bf881235f1a8430093bdb7b80348d78211885d49fffbe5e7d91b274992a"},"schema_version":"1.0","source":{"id":"2508.03835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03835","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03835v1","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03835","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"ICIYY5ZQTVTW","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_16","alias_value":"ICIYY5ZQTVTWOZCW","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_8","alias_value":"ICIYY5ZQ","created_at":"2026-07-05T11:49:16Z"}],"graph_snapshots":[{"event_id":"sha256:68c45544bb4b1b1dcc9b000a570858c8333f625366824d1bf2d749920fd08464","target":"graph","created_at":"2026-07-05T11:49:16Z","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/2508.03835/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For graphs $H$, we study the extremal function $M_H(n)$ which is the maximum running time (until stabilisation) of an $H$-bootstrap percolation process on $n$ vertices. Building on previous work in the clique case $H=K_k$, we develop a general framework of chain constructions. We demonstrate the flexibility of this framework by applying several variations of the method to give lower bounds on $M_H(n)$ for a wide variety of different graphs $H$ including dense graphs, random graphs and complete bipartite graphs. In particular, we focus on the question of whether $M_H(n)$ is (almost) quadratic o","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":"2025-08-05T18:28:35Z","title":"Slow graph bootstrap percolation III: Chain constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03835","kind":"arxiv","version":1},"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:553322b3f0839f5dfd3297a79dc2b515ee1a11d614a30f75572f06f07886d677","target":"record","created_at":"2026-07-05T11:49:16Z","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":"32222509bcb54b6cac854dda568dff9db77b92bbdf02b3b92d9220cd1ab11fe2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-05T18:28:35Z","title_canon_sha256":"c5b65bf881235f1a8430093bdb7b80348d78211885d49fffbe5e7d91b274992a"},"schema_version":"1.0","source":{"id":"2508.03835","kind":"arxiv","version":1}},"canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","first_computed_at":"2026-07-05T11:49:16.029474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:16.029474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cJrP/tTn/Dnk/bWCPfO+VgqriJ+NzNRKnMUfZWB4SwSj7uXy5Uqst43h3BmOUuB18eZpWzYM9V/w0/RdpskJDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:16.029996Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.03835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:553322b3f0839f5dfd3297a79dc2b515ee1a11d614a30f75572f06f07886d677","sha256:68c45544bb4b1b1dcc9b000a570858c8333f625366824d1bf2d749920fd08464"],"state_sha256":"a78c09a16107caf5e05b5b4c56ccb0414d7bd0637f7a1d50e221423b0a017b00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guqK3WywRIfVobl6cv2GQqJ0UMLzGE5TKgHKM/LH6Z7thqBWswHCz6QeuGMIX8AxuPIyvvSbUGf93omUsE/mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:04:42.925577Z","bundle_sha256":"ece61bbc7d7f8a56c7f5072c6085ccfc4092c79112a6a7c253f507db80b91a09"}}