{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B64WOLFKLPEFCHTANVD6WSDLNR","short_pith_number":"pith:B64WOLFK","schema_version":"1.0","canonical_sha256":"0fb9672caa5bc8511e606d47eb486b6c6daa7fd2c1a194ae778ddc540a0dd05e","source":{"kind":"arxiv","id":"1806.10425","version":1},"attestation_state":"computed","paper":{"title":"On $K_{2,t}$-bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, M.R. Bidgoli","submitted_at":"2018-06-27T11:59:12Z","abstract_excerpt":"Given two graphs $G$ and $H$, it is said that $G$ percolates in $H$-bootstrap process if one could join all the nonadjacent pairs of vertices of $G$ in some order such that a new copy of $H$ is created at each step. Balogh, Bollob\\'as and Morris in 2012 investigated the threshold of $H$-bootstrap percolation in the Erd\\H{o}s-R\\'enyi model for the complete graph $H$ and proposed the similar problem for $H=K_{s,t}$, the complete bipartite graph. In this paper, we provide lower and upper bounds on the threshold of $K_{2, t}$-bootstrap percolation. In addition, a threshold function is derived for "},"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":"1806.10425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"6957e5fe99601299df2f503d5a267e7aef328d5c13a79f604fb35f99b64e5f3d","abstract_canon_sha256":"d6ade47717251fead72fc61143e1810865d8ec5756ba58b0898e8621ff8046b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.484582Z","signature_b64":"jYGd10AZePoXp8oZdD9dSXtb7znOAo2bEIGfoYVz3ZB2ErIuzkj6heQIj7/EUcv83PxPdAV3RKfvZP5mVhD7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fb9672caa5bc8511e606d47eb486b6c6daa7fd2c1a194ae778ddc540a0dd05e","last_reissued_at":"2026-05-18T00:12:12.483921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.483921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $K_{2,t}$-bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, M.R. Bidgoli","submitted_at":"2018-06-27T11:59:12Z","abstract_excerpt":"Given two graphs $G$ and $H$, it is said that $G$ percolates in $H$-bootstrap process if one could join all the nonadjacent pairs of vertices of $G$ in some order such that a new copy of $H$ is created at each step. Balogh, Bollob\\'as and Morris in 2012 investigated the threshold of $H$-bootstrap percolation in the Erd\\H{o}s-R\\'enyi model for the complete graph $H$ and proposed the similar problem for $H=K_{s,t}$, the complete bipartite graph. In this paper, we provide lower and upper bounds on the threshold of $K_{2, t}$-bootstrap percolation. In addition, a threshold function is derived for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10425","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":""},"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":"1806.10425","created_at":"2026-05-18T00:12:12.484016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10425v1","created_at":"2026-05-18T00:12:12.484016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10425","created_at":"2026-05-18T00:12:12.484016+00:00"},{"alias_kind":"pith_short_12","alias_value":"B64WOLFKLPEF","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B64WOLFKLPEFCHTA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B64WOLFK","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR","json":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR.json","graph_json":"https://pith.science/api/pith-number/B64WOLFKLPEFCHTANVD6WSDLNR/graph.json","events_json":"https://pith.science/api/pith-number/B64WOLFKLPEFCHTANVD6WSDLNR/events.json","paper":"https://pith.science/paper/B64WOLFK"},"agent_actions":{"view_html":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR","download_json":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR.json","view_paper":"https://pith.science/paper/B64WOLFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10425&json=true","fetch_graph":"https://pith.science/api/pith-number/B64WOLFKLPEFCHTANVD6WSDLNR/graph.json","fetch_events":"https://pith.science/api/pith-number/B64WOLFKLPEFCHTANVD6WSDLNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR/action/storage_attestation","attest_author":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR/action/author_attestation","sign_citation":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR/action/citation_signature","submit_replication":"https://pith.science/pith/B64WOLFKLPEFCHTANVD6WSDLNR/action/replication_record"}},"created_at":"2026-05-18T00:12:12.484016+00:00","updated_at":"2026-05-18T00:12:12.484016+00:00"}