{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YRLLFQ7LC6S7ELS35F635HYH6P","short_pith_number":"pith:YRLLFQ7L","schema_version":"1.0","canonical_sha256":"c456b2c3eb17a5f22e5be97dbe9f07f3e2ad74d9ed5917e47f9b2c7cca8dd979","source":{"kind":"arxiv","id":"1511.04356","version":1},"attestation_state":"computed","paper":{"title":"A refinement of theorems on vertex-disjoint chorded cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elyse Yeager, Michael Santana, Theodore Molla","submitted_at":"2015-11-13T16:49:57Z","abstract_excerpt":"In 1963, Corr\\'adi and Hajnal settled a conjecture of Erd\\H{o}s by proving that, for all $k \\geq 1$, any graph $G$ with $|G| \\geq 3k$ and minimum degree at least $2k$ contains $k$ vertex-disjoint cycles. In 2008, Finkel proved that for all $k \\geq 1$, any graph $G$ with $|G| \\geq 4k$ and minimum degree at least $3k$ contains $k$ vertex-disjoint chorded cycles. Finkel's result was strengthened by Chiba, Fujita, Gao, and Li in 2010, who showed, among other results, that for all $k \\geq 1$, any graph $G$ with $|G| \\geq 4k$ and minimum Ore-degree at least $6k-1$ contains $k$ vertex-disjoint cycles"},"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":"1511.04356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T16:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"3d9511568bbdde589528ed4f6addafa2bd15ef2e7b9cbf1b4e7e5a18ed7a2b5e","abstract_canon_sha256":"de50b089acf3abce71e4fd014b7e325262f0278e1959e9af494da69f3afe6d9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:59.107578Z","signature_b64":"NEg/9Xbly8U4O6Wn8zkZ7BfOI51cYvr76zxPZS+wgD/IM5a/W5+0mDtQbR206mqvUhOl5iQuVniO/2VO2kdNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c456b2c3eb17a5f22e5be97dbe9f07f3e2ad74d9ed5917e47f9b2c7cca8dd979","last_reissued_at":"2026-05-18T01:26:59.106844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:59.106844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A refinement of theorems on vertex-disjoint chorded cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elyse Yeager, Michael Santana, Theodore Molla","submitted_at":"2015-11-13T16:49:57Z","abstract_excerpt":"In 1963, Corr\\'adi and Hajnal settled a conjecture of Erd\\H{o}s by proving that, for all $k \\geq 1$, any graph $G$ with $|G| \\geq 3k$ and minimum degree at least $2k$ contains $k$ vertex-disjoint cycles. In 2008, Finkel proved that for all $k \\geq 1$, any graph $G$ with $|G| \\geq 4k$ and minimum degree at least $3k$ contains $k$ vertex-disjoint chorded cycles. Finkel's result was strengthened by Chiba, Fujita, Gao, and Li in 2010, who showed, among other results, that for all $k \\geq 1$, any graph $G$ with $|G| \\geq 4k$ and minimum Ore-degree at least $6k-1$ contains $k$ vertex-disjoint cycles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04356","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":"1511.04356","created_at":"2026-05-18T01:26:59.106970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04356v1","created_at":"2026-05-18T01:26:59.106970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04356","created_at":"2026-05-18T01:26:59.106970+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRLLFQ7LC6S7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRLLFQ7LC6S7ELS3","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRLLFQ7L","created_at":"2026-05-18T12:29:52.810259+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/YRLLFQ7LC6S7ELS35F635HYH6P","json":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P.json","graph_json":"https://pith.science/api/pith-number/YRLLFQ7LC6S7ELS35F635HYH6P/graph.json","events_json":"https://pith.science/api/pith-number/YRLLFQ7LC6S7ELS35F635HYH6P/events.json","paper":"https://pith.science/paper/YRLLFQ7L"},"agent_actions":{"view_html":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P","download_json":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P.json","view_paper":"https://pith.science/paper/YRLLFQ7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04356&json=true","fetch_graph":"https://pith.science/api/pith-number/YRLLFQ7LC6S7ELS35F635HYH6P/graph.json","fetch_events":"https://pith.science/api/pith-number/YRLLFQ7LC6S7ELS35F635HYH6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P/action/storage_attestation","attest_author":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P/action/author_attestation","sign_citation":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P/action/citation_signature","submit_replication":"https://pith.science/pith/YRLLFQ7LC6S7ELS35F635HYH6P/action/replication_record"}},"created_at":"2026-05-18T01:26:59.106970+00:00","updated_at":"2026-05-18T01:26:59.106970+00:00"}