{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UEE4RMCRBVWWZQO4I677XM4BQE","short_pith_number":"pith:UEE4RMCR","schema_version":"1.0","canonical_sha256":"a109c8b0510d6d6cc1dc47bffbb38181353be3f0473f98a8875de4b0ce6e1431","source":{"kind":"arxiv","id":"1802.06503","version":2},"attestation_state":"computed","paper":{"title":"Multicolor Gallai-Ramsey numbers of $C_9$ and $C_{11}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Bosse, Zi-Xia Song","submitted_at":"2018-02-19T02:32:23Z","abstract_excerpt":"A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. We study Ramsey-type problems in Gallai colorings. Given an integer $k\\ge1$ and a graph $H$, the Gallai-Ramsey number $GR_k(H)$ is the least positive integer $n$ such that every Gallai $k$-coloring of the complete graph on $n$ vertices contains a monochromatic copy of $H$. It turns out that $GR_k(H)$ is more well-behaved than the classical Ramsey number $R_k(H)$. However, finding exact values of $GR_k (H)$ is far from trivial. In this "},"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":"1802.06503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-19T02:32:23Z","cross_cats_sorted":[],"title_canon_sha256":"1fcf36cfd170ae35e3d20fc92647fb7c836a16157ad13376769889ef60c8ff3e","abstract_canon_sha256":"df091d1b10475fbd9675fe0c4c359d7791cbaf4ab1980b03b4c1c987c9b9a896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:41.055202Z","signature_b64":"yI67yvUmHEdO1vkD8t3qfnVzO771gIfC0E6M54rPItrDdxZZ+vmoVbv/dbufwbvlevmMX0KepVmHA1Oq5OvLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a109c8b0510d6d6cc1dc47bffbb38181353be3f0473f98a8875de4b0ce6e1431","last_reissued_at":"2026-05-18T00:19:41.054690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:41.054690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicolor Gallai-Ramsey numbers of $C_9$ and $C_{11}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Bosse, Zi-Xia Song","submitted_at":"2018-02-19T02:32:23Z","abstract_excerpt":"A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. We study Ramsey-type problems in Gallai colorings. Given an integer $k\\ge1$ and a graph $H$, the Gallai-Ramsey number $GR_k(H)$ is the least positive integer $n$ such that every Gallai $k$-coloring of the complete graph on $n$ vertices contains a monochromatic copy of $H$. It turns out that $GR_k(H)$ is more well-behaved than the classical Ramsey number $R_k(H)$. However, finding exact values of $GR_k (H)$ is far from trivial. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06503","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":"1802.06503","created_at":"2026-05-18T00:19:41.054764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06503v2","created_at":"2026-05-18T00:19:41.054764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06503","created_at":"2026-05-18T00:19:41.054764+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEE4RMCRBVWW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEE4RMCRBVWWZQO4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEE4RMCR","created_at":"2026-05-18T12:32:56.356000+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/UEE4RMCRBVWWZQO4I677XM4BQE","json":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE.json","graph_json":"https://pith.science/api/pith-number/UEE4RMCRBVWWZQO4I677XM4BQE/graph.json","events_json":"https://pith.science/api/pith-number/UEE4RMCRBVWWZQO4I677XM4BQE/events.json","paper":"https://pith.science/paper/UEE4RMCR"},"agent_actions":{"view_html":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE","download_json":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE.json","view_paper":"https://pith.science/paper/UEE4RMCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/UEE4RMCRBVWWZQO4I677XM4BQE/graph.json","fetch_events":"https://pith.science/api/pith-number/UEE4RMCRBVWWZQO4I677XM4BQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE/action/storage_attestation","attest_author":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE/action/author_attestation","sign_citation":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE/action/citation_signature","submit_replication":"https://pith.science/pith/UEE4RMCRBVWWZQO4I677XM4BQE/action/replication_record"}},"created_at":"2026-05-18T00:19:41.054764+00:00","updated_at":"2026-05-18T00:19:41.054764+00:00"}