{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RU5OCWDRE46GIOXPZFPKZ4LB2R","short_pith_number":"pith:RU5OCWDR","schema_version":"1.0","canonical_sha256":"8d3ae15871273c643aefc95eacf161d446488c873d8cc8dee01c49ddd5298cd6","source":{"kind":"arxiv","id":"2211.03291","version":1},"attestation_state":"computed","paper":{"title":"Rainbow cycles in properly edge-colored graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Joonkyung Lee, Tuan Tran","submitted_at":"2022-11-07T04:03:24Z","abstract_excerpt":"We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\\log n)^2$ contains a rainbow cycle, improving upon $(\\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex graph with at least $10^5 k^2 n^{1+1/k}$ edges contains a rainbow $2k$-cycle, which improves the previous bound $2^{ck^2}n^{1+1/k}$ obtained by Janzer.\n  Our method using homomorphism inequalities and a lopsided regularization lemma also provides a simple way to prove the Erd\\H{o}s--Simonovits supersaturation theorem for even cycles, which may be of independen"},"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":"2211.03291","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-07T04:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"132f94d15012def544aa3075fbed2fa4ae91880544e87d73aab8eee29db4b84a","abstract_canon_sha256":"306e68183788d56cb52d9cdedcbef8ea943cfee213827f30113ccdc14c016064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:47.146152Z","signature_b64":"Bx2OxewEoxpsKSldRNjzeCzfLjXM3PI9xTqVPeCViWZvCXUi051ds7TXEBrF0G2ORwPxgPmxSiP+F8PFbD8HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d3ae15871273c643aefc95eacf161d446488c873d8cc8dee01c49ddd5298cd6","last_reissued_at":"2026-07-05T05:13:47.145728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:47.145728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow cycles in properly edge-colored graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Joonkyung Lee, Tuan Tran","submitted_at":"2022-11-07T04:03:24Z","abstract_excerpt":"We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\\log n)^2$ contains a rainbow cycle, improving upon $(\\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex graph with at least $10^5 k^2 n^{1+1/k}$ edges contains a rainbow $2k$-cycle, which improves the previous bound $2^{ck^2}n^{1+1/k}$ obtained by Janzer.\n  Our method using homomorphism inequalities and a lopsided regularization lemma also provides a simple way to prove the Erd\\H{o}s--Simonovits supersaturation theorem for even cycles, which may be of independen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.03291","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.03291/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.03291","created_at":"2026-07-05T05:13:47.145785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.03291v1","created_at":"2026-07-05T05:13:47.145785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.03291","created_at":"2026-07-05T05:13:47.145785+00:00"},{"alias_kind":"pith_short_12","alias_value":"RU5OCWDRE46G","created_at":"2026-07-05T05:13:47.145785+00:00"},{"alias_kind":"pith_short_16","alias_value":"RU5OCWDRE46GIOXP","created_at":"2026-07-05T05:13:47.145785+00:00"},{"alias_kind":"pith_short_8","alias_value":"RU5OCWDR","created_at":"2026-07-05T05:13:47.145785+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/RU5OCWDRE46GIOXPZFPKZ4LB2R","json":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R.json","graph_json":"https://pith.science/api/pith-number/RU5OCWDRE46GIOXPZFPKZ4LB2R/graph.json","events_json":"https://pith.science/api/pith-number/RU5OCWDRE46GIOXPZFPKZ4LB2R/events.json","paper":"https://pith.science/paper/RU5OCWDR"},"agent_actions":{"view_html":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R","download_json":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R.json","view_paper":"https://pith.science/paper/RU5OCWDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.03291&json=true","fetch_graph":"https://pith.science/api/pith-number/RU5OCWDRE46GIOXPZFPKZ4LB2R/graph.json","fetch_events":"https://pith.science/api/pith-number/RU5OCWDRE46GIOXPZFPKZ4LB2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R/action/storage_attestation","attest_author":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R/action/author_attestation","sign_citation":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R/action/citation_signature","submit_replication":"https://pith.science/pith/RU5OCWDRE46GIOXPZFPKZ4LB2R/action/replication_record"}},"created_at":"2026-07-05T05:13:47.145785+00:00","updated_at":"2026-07-05T05:13:47.145785+00:00"}