{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2MLNLBYJURZCY3CWNHN6MUGSI5","short_pith_number":"pith:2MLNLBYJ","canonical_record":{"source":{"id":"2007.00395","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T11:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"5da2035ba7ae862be710892bb443692e5c303319808f75df56b40ad12d18b58f","abstract_canon_sha256":"8e7848abd8611c12cb05b65373a078de6c76d0d92ce8b45ee7878f7354476b8e"},"schema_version":"1.0"},"canonical_sha256":"d316d58709a4722c6c5669dbe650d24747099de7e062ca8f6fee99591d407f8c","source":{"kind":"arxiv","id":"2007.00395","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00395","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00395v2","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00395","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"2MLNLBYJURZC","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"2MLNLBYJURZCY3CW","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"2MLNLBYJ","created_at":"2026-07-05T04:16:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2MLNLBYJURZCY3CWNHN6MUGSI5","target":"record","payload":{"canonical_record":{"source":{"id":"2007.00395","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T11:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"5da2035ba7ae862be710892bb443692e5c303319808f75df56b40ad12d18b58f","abstract_canon_sha256":"8e7848abd8611c12cb05b65373a078de6c76d0d92ce8b45ee7878f7354476b8e"},"schema_version":"1.0"},"canonical_sha256":"d316d58709a4722c6c5669dbe650d24747099de7e062ca8f6fee99591d407f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:34.274189Z","signature_b64":"ktZC1yHu84Xn5b43FHCVmLqhVu0cyjNf2HDfjrqdn5JeWyFNkh24lv8/9peYhAhS+rorfaIYd1/gMyF4BhmPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d316d58709a4722c6c5669dbe650d24747099de7e062ca8f6fee99591d407f8c","last_reissued_at":"2026-07-05T04:16:34.273741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:34.273741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.00395","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-07-05T04:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KzO86jnfaMkUhha16Ar9YAKD9iNxCBncqS+uUz4MIw7JGayxSMQfVN5lYDlPNd/ERa/W+wJlzZTIdg2iaYQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:26:26.957724Z"},"content_sha256":"6ca909814516c845a3f3c3e40969481e4525a76aef0b0bebbbc0a9a3e5d6b591","schema_version":"1.0","event_id":"sha256:6ca909814516c845a3f3c3e40969481e4525a76aef0b0bebbbc0a9a3e5d6b591"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2MLNLBYJURZCY3CWNHN6MUGSI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost all optimally coloured complete graphs contain a rainbow Hamilton path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Stephen Gould, Tom Kelly","submitted_at":"2020-07-01T11:35:12Z","abstract_excerpt":"A subgraph $H$ of an edge-coloured graph is called rainbow if all of the edges of $H$ have different colours. In 1989, Andersen conjectured that every proper edge-colouring of $K_{n}$ admits a rainbow path of length $n-2$. We show that almost all optimal edge-colourings of $K_{n}$ admit both (i) a rainbow Hamilton path and (ii) a rainbow cycle using all of the colours. This result demonstrates that Andersen's Conjecture holds for almost all optimal edge-colourings of $K_{n}$ and answers a recent question of Ferber, Jain, and Sudakov. Our result also has applications to the existence of transve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00395","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.00395/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GP9G/kQJDpbb94Qr5C5hxkK0OOi2yzCy8sqd7K4CPzkufyFVRj2YDFQtRkPRa6jMMMMUorSc0xbYdPpTomogBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:26:26.958088Z"},"content_sha256":"b1d0f75220765a0a20e87b650b77bfd644fcc75ebc8433c8cd1667f2b4f8af13","schema_version":"1.0","event_id":"sha256:b1d0f75220765a0a20e87b650b77bfd644fcc75ebc8433c8cd1667f2b4f8af13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/bundle.json","state_url":"https://pith.science/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/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-07-06T12:26:26Z","links":{"resolver":"https://pith.science/pith/2MLNLBYJURZCY3CWNHN6MUGSI5","bundle":"https://pith.science/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/bundle.json","state":"https://pith.science/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MLNLBYJURZCY3CWNHN6MUGSI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2MLNLBYJURZCY3CWNHN6MUGSI5","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":"8e7848abd8611c12cb05b65373a078de6c76d0d92ce8b45ee7878f7354476b8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T11:35:12Z","title_canon_sha256":"5da2035ba7ae862be710892bb443692e5c303319808f75df56b40ad12d18b58f"},"schema_version":"1.0","source":{"id":"2007.00395","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00395","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00395v2","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00395","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"2MLNLBYJURZC","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"2MLNLBYJURZCY3CW","created_at":"2026-07-05T04:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"2MLNLBYJ","created_at":"2026-07-05T04:16:34Z"}],"graph_snapshots":[{"event_id":"sha256:b1d0f75220765a0a20e87b650b77bfd644fcc75ebc8433c8cd1667f2b4f8af13","target":"graph","created_at":"2026-07-05T04:16:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.00395/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A subgraph $H$ of an edge-coloured graph is called rainbow if all of the edges of $H$ have different colours. In 1989, Andersen conjectured that every proper edge-colouring of $K_{n}$ admits a rainbow path of length $n-2$. We show that almost all optimal edge-colourings of $K_{n}$ admit both (i) a rainbow Hamilton path and (ii) a rainbow cycle using all of the colours. This result demonstrates that Andersen's Conjecture holds for almost all optimal edge-colourings of $K_{n}$ and answers a recent question of Ferber, Jain, and Sudakov. Our result also has applications to the existence of transve","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Stephen Gould, Tom Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T11:35:12Z","title":"Almost all optimally coloured complete graphs contain a rainbow Hamilton path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00395","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:6ca909814516c845a3f3c3e40969481e4525a76aef0b0bebbbc0a9a3e5d6b591","target":"record","created_at":"2026-07-05T04:16:34Z","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":"8e7848abd8611c12cb05b65373a078de6c76d0d92ce8b45ee7878f7354476b8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T11:35:12Z","title_canon_sha256":"5da2035ba7ae862be710892bb443692e5c303319808f75df56b40ad12d18b58f"},"schema_version":"1.0","source":{"id":"2007.00395","kind":"arxiv","version":2}},"canonical_sha256":"d316d58709a4722c6c5669dbe650d24747099de7e062ca8f6fee99591d407f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d316d58709a4722c6c5669dbe650d24747099de7e062ca8f6fee99591d407f8c","first_computed_at":"2026-07-05T04:16:34.273741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:34.273741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ktZC1yHu84Xn5b43FHCVmLqhVu0cyjNf2HDfjrqdn5JeWyFNkh24lv8/9peYhAhS+rorfaIYd1/gMyF4BhmPAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:34.274189Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.00395","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ca909814516c845a3f3c3e40969481e4525a76aef0b0bebbbc0a9a3e5d6b591","sha256:b1d0f75220765a0a20e87b650b77bfd644fcc75ebc8433c8cd1667f2b4f8af13"],"state_sha256":"1b3b66f77ce89da4b839b93a2347c7694cdc6fa83e1c4ef6dbb22123a46f0ace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+kUrb8apMzWZVFH6lCuoFsVALQ8tW2nMAdy8LGbWdMNY+7Ybaohnj253LP2FUHdHbYqS4RQBHYiqL7jyZPlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:26:26.960093Z","bundle_sha256":"2a180e26c70c6372a92c964f46151ae4704c18857844d3400fb691a9c0704e40"}}