{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:44CPGT7Y66GGFXRQHO2ILF2VAI","short_pith_number":"pith:44CPGT7Y","schema_version":"1.0","canonical_sha256":"e704f34ff8f78c62de303bb4859755020edf0230291cfc6af2436b39fd3d599f","source":{"kind":"arxiv","id":"1603.07883","version":2},"attestation_state":"computed","paper":{"title":"Jigsaw percolation on random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Christoph Koch, Mihyun Kang, Oliver Cooley","submitted_at":"2016-03-25T11:20:59Z","abstract_excerpt":"The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of two graphs on a common vertex set. Our aim is to extend a result of Bollob\\'as, Riordan, Slivken, and Smith concerning this process to hypergraphs for a variety of possible definitions of connectedness. In particular, we determine the asymptotic order of the critical threshold probability for percolation when both hypergraphs are chosen binomially at random."},"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":"1603.07883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T11:20:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"fcb1ec493756757c2bd325b46861f9b32228acd98d5e3eeece313e866b0c715e","abstract_canon_sha256":"1d3cb3231a381ba84fff69cfb562f21eefa80e57dfdb5fab094d40296fa6fc40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:48.640898Z","signature_b64":"fCz1MbU0uXYaUyTOeLwA+MRRjpfsJrdtDtf2vHO5nPLt4x84ssprCTVGWiBSN6cy30TO2N2euVf3NmWLXqm4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e704f34ff8f78c62de303bb4859755020edf0230291cfc6af2436b39fd3d599f","last_reissued_at":"2026-05-18T00:37:48.640341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:48.640341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jigsaw percolation on random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Christoph Koch, Mihyun Kang, Oliver Cooley","submitted_at":"2016-03-25T11:20:59Z","abstract_excerpt":"The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of two graphs on a common vertex set. Our aim is to extend a result of Bollob\\'as, Riordan, Slivken, and Smith concerning this process to hypergraphs for a variety of possible definitions of connectedness. In particular, we determine the asymptotic order of the critical threshold probability for percolation when both hypergraphs are chosen binomially at random."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07883","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":""},"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":"1603.07883","created_at":"2026-05-18T00:37:48.640436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07883v2","created_at":"2026-05-18T00:37:48.640436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07883","created_at":"2026-05-18T00:37:48.640436+00:00"},{"alias_kind":"pith_short_12","alias_value":"44CPGT7Y66GG","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"44CPGT7Y66GGFXRQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"44CPGT7Y","created_at":"2026-05-18T12:29:58.707656+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/44CPGT7Y66GGFXRQHO2ILF2VAI","json":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI.json","graph_json":"https://pith.science/api/pith-number/44CPGT7Y66GGFXRQHO2ILF2VAI/graph.json","events_json":"https://pith.science/api/pith-number/44CPGT7Y66GGFXRQHO2ILF2VAI/events.json","paper":"https://pith.science/paper/44CPGT7Y"},"agent_actions":{"view_html":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI","download_json":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI.json","view_paper":"https://pith.science/paper/44CPGT7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07883&json=true","fetch_graph":"https://pith.science/api/pith-number/44CPGT7Y66GGFXRQHO2ILF2VAI/graph.json","fetch_events":"https://pith.science/api/pith-number/44CPGT7Y66GGFXRQHO2ILF2VAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI/action/storage_attestation","attest_author":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI/action/author_attestation","sign_citation":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI/action/citation_signature","submit_replication":"https://pith.science/pith/44CPGT7Y66GGFXRQHO2ILF2VAI/action/replication_record"}},"created_at":"2026-05-18T00:37:48.640436+00:00","updated_at":"2026-05-18T00:37:48.640436+00:00"}