{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KKDT7Y6W2Y242B2MVXWAMZ6HW6","short_pith_number":"pith:KKDT7Y6W","schema_version":"1.0","canonical_sha256":"52873fe3d6d635cd074cadec0667c7b79088f969846a4348c335abc6a46d72d9","source":{"kind":"arxiv","id":"1905.00239","version":1},"attestation_state":"computed","paper":{"title":"An Ore-type condition for existence of two disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Maoqun Wang","submitted_at":"2019-05-01T09:52:56Z","abstract_excerpt":"Let $n_{1}$ and $n_{2}$ be two integers with $n_{1},n_{2}\\geq3$ and $G$ a graph of order $n=n_{1}+n_{2}$. As a generalization of Ore's degree condition for the existence of Hamilton cycle in $G$, El-Zahar proved that if $\\delta(G)\\geq \\left\\lceil\\frac{n_{1}}{2}\\right\\rceil+\\left\\lceil\\frac{n_{2}}{2}\\right\\rceil$ then $G$ contains two disjoint cycles of length $n_{1}$ and $n_{2}$. Recently, Yan et. al considered the problem by extending the degree condition to degree sum condition and proved that if $d(u)+d(v)\\geq n+4$ for any pair of non-adjacent vertices $u$ and $v$ of $G$, then $G$ contains "},"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":"1905.00239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-01T09:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"4321c102f47faed440529cfd258d4f100fb272458166b40d361d65f5b1b2af4c","abstract_canon_sha256":"84e0b10e1d7473e8f4b3a8000ddc1c1efd6642c13481952ff178e3b0a0a277ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:13.375497Z","signature_b64":"mfeITK1eSybhPkJ1R+8zntxUMv6hU/NKtYXNzlTTe+TATGFPNk59945EfK2KC2jzL0NnzHdwZfHXiq/9ZGe7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52873fe3d6d635cd074cadec0667c7b79088f969846a4348c335abc6a46d72d9","last_reissued_at":"2026-05-17T23:47:13.375108Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:13.375108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Ore-type condition for existence of two disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Maoqun Wang","submitted_at":"2019-05-01T09:52:56Z","abstract_excerpt":"Let $n_{1}$ and $n_{2}$ be two integers with $n_{1},n_{2}\\geq3$ and $G$ a graph of order $n=n_{1}+n_{2}$. As a generalization of Ore's degree condition for the existence of Hamilton cycle in $G$, El-Zahar proved that if $\\delta(G)\\geq \\left\\lceil\\frac{n_{1}}{2}\\right\\rceil+\\left\\lceil\\frac{n_{2}}{2}\\right\\rceil$ then $G$ contains two disjoint cycles of length $n_{1}$ and $n_{2}$. Recently, Yan et. al considered the problem by extending the degree condition to degree sum condition and proved that if $d(u)+d(v)\\geq n+4$ for any pair of non-adjacent vertices $u$ and $v$ of $G$, then $G$ contains "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00239","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":""},"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":"1905.00239","created_at":"2026-05-17T23:47:13.375167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00239v1","created_at":"2026-05-17T23:47:13.375167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00239","created_at":"2026-05-17T23:47:13.375167+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKDT7Y6W2Y24","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKDT7Y6W2Y242B2M","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKDT7Y6W","created_at":"2026-05-18T12:33:21.387695+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/KKDT7Y6W2Y242B2MVXWAMZ6HW6","json":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6.json","graph_json":"https://pith.science/api/pith-number/KKDT7Y6W2Y242B2MVXWAMZ6HW6/graph.json","events_json":"https://pith.science/api/pith-number/KKDT7Y6W2Y242B2MVXWAMZ6HW6/events.json","paper":"https://pith.science/paper/KKDT7Y6W"},"agent_actions":{"view_html":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6","download_json":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6.json","view_paper":"https://pith.science/paper/KKDT7Y6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00239&json=true","fetch_graph":"https://pith.science/api/pith-number/KKDT7Y6W2Y242B2MVXWAMZ6HW6/graph.json","fetch_events":"https://pith.science/api/pith-number/KKDT7Y6W2Y242B2MVXWAMZ6HW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6/action/storage_attestation","attest_author":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6/action/author_attestation","sign_citation":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6/action/citation_signature","submit_replication":"https://pith.science/pith/KKDT7Y6W2Y242B2MVXWAMZ6HW6/action/replication_record"}},"created_at":"2026-05-17T23:47:13.375167+00:00","updated_at":"2026-05-17T23:47:13.375167+00:00"}