{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SRDDJZ3HZJJ3PCQENMF3T7L623","short_pith_number":"pith:SRDDJZ3H","schema_version":"1.0","canonical_sha256":"944634e767ca53b78a046b0bb9fd7ed6cc8b95d7773cd73b5eae6e1eb7f6cbf8","source":{"kind":"arxiv","id":"1609.00069","version":2},"attestation_state":"computed","paper":{"title":"Rainbow Tur\\'an problems for paths and forests of stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amites Sarkar, Cory Palmer, Daniel Johnston","submitted_at":"2016-08-31T23:57:08Z","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."},"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":"1609.00069","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T23:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"a0ed538758594f9648ad08cb601cbf362686a1705206db8d89d460639bb867d6","abstract_canon_sha256":"8f752aa727bc3acdac20285381fa1ba7e599bc88d0b1d17df660f8ac7d8e339b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.415250Z","signature_b64":"SIr79Jrx21FhGMsBUbD3CbSqXxVb9ZxqzZUpiK2g+b3p6FaTYkHRK8W8muBy4qFnj8FuJ3df4sKIezicOdHHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"944634e767ca53b78a046b0bb9fd7ed6cc8b95d7773cd73b5eae6e1eb7f6cbf8","last_reissued_at":"2026-05-18T00:54:15.414584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.414584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Tur\\'an problems for paths and forests of stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amites Sarkar, Cory Palmer, Daniel Johnston","submitted_at":"2016-08-31T23:57:08Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00069","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":"1609.00069","created_at":"2026-05-18T00:54:15.414679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00069v2","created_at":"2026-05-18T00:54:15.414679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00069","created_at":"2026-05-18T00:54:15.414679+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRDDJZ3HZJJ3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRDDJZ3HZJJ3PCQE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRDDJZ3H","created_at":"2026-05-18T12:30:44.179134+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/SRDDJZ3HZJJ3PCQENMF3T7L623","json":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623.json","graph_json":"https://pith.science/api/pith-number/SRDDJZ3HZJJ3PCQENMF3T7L623/graph.json","events_json":"https://pith.science/api/pith-number/SRDDJZ3HZJJ3PCQENMF3T7L623/events.json","paper":"https://pith.science/paper/SRDDJZ3H"},"agent_actions":{"view_html":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623","download_json":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623.json","view_paper":"https://pith.science/paper/SRDDJZ3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00069&json=true","fetch_graph":"https://pith.science/api/pith-number/SRDDJZ3HZJJ3PCQENMF3T7L623/graph.json","fetch_events":"https://pith.science/api/pith-number/SRDDJZ3HZJJ3PCQENMF3T7L623/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623/action/storage_attestation","attest_author":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623/action/author_attestation","sign_citation":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623/action/citation_signature","submit_replication":"https://pith.science/pith/SRDDJZ3HZJJ3PCQENMF3T7L623/action/replication_record"}},"created_at":"2026-05-18T00:54:15.414679+00:00","updated_at":"2026-05-18T00:54:15.414679+00:00"}