{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GAPL3D5BXQMEZALNJJTEIEG5AY","short_pith_number":"pith:GAPL3D5B","schema_version":"1.0","canonical_sha256":"301ebd8fa1bc184c816d4a664410dd062a6d67a075812433fa0cde29bb15016e","source":{"kind":"arxiv","id":"1909.02590","version":2},"attestation_state":"computed","paper":{"title":"Chromatic number is Ramsey distinguishing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Savery","submitted_at":"2019-09-05T18:27:41Z","abstract_excerpt":"A graph $G$ is Ramsey for a graph $H$ if every colouring of the edges of $G$ in two colours contains a monochromatic copy of $H$. Two graphs $H_1$ and $H_2$ are Ramsey equivalent if any graph $G$ is Ramsey for $H_1$ if and only if it is Ramsey for $H_2$. A graph parameter $s$ is Ramsey distinguishing if $s(H_1)\\neq s(H_2)$ implies that $H_1$ and $H_2$ are not Ramsey equivalent. In this paper we show that the chromatic number is a Ramsey distinguishing parameter. We also extend this to the multi-colour case and use a similar idea to find another graph parameter which is Ramsey distinguishing."},"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":"1909.02590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T18:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"1d73f6a649a07cf2fba38edde1c13c068d9fb4eb5a66ec56f93ade16d77c469d","abstract_canon_sha256":"c4a65430625252fc74bbfec224bbb026ccc58a45e4f00132492d684e6a4536da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:08.795479Z","signature_b64":"o69Rcqo/aw3z+FzgxP2HskLOmZNKnT60/aYEyfNTj1kQLV7nL7l3E6tSh6Vi4zYQrXBH1QhHqhvrtOJPd65iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301ebd8fa1bc184c816d4a664410dd062a6d67a075812433fa0cde29bb15016e","last_reissued_at":"2026-07-05T04:03:08.795128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:08.795128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic number is Ramsey distinguishing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Savery","submitted_at":"2019-09-05T18:27:41Z","abstract_excerpt":"A graph $G$ is Ramsey for a graph $H$ if every colouring of the edges of $G$ in two colours contains a monochromatic copy of $H$. Two graphs $H_1$ and $H_2$ are Ramsey equivalent if any graph $G$ is Ramsey for $H_1$ if and only if it is Ramsey for $H_2$. A graph parameter $s$ is Ramsey distinguishing if $s(H_1)\\neq s(H_2)$ implies that $H_1$ and $H_2$ are not Ramsey equivalent. In this paper we show that the chromatic number is a Ramsey distinguishing parameter. We also extend this to the multi-colour case and use a similar idea to find another graph parameter which is Ramsey distinguishing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02590","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.02590/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.02590","created_at":"2026-07-05T04:03:08.795183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02590v2","created_at":"2026-07-05T04:03:08.795183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02590","created_at":"2026-07-05T04:03:08.795183+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAPL3D5BXQME","created_at":"2026-07-05T04:03:08.795183+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAPL3D5BXQMEZALN","created_at":"2026-07-05T04:03:08.795183+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAPL3D5B","created_at":"2026-07-05T04:03:08.795183+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/GAPL3D5BXQMEZALNJJTEIEG5AY","json":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY.json","graph_json":"https://pith.science/api/pith-number/GAPL3D5BXQMEZALNJJTEIEG5AY/graph.json","events_json":"https://pith.science/api/pith-number/GAPL3D5BXQMEZALNJJTEIEG5AY/events.json","paper":"https://pith.science/paper/GAPL3D5B"},"agent_actions":{"view_html":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY","download_json":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY.json","view_paper":"https://pith.science/paper/GAPL3D5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02590&json=true","fetch_graph":"https://pith.science/api/pith-number/GAPL3D5BXQMEZALNJJTEIEG5AY/graph.json","fetch_events":"https://pith.science/api/pith-number/GAPL3D5BXQMEZALNJJTEIEG5AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY/action/storage_attestation","attest_author":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY/action/author_attestation","sign_citation":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY/action/citation_signature","submit_replication":"https://pith.science/pith/GAPL3D5BXQMEZALNJJTEIEG5AY/action/replication_record"}},"created_at":"2026-07-05T04:03:08.795183+00:00","updated_at":"2026-07-05T04:03:08.795183+00:00"}