{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VKMHGFRJZUFFX3F5VESFHU65ZI","short_pith_number":"pith:VKMHGFRJ","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"},"canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","source":{"kind":"arxiv","id":"2211.04758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04758","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04758v2","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04758","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"VKMHGFRJZUFF","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_16","alias_value":"VKMHGFRJZUFFX3F5","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_8","alias_value":"VKMHGFRJ","created_at":"2026-07-05T05:43:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VKMHGFRJZUFFX3F5VESFHU65ZI","target":"record","payload":{"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"},"canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","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"},"source_kind":"arxiv","source_id":"2211.04758","source_version":2,"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-07-05T05:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cNxdjgvSbioyvUCFKRZAELXPfRmtGuajUThbRGpDNpnCRgXIPi8EnHLuab0K3o9TZNj4e6zFMS6g3VSo840Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:50:27.637146Z"},"content_sha256":"fd47db458b583a3f2096807df78c01351c4d790825d5bfb70798109fbd91ac3f","schema_version":"1.0","event_id":"sha256:fd47db458b583a3f2096807df78c01351c4d790825d5bfb70798109fbd91ac3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VKMHGFRJZUFFX3F5VESFHU65ZI","target":"graph","payload":{"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"},"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-07-05T05:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gifr+wIrjfo4U0CGsE4Wclz2gaR5sMwpuXyO8K9Oa+gzkXe+552GpNIzhdVHphMfeTAR7JO8ndT1JUYKaoZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:50:27.637721Z"},"content_sha256":"7d6fb1ce9a03dfbc92705023e87a46dda95ceb3a9255a5a5fb179a41935e3151","schema_version":"1.0","event_id":"sha256:7d6fb1ce9a03dfbc92705023e87a46dda95ceb3a9255a5a5fb179a41935e3151"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/bundle.json","state_url":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/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-21T07:50:27Z","links":{"resolver":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI","bundle":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/bundle.json","state":"https://pith.science/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKMHGFRJZUFFX3F5VESFHU65ZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VKMHGFRJZUFFX3F5VESFHU65ZI","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":"4e7569462b141fa07968d75508640574b2b4687a36d056cbfdff896a31950c70","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-09T09:22:52Z","title_canon_sha256":"1a45dc633ab75adb865af9be2ceb3bf0794c49bd845dfcd478ee5d17110b3f4d"},"schema_version":"1.0","source":{"id":"2211.04758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04758","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04758v2","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04758","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"VKMHGFRJZUFF","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_16","alias_value":"VKMHGFRJZUFFX3F5","created_at":"2026-07-05T05:43:17Z"},{"alias_kind":"pith_short_8","alias_value":"VKMHGFRJ","created_at":"2026-07-05T05:43:17Z"}],"graph_snapshots":[{"event_id":"sha256:7d6fb1ce9a03dfbc92705023e87a46dda95ceb3a9255a5a5fb179a41935e3151","target":"graph","created_at":"2026-07-05T05:43:17Z","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/2211.04758/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}}} ","authors_text":"Donglei Yang, Jie Han","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-09T09:22:52Z","title":"Spanning trees in sparse expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04758","kind":"arxiv","version":2},"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:fd47db458b583a3f2096807df78c01351c4d790825d5bfb70798109fbd91ac3f","target":"record","created_at":"2026-07-05T05:43:17Z","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":"4e7569462b141fa07968d75508640574b2b4687a36d056cbfdff896a31950c70","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-09T09:22:52Z","title_canon_sha256":"1a45dc633ab75adb865af9be2ceb3bf0794c49bd845dfcd478ee5d17110b3f4d"},"schema_version":"1.0","source":{"id":"2211.04758","kind":"arxiv","version":2}},"canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa98731629cd0a5becbda92453d3ddca3aa40f8a5de8ac9710b5d72e205640fd","first_computed_at":"2026-07-05T05:43:17.238486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:43:17.238486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzZLu+8PcJXjWQAG3thDt7WcW339D2Do0YifY5tU2/j+HjUU2s1v20TfTe6bRPExzKt9XkdYp4ScipxgI1D/AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:43:17.238972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd47db458b583a3f2096807df78c01351c4d790825d5bfb70798109fbd91ac3f","sha256:7d6fb1ce9a03dfbc92705023e87a46dda95ceb3a9255a5a5fb179a41935e3151"],"state_sha256":"c7f1a22f254847de5fb5ef3769f4cb049b6a0a3828414cb56859f4970b38fd07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgHz9hxS1yKqtFdLAkmsJiX+7GvlmP6pJBDHyIGWsVp9xaioY9qoKGcPvlquybrVCsrjN2Q46+3GFOaf+1V7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T07:50:27.643225Z","bundle_sha256":"e00c9fdba124dde81c77f185d44ce962e79ff57b66d5fcc486b12037e3c367a6"}}