{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T537SV4ASKIDYSZCPCWS3BKLK6","short_pith_number":"pith:T537SV4A","schema_version":"1.0","canonical_sha256":"9f77f9578092903c4b2278ad2d854b57963b2b952502597592df5c63c11b39ee","source":{"kind":"arxiv","id":"1704.07144","version":1},"attestation_state":"computed","paper":{"title":"Bootstrap percolation in random $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Christoph Koch, Mihyun Kang, Tam\\'as Makai","submitted_at":"2017-04-24T11:03:43Z","abstract_excerpt":"We investigate bootstrap percolation with infection threshold $r> 1$ on the binomial $k$-uniform random hypergraph $H_k(n,p)$ in the regime $n^{-1}\\ll n^{k-2}p \\ll n^{-1/r}$, when the initial set of infected vertices is chosen uniformly at random from all sets of given size. We establish a threshold such that if there are less vertices in the initial set of infected vertices, then whp only a few additional vertices become infected, while if the initial set of infected vertices exceeds the threshold then whp almost every vertex becomes infected. In addition, for $k=2$, we show that the probabil"},"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":"1704.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T11:03:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"16bbd633655010588894b1df51ee8472284508dc682c7dbd92cda64229219633","abstract_canon_sha256":"a41c4f3578bc18fda5741ab9238c1b570f020d8b7d944e83d1a98c92fe28b0b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.407476Z","signature_b64":"1gQi16CvrdEVnvbhV/sT5Shu1zE56Yt30oVAv8Qm+YtVV8iUUSEDtrDm4HUTUBaN9MUNxt1blvmKJcVxty16Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f77f9578092903c4b2278ad2d854b57963b2b952502597592df5c63c11b39ee","last_reissued_at":"2026-05-18T00:45:53.407020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.407020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bootstrap percolation in random $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Christoph Koch, Mihyun Kang, Tam\\'as Makai","submitted_at":"2017-04-24T11:03:43Z","abstract_excerpt":"We investigate bootstrap percolation with infection threshold $r> 1$ on the binomial $k$-uniform random hypergraph $H_k(n,p)$ in the regime $n^{-1}\\ll n^{k-2}p \\ll n^{-1/r}$, when the initial set of infected vertices is chosen uniformly at random from all sets of given size. We establish a threshold such that if there are less vertices in the initial set of infected vertices, then whp only a few additional vertices become infected, while if the initial set of infected vertices exceeds the threshold then whp almost every vertex becomes infected. In addition, for $k=2$, we show that the probabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07144","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":"1704.07144","created_at":"2026-05-18T00:45:53.407091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07144v1","created_at":"2026-05-18T00:45:53.407091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07144","created_at":"2026-05-18T00:45:53.407091+00:00"},{"alias_kind":"pith_short_12","alias_value":"T537SV4ASKID","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T537SV4ASKIDYSZC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T537SV4A","created_at":"2026-05-18T12:31:43.269735+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/T537SV4ASKIDYSZCPCWS3BKLK6","json":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6.json","graph_json":"https://pith.science/api/pith-number/T537SV4ASKIDYSZCPCWS3BKLK6/graph.json","events_json":"https://pith.science/api/pith-number/T537SV4ASKIDYSZCPCWS3BKLK6/events.json","paper":"https://pith.science/paper/T537SV4A"},"agent_actions":{"view_html":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6","download_json":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6.json","view_paper":"https://pith.science/paper/T537SV4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07144&json=true","fetch_graph":"https://pith.science/api/pith-number/T537SV4ASKIDYSZCPCWS3BKLK6/graph.json","fetch_events":"https://pith.science/api/pith-number/T537SV4ASKIDYSZCPCWS3BKLK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6/action/storage_attestation","attest_author":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6/action/author_attestation","sign_citation":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6/action/citation_signature","submit_replication":"https://pith.science/pith/T537SV4ASKIDYSZCPCWS3BKLK6/action/replication_record"}},"created_at":"2026-05-18T00:45:53.407091+00:00","updated_at":"2026-05-18T00:45:53.407091+00:00"}