{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BWDXGD5VRWKQV7JUFWHSDDHGD2","short_pith_number":"pith:BWDXGD5V","canonical_record":{"source":{"id":"1803.02809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T18:36:42Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b7ba80cbf27c180c67caa664f6ddb2c698c2898348b531706c3578ea1c032053","abstract_canon_sha256":"81fb00399adf8896f99c2e537857d738e225ef25b43e1b0661cf75c444a3256d"},"schema_version":"1.0"},"canonical_sha256":"0d87730fb58d950afd342d8f218ce61e9d9780eadcf856c51c68c70bb31f656e","source":{"kind":"arxiv","id":"1803.02809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02809","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02809v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02809","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"BWDXGD5VRWKQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWDXGD5VRWKQV7JU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWDXGD5V","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BWDXGD5VRWKQV7JUFWHSDDHGD2","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T18:36:42Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b7ba80cbf27c180c67caa664f6ddb2c698c2898348b531706c3578ea1c032053","abstract_canon_sha256":"81fb00399adf8896f99c2e537857d738e225ef25b43e1b0661cf75c444a3256d"},"schema_version":"1.0"},"canonical_sha256":"0d87730fb58d950afd342d8f218ce61e9d9780eadcf856c51c68c70bb31f656e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.177639Z","signature_b64":"tLQqlTxU0XxZ5dURGPVBERMZLdt13KNUA1RBf/oy9grh7RT7tT6fb6+7vNh/pNG7h/ASHjNSwkbM3sRuH+G6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d87730fb58d950afd342d8f218ce61e9d9780eadcf856c51c68c70bb31f656e","last_reissued_at":"2026-05-18T00:21:49.177063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.177063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02809","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiMGn1K6/aTTilD9+YS1N/gWbtU/1g+df2qyRpf/I3CE4dXBbUUmouYMbWB4x0NZ7D1J7NY4Jwk7yH6fl4wnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:32:00.664867Z"},"content_sha256":"cafdbff8a2ad4e93862680df75f50fa19504e1c4e76f499f7d63c387c9e9bc92","schema_version":"1.0","event_id":"sha256:cafdbff8a2ad4e93862680df75f50fa19504e1c4e76f499f7d63c387c9e9bc92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BWDXGD5VRWKQV7JUFWHSDDHGD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The size of the giant component in random hypergraphs: a short proof","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":"2018-03-07T18:36:42Z","abstract_excerpt":"We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\\ge 2$ and $1\\le j \\le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges from one to the other such that consecutive edges intersect in at least $j$ vertices.\n  We prove that certain collections of $j$-sets constructed during a breadth-first search process on $j$-components in a random $k$-uniform hypergraph are reasonably regularly distributed with high probability. We use this property to provide a short proof of the asymptotic s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02809","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TDp0SWMx1nQYeiGEBMfJL6PYY0BSUCnfHO5SqfFQyWaDg4u6r6LTuOxJ7s8bZ3k7cXq1g+WtwLzvnX8UpciCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:32:00.665649Z"},"content_sha256":"46a756edf12405450f07c3b5cc2fd631510d6398c8b90a2a497f65c403489ce9","schema_version":"1.0","event_id":"sha256:46a756edf12405450f07c3b5cc2fd631510d6398c8b90a2a497f65c403489ce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/bundle.json","state_url":"https://pith.science/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/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-01T06:32:00Z","links":{"resolver":"https://pith.science/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2","bundle":"https://pith.science/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/bundle.json","state":"https://pith.science/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWDXGD5VRWKQV7JUFWHSDDHGD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BWDXGD5VRWKQV7JUFWHSDDHGD2","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":"81fb00399adf8896f99c2e537857d738e225ef25b43e1b0661cf75c444a3256d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T18:36:42Z","title_canon_sha256":"b7ba80cbf27c180c67caa664f6ddb2c698c2898348b531706c3578ea1c032053"},"schema_version":"1.0","source":{"id":"1803.02809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02809","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02809v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02809","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"BWDXGD5VRWKQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWDXGD5VRWKQV7JU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWDXGD5V","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:46a756edf12405450f07c3b5cc2fd631510d6398c8b90a2a497f65c403489ce9","target":"graph","created_at":"2026-05-18T00:21:49Z","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 connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\\ge 2$ and $1\\le j \\le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges from one to the other such that consecutive edges intersect in at least $j$ vertices.\n  We prove that certain collections of $j$-sets constructed during a breadth-first search process on $j$-components in a random $k$-uniform hypergraph are reasonably regularly distributed with high probability. We use this property to provide a short proof of the asymptotic s","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":"2018-03-07T18:36:42Z","title":"The size of the giant component in random hypergraphs: a short proof"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02809","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:cafdbff8a2ad4e93862680df75f50fa19504e1c4e76f499f7d63c387c9e9bc92","target":"record","created_at":"2026-05-18T00:21:49Z","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":"81fb00399adf8896f99c2e537857d738e225ef25b43e1b0661cf75c444a3256d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T18:36:42Z","title_canon_sha256":"b7ba80cbf27c180c67caa664f6ddb2c698c2898348b531706c3578ea1c032053"},"schema_version":"1.0","source":{"id":"1803.02809","kind":"arxiv","version":1}},"canonical_sha256":"0d87730fb58d950afd342d8f218ce61e9d9780eadcf856c51c68c70bb31f656e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d87730fb58d950afd342d8f218ce61e9d9780eadcf856c51c68c70bb31f656e","first_computed_at":"2026-05-18T00:21:49.177063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.177063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tLQqlTxU0XxZ5dURGPVBERMZLdt13KNUA1RBf/oy9grh7RT7tT6fb6+7vNh/pNG7h/ASHjNSwkbM3sRuH+G6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.177639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cafdbff8a2ad4e93862680df75f50fa19504e1c4e76f499f7d63c387c9e9bc92","sha256:46a756edf12405450f07c3b5cc2fd631510d6398c8b90a2a497f65c403489ce9"],"state_sha256":"c61fff20d33fd2bf82aa29dda056d3388a8c6ef7d51e194112f28d67b1616b56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9fXrZNt3G4bbMJeF4WCyhWsSZPQ601xIvivxVc3lwx0WPGNim+G96m67967OrEZW7gQE69oKPzUaDAJRFLSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:32:00.669571Z","bundle_sha256":"9975f4629e677549296115c111235995c6d2c495278651ee5d3ab2c41dc54d9b"}}