{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3JYPMLTWJBTYDTABQJATCBP2LP","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":"05b34d5756f2c974fc1a53cf2cdba37d07837a1a6b69ac4d20124198469f3602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-08T09:49:01Z","title_canon_sha256":"ee053b9f9bc58be5de1880d561a4796ec106722b78e824239e71af728ec9999e"},"schema_version":"1.0","source":{"id":"2302.03966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03966","created_at":"2026-07-05T05:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03966v1","created_at":"2026-07-05T05:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03966","created_at":"2026-07-05T05:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"3JYPMLTWJBTY","created_at":"2026-07-05T05:39:59Z"},{"alias_kind":"pith_short_16","alias_value":"3JYPMLTWJBTYDTAB","created_at":"2026-07-05T05:39:59Z"},{"alias_kind":"pith_short_8","alias_value":"3JYPMLTW","created_at":"2026-07-05T05:39:59Z"}],"graph_snapshots":[{"event_id":"sha256:1525d84ed20ed5a88ffdc4a4c7e6e06d04377cc333b3cf86a145bd8b0aa0a02c","target":"graph","created_at":"2026-07-05T05:39:59Z","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/2302.03966/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for any $\\varepsilon>0$ and $\\Delta\\in\\mathbb{N}$, there exists $\\alpha>0$ such that for sufficiently large $n$, every $n$-vertex graph $G$ satisfying that $\\delta(G)\\geq\\varepsilon n$ and $e(X, Y)>0$ for every pair of disjoint vertex sets $X, Y\\subseteq V(G)$ of size $\\alpha n$ contains all spanning trees with maximum degree at most $\\Delta$. This strengthens a result of B\\\"ottcher et al.","authors_text":"Donglei Yang, Guanghui Wang, Jie Han, Jie Hu, Lidan Ping, Yi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-08T09:49:01Z","title":"Spanning trees in graphs without large bipartite holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03966","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:b76877beaf120b0fd2cd848a5a991079ab0313c1f88d498f3e63ec6fd718e639","target":"record","created_at":"2026-07-05T05:39:59Z","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":"05b34d5756f2c974fc1a53cf2cdba37d07837a1a6b69ac4d20124198469f3602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-08T09:49:01Z","title_canon_sha256":"ee053b9f9bc58be5de1880d561a4796ec106722b78e824239e71af728ec9999e"},"schema_version":"1.0","source":{"id":"2302.03966","kind":"arxiv","version":1}},"canonical_sha256":"da70f62e76486781cc0182413105fa5be628bac697d0f4af6615ec26678a50f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da70f62e76486781cc0182413105fa5be628bac697d0f4af6615ec26678a50f3","first_computed_at":"2026-07-05T05:39:59.755900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:39:59.755900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMPn/jWBHGD6uzg2KCSSQ2rEbjcKvBfuyeUBXnwzx7NampmGXYc4tnEJCA3CuPmWsMYAcdVGNqMVtfQ74wRDDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:39:59.756344Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.03966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76877beaf120b0fd2cd848a5a991079ab0313c1f88d498f3e63ec6fd718e639","sha256:1525d84ed20ed5a88ffdc4a4c7e6e06d04377cc333b3cf86a145bd8b0aa0a02c"],"state_sha256":"66f71a56a222aa615ace11b024ce3b8d5dcf1b64b51abb310285e9f6d1f32b48"}