{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RLXTHRXXATDLQN3NBPCRKP2KCN","short_pith_number":"pith:RLXTHRXX","schema_version":"1.0","canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","source":{"kind":"arxiv","id":"1202.3221","version":2},"attestation_state":"computed","paper":{"title":"Rainbow Tur\\'an Problem for Even Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Shagnik Das","submitted_at":"2012-02-15T07:31:35Z","abstract_excerpt":"An edge-colored graph is rainbow if all its edges are colored with distinct colors. For a fixed graph $H$, the rainbow Tur\\'an number $\\mathrm{ex}^{\\ast}(n,H)$ is defined as the maximum number of edges in a properly edge-colored graph on $n$ vertices with no rainbow copy of $H$. We study the rainbow Tur\\'an number of even cycles, and prove that for every fixed $\\varepsilon > 0$, there is a constant $C(\\varepsilon)$ such that every properly edge-colored graph on $n$ vertices with at least $C(\\varepsilon) n^{1 + \\varepsilon}$ edges contains a rainbow cycle of even length at most $2 \\lceil \\frac{"},"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":"1202.3221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T07:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"756e4d00744df52f6787d82618822a10cf57d5d74be098c6721a823df0ac0d0f","abstract_canon_sha256":"66dbf3fea4368db042a4cb1823e1f5497e3128f90971b1e3d66128717bb87719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:46.493240Z","signature_b64":"N5Obxa5a6Fr+JLkwnzvlUuQpyYpkC8N4dsOiM4LXSxc+OO+npRnnkVYTmXC96xcF5Vsnp6KjQTgHQH4/vII7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","last_reissued_at":"2026-05-18T03:55:46.492808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:46.492808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Tur\\'an Problem for Even Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Shagnik Das","submitted_at":"2012-02-15T07:31:35Z","abstract_excerpt":"An edge-colored graph is rainbow if all its edges are colored with distinct colors. For a fixed graph $H$, the rainbow Tur\\'an number $\\mathrm{ex}^{\\ast}(n,H)$ is defined as the maximum number of edges in a properly edge-colored graph on $n$ vertices with no rainbow copy of $H$. We study the rainbow Tur\\'an number of even cycles, and prove that for every fixed $\\varepsilon > 0$, there is a constant $C(\\varepsilon)$ such that every properly edge-colored graph on $n$ vertices with at least $C(\\varepsilon) n^{1 + \\varepsilon}$ edges contains a rainbow cycle of even length at most $2 \\lceil \\frac{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3221","kind":"arxiv","version":2},"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":"1202.3221","created_at":"2026-05-18T03:55:46.492866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3221v2","created_at":"2026-05-18T03:55:46.492866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3221","created_at":"2026-05-18T03:55:46.492866+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLXTHRXXATDL","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLXTHRXXATDLQN3N","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLXTHRXX","created_at":"2026-05-18T12:27:20.899486+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/RLXTHRXXATDLQN3NBPCRKP2KCN","json":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN.json","graph_json":"https://pith.science/api/pith-number/RLXTHRXXATDLQN3NBPCRKP2KCN/graph.json","events_json":"https://pith.science/api/pith-number/RLXTHRXXATDLQN3NBPCRKP2KCN/events.json","paper":"https://pith.science/paper/RLXTHRXX"},"agent_actions":{"view_html":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN","download_json":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN.json","view_paper":"https://pith.science/paper/RLXTHRXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3221&json=true","fetch_graph":"https://pith.science/api/pith-number/RLXTHRXXATDLQN3NBPCRKP2KCN/graph.json","fetch_events":"https://pith.science/api/pith-number/RLXTHRXXATDLQN3NBPCRKP2KCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/action/storage_attestation","attest_author":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/action/author_attestation","sign_citation":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/action/citation_signature","submit_replication":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/action/replication_record"}},"created_at":"2026-05-18T03:55:46.492866+00:00","updated_at":"2026-05-18T03:55:46.492866+00:00"}