{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ICIYY5ZQTVTWOZCWHWSEOXCBDK","short_pith_number":"pith:ICIYY5ZQ","schema_version":"1.0","canonical_sha256":"40918c77309d676764563da4475c411a8054f38c758b81c418f18de3838d3df7","source":{"kind":"arxiv","id":"2508.03835","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.03835","created_at":"2026-07-05T11:49:16.029540+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.03835v1","created_at":"2026-07-05T11:49:16.029540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03835","created_at":"2026-07-05T11:49:16.029540+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICIYY5ZQTVTW","created_at":"2026-07-05T11:49:16.029540+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICIYY5ZQTVTWOZCW","created_at":"2026-07-05T11:49:16.029540+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICIYY5ZQ","created_at":"2026-07-05T11:49:16.029540+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22630","citing_title":"Upper bounds on the running time of bootstrap percolation","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK","json":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK.json","graph_json":"https://pith.science/api/pith-number/ICIYY5ZQTVTWOZCWHWSEOXCBDK/graph.json","events_json":"https://pith.science/api/pith-number/ICIYY5ZQTVTWOZCWHWSEOXCBDK/events.json","paper":"https://pith.science/paper/ICIYY5ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK","download_json":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK.json","view_paper":"https://pith.science/paper/ICIYY5ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.03835&json=true","fetch_graph":"https://pith.science/api/pith-number/ICIYY5ZQTVTWOZCWHWSEOXCBDK/graph.json","fetch_events":"https://pith.science/api/pith-number/ICIYY5ZQTVTWOZCWHWSEOXCBDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/action/storage_attestation","attest_author":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/action/author_attestation","sign_citation":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/action/citation_signature","submit_replication":"https://pith.science/pith/ICIYY5ZQTVTWOZCWHWSEOXCBDK/action/replication_record"}},"created_at":"2026-07-05T11:49:16.029540+00:00","updated_at":"2026-07-05T11:49:16.029540+00:00"}