{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DD7LCJ36W6VPJPQ53EVF4B7Y5T","short_pith_number":"pith:DD7LCJ36","schema_version":"1.0","canonical_sha256":"18feb1277eb7aaf4be1dd92a5e07f8ecd24bbc604339b3bdd6423b165ed02841","source":{"kind":"arxiv","id":"1806.02903","version":2},"attestation_state":"computed","paper":{"title":"A Sharp Threshold for Bootstrap Percolation in a Random Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Jonathan A. Noel, Natasha Morrison","submitted_at":"2018-06-07T21:01:54Z","abstract_excerpt":"Given a hypergraph $\\mathcal{H}$, the $\\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\\mathcal{H}$ in which $v$ is the unique healthy vertex. We say that the set of initially infected vertices percolates if every vertex of $\\mathcal{H}$ is eventually infected. We show that this process exhibits a sharp threshold when $\\mathcal{H}$ is a hypergraph obtained by randomly sampling hyperedges from an approximately $d$-regular $r$-uniform hypergraph satisfying some"},"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.02903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-07T21:01:54Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3453db16ee27446d43f887ab7a3b92bda99b44840b72ce654c0f461829fff4b3","abstract_canon_sha256":"5b0ffa4ed38172c7d2b23a5785484c2b36c30478fa2bf18e1576a4816563cf30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:55.132334Z","signature_b64":"wA+bDbmmT8ZqufzR1DIDEPE0yvRN/jBRg4JFZDTDdxyn7ZO4e+cf5MoNUl6EPBTbUowlpL9L4YvBhM0umWXIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18feb1277eb7aaf4be1dd92a5e07f8ecd24bbc604339b3bdd6423b165ed02841","last_reissued_at":"2026-07-05T01:40:55.131907Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:55.131907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sharp Threshold for Bootstrap Percolation in a Random Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Jonathan A. Noel, Natasha Morrison","submitted_at":"2018-06-07T21:01:54Z","abstract_excerpt":"Given a hypergraph $\\mathcal{H}$, the $\\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\\mathcal{H}$ in which $v$ is the unique healthy vertex. We say that the set of initially infected vertices percolates if every vertex of $\\mathcal{H}$ is eventually infected. We show that this process exhibits a sharp threshold when $\\mathcal{H}$ is a hypergraph obtained by randomly sampling hyperedges from an approximately $d$-regular $r$-uniform hypergraph satisfying some"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02903","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/1806.02903/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":"1806.02903","created_at":"2026-07-05T01:40:55.131964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02903v2","created_at":"2026-07-05T01:40:55.131964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02903","created_at":"2026-07-05T01:40:55.131964+00:00"},{"alias_kind":"pith_short_12","alias_value":"DD7LCJ36W6VP","created_at":"2026-07-05T01:40:55.131964+00:00"},{"alias_kind":"pith_short_16","alias_value":"DD7LCJ36W6VPJPQ5","created_at":"2026-07-05T01:40:55.131964+00:00"},{"alias_kind":"pith_short_8","alias_value":"DD7LCJ36","created_at":"2026-07-05T01:40:55.131964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.04559","citing_title":"The maximum length of $K_r$-Bootstrap Percolation","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T","json":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T.json","graph_json":"https://pith.science/api/pith-number/DD7LCJ36W6VPJPQ53EVF4B7Y5T/graph.json","events_json":"https://pith.science/api/pith-number/DD7LCJ36W6VPJPQ53EVF4B7Y5T/events.json","paper":"https://pith.science/paper/DD7LCJ36"},"agent_actions":{"view_html":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T","download_json":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T.json","view_paper":"https://pith.science/paper/DD7LCJ36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02903&json=true","fetch_graph":"https://pith.science/api/pith-number/DD7LCJ36W6VPJPQ53EVF4B7Y5T/graph.json","fetch_events":"https://pith.science/api/pith-number/DD7LCJ36W6VPJPQ53EVF4B7Y5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T/action/storage_attestation","attest_author":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T/action/author_attestation","sign_citation":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T/action/citation_signature","submit_replication":"https://pith.science/pith/DD7LCJ36W6VPJPQ53EVF4B7Y5T/action/replication_record"}},"created_at":"2026-07-05T01:40:55.131964+00:00","updated_at":"2026-07-05T01:40:55.131964+00:00"}