{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DXIRR5FSN3L75VJMLYQVCFU2AS","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":"d3334fdfa404e309045502a551da72e15600213ced0739a9d8afc33315fc63e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T13:01:12Z","title_canon_sha256":"c4ae1b7029ae84964f8ce7896c7c665f1a330fb351d65ebefcab60279aa3cee3"},"schema_version":"1.0","source":{"id":"1706.05642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05642","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05642v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05642","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"DXIRR5FSN3L7","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXIRR5FSN3L75VJM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXIRR5FS","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f524fcc2160d487e21f30536e4aac41dc2827a24a41089e1ee1a07dd28ec5d9c","target":"graph","created_at":"2026-05-18T00:42:09Z","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":"We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\\epsilon:=\\epsilon(k,m)>0$ so that the following holds. For every graph $H$ with chromatic number $k$ from which one can delete an edge and reduce the chromatic number, and for every graph $G$ on $n>n_0(H)$ vertices in which all degrees are at least $(1-\\epsilon)n$, any subgraph of $G$ which is $H$-free and contains the maximum number of copies of the complete graph $K_m$ is $(k-1)$-colorable.\n  We also consider several extensions for the case of a general forbidde","authors_text":"Clara Shikhelman, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T13:01:12Z","title":"$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05642","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:f0b707aadc99b11dc91216f440a0be6986d533440000d5eac8365a9d0efbb4a1","target":"record","created_at":"2026-05-18T00:42:09Z","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":"d3334fdfa404e309045502a551da72e15600213ced0739a9d8afc33315fc63e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T13:01:12Z","title_canon_sha256":"c4ae1b7029ae84964f8ce7896c7c665f1a330fb351d65ebefcab60279aa3cee3"},"schema_version":"1.0","source":{"id":"1706.05642","kind":"arxiv","version":1}},"canonical_sha256":"1dd118f4b26ed7fed52c5e2151169a04a2d85dbd45d864a0ecaeabb73f11856b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dd118f4b26ed7fed52c5e2151169a04a2d85dbd45d864a0ecaeabb73f11856b","first_computed_at":"2026-05-18T00:42:09.314150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:09.314150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8npD8Tq8uG2NpeMFuQtfEXRl2spbElzr1WniIA735JPUJXF0nteqIa383i7oUxsM4PmsgVx5CR/yeLe4IkUaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:09.314620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0b707aadc99b11dc91216f440a0be6986d533440000d5eac8365a9d0efbb4a1","sha256:f524fcc2160d487e21f30536e4aac41dc2827a24a41089e1ee1a07dd28ec5d9c"],"state_sha256":"50d2aa8ad046c9ff117764531321af86aee6090e74ed71b3d391f5181f1c45ff"}