{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HRC6PMS56FAOHLCYPP6NLM7XPV","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":"612ca8fea4f8398552cead96467fc7fd64338681e41589b429dabcc66c623c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-25T17:51:14Z","title_canon_sha256":"c65180ba696e0f193821faa560cad50a9d668ade3db696c16169691cd68cd018"},"schema_version":"1.0","source":{"id":"1802.09049","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09049","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09049v2","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09049","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"HRC6PMS56FAO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HRC6PMS56FAOHLCY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HRC6PMS5","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:264dcd65f40a82ba1ad1c13509158b22a400dad6069a5f34c2100c314824dbb3","target":"graph","created_at":"2026-05-17T23:43:51Z","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":"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","authors_text":"Dong Yeap Kang, Jaehoon Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-25T17:51:14Z","title":"On 1-factors with prescribed lengths in tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09049","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:83efbbd17fdd4fe5604c8d504d4a3d907c7cc949674780dd2381edfe619649c1","target":"record","created_at":"2026-05-17T23:43:51Z","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":"612ca8fea4f8398552cead96467fc7fd64338681e41589b429dabcc66c623c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-25T17:51:14Z","title_canon_sha256":"c65180ba696e0f193821faa560cad50a9d668ade3db696c16169691cd68cd018"},"schema_version":"1.0","source":{"id":"1802.09049","kind":"arxiv","version":2}},"canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","first_computed_at":"2026-05-17T23:43:51.404664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:51.404664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ml5C7sE1btqS9z0TATNuU4jqOm2i5e7d5K25sme912imyjlByv/z+tmBGbCCZogMHLjmuHZUuTOjAQ/sL63rAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:51.405402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09049","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83efbbd17fdd4fe5604c8d504d4a3d907c7cc949674780dd2381edfe619649c1","sha256:264dcd65f40a82ba1ad1c13509158b22a400dad6069a5f34c2100c314824dbb3"],"state_sha256":"cb3efc8a90aeed3d5db72ab99fc18167431a87ccc5368e56e85c0130785840a2"}