{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CWMGE2XQI3SYEC5FFGPQEBEG6F","short_pith_number":"pith:CWMGE2XQ","schema_version":"1.0","canonical_sha256":"1598626af046e5820ba5299f020486f14d839f8d661d5d7e50e0a5c316cad3cb","source":{"kind":"arxiv","id":"1609.09550","version":1},"attestation_state":"computed","paper":{"title":"Counting Hamilton decompositions of oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Eoin Long","submitted_at":"2016-09-29T23:42:23Z","abstract_excerpt":"A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled by K\\\"uhn and Osthus, who proved more generally that every $r$-regular $n$-vertex oriented graph $G$ (without antiparallel edges) with $r=cn$ for some fixed $c>3/8$ has a Hamiltonian decomposition, provided $n=n(c)$ is sufficiently large. In this paper we address the natural q"},"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":"1609.09550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-29T23:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"cbfb1e5a8baadeb9bfe914a53377de1601433638da559d317ed6c925f58e6001","abstract_canon_sha256":"f7ba3e2b2690c38d2acc015187a2acdafc292190909bce0094173fd3557784ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.741162Z","signature_b64":"Rt1PrQnYcgNrtpcGKhTptfMpxT40ZEz6mtabjGN9bAnt2EPbZyzUBiQCG7zVZJ8xHvRvMu89gOIfEv7O7MU0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1598626af046e5820ba5299f020486f14d839f8d661d5d7e50e0a5c316cad3cb","last_reissued_at":"2026-05-18T01:03:35.740648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.740648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Hamilton decompositions of oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Eoin Long","submitted_at":"2016-09-29T23:42:23Z","abstract_excerpt":"A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled by K\\\"uhn and Osthus, who proved more generally that every $r$-regular $n$-vertex oriented graph $G$ (without antiparallel edges) with $r=cn$ for some fixed $c>3/8$ has a Hamiltonian decomposition, provided $n=n(c)$ is sufficiently large. In this paper we address the natural q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09550","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":"1609.09550","created_at":"2026-05-18T01:03:35.740746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09550v1","created_at":"2026-05-18T01:03:35.740746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09550","created_at":"2026-05-18T01:03:35.740746+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWMGE2XQI3SY","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWMGE2XQI3SYEC5F","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWMGE2XQ","created_at":"2026-05-18T12:30:09.641336+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/CWMGE2XQI3SYEC5FFGPQEBEG6F","json":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F.json","graph_json":"https://pith.science/api/pith-number/CWMGE2XQI3SYEC5FFGPQEBEG6F/graph.json","events_json":"https://pith.science/api/pith-number/CWMGE2XQI3SYEC5FFGPQEBEG6F/events.json","paper":"https://pith.science/paper/CWMGE2XQ"},"agent_actions":{"view_html":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F","download_json":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F.json","view_paper":"https://pith.science/paper/CWMGE2XQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09550&json=true","fetch_graph":"https://pith.science/api/pith-number/CWMGE2XQI3SYEC5FFGPQEBEG6F/graph.json","fetch_events":"https://pith.science/api/pith-number/CWMGE2XQI3SYEC5FFGPQEBEG6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F/action/storage_attestation","attest_author":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F/action/author_attestation","sign_citation":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F/action/citation_signature","submit_replication":"https://pith.science/pith/CWMGE2XQI3SYEC5FFGPQEBEG6F/action/replication_record"}},"created_at":"2026-05-18T01:03:35.740746+00:00","updated_at":"2026-05-18T01:03:35.740746+00:00"}