{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4HVXMFWNOBOKCGSUK5IRUZSYU2","short_pith_number":"pith:4HVXMFWN","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"},"canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","source":{"kind":"arxiv","id":"1412.6366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6366","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6366v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6366","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HVXMFWNOBOK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HVXMFWNOBOKCGSU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HVXMFWN","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4HVXMFWNOBOKCGSUK5IRUZSYU2","target":"record","payload":{"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"},"canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","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"},"source_kind":"arxiv","source_id":"1412.6366","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrXPhpoAtTqjHthd3ezNQ529nOSGXdMgc35Kp7+dkQqUdpUMs7rfBvRwHZtq/6hSqpZ5YwHKaAk+qH7HmbPFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:38:50.671401Z"},"content_sha256":"7a3324e469737cb12e16a285516a844f399c4a90b217efd6b1eac0324dbe1ef3","schema_version":"1.0","event_id":"sha256:7a3324e469737cb12e16a285516a844f399c4a90b217efd6b1eac0324dbe1ef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4HVXMFWNOBOKCGSUK5IRUZSYU2","target":"graph","payload":{"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"},"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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJDXM92fCOp91xn1SGmPyQ3p9vlLUIglX8pIy0t+TyKbJ30kMVzuM8arW5oTF/zf0SMHVzLzMmHkUu6QZygVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:38:50.671750Z"},"content_sha256":"c918a3159af819c6fb874a5c3ff3e8bc75054832b5e0c67e35aba6adae8b3872","schema_version":"1.0","event_id":"sha256:c918a3159af819c6fb874a5c3ff3e8bc75054832b5e0c67e35aba6adae8b3872"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/bundle.json","state_url":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/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-01T08:38:50Z","links":{"resolver":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2","bundle":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/bundle.json","state":"https://pith.science/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HVXMFWNOBOKCGSUK5IRUZSYU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4HVXMFWNOBOKCGSUK5IRUZSYU2","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":"4991c51fa787392dc8a5f65124bf74d2c074df97257b602ca6180cb40926af15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T15:02:37Z","title_canon_sha256":"76cc1d821addf4e4751ebb2d02b783a5bd9932627c2cb8c10177fa15ae7c9146"},"schema_version":"1.0","source":{"id":"1412.6366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6366","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6366v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6366","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HVXMFWNOBOK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HVXMFWNOBOKCGSU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HVXMFWN","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:c918a3159af819c6fb874a5c3ff3e8bc75054832b5e0c67e35aba6adae8b3872","target":"graph","created_at":"2026-05-18T02:30:53Z","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":"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 ","authors_text":"Mihyun Kang, Oliver Cooley, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T15:02:37Z","title":"Largest components in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6366","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:7a3324e469737cb12e16a285516a844f399c4a90b217efd6b1eac0324dbe1ef3","target":"record","created_at":"2026-05-18T02:30:53Z","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":"4991c51fa787392dc8a5f65124bf74d2c074df97257b602ca6180cb40926af15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T15:02:37Z","title_canon_sha256":"76cc1d821addf4e4751ebb2d02b783a5bd9932627c2cb8c10177fa15ae7c9146"},"schema_version":"1.0","source":{"id":"1412.6366","kind":"arxiv","version":1}},"canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1eb7616cd705ca11a5457511a6658a6b2c5cf5752bc0b7ed3f7db2f6c0f834b","first_computed_at":"2026-05-18T02:30:53.694512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:53.694512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvSqcE42RPtbP4hCVExm6VT5X03mV7+jwkh5q9MoMGvueJlMWaxsWMiWQG5AoizEbgwIYlpI71N9DeftmjhoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:53.694921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a3324e469737cb12e16a285516a844f399c4a90b217efd6b1eac0324dbe1ef3","sha256:c918a3159af819c6fb874a5c3ff3e8bc75054832b5e0c67e35aba6adae8b3872"],"state_sha256":"95eefdc3db19c95eb5bbbd0121e26313032f59d1abbd8355b48036f93dfec3b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7l6htRVsz0R9LoXT5nedCQMda7Mp0E5OeG/FQh9fgJ35WRxtNggmUXxSuCT+iA+HXDGcgqcS9E3e7SIF0A1uCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:38:50.673668Z","bundle_sha256":"9863a68636b03fb7194c824f0f4cf3d1dd0b15e10ab55f710a2c8a940d51ce05"}}