{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2NLPOXCLGTLV72HPV6FWGNCHX5","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":"478d7e3b5157c3f72194726ccf49e80261cef67e282292c4d4669d5cfd6cf034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T10:51:55Z","title_canon_sha256":"d2c7956cec65078a26237c6bfd5f133d14e6f3f5572a583136ec555e96dad99f"},"schema_version":"1.0","source":{"id":"1705.02819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02819","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02819v2","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02819","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"2NLPOXCLGTLV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NLPOXCLGTLV72HP","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NLPOXCL","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8d62c61979f01734bc3400344996bbd824b140205af58799990381e75229ffec","target":"graph","created_at":"2026-05-18T00:43:15Z","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"},"paper":{"abstract_excerpt":"For a vertex subset $X$ of a graph $G$, let $\\Delta_{t}(X)$ be the maximum value of the degree sums of the subsets of $X$ of size $t$. In this paper, we prove the following result: Let $k$ be a positive integer, and let $G$ be an $m$-connected graph of order $n \\ge 5k - 2$. If $\\Delta_{2}(X) \\ge n$ for every independent set $X$ of size $\\lceil m/k \\rceil+1$ in $G$, then $G$ has a 2-factor with exactly $k$ cycles. This is a common generalization of the results obtained by Brandt et al. [Degree conditions for 2-factors, J. Graph Theory 24 (1997) 165-173] and Yamashita [On degree sum conditions f","authors_text":"Shuya Chiba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T10:51:55Z","title":"On degree sum conditions for 2-factors with a prescribed number of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02819","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:7479fc7119f5ada5ab2c62096ada1230075629528322a680501af2c8e0131e93","target":"record","created_at":"2026-05-18T00:43:15Z","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":"478d7e3b5157c3f72194726ccf49e80261cef67e282292c4d4669d5cfd6cf034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T10:51:55Z","title_canon_sha256":"d2c7956cec65078a26237c6bfd5f133d14e6f3f5572a583136ec555e96dad99f"},"schema_version":"1.0","source":{"id":"1705.02819","kind":"arxiv","version":2}},"canonical_sha256":"d356f75c4b34d75fe8efaf8b633447bf41ae8067b007d74b31b4dba2fe58be08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d356f75c4b34d75fe8efaf8b633447bf41ae8067b007d74b31b4dba2fe58be08","first_computed_at":"2026-05-18T00:43:15.463475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:15.463475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fEuSP/jQ3ILvpH3/hAA5m8ylKAY7Whw6e8gyJUqDgJx9myA6Sn+LO+qxAXkae5Gmxp4LXtzwd6ODnInxN5PNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:15.463972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7479fc7119f5ada5ab2c62096ada1230075629528322a680501af2c8e0131e93","sha256:8d62c61979f01734bc3400344996bbd824b140205af58799990381e75229ffec"],"state_sha256":"13f867735e2ab36adf4458243ee30e14127062d51f3928d78be9ffd3d75a6b6b"}