{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BHGHBU3QXPPTZWNLYDNPSUHOGR","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":"ce0a06f9f7eea9bf3e39c4d9ff20a93056aa2b9358b920eaef785c82bd2d92e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T02:48:45Z","title_canon_sha256":"004be933ec25fdb86c02096313525019eae29766ea39806d99cfda0fd325930a"},"schema_version":"1.0","source":{"id":"2507.03264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03264","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03264v1","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03264","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"BHGHBU3QXPPT","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"BHGHBU3QXPPTZWNL","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"BHGHBU3Q","created_at":"2026-07-05T11:31:55Z"}],"graph_snapshots":[{"event_id":"sha256:12e80f10538d2e319921efdc1da894439c65c8a075f1c9f1aa5b3c295e856a37","target":"graph","created_at":"2026-07-05T11:31:55Z","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/2507.03264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a connected graph on $n$ vertices and at most $n(1+\\epsilon)$ edges with bounded maximum degree, and $F$ a graph on $n$ vertices with minimum degree at least $n-k$, where $\\epsilon$ is a constant depending on $k$. In this paper, we prove that $F$ contains $G$ as a spanning subgraph provided $n\\ge 6k^3$, by establishing tight bounds for the Ramsey number $r(G,K_{1,k})$, where $K_{1,k}$ is a star on $k+1$ vertices. Our result generalizes and refines the work of Erd\\H{o}s, Faudree, Rousseau, and Schelp (JCT-B, 1982), who established the corresponding result for $G$ being a tree. Moreov","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T02:48:45Z","title":"Minimum degree and sparse connected spanning subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03264","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:b4eb8e710a2d62fdb5bbf2f97a52fb277bcad77505e76e28042c55365f9603dc","target":"record","created_at":"2026-07-05T11:31:55Z","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":"ce0a06f9f7eea9bf3e39c4d9ff20a93056aa2b9358b920eaef785c82bd2d92e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T02:48:45Z","title_canon_sha256":"004be933ec25fdb86c02096313525019eae29766ea39806d99cfda0fd325930a"},"schema_version":"1.0","source":{"id":"2507.03264","kind":"arxiv","version":1}},"canonical_sha256":"09cc70d370bbdf3cd9abc0daf950ee3461ef2b423331a543f4dadc60716d03dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09cc70d370bbdf3cd9abc0daf950ee3461ef2b423331a543f4dadc60716d03dc","first_computed_at":"2026-07-05T11:31:55.790647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:55.790647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ZtdyEIQRC2JvspjufFhhCyYglOftXmBQRsRifARYEeTmrPGoUEMPa2A2FBfUmnOTaHjQGJStv+FVi0B+CKKBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:55.791128Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.03264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4eb8e710a2d62fdb5bbf2f97a52fb277bcad77505e76e28042c55365f9603dc","sha256:12e80f10538d2e319921efdc1da894439c65c8a075f1c9f1aa5b3c295e856a37"],"state_sha256":"ccca2676559618272572d15884b7240c920975cacf11e2120c813161472ff0a0"}