{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3K4OKW3G5ENY4573DL4URVBJ5F","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":"d0c42ff698bcc9e84e068d707320e621736a72cdc70dfe79d57ae3750b8c2821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T15:26:32Z","title_canon_sha256":"104a3b4b3ad309e6f92b7cfe3ab1df177922fde3bff6691af52c7ef213bdd254"},"schema_version":"1.0","source":{"id":"1810.08107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08107","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08107v1","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08107","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"3K4OKW3G5ENY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3K4OKW3G5ENY4573","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3K4OKW3G","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:590c586788eda0320f2767248b3d258d57347bc715fa148b483840015c939269","target":"graph","created_at":"2026-05-18T00:02:50Z","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 the binomial random graph $\\mathcal{G}(n,p)$, when $p$ changes from $(1-\\varepsilon)/n$ (subcritical case) to $1/n$ and then to $(1+\\varepsilon)/n$ (supercritical case) for $\\varepsilon>0$, with high probability the order of the largest component increases smoothly from $O(\\varepsilon^{-2}\\log(\\varepsilon^3 n))$ to $\\Theta(n^{2/3})$ and then to $(1 \\pm o(1)) 2 \\varepsilon n$.\n  As a natural generalisation of random graphs and connectedness, we consider the binomial random $k$-uniform hypergraph $\\mathcal{H}^k(n,p)$ (where each $k$-tuple of vertices is present as a hyperedge with probability","authors_text":"Mihyun Kang, Nicola Del Giudice, Oliver Cooley, Wenjie Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T15:26:32Z","title":"Subcritical random hypergraphs, high-order components, and hypertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08107","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:d45ff6315fc77956ae7e2f128a8ebca8d2f102ae6bce211bdbc084aecda6adca","target":"record","created_at":"2026-05-18T00:02:50Z","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":"d0c42ff698bcc9e84e068d707320e621736a72cdc70dfe79d57ae3750b8c2821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T15:26:32Z","title_canon_sha256":"104a3b4b3ad309e6f92b7cfe3ab1df177922fde3bff6691af52c7ef213bdd254"},"schema_version":"1.0","source":{"id":"1810.08107","kind":"arxiv","version":1}},"canonical_sha256":"dab8e55b66e91b8e77fb1af948d429e943f161667e1bdaab8eb7fa19ec51e045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dab8e55b66e91b8e77fb1af948d429e943f161667e1bdaab8eb7fa19ec51e045","first_computed_at":"2026-05-18T00:02:50.551932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:50.551932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTZBggNpmaDX4p3E1TSiqYHcigAqyMTfq8hPUkaPVdpAhIPSuLXvodL4nvRZaei1qx77FWEilj8WcXe23K6gAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:50.552462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d45ff6315fc77956ae7e2f128a8ebca8d2f102ae6bce211bdbc084aecda6adca","sha256:590c586788eda0320f2767248b3d258d57347bc715fa148b483840015c939269"],"state_sha256":"4dbc0fe69e76126ebcf5336e108afba40590e0b4bba63c8d503c3ffebcc939f2"}