{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W4NC5CUVB6M5PLQ3DRRT5MALKG","short_pith_number":"pith:W4NC5CUV","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"},"canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","source":{"kind":"arxiv","id":"2608.06358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06358","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06358v1","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06358","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"W4NC5CUVB6M5","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_16","alias_value":"W4NC5CUVB6M5PLQ3","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_8","alias_value":"W4NC5CUV","created_at":"2026-08-07T01:41:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W4NC5CUVB6M5PLQ3DRRT5MALKG","target":"record","payload":{"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"},"canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","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"},"source_kind":"arxiv","source_id":"2608.06358","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-08-07T01:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2nA+cqdLnGtNfgAKmP2CW6rhvScugbYJeQMUoOCks6RUNsl8keEBgz33oT2FUsiiuubNSvAg/OtBoBVjMh0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:42:03.246386Z"},"content_sha256":"6cd159e8ecbd2cc0f630ab3844c02e99bbd0935893e0eb6678de0aad6570fa3a","schema_version":"1.0","event_id":"sha256:6cd159e8ecbd2cc0f630ab3844c02e99bbd0935893e0eb6678de0aad6570fa3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W4NC5CUVB6M5PLQ3DRRT5MALKG","target":"graph","payload":{"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"},"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-08-07T01:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AddbkE9/WIPKXgdkCDr55ByebPPaHK6gMmw55x+vlKW690z0/R+Vq07qcP/kYGKTr0eC4y0Mwr1QL6aDVnZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:42:03.246873Z"},"content_sha256":"d70b782635f5bbea9661a70e9ca992a1e995de047ffb9a5686b6d5f83b52be77","schema_version":"1.0","event_id":"sha256:d70b782635f5bbea9661a70e9ca992a1e995de047ffb9a5686b6d5f83b52be77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/bundle.json","state_url":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/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-08-08T03:42:03Z","links":{"resolver":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG","bundle":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/bundle.json","state":"https://pith.science/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4NC5CUVB6M5PLQ3DRRT5MALKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W4NC5CUVB6M5PLQ3DRRT5MALKG","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":"66897e8dfb2b6f055296f85cc50109a327e73cc6b9a087bab60df0dd85d7a490","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:55:25Z","title_canon_sha256":"b5d7eefa4f2da8f78a53663b9c667f36a0e769edc6954f29152a81b1a61b44ca"},"schema_version":"1.0","source":{"id":"2608.06358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06358","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06358v1","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06358","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"W4NC5CUVB6M5","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_16","alias_value":"W4NC5CUVB6M5PLQ3","created_at":"2026-08-07T01:41:28Z"},{"alias_kind":"pith_short_8","alias_value":"W4NC5CUV","created_at":"2026-08-07T01:41:28Z"}],"graph_snapshots":[{"event_id":"sha256:d70b782635f5bbea9661a70e9ca992a1e995de047ffb9a5686b6d5f83b52be77","target":"graph","created_at":"2026-08-07T01:41:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.06358/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06358","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:6cd159e8ecbd2cc0f630ab3844c02e99bbd0935893e0eb6678de0aad6570fa3a","target":"record","created_at":"2026-08-07T01:41:28Z","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":"66897e8dfb2b6f055296f85cc50109a327e73cc6b9a087bab60df0dd85d7a490","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:55:25Z","title_canon_sha256":"b5d7eefa4f2da8f78a53663b9c667f36a0e769edc6954f29152a81b1a61b44ca"},"schema_version":"1.0","source":{"id":"2608.06358","kind":"arxiv","version":1}},"canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b71a2e8a950f99d7ae1b1c633eb00b51b62d38d2efce0c49dd35cf3822a742ea","first_computed_at":"2026-08-07T01:41:28.529697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T01:41:28.529697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"neji1pvKFD+axd8mBxRfR6tsIm7sdch/JRrv4g/w2YYLOx2MBdTD5t0r0ZucPuIG3f0HqIUtDB0zddglpHzRBQ==","signature_status":"signed_v1","signed_at":"2026-08-07T01:41:28.531327Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd159e8ecbd2cc0f630ab3844c02e99bbd0935893e0eb6678de0aad6570fa3a","sha256:d70b782635f5bbea9661a70e9ca992a1e995de047ffb9a5686b6d5f83b52be77"],"state_sha256":"5524debbce658ad5ddf2ea45d54a08139f51dca137138986752af01e3e4993cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bbzTfGvxkEsVvONfnk+Za7WbvRNmfOK0KuQ5f2+8H5okN1HRG9bXxY5aip+VLnEVEAtrRWy+IQu23+OxBoBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T03:42:03.250139Z","bundle_sha256":"44e7b0b94579f0013c5322fc9c5b113389f85fbb128abd4a29e481a863c1de24"}}