{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2NLPOXCLGTLV72HPV6FWGNCHX5","short_pith_number":"pith:2NLPOXCL","schema_version":"1.0","canonical_sha256":"d356f75c4b34d75fe8efaf8b633447bf41ae8067b007d74b31b4dba2fe58be08","source":{"kind":"arxiv","id":"1705.02819","version":2},"attestation_state":"computed","paper":{"title":"On degree sum conditions for 2-factors with a prescribed number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuya Chiba","submitted_at":"2017-05-08T10:51:55Z","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"},"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":"1705.02819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T10:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"d2c7956cec65078a26237c6bfd5f133d14e6f3f5572a583136ec555e96dad99f","abstract_canon_sha256":"478d7e3b5157c3f72194726ccf49e80261cef67e282292c4d4669d5cfd6cf034"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.463972Z","signature_b64":"fEuSP/jQ3ILvpH3/hAA5m8ylKAY7Whw6e8gyJUqDgJx9myA6Sn+LO+qxAXkae5Gmxp4LXtzwd6ODnInxN5PNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d356f75c4b34d75fe8efaf8b633447bf41ae8067b007d74b31b4dba2fe58be08","last_reissued_at":"2026-05-18T00:43:15.463475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.463475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On degree sum conditions for 2-factors with a prescribed number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuya Chiba","submitted_at":"2017-05-08T10:51:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02819","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1705.02819","created_at":"2026-05-18T00:43:15.463553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02819v2","created_at":"2026-05-18T00:43:15.463553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02819","created_at":"2026-05-18T00:43:15.463553+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NLPOXCLGTLV","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NLPOXCLGTLV72HP","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NLPOXCL","created_at":"2026-05-18T12:30:55.937587+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/2NLPOXCLGTLV72HPV6FWGNCHX5","json":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5.json","graph_json":"https://pith.science/api/pith-number/2NLPOXCLGTLV72HPV6FWGNCHX5/graph.json","events_json":"https://pith.science/api/pith-number/2NLPOXCLGTLV72HPV6FWGNCHX5/events.json","paper":"https://pith.science/paper/2NLPOXCL"},"agent_actions":{"view_html":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5","download_json":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5.json","view_paper":"https://pith.science/paper/2NLPOXCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02819&json=true","fetch_graph":"https://pith.science/api/pith-number/2NLPOXCLGTLV72HPV6FWGNCHX5/graph.json","fetch_events":"https://pith.science/api/pith-number/2NLPOXCLGTLV72HPV6FWGNCHX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5/action/storage_attestation","attest_author":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5/action/author_attestation","sign_citation":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5/action/citation_signature","submit_replication":"https://pith.science/pith/2NLPOXCLGTLV72HPV6FWGNCHX5/action/replication_record"}},"created_at":"2026-05-18T00:43:15.463553+00:00","updated_at":"2026-05-18T00:43:15.463553+00:00"}