{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CZTHHRWNSFEDEOR5P4MVJFERQA","short_pith_number":"pith:CZTHHRWN","schema_version":"1.0","canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","source":{"kind":"arxiv","id":"1901.03308","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for rainbow Tur\\'{a}n numbers of paths and other trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Johnston, Puck Rombach","submitted_at":"2019-01-10T18:23:00Z","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 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 rainbow Tur\\'{a}n number of $F$. We show that $ex^*(n,P_k)\\geq \\frac{k}{2}n + O(1)$ where $P_k$ is a path on $k\\geq 3$ edges, generalizing a result by Maamoun and Meyniel and by Johnston, Palmer and Sarkar. We show similar bounds for brooms on $2^s-1$ edges and diameter $\\leq 10$ and a few other caterpillars of"},"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":"1901.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"9110f2686d44b78eb5eb2501ed71936adec5d9e9313ce661d527b08ff257a436","abstract_canon_sha256":"999c9e9709ee4edeac4cc4018463bcb7c100aa1576649fdea1d23fb299d696d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.770948Z","signature_b64":"zpa51nCvNzNL5qVzi6LRFZUEYkxo8ZelGPWib0HQMm6E4IgGt/2CvDbkZyPv96ez0fP8KOA7jZVdqauCgdO/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","last_reissued_at":"2026-05-17T23:56:34.770497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.770497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for rainbow Tur\\'{a}n numbers of paths and other trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Johnston, Puck Rombach","submitted_at":"2019-01-10T18:23:00Z","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 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 rainbow Tur\\'{a}n number of $F$. We show that $ex^*(n,P_k)\\geq \\frac{k}{2}n + O(1)$ where $P_k$ is a path on $k\\geq 3$ edges, generalizing a result by Maamoun and Meyniel and by Johnston, Palmer and Sarkar. We show similar bounds for brooms on $2^s-1$ edges and diameter $\\leq 10$ and a few other caterpillars of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03308","kind":"arxiv","version":1},"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":"1901.03308","created_at":"2026-05-17T23:56:34.770565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03308v1","created_at":"2026-05-17T23:56:34.770565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03308","created_at":"2026-05-17T23:56:34.770565+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZTHHRWNSFED","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZTHHRWNSFEDEOR5","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZTHHRWN","created_at":"2026-05-18T12:33:15.570797+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/CZTHHRWNSFEDEOR5P4MVJFERQA","json":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA.json","graph_json":"https://pith.science/api/pith-number/CZTHHRWNSFEDEOR5P4MVJFERQA/graph.json","events_json":"https://pith.science/api/pith-number/CZTHHRWNSFEDEOR5P4MVJFERQA/events.json","paper":"https://pith.science/paper/CZTHHRWN"},"agent_actions":{"view_html":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA","download_json":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA.json","view_paper":"https://pith.science/paper/CZTHHRWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03308&json=true","fetch_graph":"https://pith.science/api/pith-number/CZTHHRWNSFEDEOR5P4MVJFERQA/graph.json","fetch_events":"https://pith.science/api/pith-number/CZTHHRWNSFEDEOR5P4MVJFERQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/action/storage_attestation","attest_author":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/action/author_attestation","sign_citation":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/action/citation_signature","submit_replication":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/action/replication_record"}},"created_at":"2026-05-17T23:56:34.770565+00:00","updated_at":"2026-05-17T23:56:34.770565+00:00"}