{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3K4OKW3G5ENY4573DL4URVBJ5F","short_pith_number":"pith:3K4OKW3G","schema_version":"1.0","canonical_sha256":"dab8e55b66e91b8e77fb1af948d429e943f161667e1bdaab8eb7fa19ec51e045","source":{"kind":"arxiv","id":"1810.08107","version":1},"attestation_state":"computed","paper":{"title":"Subcritical random hypergraphs, high-order components, and hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Nicola Del Giudice, Oliver Cooley, Wenjie Fang","submitted_at":"2018-10-18T15:26:32Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.08107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T15:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"104a3b4b3ad309e6f92b7cfe3ab1df177922fde3bff6691af52c7ef213bdd254","abstract_canon_sha256":"d0c42ff698bcc9e84e068d707320e621736a72cdc70dfe79d57ae3750b8c2821"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:50.552462Z","signature_b64":"aTZBggNpmaDX4p3E1TSiqYHcigAqyMTfq8hPUkaPVdpAhIPSuLXvodL4nvRZaei1qx77FWEilj8WcXe23K6gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dab8e55b66e91b8e77fb1af948d429e943f161667e1bdaab8eb7fa19ec51e045","last_reissued_at":"2026-05-18T00:02:50.551932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:50.551932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subcritical random hypergraphs, high-order components, and hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Nicola Del Giudice, Oliver Cooley, Wenjie Fang","submitted_at":"2018-10-18T15:26:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08107","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.08107","created_at":"2026-05-18T00:02:50.552020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08107v1","created_at":"2026-05-18T00:02:50.552020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08107","created_at":"2026-05-18T00:02:50.552020+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K4OKW3G5ENY","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K4OKW3G5ENY4573","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K4OKW3G","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F","json":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F.json","graph_json":"https://pith.science/api/pith-number/3K4OKW3G5ENY4573DL4URVBJ5F/graph.json","events_json":"https://pith.science/api/pith-number/3K4OKW3G5ENY4573DL4URVBJ5F/events.json","paper":"https://pith.science/paper/3K4OKW3G"},"agent_actions":{"view_html":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F","download_json":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F.json","view_paper":"https://pith.science/paper/3K4OKW3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08107&json=true","fetch_graph":"https://pith.science/api/pith-number/3K4OKW3G5ENY4573DL4URVBJ5F/graph.json","fetch_events":"https://pith.science/api/pith-number/3K4OKW3G5ENY4573DL4URVBJ5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F/action/storage_attestation","attest_author":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F/action/author_attestation","sign_citation":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F/action/citation_signature","submit_replication":"https://pith.science/pith/3K4OKW3G5ENY4573DL4URVBJ5F/action/replication_record"}},"created_at":"2026-05-18T00:02:50.552020+00:00","updated_at":"2026-05-18T00:02:50.552020+00:00"}