{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SRDDJZ3HZJJ3PCQENMF3T7L623","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":"8f752aa727bc3acdac20285381fa1ba7e599bc88d0b1d17df660f8ac7d8e339b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T23:57:08Z","title_canon_sha256":"a0ed538758594f9648ad08cb601cbf362686a1705206db8d89d460639bb867d6"},"schema_version":"1.0","source":{"id":"1609.00069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00069","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00069v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00069","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"SRDDJZ3HZJJ3","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRDDJZ3HZJJ3PCQE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRDDJZ3H","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:b52e906da64c5f528867e77beacaf4124a11e34f6cea8b66029848f39fae3c81","target":"graph","created_at":"2026-05-18T00:54:15Z","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":"For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a {\\emph rainbow copy} of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n,F)$, is the {\\emph rainbow Tur\\'an number} of $F$, and its systematic study was initiated by Keevash, Mubayi, Sudakov and Verstra\\\"ete in 2007. We determine $ex^*(n,F)$ exactly when $F$ is a forest of stars, and give bounds on $ex^*(n,F)$ when $F$ is a path with $k$ edges, disproving a conjecture in Keevash et al.","authors_text":"Amites Sarkar, Cory Palmer, Daniel Johnston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T23:57:08Z","title":"Rainbow Tur\\'an problems for paths and forests of stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00069","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:e2150c5d6aa5006631e4672aacf79a81ec2838284c0507114965aa07742a93bf","target":"record","created_at":"2026-05-18T00:54:15Z","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":"8f752aa727bc3acdac20285381fa1ba7e599bc88d0b1d17df660f8ac7d8e339b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T23:57:08Z","title_canon_sha256":"a0ed538758594f9648ad08cb601cbf362686a1705206db8d89d460639bb867d6"},"schema_version":"1.0","source":{"id":"1609.00069","kind":"arxiv","version":2}},"canonical_sha256":"944634e767ca53b78a046b0bb9fd7ed6cc8b95d7773cd73b5eae6e1eb7f6cbf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"944634e767ca53b78a046b0bb9fd7ed6cc8b95d7773cd73b5eae6e1eb7f6cbf8","first_computed_at":"2026-05-18T00:54:15.414584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:15.414584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SIr79Jrx21FhGMsBUbD3CbSqXxVb9ZxqzZUpiK2g+b3p6FaTYkHRK8W8muBy4qFnj8FuJ3df4sKIezicOdHHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:15.415250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2150c5d6aa5006631e4672aacf79a81ec2838284c0507114965aa07742a93bf","sha256:b52e906da64c5f528867e77beacaf4124a11e34f6cea8b66029848f39fae3c81"],"state_sha256":"c00c76a83c75e7f019393a5069cc52af011031acec47b3acb06d5bdb59198c17"}