{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4QO7X376BCFDFYT3HJED3ITMRF","short_pith_number":"pith:4QO7X376","schema_version":"1.0","canonical_sha256":"e41dfbeffe088a32e27b3a483da26c896d4fb6b668f31fad3f606450ef720a93","source":{"kind":"arxiv","id":"1706.04950","version":1},"attestation_state":"computed","paper":{"title":"Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozsef Balogh, Theodore Molla","submitted_at":"2017-06-15T16:16:49Z","abstract_excerpt":"We prove two results regarding cycles in properly edge-colored graphs.\n  First, we make a small improvement to the recent breakthrough work of Alon, Pokrovskiy and Sudakov who showed that every properly edge-colored complete graph $G$ on $n$ vertices has a rainbow cycle on at least $n - O(n^{3/4})$ vertices, by showing that $G$ has a rainbow cycle on at least $n - O(\\log n \\sqrt{n})$ vertices.\n  Second, by modifying the argument of Hatami and Shor which gives a lower bound for the length of a partial transversal in a Latin Square, we prove that every properly colored complete graph has a Hamil"},"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.04950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T16:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"140134f21c39cec338a67aa9436fe9fa31510bf6ced13d20040e3aaeb35e4528","abstract_canon_sha256":"c45edf3f7ebe585d7a3c425af848ea86d2d8fe905b948b60cf8ecd2cdcb2233f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.447070Z","signature_b64":"4IxqWtmIvihqli19479yysCNIYGAxWXRw1OD0DOGmf+G8CQVTLWZcdNseNZx1MjUJXWWfZAEqhblvM5z0DdJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e41dfbeffe088a32e27b3a483da26c896d4fb6b668f31fad3f606450ef720a93","last_reissued_at":"2026-05-18T00:42:18.446437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.446437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozsef Balogh, Theodore Molla","submitted_at":"2017-06-15T16:16:49Z","abstract_excerpt":"We prove two results regarding cycles in properly edge-colored graphs.\n  First, we make a small improvement to the recent breakthrough work of Alon, Pokrovskiy and Sudakov who showed that every properly edge-colored complete graph $G$ on $n$ vertices has a rainbow cycle on at least $n - O(n^{3/4})$ vertices, by showing that $G$ has a rainbow cycle on at least $n - O(\\log n \\sqrt{n})$ vertices.\n  Second, by modifying the argument of Hatami and Shor which gives a lower bound for the length of a partial transversal in a Latin Square, we prove that every properly colored complete graph has a Hamil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04950","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.04950","created_at":"2026-05-18T00:42:18.446527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04950v1","created_at":"2026-05-18T00:42:18.446527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04950","created_at":"2026-05-18T00:42:18.446527+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QO7X376BCFD","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QO7X376BCFDFYT3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QO7X376","created_at":"2026-05-18T12:31:00.734936+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/4QO7X376BCFDFYT3HJED3ITMRF","json":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF.json","graph_json":"https://pith.science/api/pith-number/4QO7X376BCFDFYT3HJED3ITMRF/graph.json","events_json":"https://pith.science/api/pith-number/4QO7X376BCFDFYT3HJED3ITMRF/events.json","paper":"https://pith.science/paper/4QO7X376"},"agent_actions":{"view_html":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF","download_json":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF.json","view_paper":"https://pith.science/paper/4QO7X376","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04950&json=true","fetch_graph":"https://pith.science/api/pith-number/4QO7X376BCFDFYT3HJED3ITMRF/graph.json","fetch_events":"https://pith.science/api/pith-number/4QO7X376BCFDFYT3HJED3ITMRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF/action/storage_attestation","attest_author":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF/action/author_attestation","sign_citation":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF/action/citation_signature","submit_replication":"https://pith.science/pith/4QO7X376BCFDFYT3HJED3ITMRF/action/replication_record"}},"created_at":"2026-05-18T00:42:18.446527+00:00","updated_at":"2026-05-18T00:42:18.446527+00:00"}