{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UBJVYADDT7ZM5EUPE4F36NUXDI","short_pith_number":"pith:UBJVYADD","schema_version":"1.0","canonical_sha256":"a0535c00639ff2ce928f270bbf36971a3492b828419504f5c72f7e16a261d49a","source":{"kind":"arxiv","id":"1406.5793","version":3},"attestation_state":"computed","paper":{"title":"On Erd\\H{o}s-Ko-Rado for random hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, Jeff Kahn","submitted_at":"2014-06-23T02:19:31Z","abstract_excerpt":"Denote by $\\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\\{1... n\\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a fixed $\\varepsilon >0$ such that if $n=2k+1$ and $p> 1-\\varepsilon$, then w.h.p. (that is, with probability tending to 1 as $k\\rightarrow \\infty$), $\\mathcal{H}_k (n,p)$ has the \"Erd\\H{o}s-Ko-Rado property.\" We also mention a similar random version of Sperner's Theorem."},"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":"1406.5793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-23T02:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"7ebf438412e569a8d31e4c1b96611466e210c8d90d7facf1362513257cfa4fbd","abstract_canon_sha256":"ee1c41233a62582ca1ba45e2bfebd998e0e89fc16872fc9e6040f6350ac08624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:44.927540Z","signature_b64":"yZts60s33BiFQam4G4wsmJjfnl9/sPD465YBy6Xiis9z7olU9I5YIORqLftaVhxaMl87FlFMpsSD++TBiYn4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0535c00639ff2ce928f270bbf36971a3492b828419504f5c72f7e16a261d49a","last_reissued_at":"2026-05-18T01:08:44.926863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:44.926863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Erd\\H{o}s-Ko-Rado for random hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, Jeff Kahn","submitted_at":"2014-06-23T02:19:31Z","abstract_excerpt":"Denote by $\\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\\{1... n\\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a fixed $\\varepsilon >0$ such that if $n=2k+1$ and $p> 1-\\varepsilon$, then w.h.p. (that is, with probability tending to 1 as $k\\rightarrow \\infty$), $\\mathcal{H}_k (n,p)$ has the \"Erd\\H{o}s-Ko-Rado property.\" We also mention a similar random version of Sperner's Theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5793","kind":"arxiv","version":3},"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":"1406.5793","created_at":"2026-05-18T01:08:44.926931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5793v3","created_at":"2026-05-18T01:08:44.926931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5793","created_at":"2026-05-18T01:08:44.926931+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBJVYADDT7ZM","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBJVYADDT7ZM5EUP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBJVYADD","created_at":"2026-05-18T12:28:52.271510+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/UBJVYADDT7ZM5EUPE4F36NUXDI","json":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI.json","graph_json":"https://pith.science/api/pith-number/UBJVYADDT7ZM5EUPE4F36NUXDI/graph.json","events_json":"https://pith.science/api/pith-number/UBJVYADDT7ZM5EUPE4F36NUXDI/events.json","paper":"https://pith.science/paper/UBJVYADD"},"agent_actions":{"view_html":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI","download_json":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI.json","view_paper":"https://pith.science/paper/UBJVYADD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5793&json=true","fetch_graph":"https://pith.science/api/pith-number/UBJVYADDT7ZM5EUPE4F36NUXDI/graph.json","fetch_events":"https://pith.science/api/pith-number/UBJVYADDT7ZM5EUPE4F36NUXDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI/action/storage_attestation","attest_author":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI/action/author_attestation","sign_citation":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI/action/citation_signature","submit_replication":"https://pith.science/pith/UBJVYADDT7ZM5EUPE4F36NUXDI/action/replication_record"}},"created_at":"2026-05-18T01:08:44.926931+00:00","updated_at":"2026-05-18T01:08:44.926931+00:00"}