{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AEKBDEEMDOLRQFARPNIOTVG3JX","short_pith_number":"pith:AEKBDEEM","schema_version":"1.0","canonical_sha256":"011411908c1b971814117b50e9d4db4de79a7727ae422db63640373266bfd1c2","source":{"kind":"arxiv","id":"1503.05612","version":2},"attestation_state":"computed","paper":{"title":"Almost-spanning universality in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, David Conlon, Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2015-03-18T23:16:21Z","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)$."},"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":"1503.05612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-18T23:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"5bb0515e97572a93336225b1cf2e03da4c2ced696720314900cb80cdac0dcfbb","abstract_canon_sha256":"e01da408004af84929254b2b29be890c8b6521014fdc81664aea7ab58e29106b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:37.585008Z","signature_b64":"9Ed0QcX6ibHrmU/ZoUwTFJYbJ48MhYfizcQBsmwSHZM/uuMS479niHlAQRxx4UgPnaxDs2No8urKuE7/uT0fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011411908c1b971814117b50e9d4db4de79a7727ae422db63640373266bfd1c2","last_reissued_at":"2026-05-18T01:21:37.584541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:37.584541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-spanning universality in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, David Conlon, Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2015-03-18T23:16:21Z","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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05612","kind":"arxiv","version":2},"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":"1503.05612","created_at":"2026-05-18T01:21:37.584602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05612v2","created_at":"2026-05-18T01:21:37.584602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05612","created_at":"2026-05-18T01:21:37.584602+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEKBDEEMDOLR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEKBDEEMDOLRQFAR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEKBDEEM","created_at":"2026-05-18T12:29:10.953037+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/AEKBDEEMDOLRQFARPNIOTVG3JX","json":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX.json","graph_json":"https://pith.science/api/pith-number/AEKBDEEMDOLRQFARPNIOTVG3JX/graph.json","events_json":"https://pith.science/api/pith-number/AEKBDEEMDOLRQFARPNIOTVG3JX/events.json","paper":"https://pith.science/paper/AEKBDEEM"},"agent_actions":{"view_html":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX","download_json":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX.json","view_paper":"https://pith.science/paper/AEKBDEEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05612&json=true","fetch_graph":"https://pith.science/api/pith-number/AEKBDEEMDOLRQFARPNIOTVG3JX/graph.json","fetch_events":"https://pith.science/api/pith-number/AEKBDEEMDOLRQFARPNIOTVG3JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX/action/storage_attestation","attest_author":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX/action/author_attestation","sign_citation":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX/action/citation_signature","submit_replication":"https://pith.science/pith/AEKBDEEMDOLRQFARPNIOTVG3JX/action/replication_record"}},"created_at":"2026-05-18T01:21:37.584602+00:00","updated_at":"2026-05-18T01:21:37.584602+00:00"}