{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BSJDF5BWROBZ5RWPCWXPFWVJ7Y","short_pith_number":"pith:BSJDF5BW","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"},"canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","source":{"kind":"arxiv","id":"1608.07028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07028","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07028v1","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07028","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"BSJDF5BWROBZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BSJDF5BWROBZ5RWP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BSJDF5BW","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BSJDF5BWROBZ5RWPCWXPFWVJ7Y","target":"record","payload":{"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"},"canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","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"},"source_kind":"arxiv","source_id":"1608.07028","source_version":1,"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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPQZm01DY83e8okeqEkB6uTEL1LteTV8YN98CN34v/3+mMM/eOgWXloR41fYUCLB+RFcNZ6H9qBEVSHaAhblDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:17:44.195990Z"},"content_sha256":"e70dcc6a06aaee87c6f6aebf73ef63ffdc12c3bebee06beb118615da98073988","schema_version":"1.0","event_id":"sha256:e70dcc6a06aaee87c6f6aebf73ef63ffdc12c3bebee06beb118615da98073988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BSJDF5BWROBZ5RWPCWXPFWVJ7Y","target":"graph","payload":{"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"},"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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MANcB47aniYk3XGWqXd7+HViTbxL+4za3rMe2drbtGfbaL7lC6x7e60uYf6iUL5fl9ma219/gMqFN0fX8bUVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:17:44.196665Z"},"content_sha256":"8524d1ac4d70f95b8719e92a4538e7d71d651cc1823ccf735985a680d8ccb549","schema_version":"1.0","event_id":"sha256:8524d1ac4d70f95b8719e92a4538e7d71d651cc1823ccf735985a680d8ccb549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/bundle.json","state_url":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/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-30T10:17:44Z","links":{"resolver":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y","bundle":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/bundle.json","state":"https://pith.science/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSJDF5BWROBZ5RWPCWXPFWVJ7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BSJDF5BWROBZ5RWPCWXPFWVJ7Y","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":"bfbe242c0dd7e9edf92d47c8db8e1b140dd235010038929a59d445475778f181","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-25T06:39:53Z","title_canon_sha256":"ba6e5286a7f4279e4d84e3e204c705fde0d15c6bab4f15549dfee9ceba0787f2"},"schema_version":"1.0","source":{"id":"1608.07028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07028","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07028v1","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07028","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"BSJDF5BWROBZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BSJDF5BWROBZ5RWP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BSJDF5BW","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:8524d1ac4d70f95b8719e92a4538e7d71d651cc1823ccf735985a680d8ccb549","target":"graph","created_at":"2026-05-18T01:07:56Z","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 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","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-25T06:39:53Z","title":"Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07028","kind":"arxiv","version":1},"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:e70dcc6a06aaee87c6f6aebf73ef63ffdc12c3bebee06beb118615da98073988","target":"record","created_at":"2026-05-18T01:07:56Z","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":"bfbe242c0dd7e9edf92d47c8db8e1b140dd235010038929a59d445475778f181","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-25T06:39:53Z","title_canon_sha256":"ba6e5286a7f4279e4d84e3e204c705fde0d15c6bab4f15549dfee9ceba0787f2"},"schema_version":"1.0","source":{"id":"1608.07028","kind":"arxiv","version":1}},"canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c9232f4368b839ec6cf15aef2daa9fe01988fe5fd241fb18ffa09e6600751eb","first_computed_at":"2026-05-18T01:07:56.278419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.278419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dd4bplc+aYGqjp7jAl0mWBcNTMgyvf9mueFPgigb6Z6ZS4s+uUULnc2ZmlprN2kc/DBACP22BpFRtwof01YQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.278827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e70dcc6a06aaee87c6f6aebf73ef63ffdc12c3bebee06beb118615da98073988","sha256:8524d1ac4d70f95b8719e92a4538e7d71d651cc1823ccf735985a680d8ccb549"],"state_sha256":"54462a2f5939a76878ed96e08e2e49b3f6496e5b20897f6c72a6987f0782a69d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzQ9gUmMMz3dMP+zRVdoqXaOcUoB0kiq8Z10OIAUPQd8GXpib2aRbvUAaBbtCV3S6vwBTWlt0MtoO2CdArv6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:17:44.200469Z","bundle_sha256":"046118682c943ddd1c33eeb14e921f38b9dd5e67d3bd91494bd351349e936c13"}}