{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W4NC5CUVB6M5PLQ3DRRT5MALKG","short_pith_number":"pith:W4NC5CUV","schema_version":"1.0","canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","source":{"kind":"arxiv","id":"2608.06358","version":1},"attestation_state":"computed","paper":{"title":"Universality in random graphs via optimal linking systems: trees and beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii","submitted_at":"2026-08-06T17:55:25Z","abstract_excerpt":"We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant $C>1$ such that, with high probability, for every fixed constant $\\Delta$, the binomial random graph $G(n,C\\ln n/n)$ contains every $n$-vertex tree with maximum degree at most $\\Delta$. This answers a question of Montgomery (Advances in Mathematics, 2019). We also determine, for every $p$ satisfying $C\\ln n/n\\leq p=n^{-1+o(1)}$, the minimum girth $\\ell$ (up to an absolute multiplicative constant) for which with high probability $G(n,p)$ contain"},"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":"2608.06358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:55:25Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b5d7eefa4f2da8f78a53663b9c667f36a0e769edc6954f29152a81b1a61b44ca","abstract_canon_sha256":"66897e8dfb2b6f055296f85cc50109a327e73cc6b9a087bab60df0dd85d7a490"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T01:41:28.531327Z","signature_b64":"neji1pvKFD+axd8mBxRfR6tsIm7sdch/JRrv4g/w2YYLOx2MBdTD5t0r0ZucPuIG3f0HqIUtDB0zddglpHzRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","last_reissued_at":"2026-08-07T01:41:28.529697Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T01:41:28.529697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality in random graphs via optimal linking systems: trees and beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii","submitted_at":"2026-08-06T17:55:25Z","abstract_excerpt":"We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant $C>1$ such that, with high probability, for every fixed constant $\\Delta$, the binomial random graph $G(n,C\\ln n/n)$ contains every $n$-vertex tree with maximum degree at most $\\Delta$. This answers a question of Montgomery (Advances in Mathematics, 2019). We also determine, for every $p$ satisfying $C\\ln n/n\\leq p=n^{-1+o(1)}$, the minimum girth $\\ell$ (up to an absolute multiplicative constant) for which with high probability $G(n,p)$ contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06358","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.06358/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.06358","created_at":"2026-08-07T01:41:28.532294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06358v1","created_at":"2026-08-07T01:41:28.532294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06358","created_at":"2026-08-07T01:41:28.532294+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4NC5CUVB6M5","created_at":"2026-08-07T01:41:28.532294+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4NC5CUVB6M5PLQ3","created_at":"2026-08-07T01:41:28.532294+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4NC5CUV","created_at":"2026-08-07T01:41:28.532294+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/W4NC5CUVB6M5PLQ3DRRT5MALKG","json":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG.json","graph_json":"https://pith.science/api/pith-number/W4NC5CUVB6M5PLQ3DRRT5MALKG/graph.json","events_json":"https://pith.science/api/pith-number/W4NC5CUVB6M5PLQ3DRRT5MALKG/events.json","paper":"https://pith.science/paper/W4NC5CUV"},"agent_actions":{"view_html":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG","download_json":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG.json","view_paper":"https://pith.science/paper/W4NC5CUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06358&json=true","fetch_graph":"https://pith.science/api/pith-number/W4NC5CUVB6M5PLQ3DRRT5MALKG/graph.json","fetch_events":"https://pith.science/api/pith-number/W4NC5CUVB6M5PLQ3DRRT5MALKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/action/storage_attestation","attest_author":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/action/author_attestation","sign_citation":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/action/citation_signature","submit_replication":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/action/replication_record"}},"created_at":"2026-08-07T01:41:28.532294+00:00","updated_at":"2026-08-07T01:41:28.532294+00:00"}