{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U3GZ27I7PZWFJGWGFNX3JIILTS","short_pith_number":"pith:U3GZ27I7","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"},"canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","source":{"kind":"arxiv","id":"1502.07289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07289","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07289v1","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07289","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"U3GZ27I7PZWF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3GZ27I7PZWFJGWG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3GZ27I7","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U3GZ27I7PZWFJGWGFNX3JIILTS","target":"record","payload":{"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"},"canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","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"},"source_kind":"arxiv","source_id":"1502.07289","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgySQNoSwsr46Lwkg3aRlHVPHVG7/I++fu6D8p/Mdn2dsQwkUGS3w+1SEJdbNqUD452ttAheGk+4ckTwzhe7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:11:47.587019Z"},"content_sha256":"f75565536e20b513d962476f296a2228acf8c7a67e2652c9d5043c19ea200c40","schema_version":"1.0","event_id":"sha256:f75565536e20b513d962476f296a2228acf8c7a67e2652c9d5043c19ea200c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U3GZ27I7PZWFJGWGFNX3JIILTS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A04yCPu798BNWHMLEo9IKPPwyvli7bOJEnFBLvC4zC7UAiQ5rrB97Cc2/zDyABK+RsgayGN91TVtjFaaCwAdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:11:47.587566Z"},"content_sha256":"40d7c80ad634a16c5f0cafac8acd04ea0f3655a1a0e5124be3ae537e820dfc00","schema_version":"1.0","event_id":"sha256:40d7c80ad634a16c5f0cafac8acd04ea0f3655a1a0e5124be3ae537e820dfc00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/bundle.json","state_url":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T19:11:47Z","links":{"resolver":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS","bundle":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/bundle.json","state":"https://pith.science/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3GZ27I7PZWFJGWGFNX3JIILTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U3GZ27I7PZWFJGWGFNX3JIILTS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9a7602a185d0da399220573798a86a4fedc06f159e79152ae539e5151614c7bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-25T18:31:15Z","title_canon_sha256":"cc1f1d2f5739864606e2e45ce3e5fd3954b1693ecdad67ac547e4b725f8b40f2"},"schema_version":"1.0","source":{"id":"1502.07289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07289","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07289v1","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07289","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"U3GZ27I7PZWF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3GZ27I7PZWFJGWG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3GZ27I7","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:40d7c80ad634a16c5f0cafac8acd04ea0f3655a1a0e5124be3ae537e820dfc00","target":"graph","created_at":"2026-05-18T02:26:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Christoph Koch, Mihyun Kang, Oliver Cooley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-25T18:31:15Z","title":"Threshold and hitting time for high-order connectivity in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07289","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f75565536e20b513d962476f296a2228acf8c7a67e2652c9d5043c19ea200c40","target":"record","created_at":"2026-05-18T02:26:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9a7602a185d0da399220573798a86a4fedc06f159e79152ae539e5151614c7bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-25T18:31:15Z","title_canon_sha256":"cc1f1d2f5739864606e2e45ce3e5fd3954b1693ecdad67ac547e4b725f8b40f2"},"schema_version":"1.0","source":{"id":"1502.07289","kind":"arxiv","version":1}},"canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6cd9d7d1f7e6c549ac62b6fb4a10b9c94120020d058de2823d52c516c0c6909","first_computed_at":"2026-05-18T02:26:11.388577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:11.388577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YtbYIgZlB3FtchyzBKn+b2bOBWWWAs9DpDNBzjxTffq6CdkL5evN0eHB0xeoy/wHXRrZeMtqNbPyCERiRERQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:11.389094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f75565536e20b513d962476f296a2228acf8c7a67e2652c9d5043c19ea200c40","sha256:40d7c80ad634a16c5f0cafac8acd04ea0f3655a1a0e5124be3ae537e820dfc00"],"state_sha256":"b1417ffe1c46dbcd93bb20a4221e1b7ab0e1310c2c8dce0952e15e12de5357cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lKa7QSL8RdOpStWWIOnySlbvkYKOua/656l7Tzrmc4SkUOrnCHxUKLl4/J8TMWJwRCXvt7Gwri6Fznl8l59Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:11:47.591495Z","bundle_sha256":"faa501428f0de668bb3b56fe04c17c44a8ec8581e2a8f4c80632ed00cf3bf279"}}