{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RLXTHRXXATDLQN3NBPCRKP2KCN","short_pith_number":"pith:RLXTHRXX","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"},"canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","source":{"kind":"arxiv","id":"1202.3221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3221","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3221v2","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3221","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"RLXTHRXXATDL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLXTHRXXATDLQN3N","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLXTHRXX","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RLXTHRXXATDLQN3NBPCRKP2KCN","target":"record","payload":{"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"},"canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","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"},"source_kind":"arxiv","source_id":"1202.3221","source_version":2,"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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srbx7G5+wGnDB792QYIKCvfEDuJS+ilBXNkN0o3GkApJIs8tvX5sBREvMupaQ4sZb5i9pg3COQ5nHW0+FWFaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:44.875381Z"},"content_sha256":"d869b5cbb26e6ac86665af72464f14bdb36ffbf72e90153ae18cf5476395c903","schema_version":"1.0","event_id":"sha256:d869b5cbb26e6ac86665af72464f14bdb36ffbf72e90153ae18cf5476395c903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RLXTHRXXATDLQN3NBPCRKP2KCN","target":"graph","payload":{"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"},"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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOqGyP2htPqzx34/own0SXfESF/C24pgx4/RJRJFBErCdfXp/njA80bhVbHZ8PqkBQYimR7Zr5qWAAXRvtMrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:44.875739Z"},"content_sha256":"415dfe75b100d0ec8a48626a22aac6df6a1789ae5031da9c93369bbd4da307e3","schema_version":"1.0","event_id":"sha256:415dfe75b100d0ec8a48626a22aac6df6a1789ae5031da9c93369bbd4da307e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/bundle.json","state_url":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/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-30T05:19:44Z","links":{"resolver":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN","bundle":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/bundle.json","state":"https://pith.science/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLXTHRXXATDLQN3NBPCRKP2KCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RLXTHRXXATDLQN3NBPCRKP2KCN","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":"66dbf3fea4368db042a4cb1823e1f5497e3128f90971b1e3d66128717bb87719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T07:31:35Z","title_canon_sha256":"756e4d00744df52f6787d82618822a10cf57d5d74be098c6721a823df0ac0d0f"},"schema_version":"1.0","source":{"id":"1202.3221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3221","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3221v2","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3221","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"RLXTHRXXATDL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLXTHRXXATDLQN3N","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLXTHRXX","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:415dfe75b100d0ec8a48626a22aac6df6a1789ae5031da9c93369bbd4da307e3","target":"graph","created_at":"2026-05-18T03:55:46Z","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":"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{","authors_text":"Benny Sudakov, Choongbum Lee, Shagnik Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T07:31:35Z","title":"Rainbow Tur\\'an Problem for Even Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3221","kind":"arxiv","version":2},"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:d869b5cbb26e6ac86665af72464f14bdb36ffbf72e90153ae18cf5476395c903","target":"record","created_at":"2026-05-18T03:55:46Z","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":"66dbf3fea4368db042a4cb1823e1f5497e3128f90971b1e3d66128717bb87719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T07:31:35Z","title_canon_sha256":"756e4d00744df52f6787d82618822a10cf57d5d74be098c6721a823df0ac0d0f"},"schema_version":"1.0","source":{"id":"1202.3221","kind":"arxiv","version":2}},"canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aef33c6f704c6b8376d0bc5153f4a137bc28488b534cbf5e12e799b5d897443","first_computed_at":"2026-05-18T03:55:46.492808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:46.492808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N5Obxa5a6Fr+JLkwnzvlUuQpyYpkC8N4dsOiM4LXSxc+OO+npRnnkVYTmXC96xcF5Vsnp6KjQTgHQH4/vII7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:46.493240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d869b5cbb26e6ac86665af72464f14bdb36ffbf72e90153ae18cf5476395c903","sha256:415dfe75b100d0ec8a48626a22aac6df6a1789ae5031da9c93369bbd4da307e3"],"state_sha256":"c1c376819b97dd207db23476c98bfe041c6c7d4a5a494096c9707a668bb4b567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkZus2rSOLDyltaMK4FMG9H3Z6WUz6JZjKNVEGAuxHJvSdOuwZt34VHLtQ80cN3Bw0/tNG9kNkei9S/+eEnGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:19:44.878002Z","bundle_sha256":"6484200ff74c220b2c0d5b5644d4099f6ed500ca9af517bb8f7814c29710daa2"}}