{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LKLNJ6JZDSH7QGM2CIO765273E","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":"131f7380b223f049db644b75ae18777231bf91829cb46de7749d1935a41636b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T10:44:17Z","title_canon_sha256":"4b0dbf8d9b1928823e91ccd177fb569bb489f74013bde3285c1b02626d766e8c"},"schema_version":"1.0","source":{"id":"2605.26826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26826","created_at":"2026-05-27T01:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26826v1","created_at":"2026-05-27T01:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26826","created_at":"2026-05-27T01:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"LKLNJ6JZDSH7","created_at":"2026-05-27T01:06:14Z"},{"alias_kind":"pith_short_16","alias_value":"LKLNJ6JZDSH7QGM2","created_at":"2026-05-27T01:06:14Z"},{"alias_kind":"pith_short_8","alias_value":"LKLNJ6JZ","created_at":"2026-05-27T01:06:14Z"}],"graph_snapshots":[{"event_id":"sha256:d9fd3ecf6e9bcc9b5fdbb8d8aeeb2a3e119d285e499902cfd75bb640cb3d2c43","target":"graph","created_at":"2026-05-27T01:06:14Z","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/2605.26826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For graph $G$, a connected graph $H$ of order $n$ is said to be $G$-good if $r(G,H)=(\\chi(G)-1)(n-1)+s(G)$, where $\\chi(G)$ is the chromatic number of $G$ and $s(G)$ is the minimum size of a color class in a $\\chi(G)$-coloring of $G$. Let $K_{p+1}(\\alpha;n)$ denote the complete $(p+1)$-partite graph with $p$ partite sets of size $\\alpha$ and one partite set of size $n$. We determine all graphs $G$ for which $K_{p+1}(\\alpha;n)$ is $G$-good for large $n$. The characterization depends on the parameter $\\mathrm{snd}(\\alpha)$, the smallest non-divisor of $\\alpha$.","authors_text":"Shaonan Mi, Ye Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T10:44:17Z","title":"Ramsey goodness of complete multipartite graphs with one large part"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26826","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:85b2f751c82cf343103cb4267b3df14503d9aca0247569ec9192466e52deffc4","target":"record","created_at":"2026-05-27T01:06:14Z","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":"131f7380b223f049db644b75ae18777231bf91829cb46de7749d1935a41636b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T10:44:17Z","title_canon_sha256":"4b0dbf8d9b1928823e91ccd177fb569bb489f74013bde3285c1b02626d766e8c"},"schema_version":"1.0","source":{"id":"2605.26826","kind":"arxiv","version":1}},"canonical_sha256":"5a96d4f9391c8ff8199a121dff775fd91ba098a98096c1d61a3dba8b134f9837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a96d4f9391c8ff8199a121dff775fd91ba098a98096c1d61a3dba8b134f9837","first_computed_at":"2026-05-27T01:06:14.525093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:06:14.525093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZqBIZxUBo4pMFRDALUIsVFGn6Qbze+C1nEzfFtLO2ea0IUDoI79qek/pcjPNNxLGDbLX4k7XM/R8E1xkbciDQ==","signature_status":"signed_v1","signed_at":"2026-05-27T01:06:14.525910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85b2f751c82cf343103cb4267b3df14503d9aca0247569ec9192466e52deffc4","sha256:d9fd3ecf6e9bcc9b5fdbb8d8aeeb2a3e119d285e499902cfd75bb640cb3d2c43"],"state_sha256":"e344818c510fa8fe6d0bcc7f2303b08c119efb82c9ccc4b0467565be816b010d"}