{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HRC6PMS56FAOHLCYPP6NLM7XPV","short_pith_number":"pith:HRC6PMS5","schema_version":"1.0","canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","source":{"kind":"arxiv","id":"1802.09049","version":2},"attestation_state":"computed","paper":{"title":"On 1-factors with prescribed lengths in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Jaehoon Kim","submitted_at":"2018-02-25T17:51:14Z","abstract_excerpt":"K\\\"uhn, Osthus, and Townsend asked whether there exists a constant $C$ such that every strongly $Ct$-connected tournament contains all possible $1$-factors with at most $t$ components. We answer this question in the affirmative. This is best possible up to constant. In addition, we can ensure that each cycle in the $1$-factor contains a prescribed vertex.\n  Indeed, we derive this result from a more general result on partitioning digraphs which are close to semicomplete. More precisely, we prove that there exists a constant $C$ such that for any $k\\geq 1$, if a strongly $Ck^4t$-connected digrap"},"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":"1802.09049","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-25T17:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"c65180ba696e0f193821faa560cad50a9d668ade3db696c16169691cd68cd018","abstract_canon_sha256":"612ca8fea4f8398552cead96467fc7fd64338681e41589b429dabcc66c623c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:51.405402Z","signature_b64":"Ml5C7sE1btqS9z0TATNuU4jqOm2i5e7d5K25sme912imyjlByv/z+tmBGbCCZogMHLjmuHZUuTOjAQ/sL63rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","last_reissued_at":"2026-05-17T23:43:51.404664Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:51.404664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On 1-factors with prescribed lengths in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Jaehoon Kim","submitted_at":"2018-02-25T17:51:14Z","abstract_excerpt":"K\\\"uhn, Osthus, and Townsend asked whether there exists a constant $C$ such that every strongly $Ct$-connected tournament contains all possible $1$-factors with at most $t$ components. We answer this question in the affirmative. This is best possible up to constant. In addition, we can ensure that each cycle in the $1$-factor contains a prescribed vertex.\n  Indeed, we derive this result from a more general result on partitioning digraphs which are close to semicomplete. More precisely, we prove that there exists a constant $C$ such that for any $k\\geq 1$, if a strongly $Ck^4t$-connected digrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09049","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":"1802.09049","created_at":"2026-05-17T23:43:51.404792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09049v2","created_at":"2026-05-17T23:43:51.404792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09049","created_at":"2026-05-17T23:43:51.404792+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRC6PMS56FAO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRC6PMS56FAOHLCY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRC6PMS5","created_at":"2026-05-18T12:32:28.185984+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/HRC6PMS56FAOHLCYPP6NLM7XPV","json":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV.json","graph_json":"https://pith.science/api/pith-number/HRC6PMS56FAOHLCYPP6NLM7XPV/graph.json","events_json":"https://pith.science/api/pith-number/HRC6PMS56FAOHLCYPP6NLM7XPV/events.json","paper":"https://pith.science/paper/HRC6PMS5"},"agent_actions":{"view_html":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV","download_json":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV.json","view_paper":"https://pith.science/paper/HRC6PMS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09049&json=true","fetch_graph":"https://pith.science/api/pith-number/HRC6PMS56FAOHLCYPP6NLM7XPV/graph.json","fetch_events":"https://pith.science/api/pith-number/HRC6PMS56FAOHLCYPP6NLM7XPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/action/storage_attestation","attest_author":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/action/author_attestation","sign_citation":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/action/citation_signature","submit_replication":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/action/replication_record"}},"created_at":"2026-05-17T23:43:51.404792+00:00","updated_at":"2026-05-17T23:43:51.404792+00:00"}