{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KL4PW2UYFI3DG33AOTSZAWSTXM","short_pith_number":"pith:KL4PW2UY","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"},"canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","source":{"kind":"arxiv","id":"1902.00612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00612","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00612v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00612","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"KL4PW2UYFI3D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KL4PW2UYFI3DG33A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KL4PW2UY","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KL4PW2UYFI3DG33AOTSZAWSTXM","target":"record","payload":{"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"},"canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","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"},"source_kind":"arxiv","source_id":"1902.00612","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWmDITmkiBzaXLZaWFrwtBdfQfovGgM3xjAIk41gD10OXUvT2NloHPEItrsz/BbFVpwGbErYqPa1WVxV381TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:01:27.656123Z"},"content_sha256":"ad0498299e7419cd385d04692eddd6b851f32f4403215a9be9c619976865e706","schema_version":"1.0","event_id":"sha256:ad0498299e7419cd385d04692eddd6b851f32f4403215a9be9c619976865e706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KL4PW2UYFI3DG33AOTSZAWSTXM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eam0aD6VK8mPLLfG7w2S6ZxbaaRHNltz5X8G1B/B2Y4YhAg7ZFFLvQUo1HQpr4PRqWUL5wibeiI0Urjg4lrcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:01:27.656816Z"},"content_sha256":"ec4f139e81949e9ae457a8022c8f1ca6302e6ce85539aa996f4e473221da1fbd","schema_version":"1.0","event_id":"sha256:ec4f139e81949e9ae457a8022c8f1ca6302e6ce85539aa996f4e473221da1fbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/bundle.json","state_url":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T10:01:27Z","links":{"resolver":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM","bundle":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/bundle.json","state":"https://pith.science/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL4PW2UYFI3DG33AOTSZAWSTXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KL4PW2UYFI3DG33AOTSZAWSTXM","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":"ec6db3bc1410f2cc476dd1bd8539c4ee24fab1394b9600022c2e755f38e46476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-02T01:32:17Z","title_canon_sha256":"d6965b3f0075130bd489806649a00885fcb4dba14ffd197c3df00eb2a222fcdd"},"schema_version":"1.0","source":{"id":"1902.00612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00612","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00612v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00612","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"KL4PW2UYFI3D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KL4PW2UYFI3DG33A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KL4PW2UY","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:ec4f139e81949e9ae457a8022c8f1ca6302e6ce85539aa996f4e473221da1fbd","target":"graph","created_at":"2026-05-17T23:54:52Z","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":"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","authors_text":"Colton Magnant, Ligong Wang, Noah Watts, Pierre Besse, Xihe Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-02T01:32:17Z","title":"Gallai-Ramsey numbers for rainbow paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00612","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:ad0498299e7419cd385d04692eddd6b851f32f4403215a9be9c619976865e706","target":"record","created_at":"2026-05-17T23:54:52Z","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":"ec6db3bc1410f2cc476dd1bd8539c4ee24fab1394b9600022c2e755f38e46476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-02T01:32:17Z","title_canon_sha256":"d6965b3f0075130bd489806649a00885fcb4dba14ffd197c3df00eb2a222fcdd"},"schema_version":"1.0","source":{"id":"1902.00612","kind":"arxiv","version":1}},"canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f8fb6a982a36336f6074e5905a53bb0784fccee38ab16437a80aca1a9e5617","first_computed_at":"2026-05-17T23:54:52.683417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.683417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2ivY9HOAvCHoSR2Y5ENRTYAKpZUuf8RapvXvihw89W0Ws7JIBFK4Pr53Ek6gtfvByA2LYWRV3k1ptqxMbcZDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.684007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad0498299e7419cd385d04692eddd6b851f32f4403215a9be9c619976865e706","sha256:ec4f139e81949e9ae457a8022c8f1ca6302e6ce85539aa996f4e473221da1fbd"],"state_sha256":"ff56999934314871fb8847c829b0d1c25f59471b343605fea358750ca9ec0f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBijVuj9rt4TAUQcg/NSRuvbR9tGbsLcQT3M7CaySX7N0HdfEYgUUWrOMWgwPnvYuBXLGmNyBEZdn6Xhl9uGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:01:27.660276Z","bundle_sha256":"c19720eb067682ad886a544070846537cb9f83789128c97b49e3789bde7ecd2b"}}