{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EWINF5HOREV3IWHOLNKU5IKA4T","short_pith_number":"pith:EWINF5HO","schema_version":"1.0","canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","source":{"kind":"arxiv","id":"1612.06026","version":1},"attestation_state":"computed","paper":{"title":"Optimal Threshold for a Random Graph to be 2-Universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Gal Kronenberg, Kyle Luh","submitted_at":"2016-12-19T02:13:12Z","abstract_excerpt":"For a family of graphs $\\mathcal{F}$, a graph $G$ is $\\mathcal{F}$-universal if $G$ contains every graph in $\\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most two, $\\mathcal{H}(n,2)$, we prove that there exists a constant $C$ such that for $p \\geq C \\left( \\frac{\\log n}{n^2} \\right)^{\\frac{1}{3}}$, the binomial random graph $G(n,p)$ is typically $\\mathcal{H}(n,2)$-universal. This bound is optimal up to the constant factor as illustrated in the seminal work of Johansson, Kahn, and Vu for triangle factors. Our result "},"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":"1612.06026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-19T02:13:12Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"051fb7f0f96c7c109eeeb9e3429d25b72714e174240af2c1d7f99e86f4ba6715","abstract_canon_sha256":"91cc20824f3c028a29eae3b44153bedaa03e72a82bbe8b0c11a54cb51f190983"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.081886Z","signature_b64":"yWjaAoUH6295PK0s4itPaac+r/FIcIuHWAfSvzLGB921UUkDC1RV0GyTlHq68w+U/w5MKURESGi1ALPayzE2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","last_reissued_at":"2026-05-18T00:54:46.081361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.081361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Threshold for a Random Graph to be 2-Universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Gal Kronenberg, Kyle Luh","submitted_at":"2016-12-19T02:13:12Z","abstract_excerpt":"For a family of graphs $\\mathcal{F}$, a graph $G$ is $\\mathcal{F}$-universal if $G$ contains every graph in $\\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most two, $\\mathcal{H}(n,2)$, we prove that there exists a constant $C$ such that for $p \\geq C \\left( \\frac{\\log n}{n^2} \\right)^{\\frac{1}{3}}$, the binomial random graph $G(n,p)$ is typically $\\mathcal{H}(n,2)$-universal. This bound is optimal up to the constant factor as illustrated in the seminal work of Johansson, Kahn, and Vu for triangle factors. Our result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06026","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":"1612.06026","created_at":"2026-05-18T00:54:46.081466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06026v1","created_at":"2026-05-18T00:54:46.081466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06026","created_at":"2026-05-18T00:54:46.081466+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWINF5HOREV3","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWINF5HOREV3IWHO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWINF5HO","created_at":"2026-05-18T12:30:15.759754+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/EWINF5HOREV3IWHOLNKU5IKA4T","json":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T.json","graph_json":"https://pith.science/api/pith-number/EWINF5HOREV3IWHOLNKU5IKA4T/graph.json","events_json":"https://pith.science/api/pith-number/EWINF5HOREV3IWHOLNKU5IKA4T/events.json","paper":"https://pith.science/paper/EWINF5HO"},"agent_actions":{"view_html":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T","download_json":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T.json","view_paper":"https://pith.science/paper/EWINF5HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06026&json=true","fetch_graph":"https://pith.science/api/pith-number/EWINF5HOREV3IWHOLNKU5IKA4T/graph.json","fetch_events":"https://pith.science/api/pith-number/EWINF5HOREV3IWHOLNKU5IKA4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/action/storage_attestation","attest_author":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/action/author_attestation","sign_citation":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/action/citation_signature","submit_replication":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/action/replication_record"}},"created_at":"2026-05-18T00:54:46.081466+00:00","updated_at":"2026-05-18T00:54:46.081466+00:00"}