{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HRC6PMS56FAOHLCYPP6NLM7XPV","short_pith_number":"pith:HRC6PMS5","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"},"canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","source":{"kind":"arxiv","id":"1802.09049","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HRC6PMS56FAOHLCYPP6NLM7XPV","target":"record","payload":{"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"},"canonical_sha256":"3c45e7b25df140e3ac587bfcd5b3f77d695df3b268553bd1228c61ed6063875f","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"},"source_kind":"arxiv","source_id":"1802.09049","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbzMx/6XmosyQdiFWHx8AJ27lzjxZL2VcTNlqtuxipQD9xCjed+UL5AeguPZ8Y54IgBvK1pB1t3vuFiRtlu3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:48:50.193020Z"},"content_sha256":"83efbbd17fdd4fe5604c8d504d4a3d907c7cc949674780dd2381edfe619649c1","schema_version":"1.0","event_id":"sha256:83efbbd17fdd4fe5604c8d504d4a3d907c7cc949674780dd2381edfe619649c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HRC6PMS56FAOHLCYPP6NLM7XPV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+mjolX5CDNGwyQ1FtKJj1cUgaa5etz0Tp1cImT8KuYZnpVVyG1akRyrrXMh2Iiyve0CZ0VPeto708yfB1qpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:48:50.193617Z"},"content_sha256":"264dcd65f40a82ba1ad1c13509158b22a400dad6069a5f34c2100c314824dbb3","schema_version":"1.0","event_id":"sha256:264dcd65f40a82ba1ad1c13509158b22a400dad6069a5f34c2100c314824dbb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/bundle.json","state_url":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:48:50Z","links":{"resolver":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV","bundle":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/bundle.json","state":"https://pith.science/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRC6PMS56FAOHLCYPP6NLM7XPV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGGMeMfucQ2fyQdjaj4QL/wUjAONErlaWfjkRHoPY/vaDZPE3K/fQiyQri70CvEVe8EQRSgzBKJEYyR2RSYJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:48:50.196444Z","bundle_sha256":"d6d9ebb54927711c432245b8535321fe7b327649ca95d2688c27770d5b1c2497"}}