{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4HVXMFWNOBOKCGSUK5IRUZSYU2","short_pith_number":"pith:4HVXMFWN","schema_version":"1.0","canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","source":{"kind":"arxiv","id":"1412.6366","version":1},"attestation_state":"computed","paper":{"title":"Largest components in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oliver Cooley, Yury Person","submitted_at":"2014-12-19T15:02:37Z","abstract_excerpt":"In this paper we consider $j$-tuple-connected components in random $k$-uniform hypergraphs (the $j$-tuple-connectedness relation can be defined by letting two $j$-sets be connected if they lie in a common edge and consider the transitive closure; the case $j=1$ corresponds to the common notion of vertex-connectedness). We determine that the existence of a $j$-tuple-connected component containing $\\Theta (n^j)$ $j$-sets in random $k$-uniform hypergraphs undergoes a phase transition and show that the threshold occurs at edge probability $\\tfrac{(k-j)!}{\\binom{k}{j}-1}n^{j-k}$. Our proof extends "},"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":"1412.6366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T15:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"76cc1d821addf4e4751ebb2d02b783a5bd9932627c2cb8c10177fa15ae7c9146","abstract_canon_sha256":"4991c51fa787392dc8a5f65124bf74d2c074df97257b602ca6180cb40926af15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.694921Z","signature_b64":"jvSqcE42RPtbP4hCVExm6VT5X03mV7+jwkh5q9MoMGvueJlMWaxsWMiWQG5AoizEbgwIYlpI71N9DeftmjhoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","last_reissued_at":"2026-05-18T02:30:53.694512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.694512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Largest components in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oliver Cooley, Yury Person","submitted_at":"2014-12-19T15:02:37Z","abstract_excerpt":"In this paper we consider $j$-tuple-connected components in random $k$-uniform hypergraphs (the $j$-tuple-connectedness relation can be defined by letting two $j$-sets be connected if they lie in a common edge and consider the transitive closure; the case $j=1$ corresponds to the common notion of vertex-connectedness). We determine that the existence of a $j$-tuple-connected component containing $\\Theta (n^j)$ $j$-sets in random $k$-uniform hypergraphs undergoes a phase transition and show that the threshold occurs at edge probability $\\tfrac{(k-j)!}{\\binom{k}{j}-1}n^{j-k}$. Our proof extends "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6366","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":"1412.6366","created_at":"2026-05-18T02:30:53.694571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6366v1","created_at":"2026-05-18T02:30:53.694571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6366","created_at":"2026-05-18T02:30:53.694571+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HVXMFWNOBOK","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HVXMFWNOBOKCGSU","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HVXMFWN","created_at":"2026-05-18T12:28:14.216126+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/4HVXMFWNOBOKCGSUK5IRUZSYU2","json":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2.json","graph_json":"https://pith.science/api/pith-number/4HVXMFWNOBOKCGSUK5IRUZSYU2/graph.json","events_json":"https://pith.science/api/pith-number/4HVXMFWNOBOKCGSUK5IRUZSYU2/events.json","paper":"https://pith.science/paper/4HVXMFWN"},"agent_actions":{"view_html":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2","download_json":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2.json","view_paper":"https://pith.science/paper/4HVXMFWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6366&json=true","fetch_graph":"https://pith.science/api/pith-number/4HVXMFWNOBOKCGSUK5IRUZSYU2/graph.json","fetch_events":"https://pith.science/api/pith-number/4HVXMFWNOBOKCGSUK5IRUZSYU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/action/storage_attestation","attest_author":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/action/author_attestation","sign_citation":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/action/citation_signature","submit_replication":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/action/replication_record"}},"created_at":"2026-05-18T02:30:53.694571+00:00","updated_at":"2026-05-18T02:30:53.694571+00:00"}