{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HSR7IELSGPDUQSP5R7OUYFZRKU","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":"87cdbde0448e1074c9552b9dfebab21452cf642bfd69836bd28eb0d5674e279a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-10T21:23:36Z","title_canon_sha256":"6763603be58c0df6c935f5940733972fc9f53eddfd009c2f0f042bc08919c449"},"schema_version":"1.0","source":{"id":"1805.04180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04180","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04180v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04180","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"HSR7IELSGPDU","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HSR7IELSGPDUQSP5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HSR7IELS","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5af01660d4a06ca2f30433043462920297abf34a12bdfed4fdc5b9624c47356e","target":"graph","created_at":"2026-05-18T00:16:13Z","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":"Let $F$ be a fixed graph. The rainbow Tur\\'an number of $F$ is defined as the maximum number of edges in a graph on $n$ vertices that has a proper edge-coloring with no rainbow copy of $F$ (where a rainbow copy of $F$ means a copy of $F$ all of whose edges have different colours). The systematic study of such problems was initiated by Keevash, Mubayi, Sudakov and Verstra\\\"ete.\n  In this paper, we show that the rainbow Tur\\'an number of a path with $k+1$ edges is less than $\\left(\\frac{9k}{7}+2\\right) n$, improving an earlier estimate of Johnston, Palmer and Sarkar.","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-10T21:23:36Z","title":"On the Rainbow Tur\\'an number of paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04180","kind":"arxiv","version":1},"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:04c54c6142125f33be7407653435ded0aaecf6d92e22e683edd86acf1f300aa1","target":"record","created_at":"2026-05-18T00:16:13Z","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":"87cdbde0448e1074c9552b9dfebab21452cf642bfd69836bd28eb0d5674e279a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-10T21:23:36Z","title_canon_sha256":"6763603be58c0df6c935f5940733972fc9f53eddfd009c2f0f042bc08919c449"},"schema_version":"1.0","source":{"id":"1805.04180","kind":"arxiv","version":1}},"canonical_sha256":"3ca3f4117233c74849fd8fdd4c1731550a1426f7e6c90bce1968572324690347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ca3f4117233c74849fd8fdd4c1731550a1426f7e6c90bce1968572324690347","first_computed_at":"2026-05-18T00:16:13.347900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:13.347900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICKrfgPHlIMt87cJY3Z6kxSd2VvFAIcSZCQ1lWibI7d8vChY5jrjjVO/eaKfG7fskrsN6YDyg0cuKUd3YP/9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:13.348658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04c54c6142125f33be7407653435ded0aaecf6d92e22e683edd86acf1f300aa1","sha256:5af01660d4a06ca2f30433043462920297abf34a12bdfed4fdc5b9624c47356e"],"state_sha256":"7020259218a954a69c30355d1da9c7f2b53d5c5f39f9ba9af4cb7c981cf11712"}