{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U3GZ27I7PZWFJGWGFNX3JIILTS","short_pith_number":"pith:U3GZ27I7","schema_version":"1.0","canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","source":{"kind":"arxiv","id":"1502.07289","version":1},"attestation_state":"computed","paper":{"title":"Threshold and hitting time for high-order connectivity in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Koch, Mihyun Kang, Oliver Cooley","submitted_at":"2015-02-25T18:31:15Z","abstract_excerpt":"We consider the following definition of connectivity in $k$-uniform hypergraphs: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We determine the threshold at which the random $k$-uniform hypergraph with edge probability $p$ becomes $j$-connected with high probability. We also deduce a hitting time result for the random hypergraph process -- the hypergraph becomes $j$-connected at exactly the moment when the last isolated $j$-set disappears. This generalises well-known results for graphs."},"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":"1502.07289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-25T18:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"cc1f1d2f5739864606e2e45ce3e5fd3954b1693ecdad67ac547e4b725f8b40f2","abstract_canon_sha256":"9a7602a185d0da399220573798a86a4fedc06f159e79152ae539e5151614c7bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:11.389094Z","signature_b64":"YtbYIgZlB3FtchyzBKn+b2bOBWWWAs9DpDNBzjxTffq6CdkL5evN0eHB0xeoy/wHXRrZeMtqNbPyCERiRERQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","last_reissued_at":"2026-05-18T02:26:11.388577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:11.388577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold and hitting time for high-order connectivity in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Koch, Mihyun Kang, Oliver Cooley","submitted_at":"2015-02-25T18:31:15Z","abstract_excerpt":"We consider the following definition of connectivity in $k$-uniform hypergraphs: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We determine the threshold at which the random $k$-uniform hypergraph with edge probability $p$ becomes $j$-connected with high probability. We also deduce a hitting time result for the random hypergraph process -- the hypergraph becomes $j$-connected at exactly the moment when the last isolated $j$-set disappears. This generalises well-known results for graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07289","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":"1502.07289","created_at":"2026-05-18T02:26:11.388666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07289v1","created_at":"2026-05-18T02:26:11.388666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07289","created_at":"2026-05-18T02:26:11.388666+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3GZ27I7PZWF","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3GZ27I7PZWFJGWG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3GZ27I7","created_at":"2026-05-18T12:29:44.643036+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/U3GZ27I7PZWFJGWGFNX3JIILTS","json":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS.json","graph_json":"https://pith.science/api/pith-number/U3GZ27I7PZWFJGWGFNX3JIILTS/graph.json","events_json":"https://pith.science/api/pith-number/U3GZ27I7PZWFJGWGFNX3JIILTS/events.json","paper":"https://pith.science/paper/U3GZ27I7"},"agent_actions":{"view_html":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS","download_json":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS.json","view_paper":"https://pith.science/paper/U3GZ27I7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07289&json=true","fetch_graph":"https://pith.science/api/pith-number/U3GZ27I7PZWFJGWGFNX3JIILTS/graph.json","fetch_events":"https://pith.science/api/pith-number/U3GZ27I7PZWFJGWGFNX3JIILTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/action/storage_attestation","attest_author":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/action/author_attestation","sign_citation":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/action/citation_signature","submit_replication":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/action/replication_record"}},"created_at":"2026-05-18T02:26:11.388666+00:00","updated_at":"2026-05-18T02:26:11.388666+00:00"}