Reproducibility materials for The three-color Ramsey number of the ten-vertex path

This archive contains the reproducibility materials for the manuscript “The three-color Ramsey number of the ten-vertex path” by Zehui Shao, Enqiang Zhu, Jin Xu, and Saeed Kosari, which proves that (R(P_{10},P_{10},P_{10})=18). The package includes: C++14 programs for the exhaustive finite verifications supporting Lemmas 13, 14, and 28; independent implementation checks, reference outputs, and exact expected results; scripts for building, running, and checking the verification programs; editable TikZ sources and reference PDFs for all eleven figures; a detailed reproduction guide, source-to-result and figure mappings, citation metadata, and SHA-256 checksums. The reproduction guide explains how readers and reviewers can inspect the computational evidence, reproduce the results, and locate each program and output in the manuscript and supplementary material. The mathematical coverage arguments appear in Sections S1 and S2 of the separately provided supplementary material. All finite instances are generated internally. The verification programs require no external dataset or solver. Version: 1.0.1, corresponding to manuscript revision v7. Licenses: C++ and Python code, including build scripts, is licensed under MIT. Documentation, metadata, figure sources, reference figures, and reference result files are licensed under CC BY 4.0.