{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:USUWMZJS7IIUKLAQYECHAO37MR","short_pith_number":"pith:USUWMZJS","schema_version":"1.0","canonical_sha256":"a4a9666532fa11452c10c104703b7f64696312f22db0e00106d8b62065ab0db6","source":{"kind":"arxiv","id":"1312.0299","version":1},"attestation_state":"computed","paper":{"title":"What is Ramsey-equivalent to a clique?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Grinshpun, Anita Liebenau, Jacob Fox, Tibor Szabo, Yury Person","submitted_at":"2013-12-02T01:41:44Z","abstract_excerpt":"A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H'. In this paper, we study the problem of determining which graphs are Ramsey-equivalent to the complete graph K_k. A famous theorem of Nesetril and Rodl implies that any graph H which is Ramsey-equivalent to K_k must contain K_k. We prove that the only connected graph which is Ramsey-equivalent to K_k is itself. This gives a negative answer to the question of Szabo, Zumstein, and Zurch"},"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":"1312.0299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-02T01:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"b85e58e349568a4cfe123cea7e5c3bb85c2dc99419507676f21573dc3f779ee4","abstract_canon_sha256":"1f2d1b24a06b5f00fb454f918739f311bfb6036bdb9674a1eedfdcceccd5401d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:46.152615Z","signature_b64":"TjRW8hFQGudXKjcmM/LWvOgBuk1K4EvSFnJgfh9eE3H+GZ7pbeD+mDnzASiiAgv+qgem5+yginZrYyaX9DW8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a9666532fa11452c10c104703b7f64696312f22db0e00106d8b62065ab0db6","last_reissued_at":"2026-05-18T03:05:46.151933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:46.151933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is Ramsey-equivalent to a clique?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Grinshpun, Anita Liebenau, Jacob Fox, Tibor Szabo, Yury Person","submitted_at":"2013-12-02T01:41:44Z","abstract_excerpt":"A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H'. In this paper, we study the problem of determining which graphs are Ramsey-equivalent to the complete graph K_k. A famous theorem of Nesetril and Rodl implies that any graph H which is Ramsey-equivalent to K_k must contain K_k. We prove that the only connected graph which is Ramsey-equivalent to K_k is itself. This gives a negative answer to the question of Szabo, Zumstein, and Zurch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0299","kind":"arxiv","version":1},"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":"1312.0299","created_at":"2026-05-18T03:05:46.152027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0299v1","created_at":"2026-05-18T03:05:46.152027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0299","created_at":"2026-05-18T03:05:46.152027+00:00"},{"alias_kind":"pith_short_12","alias_value":"USUWMZJS7IIU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"USUWMZJS7IIUKLAQ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"USUWMZJS","created_at":"2026-05-18T12:28:02.375192+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/USUWMZJS7IIUKLAQYECHAO37MR","json":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR.json","graph_json":"https://pith.science/api/pith-number/USUWMZJS7IIUKLAQYECHAO37MR/graph.json","events_json":"https://pith.science/api/pith-number/USUWMZJS7IIUKLAQYECHAO37MR/events.json","paper":"https://pith.science/paper/USUWMZJS"},"agent_actions":{"view_html":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR","download_json":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR.json","view_paper":"https://pith.science/paper/USUWMZJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0299&json=true","fetch_graph":"https://pith.science/api/pith-number/USUWMZJS7IIUKLAQYECHAO37MR/graph.json","fetch_events":"https://pith.science/api/pith-number/USUWMZJS7IIUKLAQYECHAO37MR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR/action/storage_attestation","attest_author":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR/action/author_attestation","sign_citation":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR/action/citation_signature","submit_replication":"https://pith.science/pith/USUWMZJS7IIUKLAQYECHAO37MR/action/replication_record"}},"created_at":"2026-05-18T03:05:46.152027+00:00","updated_at":"2026-05-18T03:05:46.152027+00:00"}