{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6LHBYTAFO44XABXVLK5HCJZJRL","short_pith_number":"pith:6LHBYTAF","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"},"canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","source":{"kind":"arxiv","id":"2308.13874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13874","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13874v1","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13874","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"6LHBYTAFO44X","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_16","alias_value":"6LHBYTAFO44XABXV","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_8","alias_value":"6LHBYTAF","created_at":"2026-07-05T06:45:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6LHBYTAFO44XABXVLK5HCJZJRL","target":"record","payload":{"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"},"canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","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"},"source_kind":"arxiv","source_id":"2308.13874","source_version":1,"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-05T06:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJ+rHoS69PHq7QC4ShRZi8w8b1njLSQqc+IdZl8IZVEreij2QAqgPCa67n4zjwAqMJvCl4fTew6IT+9kWEIVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:40:37.301514Z"},"content_sha256":"85c42a54c7c800e88cc4c40279f690b3fe714d29268641e1134c2ba3c3e46310","schema_version":"1.0","event_id":"sha256:85c42a54c7c800e88cc4c40279f690b3fe714d29268641e1134c2ba3c3e46310"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6LHBYTAFO44XABXVLK5HCJZJRL","target":"graph","payload":{"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"},"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-05T06:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZwoU33sGIyyqgKiflgfnncjcuvBazVoRNDx9r/24XMuwYP/lZ7Zf5cEV6RW1JkIiomiBPBqiFbssYCJhRozDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:40:37.302027Z"},"content_sha256":"35cd1c78c57babf91dee388607537348c4426ead4fdd713220872dadb2b33a66","schema_version":"1.0","event_id":"sha256:35cd1c78c57babf91dee388607537348c4426ead4fdd713220872dadb2b33a66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/bundle.json","state_url":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LHBYTAFO44XABXVLK5HCJZJRL/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-19T07:40:37Z","links":{"resolver":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL","bundle":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/bundle.json","state":"https://pith.science/pith/6LHBYTAFO44XABXVLK5HCJZJRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LHBYTAFO44XABXVLK5HCJZJRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6LHBYTAFO44XABXVLK5HCJZJRL","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":"0eb8d4d12fc8cd7255fa252ec25b3a262380ab4266fa368d3f2e94c149172c85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-26T13:17:25Z","title_canon_sha256":"97cd6cd97dde76533260723b4da1bea1311a372c2ee2bb91d9f3b721a1bafce4"},"schema_version":"1.0","source":{"id":"2308.13874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13874","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13874v1","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13874","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"6LHBYTAFO44X","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_16","alias_value":"6LHBYTAFO44XABXV","created_at":"2026-07-05T06:45:06Z"},{"alias_kind":"pith_short_8","alias_value":"6LHBYTAF","created_at":"2026-07-05T06:45:06Z"}],"graph_snapshots":[{"event_id":"sha256:35cd1c78c57babf91dee388607537348c4426ead4fdd713220872dadb2b33a66","target":"graph","created_at":"2026-07-05T06:45:06Z","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/2308.13874/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"C.T. Ng, Guoyan Ao, Jinjiang Yuan, Ruifang Liu, T.C.E. Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-26T13:17:25Z","title":"Sufficient conditions for $k$-factors and spanning trees of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13874","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:85c42a54c7c800e88cc4c40279f690b3fe714d29268641e1134c2ba3c3e46310","target":"record","created_at":"2026-07-05T06:45:06Z","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":"0eb8d4d12fc8cd7255fa252ec25b3a262380ab4266fa368d3f2e94c149172c85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-26T13:17:25Z","title_canon_sha256":"97cd6cd97dde76533260723b4da1bea1311a372c2ee2bb91d9f3b721a1bafce4"},"schema_version":"1.0","source":{"id":"2308.13874","kind":"arxiv","version":1}},"canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2ce1c4c0577397006f55aba7127298ae1c5baa846fc4c188adfc18beee5fab7","first_computed_at":"2026-07-05T06:45:06.575359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:45:06.575359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOsIEmdXgvFEbvAE+TpqEuB2rX1QDR0Hft2aJKrqZslg8AFChgWAD1te5AzllasjyBoLk+3lUMQBpQImkGS2CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:45:06.575846Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c42a54c7c800e88cc4c40279f690b3fe714d29268641e1134c2ba3c3e46310","sha256:35cd1c78c57babf91dee388607537348c4426ead4fdd713220872dadb2b33a66"],"state_sha256":"e2d7da3eeb492ac858a1de3c39498e872d4ec29a4d4c7fe4ac2eaee1e1f2f99a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EppViFbqCGC5CL8On/E48LUe5zHY96KhIgtBjGntvgvZfhEpgIYb6ZZlc54Z8Q7UYat5NkMk74ZdqcELYEZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:40:37.307358Z","bundle_sha256":"a4a49a4debad1edeef5818b5302e4668d18644f0372329b5fe22b3acd2c3f04f"}}