{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BSJDF5BWROBZ5RWPCWXPFWVJ7Y","short_pith_number":"pith:BSJDF5BW","schema_version":"1.0","canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","source":{"kind":"arxiv","id":"1608.07028","version":1},"attestation_state":"computed","paper":{"title":"Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Noga Alon","submitted_at":"2016-08-25T06:39:53Z","abstract_excerpt":"A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph $K_n$ has a rainbow Hamiltonian path. Although this conjecture turned out to be false, it was widely believed that such a colouring always contains a rainbow cycle of length almost $n$. In this paper, improving on several earlier results, we confirm this by proving that every properly edge-coloured $K_n$ has a rainbow cycle of length $n-O(n^{3/4})$. One of the main ingredients of our proof, which is of independent int"},"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":"1608.07028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-25T06:39:53Z","cross_cats_sorted":[],"title_canon_sha256":"ba6e5286a7f4279e4d84e3e204c705fde0d15c6bab4f15549dfee9ceba0787f2","abstract_canon_sha256":"bfbe242c0dd7e9edf92d47c8db8e1b140dd235010038929a59d445475778f181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.278827Z","signature_b64":"dd4bplc+aYGqjp7jAl0mWBcNTMgyvf9mueFPgigb6Z6ZS4s+uUULnc2ZmlprN2kc/DBACP22BpFRtwof01YQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","last_reissued_at":"2026-05-18T01:07:56.278419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.278419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Noga Alon","submitted_at":"2016-08-25T06:39:53Z","abstract_excerpt":"A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph $K_n$ has a rainbow Hamiltonian path. Although this conjecture turned out to be false, it was widely believed that such a colouring always contains a rainbow cycle of length almost $n$. In this paper, improving on several earlier results, we confirm this by proving that every properly edge-coloured $K_n$ has a rainbow cycle of length $n-O(n^{3/4})$. One of the main ingredients of our proof, which is of independent int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07028","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":"1608.07028","created_at":"2026-05-18T01:07:56.278493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07028v1","created_at":"2026-05-18T01:07:56.278493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07028","created_at":"2026-05-18T01:07:56.278493+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSJDF5BWROBZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSJDF5BWROBZ5RWP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSJDF5BW","created_at":"2026-05-18T12:30:07.202191+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/BSJDF5BWROBZ5RWPCWXPFWVJ7Y","json":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y.json","graph_json":"https://pith.science/api/pith-number/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/graph.json","events_json":"https://pith.science/api/pith-number/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/events.json","paper":"https://pith.science/paper/BSJDF5BW"},"agent_actions":{"view_html":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y","download_json":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y.json","view_paper":"https://pith.science/paper/BSJDF5BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07028&json=true","fetch_graph":"https://pith.science/api/pith-number/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/action/storage_attestation","attest_author":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/action/author_attestation","sign_citation":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/action/citation_signature","submit_replication":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/action/replication_record"}},"created_at":"2026-05-18T01:07:56.278493+00:00","updated_at":"2026-05-18T01:07:56.278493+00:00"}