{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6VGNULUPCVJ3EBZ5AB4YXAOTQT","short_pith_number":"pith:6VGNULUP","schema_version":"1.0","canonical_sha256":"f54cda2e8f1553b2073d00798b81d384f5af3342e2b08d987096f04b7d6bcc1f","source":{"kind":"arxiv","id":"1608.08990","version":1},"attestation_state":"computed","paper":{"title":"The structure of typical eye-free graphs and a Turan-type result for two weighted colours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Keevash, William Lochet","submitted_at":"2016-08-31T18:46:34Z","abstract_excerpt":"The $(a,b)$-eye is the graph $I_{a,b} = K_{a+b}-K_b$ obtained by deleting the edges of a clique of size $b$ from a clique of size $a+b$. We show that for any $a,b \\ge 2$ and $p \\in (0,1)$, if we condition the random graph $G \\sim G(n,p)$ on having no induced copy of $I_{a,b}$, then with high probability $G$ is close to an $a$-partite graph or the complement of a $(b-1)$-partite graph. Our proof uses the recently developed theory of hypergraph containers, and a stability result for an extremal problem with two weighted colours. We also apply the stability method to obtain an exact Tur\\'an-type "},"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":"1608.08990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T18:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"1005e03182d20a5e42b1694ff686b99daed53159ac12a1ea65947a435f301f40","abstract_canon_sha256":"76a60fbd2090d169b14a8d8da629ccde46e0e7e371912647a7debec8925f151e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:39.507500Z","signature_b64":"Wi2etQqTs+bzL3NNN5rs8WYjlSxx8Q76OW2Hknv0E3A9GcRFwhrclEEIHz1nTJh8dRQQxNyBzEnwOO0hyWF0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f54cda2e8f1553b2073d00798b81d384f5af3342e2b08d987096f04b7d6bcc1f","last_reissued_at":"2026-05-18T01:06:39.506727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:39.506727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The structure of typical eye-free graphs and a Turan-type result for two weighted colours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Keevash, William Lochet","submitted_at":"2016-08-31T18:46:34Z","abstract_excerpt":"The $(a,b)$-eye is the graph $I_{a,b} = K_{a+b}-K_b$ obtained by deleting the edges of a clique of size $b$ from a clique of size $a+b$. We show that for any $a,b \\ge 2$ and $p \\in (0,1)$, if we condition the random graph $G \\sim G(n,p)$ on having no induced copy of $I_{a,b}$, then with high probability $G$ is close to an $a$-partite graph or the complement of a $(b-1)$-partite graph. Our proof uses the recently developed theory of hypergraph containers, and a stability result for an extremal problem with two weighted colours. We also apply the stability method to obtain an exact Tur\\'an-type "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08990","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":"1608.08990","created_at":"2026-05-18T01:06:39.506854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08990v1","created_at":"2026-05-18T01:06:39.506854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08990","created_at":"2026-05-18T01:06:39.506854+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VGNULUPCVJ3","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VGNULUPCVJ3EBZ5","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VGNULUP","created_at":"2026-05-18T12:30:04.600751+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/6VGNULUPCVJ3EBZ5AB4YXAOTQT","json":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT.json","graph_json":"https://pith.science/api/pith-number/6VGNULUPCVJ3EBZ5AB4YXAOTQT/graph.json","events_json":"https://pith.science/api/pith-number/6VGNULUPCVJ3EBZ5AB4YXAOTQT/events.json","paper":"https://pith.science/paper/6VGNULUP"},"agent_actions":{"view_html":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT","download_json":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT.json","view_paper":"https://pith.science/paper/6VGNULUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08990&json=true","fetch_graph":"https://pith.science/api/pith-number/6VGNULUPCVJ3EBZ5AB4YXAOTQT/graph.json","fetch_events":"https://pith.science/api/pith-number/6VGNULUPCVJ3EBZ5AB4YXAOTQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT/action/storage_attestation","attest_author":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT/action/author_attestation","sign_citation":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT/action/citation_signature","submit_replication":"https://pith.science/pith/6VGNULUPCVJ3EBZ5AB4YXAOTQT/action/replication_record"}},"created_at":"2026-05-18T01:06:39.506854+00:00","updated_at":"2026-05-18T01:06:39.506854+00:00"}