{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EWINF5HOREV3IWHOLNKU5IKA4T","short_pith_number":"pith:EWINF5HO","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"},"canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","source":{"kind":"arxiv","id":"1612.06026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06026","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06026v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06026","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"EWINF5HOREV3","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWINF5HOREV3IWHO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWINF5HO","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EWINF5HOREV3IWHOLNKU5IKA4T","target":"record","payload":{"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"},"canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","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"},"source_kind":"arxiv","source_id":"1612.06026","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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjHJg/J2pw0b1VmYuHHSqDY1rfwwwGNuyQ0i+uFMBiYWT0w5Wv7Ov+ljTVR/Cp7ThbXHr0JY1NIRkOIRJ+oqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:30:34.415087Z"},"content_sha256":"9df132986b31d27ae443fc00fc064b34ce379fb3176f5e2f833ad05f5eba77ec","schema_version":"1.0","event_id":"sha256:9df132986b31d27ae443fc00fc064b34ce379fb3176f5e2f833ad05f5eba77ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EWINF5HOREV3IWHOLNKU5IKA4T","target":"graph","payload":{"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"},"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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4bJiH5ZG/KVl0gAb1FdSU7D3LB+iW2oXcz2hZBUyIxHue1rBGIoMsT0LOcX/JRJ0a0IEJwNQ2CWT/SNuTsNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:30:34.415565Z"},"content_sha256":"3afe455d26a9b9c8ea8777120e8336ddde10e81ca9fc4a2e87ba25acfcd4bac9","schema_version":"1.0","event_id":"sha256:3afe455d26a9b9c8ea8777120e8336ddde10e81ca9fc4a2e87ba25acfcd4bac9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/bundle.json","state_url":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWINF5HOREV3IWHOLNKU5IKA4T/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-05-31T23:30:34Z","links":{"resolver":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T","bundle":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/bundle.json","state":"https://pith.science/pith/EWINF5HOREV3IWHOLNKU5IKA4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWINF5HOREV3IWHOLNKU5IKA4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EWINF5HOREV3IWHOLNKU5IKA4T","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":"91cc20824f3c028a29eae3b44153bedaa03e72a82bbe8b0c11a54cb51f190983","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-19T02:13:12Z","title_canon_sha256":"051fb7f0f96c7c109eeeb9e3429d25b72714e174240af2c1d7f99e86f4ba6715"},"schema_version":"1.0","source":{"id":"1612.06026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06026","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06026v1","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06026","created_at":"2026-05-18T00:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"EWINF5HOREV3","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWINF5HOREV3IWHO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWINF5HO","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:3afe455d26a9b9c8ea8777120e8336ddde10e81ca9fc4a2e87ba25acfcd4bac9","target":"graph","created_at":"2026-05-18T00:54:46Z","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":"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 ","authors_text":"Asaf Ferber, Gal Kronenberg, Kyle Luh","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-19T02:13:12Z","title":"Optimal Threshold for a Random Graph to be 2-Universal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06026","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:9df132986b31d27ae443fc00fc064b34ce379fb3176f5e2f833ad05f5eba77ec","target":"record","created_at":"2026-05-18T00:54:46Z","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":"91cc20824f3c028a29eae3b44153bedaa03e72a82bbe8b0c11a54cb51f190983","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-19T02:13:12Z","title_canon_sha256":"051fb7f0f96c7c109eeeb9e3429d25b72714e174240af2c1d7f99e86f4ba6715"},"schema_version":"1.0","source":{"id":"1612.06026","kind":"arxiv","version":1}},"canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2590d2f4ee892bb458ee5b554ea140e4c01e91f9e94e5e870b8e87faf83bd1ba","first_computed_at":"2026-05-18T00:54:46.081361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:46.081361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yWjaAoUH6295PK0s4itPaac+r/FIcIuHWAfSvzLGB921UUkDC1RV0GyTlHq68w+U/w5MKURESGi1ALPayzE2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:46.081886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9df132986b31d27ae443fc00fc064b34ce379fb3176f5e2f833ad05f5eba77ec","sha256:3afe455d26a9b9c8ea8777120e8336ddde10e81ca9fc4a2e87ba25acfcd4bac9"],"state_sha256":"54b5e707fc95f499b7f9d93176e4a8dbe2996235eecb5169a5fbd7a84830c0a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHKr1F6iRWCoYz464+vP48hP9G8j7JxP3yszxDvJ9D3yEUjO2TBXCPu8ZzZ4LSK7gNafQcW2iq2FfUUtKYUGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:30:34.418504Z","bundle_sha256":"b0eb12af29d4660ad70288bcd75bfe6842dbfac65bd3a947efa7f893b7cf6ac8"}}