{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MJLCOTG3JOUZ5ARWWQUZ5463TM","short_pith_number":"pith:MJLCOTG3","schema_version":"1.0","canonical_sha256":"6256274cdb4ba99e8236b4299ef3db9b33bcfd19c1220019e3cef9aecb150030","source":{"kind":"arxiv","id":"2311.03185","version":1},"attestation_state":"computed","paper":{"title":"Spanning trees in pseudorandom graphs via sorting networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Joseph Hyde, Mat\\'ias Pavez-Sign\\'e, Natasha Morrison","submitted_at":"2023-11-06T15:25:13Z","abstract_excerpt":"We show that $(n,d,\\lambda)$-graphs with $\\lambda=O(d/\\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form $\\lambda=d/\\exp{(O(\\sqrt{\\log n}))}$, and makes progress towards a problem of Alon, Krivelevich, and Sudakov from 2007. Our proof relies on the existence of sorting networks of logarithmic depth, as given by a celebrated construction of Ajtai, Koml\\'os and Szemer\\'edi. Using this construction, we show that the classical vertex-disjoint paths problem can be solved for a set of ve"},"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":"2311.03185","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-06T15:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"770c0e3ff2dfff72f41876a3bb6275c294fabc904d60d2bce7e33995f4ae7c36","abstract_canon_sha256":"18335531afd23744cfa2081270ac3cceb79caca962a9b4540a77aee836eaf5db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:37.611308Z","signature_b64":"7Bq0w0gXW22rD0jzXeqeq4DnPZOUbISOC1uOXGJGn1S7vvr1anekx9AOaxlBkRiEKiL8N2pWMDcp2lrNNqjxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6256274cdb4ba99e8236b4299ef3db9b33bcfd19c1220019e3cef9aecb150030","last_reissued_at":"2026-07-05T07:09:37.610798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:37.610798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees in pseudorandom graphs via sorting networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Joseph Hyde, Mat\\'ias Pavez-Sign\\'e, Natasha Morrison","submitted_at":"2023-11-06T15:25:13Z","abstract_excerpt":"We show that $(n,d,\\lambda)$-graphs with $\\lambda=O(d/\\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form $\\lambda=d/\\exp{(O(\\sqrt{\\log n}))}$, and makes progress towards a problem of Alon, Krivelevich, and Sudakov from 2007. Our proof relies on the existence of sorting networks of logarithmic depth, as given by a celebrated construction of Ajtai, Koml\\'os and Szemer\\'edi. Using this construction, we show that the classical vertex-disjoint paths problem can be solved for a set of ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03185","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/2311.03185/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":"2311.03185","created_at":"2026-07-05T07:09:37.610858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03185v1","created_at":"2026-07-05T07:09:37.610858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03185","created_at":"2026-07-05T07:09:37.610858+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJLCOTG3JOUZ","created_at":"2026-07-05T07:09:37.610858+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJLCOTG3JOUZ5ARW","created_at":"2026-07-05T07:09:37.610858+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJLCOTG3","created_at":"2026-07-05T07:09:37.610858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14286","citing_title":"Embedding edge-colored graphs in expanders with roll-back","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM","json":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM.json","graph_json":"https://pith.science/api/pith-number/MJLCOTG3JOUZ5ARWWQUZ5463TM/graph.json","events_json":"https://pith.science/api/pith-number/MJLCOTG3JOUZ5ARWWQUZ5463TM/events.json","paper":"https://pith.science/paper/MJLCOTG3"},"agent_actions":{"view_html":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM","download_json":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM.json","view_paper":"https://pith.science/paper/MJLCOTG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03185&json=true","fetch_graph":"https://pith.science/api/pith-number/MJLCOTG3JOUZ5ARWWQUZ5463TM/graph.json","fetch_events":"https://pith.science/api/pith-number/MJLCOTG3JOUZ5ARWWQUZ5463TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM/action/storage_attestation","attest_author":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM/action/author_attestation","sign_citation":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM/action/citation_signature","submit_replication":"https://pith.science/pith/MJLCOTG3JOUZ5ARWWQUZ5463TM/action/replication_record"}},"created_at":"2026-07-05T07:09:37.610858+00:00","updated_at":"2026-07-05T07:09:37.610858+00:00"}