{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6LHBYTAFO44XABXVLK5HCJZJRL","short_pith_number":"pith:6LHBYTAF","schema_version":"1.0","canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","source":{"kind":"arxiv","id":"2308.13874","version":1},"attestation_state":"computed","paper":{"title":"Sufficient conditions for $k$-factors and spanning trees of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C.T. Ng, Guoyan Ao, Jinjiang Yuan, Ruifang Liu, T.C.E. Cheng","submitted_at":"2023-08-26T13:17:25Z","abstract_excerpt":"For any integer $k\\geq1,$ a graph $G$ has a $k$-factor if it contains a $k$-regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$-cliques to guarantee the existence of a $k$-factor in a graph with minimum degree at least $\\delta$, which improves the sufficient condition of O \\cite{O2021} based on the number of edges. For any integer $k\\geq2,$ a spanning $k$-tree of a connected graph $G$ is a spanning tree in which every vertex has degree at most $k$. Motivated by the technique of Li and Ning \\cite{Li2016}, we present a tight spectral condition f"},"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":"2308.13874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-26T13:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"97cd6cd97dde76533260723b4da1bea1311a372c2ee2bb91d9f3b721a1bafce4","abstract_canon_sha256":"0eb8d4d12fc8cd7255fa252ec25b3a262380ab4266fa368d3f2e94c149172c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:06.575846Z","signature_b64":"cOsIEmdXgvFEbvAE+TpqEuB2rX1QDR0Hft2aJKrqZslg8AFChgWAD1te5AzllasjyBoLk+3lUMQBpQImkGS2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","last_reissued_at":"2026-07-05T06:45:06.575359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:06.575359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient conditions for $k$-factors and spanning trees of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C.T. Ng, Guoyan Ao, Jinjiang Yuan, Ruifang Liu, T.C.E. Cheng","submitted_at":"2023-08-26T13:17:25Z","abstract_excerpt":"For any integer $k\\geq1,$ a graph $G$ has a $k$-factor if it contains a $k$-regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$-cliques to guarantee the existence of a $k$-factor in a graph with minimum degree at least $\\delta$, which improves the sufficient condition of O \\cite{O2021} based on the number of edges. For any integer $k\\geq2,$ a spanning $k$-tree of a connected graph $G$ is a spanning tree in which every vertex has degree at most $k$. Motivated by the technique of Li and Ning \\cite{Li2016}, we present a tight spectral condition f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13874","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/2308.13874/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":"2308.13874","created_at":"2026-07-05T06:45:06.575422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13874v1","created_at":"2026-07-05T06:45:06.575422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13874","created_at":"2026-07-05T06:45:06.575422+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LHBYTAFO44X","created_at":"2026-07-05T06:45:06.575422+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LHBYTAFO44XABXV","created_at":"2026-07-05T06:45:06.575422+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LHBYTAF","created_at":"2026-07-05T06:45:06.575422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL","json":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL.json","graph_json":"https://pith.science/api/pith-number/6LHBYTAFO44XABXVLK5HCJZJRL/graph.json","events_json":"https://pith.science/api/pith-number/6LHBYTAFO44XABXVLK5HCJZJRL/events.json","paper":"https://pith.science/paper/6LHBYTAF"},"agent_actions":{"view_html":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL","download_json":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL.json","view_paper":"https://pith.science/paper/6LHBYTAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13874&json=true","fetch_graph":"https://pith.science/api/pith-number/6LHBYTAFO44XABXVLK5HCJZJRL/graph.json","fetch_events":"https://pith.science/api/pith-number/6LHBYTAFO44XABXVLK5HCJZJRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/action/storage_attestation","attest_author":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/action/author_attestation","sign_citation":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/action/citation_signature","submit_replication":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/action/replication_record"}},"created_at":"2026-07-05T06:45:06.575422+00:00","updated_at":"2026-07-05T06:45:06.575422+00:00"}