{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZBFTCX7SL5CF2QA5VHW5AOCSI7","short_pith_number":"pith:ZBFTCX7S","schema_version":"1.0","canonical_sha256":"c84b315ff25f445d401da9edd0385247d5e9d2b042bece620bf7880a3c61f20e","source":{"kind":"arxiv","id":"1605.07608","version":1},"attestation_state":"computed","paper":{"title":"On randomly generated intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Mikl\\'os Ruszink\\'o, Ryan R. Martin, Tom Bohman","submitted_at":"2016-05-24T00:45:54Z","abstract_excerpt":"Let $c$ be a positive constant. We show that if $r=\\lfloor cn^{1/3}\\rfloor$ and the members of ${[n]\\choose r}$ are chosen sequentially at random to form an intersecting hypergraph then with limiting probability $(1+c^3)^{-1}$, as $n\\to\\infty$, the resulting family will be of maximum size ${n-1\\choose r-1}$."},"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":"1605.07608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T00:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"f229f77dd74735f2b2d9818d048891c466100c4b628233ee1741ec5d166e5a56","abstract_canon_sha256":"caa17e56208320b8ed06832e77ead409bd5768486103f79600630ccb4be13f24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.418125Z","signature_b64":"dXVT+KGi2UEfa/pz4jFfODTRpfWrHk7Yc6z0/2rLCThz0wuKtYeVQI/90QbZO/1VSSw1p86q2cCXrU39jojVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84b315ff25f445d401da9edd0385247d5e9d2b042bece620bf7880a3c61f20e","last_reissued_at":"2026-05-18T01:13:45.417641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.417641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On randomly generated intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Mikl\\'os Ruszink\\'o, Ryan R. Martin, Tom Bohman","submitted_at":"2016-05-24T00:45:54Z","abstract_excerpt":"Let $c$ be a positive constant. We show that if $r=\\lfloor cn^{1/3}\\rfloor$ and the members of ${[n]\\choose r}$ are chosen sequentially at random to form an intersecting hypergraph then with limiting probability $(1+c^3)^{-1}$, as $n\\to\\infty$, the resulting family will be of maximum size ${n-1\\choose r-1}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07608","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":"1605.07608","created_at":"2026-05-18T01:13:45.417711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07608v1","created_at":"2026-05-18T01:13:45.417711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07608","created_at":"2026-05-18T01:13:45.417711+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBFTCX7SL5CF","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBFTCX7SL5CF2QA5","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBFTCX7S","created_at":"2026-05-18T12:30:53.716459+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/ZBFTCX7SL5CF2QA5VHW5AOCSI7","json":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7.json","graph_json":"https://pith.science/api/pith-number/ZBFTCX7SL5CF2QA5VHW5AOCSI7/graph.json","events_json":"https://pith.science/api/pith-number/ZBFTCX7SL5CF2QA5VHW5AOCSI7/events.json","paper":"https://pith.science/paper/ZBFTCX7S"},"agent_actions":{"view_html":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7","download_json":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7.json","view_paper":"https://pith.science/paper/ZBFTCX7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07608&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBFTCX7SL5CF2QA5VHW5AOCSI7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBFTCX7SL5CF2QA5VHW5AOCSI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7/action/storage_attestation","attest_author":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7/action/author_attestation","sign_citation":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7/action/citation_signature","submit_replication":"https://pith.science/pith/ZBFTCX7SL5CF2QA5VHW5AOCSI7/action/replication_record"}},"created_at":"2026-05-18T01:13:45.417711+00:00","updated_at":"2026-05-18T01:13:45.417711+00:00"}