{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TQIYH7ASWLTTMPYPMNQYVGKYBP","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":"53cb8699c316a63dfd8ab67e7588bf9f7aa90890d792df9e9e6fa4bf1e5645e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T17:42:35Z","title_canon_sha256":"6cbcdc73badb77e6490da9e331b90b6015e7411254097a6f6222f0ded2ec3115"},"schema_version":"1.0","source":{"id":"1809.00227","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00227","created_at":"2026-07-05T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00227v2","created_at":"2026-07-05T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00227","created_at":"2026-07-05T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"TQIYH7ASWLTT","created_at":"2026-07-05T01:35:42Z"},{"alias_kind":"pith_short_16","alias_value":"TQIYH7ASWLTTMPYP","created_at":"2026-07-05T01:35:42Z"},{"alias_kind":"pith_short_8","alias_value":"TQIYH7AS","created_at":"2026-07-05T01:35:42Z"}],"graph_snapshots":[{"event_id":"sha256:08a8b777d32e936d3470cc98531420cf1cbad6d656717f7a56c3f42f461e6613","target":"graph","created_at":"2026-07-05T01:35:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1809.00227/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 at most $k$ colors. For an integer $k\\geq 1$, the Gallai-Ramsey number $GR_k(H)$ of a given graph $H$ is the least positive integer $N$ such that every Gallai $k$-coloring of the complete graph $K_N$ contains a monochromatic copy of $H$. Let $C_m$ denote the cycle on $m\\ge4$ vertices and let $\\Theta_m$ denote the family of graphs obtained from $C_m$ by adding an additional edge joining two non-consecutive vertices. We prove that $GR_k(\\Theta_{2n+1","authors_text":"Fangfang Zhang, Yaojun Chen, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T17:42:35Z","title":"Gallai-Ramsey number of odd cycles with chords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00227","kind":"arxiv","version":2},"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:e3b6b0107c720656f2d9fe74730ff8f7abc9736800b35745ea82f8bde5826cf9","target":"record","created_at":"2026-07-05T01:35:42Z","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":"53cb8699c316a63dfd8ab67e7588bf9f7aa90890d792df9e9e6fa4bf1e5645e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T17:42:35Z","title_canon_sha256":"6cbcdc73badb77e6490da9e331b90b6015e7411254097a6f6222f0ded2ec3115"},"schema_version":"1.0","source":{"id":"1809.00227","kind":"arxiv","version":2}},"canonical_sha256":"9c1183fc12b2e7363f0f63618a99580bc76c48b5ebbd7bb7a0a7d040bd8accd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c1183fc12b2e7363f0f63618a99580bc76c48b5ebbd7bb7a0a7d040bd8accd1","first_computed_at":"2026-07-05T01:35:42.811671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:35:42.811671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+eemKULokJhv9a2hiw7ate2iuzaRQQ8MXnyEik7W1m74Qfwwce68su2Rp0evEBVzaAxz9gwGcED9QtigIdsDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:35:42.812053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00227","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3b6b0107c720656f2d9fe74730ff8f7abc9736800b35745ea82f8bde5826cf9","sha256:08a8b777d32e936d3470cc98531420cf1cbad6d656717f7a56c3f42f461e6613"],"state_sha256":"3f3406f67ed7b1b7ca10d4dea0b58879c6b748e37b93eb3d6bf11b8cd5a03241"}