{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VKMHGFRJZUFFX3F5VESFHU65ZI","short_pith_number":"pith:VKMHGFRJ","schema_version":"1.0","canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","source":{"kind":"arxiv","id":"2211.04758","version":2},"attestation_state":"computed","paper":{"title":"Spanning trees in sparse expanders","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Jie Han","submitted_at":"2022-11-09T09:22:52Z","abstract_excerpt":"Given integers $n\\ge \\Delta\\ge 2$, let $\\mathcal{T}(n, \\Delta)$ be the collection of all $n$-vertex trees with maximum degree at most $\\Delta$. A question of Alon, Krivelevich and Sudakov in 2007 asks for determining the best possible spectral gap condition forcing an $(n, d,\\lambda)$-graph to be $\\mathcal{T}(n, \\Delta)$-universal, namely, it contains all members of $\\mathcal{T}(n, \\Delta)$ as a subgraph simultaneously. In this paper we show that for sufficiently large integer $n$ and all $\\Delta\\in \\mathbb{N}$, every $(n, d,\\lambda)$-graph with \\[ \\lambda\\le\\frac{d}{2\\Delta^{5\\sqrt{\\log n}}} "},"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":"2211.04758","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-09T09:22:52Z","cross_cats_sorted":[],"title_canon_sha256":"1a45dc633ab75adb865af9be2ceb3bf0794c49bd845dfcd478ee5d17110b3f4d","abstract_canon_sha256":"4e7569462b141fa07968d75508640574b2b4687a36d056cbfdff896a31950c70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:17.238972Z","signature_b64":"YzZLu+8PcJXjWQAG3thDt7WcW339D2Do0YifY5tU2/j+HjUU2s1v20TfTe6bRPExzKt9XkdYp4ScipxgI1D/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","last_reissued_at":"2026-07-05T05:43:17.238486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:17.238486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees in sparse expanders","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Jie Han","submitted_at":"2022-11-09T09:22:52Z","abstract_excerpt":"Given integers $n\\ge \\Delta\\ge 2$, let $\\mathcal{T}(n, \\Delta)$ be the collection of all $n$-vertex trees with maximum degree at most $\\Delta$. A question of Alon, Krivelevich and Sudakov in 2007 asks for determining the best possible spectral gap condition forcing an $(n, d,\\lambda)$-graph to be $\\mathcal{T}(n, \\Delta)$-universal, namely, it contains all members of $\\mathcal{T}(n, \\Delta)$ as a subgraph simultaneously. In this paper we show that for sufficiently large integer $n$ and all $\\Delta\\in \\mathbb{N}$, every $(n, d,\\lambda)$-graph with \\[ \\lambda\\le\\frac{d}{2\\Delta^{5\\sqrt{\\log n}}} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04758","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.04758/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":"2211.04758","created_at":"2026-07-05T05:43:17.238542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04758v2","created_at":"2026-07-05T05:43:17.238542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04758","created_at":"2026-07-05T05:43:17.238542+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKMHGFRJZUFF","created_at":"2026-07-05T05:43:17.238542+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKMHGFRJZUFFX3F5","created_at":"2026-07-05T05:43:17.238542+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKMHGFRJ","created_at":"2026-07-05T05:43:17.238542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04783","citing_title":"Embedding loose trees in $k$-uniform hypergraphs","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI","json":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI.json","graph_json":"https://pith.science/api/pith-number/VKMHGFRJZUFFX3F5VESFHU65ZI/graph.json","events_json":"https://pith.science/api/pith-number/VKMHGFRJZUFFX3F5VESFHU65ZI/events.json","paper":"https://pith.science/paper/VKMHGFRJ"},"agent_actions":{"view_html":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI","download_json":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI.json","view_paper":"https://pith.science/paper/VKMHGFRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04758&json=true","fetch_graph":"https://pith.science/api/pith-number/VKMHGFRJZUFFX3F5VESFHU65ZI/graph.json","fetch_events":"https://pith.science/api/pith-number/VKMHGFRJZUFFX3F5VESFHU65ZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/action/storage_attestation","attest_author":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/action/author_attestation","sign_citation":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/action/citation_signature","submit_replication":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/action/replication_record"}},"created_at":"2026-07-05T05:43:17.238542+00:00","updated_at":"2026-07-05T05:43:17.238542+00:00"}