{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H5IQXVP27LKEL6IFUIAMFVNHDK","short_pith_number":"pith:H5IQXVP2","canonical_record":{"source":{"id":"1203.0659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-03T15:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"acce584a349a81e52172b9b836ee9888c1bc61fa567f2843684025594160d20c","abstract_canon_sha256":"e517d293cbd69c475f57133fa3ad6f927d543fc379c72f3fc476822e03826df6"},"schema_version":"1.0"},"canonical_sha256":"3f510bd5fafad445f905a200c2d5a71aae003f2d927de1973e945b34a06eddae","source":{"kind":"arxiv","id":"1203.0659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0659","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0659v2","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0659","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"H5IQXVP27LKE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H5IQXVP27LKEL6IF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H5IQXVP2","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H5IQXVP27LKEL6IFUIAMFVNHDK","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-03T15:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"acce584a349a81e52172b9b836ee9888c1bc61fa567f2843684025594160d20c","abstract_canon_sha256":"e517d293cbd69c475f57133fa3ad6f927d543fc379c72f3fc476822e03826df6"},"schema_version":"1.0"},"canonical_sha256":"3f510bd5fafad445f905a200c2d5a71aae003f2d927de1973e945b34a06eddae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:25.245504Z","signature_b64":"VzB4Bbm92ulAo7FxfKbSl7IEarmkr9G1o8BqNtAixWTKX9jh1Me72uu7vrgsDiXNrsfI+cNl5zpDws3v7/56Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f510bd5fafad445f905a200c2d5a71aae003f2d927de1973e945b34a06eddae","last_reissued_at":"2026-05-18T03:08:25.244900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:25.244900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0659","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-18T03:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wPnEa1fpdZ4D8kuOjwBaPG0LFV11v/rE0jfsMDCqoszo1awM94qoae6X0afwOGXkhoy8CQVG1ZMFQDZ5+zcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:04:03.328525Z"},"content_sha256":"de0821740495305c67ac229a07aeeb2069f55c750e58095847b53b86f85559c2","schema_version":"1.0","event_id":"sha256:de0821740495305c67ac229a07aeeb2069f55c750e58095847b53b86f85559c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H5IQXVP27LKEL6IFUIAMFVNHDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamilton decompositions of regular expanders: applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus","submitted_at":"2012-03-03T15:49:36Z","abstract_excerpt":"In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This verified a conjecture of Kelly from 1968. In this paper, we derive a number of further consequences of our result on robust outexpanders, the main ones are the following: (i) an undirected analogue of our r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0659","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-18T03:08:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mxqj+4qQVA+3nn0mTxE3iUyxcojUxruWhkiYoo/D54u6X9VWpCMgJE3DvngelzBjBZSqbHpXge6BhojZmPEdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:04:03.329061Z"},"content_sha256":"52ac536f32d80c29fc26fa00a3911b7cc589e5750030a8c8cbf5418b4d7a0f95","schema_version":"1.0","event_id":"sha256:52ac536f32d80c29fc26fa00a3911b7cc589e5750030a8c8cbf5418b4d7a0f95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/bundle.json","state_url":"https://pith.science/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/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-31T05:04:03Z","links":{"resolver":"https://pith.science/pith/H5IQXVP27LKEL6IFUIAMFVNHDK","bundle":"https://pith.science/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/bundle.json","state":"https://pith.science/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5IQXVP27LKEL6IFUIAMFVNHDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H5IQXVP27LKEL6IFUIAMFVNHDK","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":"e517d293cbd69c475f57133fa3ad6f927d543fc379c72f3fc476822e03826df6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-03T15:49:36Z","title_canon_sha256":"acce584a349a81e52172b9b836ee9888c1bc61fa567f2843684025594160d20c"},"schema_version":"1.0","source":{"id":"1203.0659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0659","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0659v2","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0659","created_at":"2026-05-18T03:08:25Z"},{"alias_kind":"pith_short_12","alias_value":"H5IQXVP27LKE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H5IQXVP27LKEL6IF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H5IQXVP2","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:52ac536f32d80c29fc26fa00a3911b7cc589e5750030a8c8cbf5418b4d7a0f95","target":"graph","created_at":"2026-05-18T03:08:25Z","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":"In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This verified a conjecture of Kelly from 1968. In this paper, we derive a number of further consequences of our result on robust outexpanders, the main ones are the following: (i) an undirected analogue of our r","authors_text":"Daniela K\\\"uhn, Deryk Osthus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-03T15:49:36Z","title":"Hamilton decompositions of regular expanders: applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0659","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:de0821740495305c67ac229a07aeeb2069f55c750e58095847b53b86f85559c2","target":"record","created_at":"2026-05-18T03:08:25Z","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":"e517d293cbd69c475f57133fa3ad6f927d543fc379c72f3fc476822e03826df6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-03T15:49:36Z","title_canon_sha256":"acce584a349a81e52172b9b836ee9888c1bc61fa567f2843684025594160d20c"},"schema_version":"1.0","source":{"id":"1203.0659","kind":"arxiv","version":2}},"canonical_sha256":"3f510bd5fafad445f905a200c2d5a71aae003f2d927de1973e945b34a06eddae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f510bd5fafad445f905a200c2d5a71aae003f2d927de1973e945b34a06eddae","first_computed_at":"2026-05-18T03:08:25.244900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:25.244900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VzB4Bbm92ulAo7FxfKbSl7IEarmkr9G1o8BqNtAixWTKX9jh1Me72uu7vrgsDiXNrsfI+cNl5zpDws3v7/56Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:25.245504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de0821740495305c67ac229a07aeeb2069f55c750e58095847b53b86f85559c2","sha256:52ac536f32d80c29fc26fa00a3911b7cc589e5750030a8c8cbf5418b4d7a0f95"],"state_sha256":"b9d559569b6bea25a2a55c1a1a66b3797dce4806c86f40845915583fd5008cfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8fUz/s6YKmx62vr7c745Y3ZREFi/7sfK+OApwWCqfEebuGoqJyKPgMhP7dTqR9Oe8nPlX91RZIFwtUcIX1dCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:04:03.331614Z","bundle_sha256":"83859b2a1bbbcdd2bfd8b0418ae2813c5963f6c682734ed76c8e51082d7d883d"}}