{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z4E3ZY53A7XSFDX2IWYZDHNZ4I","short_pith_number":"pith:Z4E3ZY53","canonical_record":{"source":{"id":"1704.05732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T13:48:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"7e0abc5b3f8b3e1ed994abec3030c2c6d04dfb60bf95f20cfcd28e87e1eb75e7","abstract_canon_sha256":"28747eda8c86c0d0d80ad432e9155515dff38ae72b79f63006dd57dbf94502ac"},"schema_version":"1.0"},"canonical_sha256":"cf09bce3bb07ef228efa45b1919db9e23262a5ee71e8d9f51afc727fb03f2823","source":{"kind":"arxiv","id":"1704.05732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05732","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05732v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05732","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z4E3ZY53A7XS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4E3ZY53A7XSFDX2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4E3ZY53","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z4E3ZY53A7XSFDX2IWYZDHNZ4I","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T13:48:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"7e0abc5b3f8b3e1ed994abec3030c2c6d04dfb60bf95f20cfcd28e87e1eb75e7","abstract_canon_sha256":"28747eda8c86c0d0d80ad432e9155515dff38ae72b79f63006dd57dbf94502ac"},"schema_version":"1.0"},"canonical_sha256":"cf09bce3bb07ef228efa45b1919db9e23262a5ee71e8d9f51afc727fb03f2823","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.665056Z","signature_b64":"tWBeuj7nO7GChzSjGcuf1g/Hv5G9zDwFZLk7VScBB64/zrE03ElVGQ3i3cDkrHS7bYSRleBnt4E9tS6B2yJNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf09bce3bb07ef228efa45b1919db9e23262a5ee71e8d9f51afc727fb03f2823","last_reissued_at":"2026-05-18T00:46:06.664544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.664544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05732","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-18T00:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIG1voD15mZjSP6DujUNAj5duHu3hpP4qdkAp+kxz0cdGCvaRWfW5987dKSqIcApmxNfsws4RBDr1GLXznFSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:00:15.093088Z"},"content_sha256":"a24410ab40f2f120f4b4e3c39e8247fc857551d28f43baa34f61d65a7a8369cd","schema_version":"1.0","event_id":"sha256:a24410ab40f2f120f4b4e3c39e8247fc857551d28f43baa34f61d65a7a8369cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z4E3ZY53A7XSFDX2IWYZDHNZ4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolution of high-order connected components in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Christoph Koch, Mihyun Kang, Oliver Cooley","submitted_at":"2017-04-19T13:48:27Z","abstract_excerpt":"We consider high-order connectivity in $k$-uniform hypergraphs defined as follows: 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 describe the evolution of $j$-connected components in the $k$-uniform binomial random hypergraph $\\mathcal{H}^k(n,p)$. In particular, we determine the asymptotic size of the giant component shortly after its emergence and establish the threshold at which the $\\mathcal{H}^k(n,p)$ becomes $j$-connected with high probability. We also obtain a hitting time result for the rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05732","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-18T00:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbbplbdgL7kAqiteKorYJ4oE3n1L4wczHdQ0KSmsNMy8EJ3RBHOgrXAhM5S2lMgtBT5dxLepb726EHxugvoNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:00:15.093885Z"},"content_sha256":"1a96e1beeafa60980635227b0ea6927f0093bb46e09593eb420efb0b13808b12","schema_version":"1.0","event_id":"sha256:1a96e1beeafa60980635227b0ea6927f0093bb46e09593eb420efb0b13808b12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/bundle.json","state_url":"https://pith.science/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/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-06-01T00:00:15Z","links":{"resolver":"https://pith.science/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I","bundle":"https://pith.science/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/bundle.json","state":"https://pith.science/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4E3ZY53A7XSFDX2IWYZDHNZ4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z4E3ZY53A7XSFDX2IWYZDHNZ4I","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":"28747eda8c86c0d0d80ad432e9155515dff38ae72b79f63006dd57dbf94502ac","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T13:48:27Z","title_canon_sha256":"7e0abc5b3f8b3e1ed994abec3030c2c6d04dfb60bf95f20cfcd28e87e1eb75e7"},"schema_version":"1.0","source":{"id":"1704.05732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05732","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05732v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05732","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z4E3ZY53A7XS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4E3ZY53A7XSFDX2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4E3ZY53","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:1a96e1beeafa60980635227b0ea6927f0093bb46e09593eb420efb0b13808b12","target":"graph","created_at":"2026-05-18T00:46:06Z","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 high-order connectivity in $k$-uniform hypergraphs defined as follows: 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 describe the evolution of $j$-connected components in the $k$-uniform binomial random hypergraph $\\mathcal{H}^k(n,p)$. In particular, we determine the asymptotic size of the giant component shortly after its emergence and establish the threshold at which the $\\mathcal{H}^k(n,p)$ becomes $j$-connected with high probability. We also obtain a hitting time result for the rela","authors_text":"Christoph Koch, Mihyun Kang, Oliver Cooley","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T13:48:27Z","title":"Evolution of high-order connected components in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05732","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:a24410ab40f2f120f4b4e3c39e8247fc857551d28f43baa34f61d65a7a8369cd","target":"record","created_at":"2026-05-18T00:46:06Z","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":"28747eda8c86c0d0d80ad432e9155515dff38ae72b79f63006dd57dbf94502ac","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T13:48:27Z","title_canon_sha256":"7e0abc5b3f8b3e1ed994abec3030c2c6d04dfb60bf95f20cfcd28e87e1eb75e7"},"schema_version":"1.0","source":{"id":"1704.05732","kind":"arxiv","version":1}},"canonical_sha256":"cf09bce3bb07ef228efa45b1919db9e23262a5ee71e8d9f51afc727fb03f2823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf09bce3bb07ef228efa45b1919db9e23262a5ee71e8d9f51afc727fb03f2823","first_computed_at":"2026-05-18T00:46:06.664544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:06.664544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWBeuj7nO7GChzSjGcuf1g/Hv5G9zDwFZLk7VScBB64/zrE03ElVGQ3i3cDkrHS7bYSRleBnt4E9tS6B2yJNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:06.665056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24410ab40f2f120f4b4e3c39e8247fc857551d28f43baa34f61d65a7a8369cd","sha256:1a96e1beeafa60980635227b0ea6927f0093bb46e09593eb420efb0b13808b12"],"state_sha256":"c7182b9d9a7b2f5fd796b77facf0e70804d6603e9d27ab777581064c3264ef20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n5XG+xxAi8tydXwIa3UJVxicsP8tj+tey+UKH7MhBJxYLlymTmPYhWnUzwCYFuU97jdfz2CDEs748MHl7jfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:00:15.098081Z","bundle_sha256":"febd1cdcf4e289f29cd46b75545bc1c8e9ca5ef6dfa24a3dd0ea0e9116319e4a"}}