{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I37GVJTELJ7PUERTRHELLLVPUQ","short_pith_number":"pith:I37GVJTE","canonical_record":{"source":{"id":"1602.02302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T20:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"0402bfbcd004177ab53f70bf405d15f84401617a55dcf301e5d4d72a303af6f7","abstract_canon_sha256":"3bd2eba7662f6a9e7e1232d5d603ba89d5e8fb2b79171ba2adaa273051bd30e6"},"schema_version":"1.0"},"canonical_sha256":"46fe6aa6645a7efa123389c8b5aeafa410e471001a0e97af7ea5c31535002c00","source":{"kind":"arxiv","id":"1602.02302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02302","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02302v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02302","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"I37GVJTELJ7P","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I37GVJTELJ7PUERT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I37GVJTE","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I37GVJTELJ7PUERTRHELLLVPUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T20:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"0402bfbcd004177ab53f70bf405d15f84401617a55dcf301e5d4d72a303af6f7","abstract_canon_sha256":"3bd2eba7662f6a9e7e1232d5d603ba89d5e8fb2b79171ba2adaa273051bd30e6"},"schema_version":"1.0"},"canonical_sha256":"46fe6aa6645a7efa123389c8b5aeafa410e471001a0e97af7ea5c31535002c00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.364788Z","signature_b64":"d8ju4Gd2U5SKv8TrVUj/+63qdrsAIDqcCDzXAD888W/O9IqNDkndNHaEbH0dVnRF2em1r4t31FjbiiEyv7ARDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fe6aa6645a7efa123389c8b5aeafa410e471001a0e97af7ea5c31535002c00","last_reissued_at":"2026-05-18T01:21:10.364187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.364187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02302","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBvNZL+lVe5X79Tu96QyT1rfJPOtPJ5ml7doGAdWqo1350Ij6DLOo2WYJB89lohn/CcTXHq5o73XlwrJKHJkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:41:55.273219Z"},"content_sha256":"1b886df51baa96b017a37da2c9715681452eb54d61ff128163e4e8dd97f1c687","schema_version":"1.0","event_id":"sha256:1b886df51baa96b017a37da2c9715681452eb54d61ff128163e4e8dd97f1c687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I37GVJTELJ7PUERTRHELLLVPUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the structure of dense graphs with fixed clique number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heiner Oberkampf, Mathias Schacht","submitted_at":"2016-02-06T20:10:34Z","abstract_excerpt":"We study structural properties of graphs with fixed clique number and high minimum degree. In particular, we show that there exists a function $L=L(r,\\varepsilon)$, such that every $K_r$-free graph $G$ on $n$ vertices with minimum degree at least $(\\frac{2r-5}{2r-3}+\\varepsilon)n$ is homomorphic to a $K_r$-free graph on at most $L$ vertices. It is known that the required minimum degree condition is approximately best possible for this result.\n  For $r=3$ this result was obtained by \\L uczak [On the structure of triangle-free graphs of large minimum degree, Combinatorica 26 (2006), no. 4, 489-4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02302","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYkSaloJCKIwAKwi87yWUyH4W6aqhL2ji4lKCCyi2bdaaLE3fNYokNf6r7mSpWZbVWcHSUO9P7hw9ScZf0f3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:41:55.273884Z"},"content_sha256":"424e9879084a0e55c16405cc31fc44bc11f153887a20d347443b44c2c6855fee","schema_version":"1.0","event_id":"sha256:424e9879084a0e55c16405cc31fc44bc11f153887a20d347443b44c2c6855fee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I37GVJTELJ7PUERTRHELLLVPUQ/bundle.json","state_url":"https://pith.science/pith/I37GVJTELJ7PUERTRHELLLVPUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I37GVJTELJ7PUERTRHELLLVPUQ/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-05-27T18:41:55Z","links":{"resolver":"https://pith.science/pith/I37GVJTELJ7PUERTRHELLLVPUQ","bundle":"https://pith.science/pith/I37GVJTELJ7PUERTRHELLLVPUQ/bundle.json","state":"https://pith.science/pith/I37GVJTELJ7PUERTRHELLLVPUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I37GVJTELJ7PUERTRHELLLVPUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I37GVJTELJ7PUERTRHELLLVPUQ","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":"3bd2eba7662f6a9e7e1232d5d603ba89d5e8fb2b79171ba2adaa273051bd30e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T20:10:34Z","title_canon_sha256":"0402bfbcd004177ab53f70bf405d15f84401617a55dcf301e5d4d72a303af6f7"},"schema_version":"1.0","source":{"id":"1602.02302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02302","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02302v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02302","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"I37GVJTELJ7P","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I37GVJTELJ7PUERT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I37GVJTE","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:424e9879084a0e55c16405cc31fc44bc11f153887a20d347443b44c2c6855fee","target":"graph","created_at":"2026-05-18T01:21:10Z","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 study structural properties of graphs with fixed clique number and high minimum degree. In particular, we show that there exists a function $L=L(r,\\varepsilon)$, such that every $K_r$-free graph $G$ on $n$ vertices with minimum degree at least $(\\frac{2r-5}{2r-3}+\\varepsilon)n$ is homomorphic to a $K_r$-free graph on at most $L$ vertices. It is known that the required minimum degree condition is approximately best possible for this result.\n  For $r=3$ this result was obtained by \\L uczak [On the structure of triangle-free graphs of large minimum degree, Combinatorica 26 (2006), no. 4, 489-4","authors_text":"Heiner Oberkampf, Mathias Schacht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T20:10:34Z","title":"On the structure of dense graphs with fixed clique number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02302","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:1b886df51baa96b017a37da2c9715681452eb54d61ff128163e4e8dd97f1c687","target":"record","created_at":"2026-05-18T01:21:10Z","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":"3bd2eba7662f6a9e7e1232d5d603ba89d5e8fb2b79171ba2adaa273051bd30e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T20:10:34Z","title_canon_sha256":"0402bfbcd004177ab53f70bf405d15f84401617a55dcf301e5d4d72a303af6f7"},"schema_version":"1.0","source":{"id":"1602.02302","kind":"arxiv","version":1}},"canonical_sha256":"46fe6aa6645a7efa123389c8b5aeafa410e471001a0e97af7ea5c31535002c00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46fe6aa6645a7efa123389c8b5aeafa410e471001a0e97af7ea5c31535002c00","first_computed_at":"2026-05-18T01:21:10.364187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.364187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8ju4Gd2U5SKv8TrVUj/+63qdrsAIDqcCDzXAD888W/O9IqNDkndNHaEbH0dVnRF2em1r4t31FjbiiEyv7ARDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.364788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b886df51baa96b017a37da2c9715681452eb54d61ff128163e4e8dd97f1c687","sha256:424e9879084a0e55c16405cc31fc44bc11f153887a20d347443b44c2c6855fee"],"state_sha256":"ca98de09dc5f8d5c4be5f88037195c3dc2e14f01c45ad9976eb0fdfd34ee0e80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpNV7o0O68b/uBcz+LebkazNK13hSsTMVxk1CFuINSYNyZxzzl5NBwuvxNbuflSirLlgyx9msphF3KzYb62NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:41:55.277724Z","bundle_sha256":"4ce377be14603747dbcfb574f4c399c763b13d5af723f499161e982ac3416e90"}}