{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CYXD3TIYOVJC3AWRHTB7FMREGK","short_pith_number":"pith:CYXD3TIY","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"},"canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","source":{"kind":"arxiv","id":"1502.02881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02881","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02881v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02881","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"CYXD3TIYOVJC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CYXD3TIYOVJC3AWR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CYXD3TIY","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CYXD3TIYOVJC3AWRHTB7FMREGK","target":"record","payload":{"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"},"canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","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"},"source_kind":"arxiv","source_id":"1502.02881","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IikJdBXSf+XTa7cPwmDsG9XOo/otutv3zB8b8fobV54q6xFg1sDWhtS1e6z3fnUm8le6CVefWIOMIzxZI2e/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:27:04.796178Z"},"content_sha256":"9b99fe3111647f29931e51aa459d1bf73470171d9062f3be46f09a6e5aa20280","schema_version":"1.0","event_id":"sha256:9b99fe3111647f29931e51aa459d1bf73470171d9062f3be46f09a6e5aa20280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CYXD3TIYOVJC3AWRHTB7FMREGK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uqfj53rBTwIz/x2N1h3CmvgkbvlXE7iZykWFHni8sJ8GQemocvF/zBW3elsipaix/n1eR2fhm/1vSxKFL0J9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:27:04.796533Z"},"content_sha256":"9b26c7b6ca5752a7b2df5ebfac00f23ddff5d55e9018a531e3dde795066777c3","schema_version":"1.0","event_id":"sha256:9b26c7b6ca5752a7b2df5ebfac00f23ddff5d55e9018a531e3dde795066777c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/bundle.json","state_url":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T16:27:04Z","links":{"resolver":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK","bundle":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/bundle.json","state":"https://pith.science/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYXD3TIYOVJC3AWRHTB7FMREGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CYXD3TIYOVJC3AWRHTB7FMREGK","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":"e8f7b14969e8975fc6e1a43016e284edc56db82fa7fcba82680cbdfadc189fb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T12:30:47Z","title_canon_sha256":"dba157183713804bb01c7cd5c4b9adc0adc172476aebc994d5bab30901dcf8ed"},"schema_version":"1.0","source":{"id":"1502.02881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02881","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02881v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02881","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"CYXD3TIYOVJC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CYXD3TIYOVJC3AWR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CYXD3TIY","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:9b26c7b6ca5752a7b2df5ebfac00f23ddff5d55e9018a531e3dde795066777c3","target":"graph","created_at":"2026-05-18T02:27:30Z","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"},"paper":{"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","authors_text":"Andrey Grinshpun, Anita Liebenau, Jacob Fox, Tibor Szabo, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T12:30:47Z","title":"On the minimum degree of minimal Ramsey graphs for multiple colours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02881","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:9b99fe3111647f29931e51aa459d1bf73470171d9062f3be46f09a6e5aa20280","target":"record","created_at":"2026-05-18T02:27:30Z","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":"e8f7b14969e8975fc6e1a43016e284edc56db82fa7fcba82680cbdfadc189fb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T12:30:47Z","title_canon_sha256":"dba157183713804bb01c7cd5c4b9adc0adc172476aebc994d5bab30901dcf8ed"},"schema_version":"1.0","source":{"id":"1502.02881","kind":"arxiv","version":1}},"canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"162e3dcd1875522d82d13cc3f2b22432aae0994c02c04302a3b8efdeb7f5bd42","first_computed_at":"2026-05-18T02:27:30.531007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:30.531007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"frSwi9tYhcITkGLkIK5ym60xkeGx6lqttfJB+zZhCnbv+AaSWqzQQUa/78kc26BhblzDGcMJ3cOxq7PBm3MZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:30.531849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b99fe3111647f29931e51aa459d1bf73470171d9062f3be46f09a6e5aa20280","sha256:9b26c7b6ca5752a7b2df5ebfac00f23ddff5d55e9018a531e3dde795066777c3"],"state_sha256":"00f21f71bcdd30b8a86d796dc6577a03c6c3411ce8297588252f46dcc6061ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Npp4rrNARJryH/qtRM5yBuC0r+vCWvirFPNCpPz09hvYLu92DO6MrinOEcnvuyDzWizfwdKYt+oEOxMrQeQiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:27:04.798557Z","bundle_sha256":"dd7a7cca62c8e4977a6aa015c17e6a0967b7ccd299fdbe88d10314511fa47575"}}