{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CYXD3TIYOVJC3AWRHTB7FMREGK","short_pith_number":"pith:CYXD3TIY","schema_version":"1.0","canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","source":{"kind":"arxiv","id":"1502.02881","version":1},"attestation_state":"computed","paper":{"title":"On the minimum degree of minimal Ramsey graphs for multiple colours","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":"2015-02-10T12:30:47Z","abstract_excerpt":"A graph G is r-Ramsey for a graph H, denoted by G\\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minimal for H if it is r-Ramsey for H but no proper subgraph of G possesses this property. Let s_r(H) denote the smallest minimum degree of G over all graphs G that are r-Ramsey-minimal for H. The study of the parameter s_2 was initiated by Burr, Erd\\H{o}s, and Lov\\'{a}sz in 1976 when they showed that for the clique s_2(K_k)=(k-1)^2. In this paper, we study the dependency of s_r(K_k) on r and show that, under the condition"},"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":"1502.02881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T12:30:47Z","cross_cats_sorted":[],"title_canon_sha256":"dba157183713804bb01c7cd5c4b9adc0adc172476aebc994d5bab30901dcf8ed","abstract_canon_sha256":"e8f7b14969e8975fc6e1a43016e284edc56db82fa7fcba82680cbdfadc189fb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.531849Z","signature_b64":"frSwi9tYhcITkGLkIK5ym60xkeGx6lqttfJB+zZhCnbv+AaSWqzQQUa/78kc26BhblzDGcMJ3cOxq7PBm3MZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","last_reissued_at":"2026-05-18T02:27:30.531007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.531007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimum degree of minimal Ramsey graphs for multiple colours","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":"2015-02-10T12:30:47Z","abstract_excerpt":"A graph G is r-Ramsey for a graph H, denoted by G\\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minimal for H if it is r-Ramsey for H but no proper subgraph of G possesses this property. Let s_r(H) denote the smallest minimum degree of G over all graphs G that are r-Ramsey-minimal for H. The study of the parameter s_2 was initiated by Burr, Erd\\H{o}s, and Lov\\'{a}sz in 1976 when they showed that for the clique s_2(K_k)=(k-1)^2. In this paper, we study the dependency of s_r(K_k) on r and show that, under the condition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02881","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":"1502.02881","created_at":"2026-05-18T02:27:30.531143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02881v1","created_at":"2026-05-18T02:27:30.531143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02881","created_at":"2026-05-18T02:27:30.531143+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYXD3TIYOVJC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYXD3TIYOVJC3AWR","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYXD3TIY","created_at":"2026-05-18T12:29:17.054201+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/CYXD3TIYOVJC3AWRHTB7FMREGK","json":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK.json","graph_json":"https://pith.science/api/pith-number/CYXD3TIYOVJC3AWRHTB7FMREGK/graph.json","events_json":"https://pith.science/api/pith-number/CYXD3TIYOVJC3AWRHTB7FMREGK/events.json","paper":"https://pith.science/paper/CYXD3TIY"},"agent_actions":{"view_html":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK","download_json":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK.json","view_paper":"https://pith.science/paper/CYXD3TIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02881&json=true","fetch_graph":"https://pith.science/api/pith-number/CYXD3TIYOVJC3AWRHTB7FMREGK/graph.json","fetch_events":"https://pith.science/api/pith-number/CYXD3TIYOVJC3AWRHTB7FMREGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/action/storage_attestation","attest_author":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/action/author_attestation","sign_citation":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/action/citation_signature","submit_replication":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/action/replication_record"}},"created_at":"2026-05-18T02:27:30.531143+00:00","updated_at":"2026-05-18T02:27:30.531143+00:00"}