{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ND4DWM2ORZUAN6ERDGCCUYC6JC","short_pith_number":"pith:ND4DWM2O","schema_version":"1.0","canonical_sha256":"68f83b334e8e6806f89119842a605e488f04dc0f2a54a6a797f600f4190141f0","source":{"kind":"arxiv","id":"1706.04903","version":1},"attestation_state":"computed","paper":{"title":"A remark on Hamilton cycles with few colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Igor Balla","submitted_at":"2017-06-15T14:47:30Z","abstract_excerpt":"Akbari, Etesami, Mahini, and Mahmoody conjectured that every proper edge colouring of $K_n$ with $n$ colours contains a Hamilton cycle with $\\leq O(\\log n)$ colours. They proved that there is always a Hamilton cycle with $\\leq 8\\sqrt n$ colours. In this note we improve this bound to $O(\\log^3 n)$."},"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":"1706.04903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T14:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"a2283d31d412e55946c650eb2554519116550a55713c84b38b2e6bbfc0fbb9c0","abstract_canon_sha256":"7815b6d1631cbaa3cc47847404d70231322a64cbfba9e6976bcc3c87eda33abf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.594571Z","signature_b64":"hMYwMl6XlQ3zntgV0vdsHU6OwhztOsNtJZQx67bVLUilnxonX4fy+C157mYVgNXrNOXrB1eCJc6CLn/VcyfYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f83b334e8e6806f89119842a605e488f04dc0f2a54a6a797f600f4190141f0","last_reissued_at":"2026-05-18T00:42:18.593854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.593854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A remark on Hamilton cycles with few colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, Igor Balla","submitted_at":"2017-06-15T14:47:30Z","abstract_excerpt":"Akbari, Etesami, Mahini, and Mahmoody conjectured that every proper edge colouring of $K_n$ with $n$ colours contains a Hamilton cycle with $\\leq O(\\log n)$ colours. They proved that there is always a Hamilton cycle with $\\leq 8\\sqrt n$ colours. In this note we improve this bound to $O(\\log^3 n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04903","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":"1706.04903","created_at":"2026-05-18T00:42:18.593966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04903v1","created_at":"2026-05-18T00:42:18.593966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04903","created_at":"2026-05-18T00:42:18.593966+00:00"},{"alias_kind":"pith_short_12","alias_value":"ND4DWM2ORZUA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"ND4DWM2ORZUAN6ER","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"ND4DWM2O","created_at":"2026-05-18T12:31:31.346846+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/ND4DWM2ORZUAN6ERDGCCUYC6JC","json":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC.json","graph_json":"https://pith.science/api/pith-number/ND4DWM2ORZUAN6ERDGCCUYC6JC/graph.json","events_json":"https://pith.science/api/pith-number/ND4DWM2ORZUAN6ERDGCCUYC6JC/events.json","paper":"https://pith.science/paper/ND4DWM2O"},"agent_actions":{"view_html":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC","download_json":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC.json","view_paper":"https://pith.science/paper/ND4DWM2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04903&json=true","fetch_graph":"https://pith.science/api/pith-number/ND4DWM2ORZUAN6ERDGCCUYC6JC/graph.json","fetch_events":"https://pith.science/api/pith-number/ND4DWM2ORZUAN6ERDGCCUYC6JC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC/action/storage_attestation","attest_author":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC/action/author_attestation","sign_citation":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC/action/citation_signature","submit_replication":"https://pith.science/pith/ND4DWM2ORZUAN6ERDGCCUYC6JC/action/replication_record"}},"created_at":"2026-05-18T00:42:18.593966+00:00","updated_at":"2026-05-18T00:42:18.593966+00:00"}