{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VNJUICSR6UXYKXO72CEOPGY2BD","short_pith_number":"pith:VNJUICSR","canonical_record":{"source":{"id":"1202.6219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T13:58:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1b8e8cb0be019432a56f9acd2ded7d7347387cb51cae99839fc8875b19a7ce0","abstract_canon_sha256":"1723ecce6b4eea5df3a43734f0ca65654f3133979c6cc02e676043d15047fe20"},"schema_version":"1.0"},"canonical_sha256":"ab53440a51f52f855ddfd088e79b1a08c6b148850035553781c36f26eabdb3f1","source":{"kind":"arxiv","id":"1202.6219","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6219","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6219v2","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6219","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"VNJUICSR6UXY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNJUICSR6UXYKXO7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNJUICSR","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VNJUICSR6UXYKXO72CEOPGY2BD","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T13:58:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1b8e8cb0be019432a56f9acd2ded7d7347387cb51cae99839fc8875b19a7ce0","abstract_canon_sha256":"1723ecce6b4eea5df3a43734f0ca65654f3133979c6cc02e676043d15047fe20"},"schema_version":"1.0"},"canonical_sha256":"ab53440a51f52f855ddfd088e79b1a08c6b148850035553781c36f26eabdb3f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:00.396807Z","signature_b64":"WyANnoohoOzuB7F6DeaMtZHhn8q1fVRbqd0p+Ixc/iOYEhefJT2VcJfwNirP0dw/ptlvRdwxffiLSd3PNl2ZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab53440a51f52f855ddfd088e79b1a08c6b148850035553781c36f26eabdb3f1","last_reissued_at":"2026-05-18T03:26:00.396070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:00.396070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6219","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:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6jHK4Q9lGlxKVX1wVa+DtVfbvtbCFq4aebsTm/1jqadHN9sok59VFmV/N43DWCtn30cY1DiTxao8myqgGGdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:37.957354Z"},"content_sha256":"6d57185be06ce871f4695c45bd9f41b3549bd7896bce5a507c9f999ebfff80c9","schema_version":"1.0","event_id":"sha256:6d57185be06ce871f4695c45bd9f41b3549bd7896bce5a507c9f999ebfff80c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VNJUICSR6UXYKXO72CEOPGY2BD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus","submitted_at":"2012-02-28T13:58:06Z","abstract_excerpt":"A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs. We show 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. This enables us to obtain numerous further results, e.g. as a special case we confirm a con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6219","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:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnTrdZovDdh7OJtxE5z6DyEzYI6lVfFMn1w5DrLKkhRi2Z0cQtpW8cw5Ql5Ip7AtQ+QND5/b13BF9uB+fiE8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:37.957711Z"},"content_sha256":"83d04fb2c96bd9f05ef395602788cfb790e6207ff0cce48e403e3536beb39aed","schema_version":"1.0","event_id":"sha256:83d04fb2c96bd9f05ef395602788cfb790e6207ff0cce48e403e3536beb39aed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNJUICSR6UXYKXO72CEOPGY2BD/bundle.json","state_url":"https://pith.science/pith/VNJUICSR6UXYKXO72CEOPGY2BD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNJUICSR6UXYKXO72CEOPGY2BD/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-30T09:20:37Z","links":{"resolver":"https://pith.science/pith/VNJUICSR6UXYKXO72CEOPGY2BD","bundle":"https://pith.science/pith/VNJUICSR6UXYKXO72CEOPGY2BD/bundle.json","state":"https://pith.science/pith/VNJUICSR6UXYKXO72CEOPGY2BD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNJUICSR6UXYKXO72CEOPGY2BD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VNJUICSR6UXYKXO72CEOPGY2BD","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":"1723ecce6b4eea5df3a43734f0ca65654f3133979c6cc02e676043d15047fe20","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T13:58:06Z","title_canon_sha256":"c1b8e8cb0be019432a56f9acd2ded7d7347387cb51cae99839fc8875b19a7ce0"},"schema_version":"1.0","source":{"id":"1202.6219","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6219","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6219v2","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6219","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"VNJUICSR6UXY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNJUICSR6UXYKXO7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNJUICSR","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:83d04fb2c96bd9f05ef395602788cfb790e6207ff0cce48e403e3536beb39aed","target":"graph","created_at":"2026-05-18T03:26:00Z","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":"A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs. We show 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. This enables us to obtain numerous further results, e.g. as a special case we confirm a con","authors_text":"Daniela K\\\"uhn, Deryk Osthus","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T13:58:06Z","title":"Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6219","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:6d57185be06ce871f4695c45bd9f41b3549bd7896bce5a507c9f999ebfff80c9","target":"record","created_at":"2026-05-18T03:26:00Z","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":"1723ecce6b4eea5df3a43734f0ca65654f3133979c6cc02e676043d15047fe20","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T13:58:06Z","title_canon_sha256":"c1b8e8cb0be019432a56f9acd2ded7d7347387cb51cae99839fc8875b19a7ce0"},"schema_version":"1.0","source":{"id":"1202.6219","kind":"arxiv","version":2}},"canonical_sha256":"ab53440a51f52f855ddfd088e79b1a08c6b148850035553781c36f26eabdb3f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab53440a51f52f855ddfd088e79b1a08c6b148850035553781c36f26eabdb3f1","first_computed_at":"2026-05-18T03:26:00.396070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:00.396070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WyANnoohoOzuB7F6DeaMtZHhn8q1fVRbqd0p+Ixc/iOYEhefJT2VcJfwNirP0dw/ptlvRdwxffiLSd3PNl2ZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:00.396807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6219","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d57185be06ce871f4695c45bd9f41b3549bd7896bce5a507c9f999ebfff80c9","sha256:83d04fb2c96bd9f05ef395602788cfb790e6207ff0cce48e403e3536beb39aed"],"state_sha256":"9071a0924be649ba4fd2ba3a2ec2c7b8ab58d015b37de707ded2f664695762c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1ob9vIn7SzbcIyjqSDsg1x1cqvQOpUQJztXNljzH6WIj78Kav/51HdmGho0ZwNnWSPLOLB0pRJNqVTP8yeqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:20:37.959918Z","bundle_sha256":"18d19aa08b8e5d214abcb04d9c50904034cd39bc080c23d34eb4044adfaa2a37"}}