{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AEKBDEEMDOLRQFARPNIOTVG3JX","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":"e01da408004af84929254b2b29be890c8b6521014fdc81664aea7ab58e29106b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-18T23:16:21Z","title_canon_sha256":"5bb0515e97572a93336225b1cf2e03da4c2ced696720314900cb80cdac0dcfbb"},"schema_version":"1.0","source":{"id":"1503.05612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05612","created_at":"2026-05-18T01:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05612v2","created_at":"2026-05-18T01:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05612","created_at":"2026-05-18T01:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"AEKBDEEMDOLR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AEKBDEEMDOLRQFAR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AEKBDEEM","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:f4805ff78d9b24f9b6a00b54d96458df312105f87e6153bc9ffa69646f4600fb","target":"graph","created_at":"2026-05-18T01:21:37Z","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":"A graph $G$ is said to be $\\mathcal H(n,\\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\\Delta$. It is known that for any $\\varepsilon > 0$ and any natural number $\\Delta$ there exists $c > 0$ such that the random graph $G(n,p)$ is asymptotically almost surely $\\mathcal H((1-\\varepsilon)n,\\Delta)$-universal for $p \\geq c (\\log n/n)^{1/\\Delta}$. Bypassing this natural boundary, we show that for $\\Delta \\geq 3$ the same conclusion holds when $p = \\omega\\left(n^{-\\frac{1}{\\Delta-1}}\\log^5 n\\right)$.","authors_text":"Asaf Ferber, David Conlon, Nemanja \\v{S}kori\\'c, Rajko Nenadov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-18T23:16:21Z","title":"Almost-spanning universality in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05612","kind":"arxiv","version":2},"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:08a0847a2931c3cde75ea7baadf70f8c9f1d01184bd2c45589e48615cca0f7b5","target":"record","created_at":"2026-05-18T01:21:37Z","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":"e01da408004af84929254b2b29be890c8b6521014fdc81664aea7ab58e29106b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-18T23:16:21Z","title_canon_sha256":"5bb0515e97572a93336225b1cf2e03da4c2ced696720314900cb80cdac0dcfbb"},"schema_version":"1.0","source":{"id":"1503.05612","kind":"arxiv","version":2}},"canonical_sha256":"011411908c1b971814117b50e9d4db4de79a7727ae422db63640373266bfd1c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"011411908c1b971814117b50e9d4db4de79a7727ae422db63640373266bfd1c2","first_computed_at":"2026-05-18T01:21:37.584541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:37.584541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Ed0QcX6ibHrmU/ZoUwTFJYbJ48MhYfizcQBsmwSHZM/uuMS479niHlAQRxx4UgPnaxDs2No8urKuE7/uT0fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:37.585008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08a0847a2931c3cde75ea7baadf70f8c9f1d01184bd2c45589e48615cca0f7b5","sha256:f4805ff78d9b24f9b6a00b54d96458df312105f87e6153bc9ffa69646f4600fb"],"state_sha256":"330eb65c936c74bf71c02f66b439c8741060cf08824f9cbc93ba91b689a17876"}