{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KL4PW2UYFI3DG33AOTSZAWSTXM","short_pith_number":"pith:KL4PW2UY","schema_version":"1.0","canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","source":{"kind":"arxiv","id":"1902.00612","version":1},"attestation_state":"computed","paper":{"title":"Gallai-Ramsey numbers for rainbow paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Ligong Wang, Noah Watts, Pierre Besse, Xihe Li","submitted_at":"2019-02-02T01:32:17Z","abstract_excerpt":"Given graphs $G$ and $H$ and a positive integer $k$, the \\emph{Gallai-Ramsey number}, denoted by $gr_{k}(G : H)$ is defined to be the minimum integer $n$ such that every coloring of $K_{n}$ using at most $k$ colors will contain either a rainbow copy of $G$ or a monochromatic copy of $H$. We consider this question in the cases where $G \\in \\{P_{4}, P_{5}\\}$. In the case where $G = P_{4}$, we completely solve the Gallai-Ramsey question by reducing to the $2$-color Ramsey numbers. In the case where $G = P_{5}$, we conjecture that the problem reduces to the $3$-color Ramsey numbers and provide sev"},"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":"1902.00612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-02T01:32:17Z","cross_cats_sorted":[],"title_canon_sha256":"d6965b3f0075130bd489806649a00885fcb4dba14ffd197c3df00eb2a222fcdd","abstract_canon_sha256":"ec6db3bc1410f2cc476dd1bd8539c4ee24fab1394b9600022c2e755f38e46476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.684007Z","signature_b64":"c2ivY9HOAvCHoSR2Y5ENRTYAKpZUuf8RapvXvihw89W0Ws7JIBFK4Pr53Ek6gtfvByA2LYWRV3k1ptqxMbcZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","last_reissued_at":"2026-05-17T23:54:52.683417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.683417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gallai-Ramsey numbers for rainbow paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Ligong Wang, Noah Watts, Pierre Besse, Xihe Li","submitted_at":"2019-02-02T01:32:17Z","abstract_excerpt":"Given graphs $G$ and $H$ and a positive integer $k$, the \\emph{Gallai-Ramsey number}, denoted by $gr_{k}(G : H)$ is defined to be the minimum integer $n$ such that every coloring of $K_{n}$ using at most $k$ colors will contain either a rainbow copy of $G$ or a monochromatic copy of $H$. We consider this question in the cases where $G \\in \\{P_{4}, P_{5}\\}$. In the case where $G = P_{4}$, we completely solve the Gallai-Ramsey question by reducing to the $2$-color Ramsey numbers. In the case where $G = P_{5}$, we conjecture that the problem reduces to the $3$-color Ramsey numbers and provide sev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00612","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":"1902.00612","created_at":"2026-05-17T23:54:52.683529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00612v1","created_at":"2026-05-17T23:54:52.683529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00612","created_at":"2026-05-17T23:54:52.683529+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL4PW2UYFI3D","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL4PW2UYFI3DG33A","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL4PW2UY","created_at":"2026-05-18T12:33:21.387695+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/KL4PW2UYFI3DG33AOTSZAWSTXM","json":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM.json","graph_json":"https://pith.science/api/pith-number/KL4PW2UYFI3DG33AOTSZAWSTXM/graph.json","events_json":"https://pith.science/api/pith-number/KL4PW2UYFI3DG33AOTSZAWSTXM/events.json","paper":"https://pith.science/paper/KL4PW2UY"},"agent_actions":{"view_html":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM","download_json":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM.json","view_paper":"https://pith.science/paper/KL4PW2UY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00612&json=true","fetch_graph":"https://pith.science/api/pith-number/KL4PW2UYFI3DG33AOTSZAWSTXM/graph.json","fetch_events":"https://pith.science/api/pith-number/KL4PW2UYFI3DG33AOTSZAWSTXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/action/storage_attestation","attest_author":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/action/author_attestation","sign_citation":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/action/citation_signature","submit_replication":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/action/replication_record"}},"created_at":"2026-05-17T23:54:52.683529+00:00","updated_at":"2026-05-17T23:54:52.683529+00:00"}