{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T55XNG44XLW2AD3RAF6OB47JGN","short_pith_number":"pith:T55XNG44","schema_version":"1.0","canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","source":{"kind":"arxiv","id":"1610.08389","version":2},"attestation_state":"computed","paper":{"title":"Stability results for graphs with a critical edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Roberts, Alex Scott","submitted_at":"2016-10-26T15:59:24Z","abstract_excerpt":"The classical stability theorem of Erd\\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \\ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible number of edges can be made into the $k$-partite Tur\\'{a}n graph by adding and deleting $o(n^2)$ edges. In this paper, we prove sharper quantitative results for graphs $H$ with a critical edge, both for the Erd\\H{o}s-Simonovits Theorem (distance to the Tur\\'{a}n graph) and for the closely related question of how close an $H$-free graph is to being $k$-partite. "},"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":"1610.08389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"a970e0d58af7a7f0c4f36f2a36837c6a7f9ca114a7c9d5ddfe5ed788c7dde3e4","abstract_canon_sha256":"da6bfe2cc0b42f1fea2509a35697fd0aaab2a8f2f6c5b6951bbc38c2f31586db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:08.521695Z","signature_b64":"0e3GZ718tGe/UAOnbx/I+qsIFVRtFUf55P0ehmChOpv61BgB2rkKXCkVS4DpymYq4unVT0WdYzFmRoIjbZxZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","last_reissued_at":"2026-05-18T00:04:08.521084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:08.521084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability results for graphs with a critical edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Roberts, Alex Scott","submitted_at":"2016-10-26T15:59:24Z","abstract_excerpt":"The classical stability theorem of Erd\\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \\ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible number of edges can be made into the $k$-partite Tur\\'{a}n graph by adding and deleting $o(n^2)$ edges. In this paper, we prove sharper quantitative results for graphs $H$ with a critical edge, both for the Erd\\H{o}s-Simonovits Theorem (distance to the Tur\\'{a}n graph) and for the closely related question of how close an $H$-free graph is to being $k$-partite. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08389","kind":"arxiv","version":2},"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":"1610.08389","created_at":"2026-05-18T00:04:08.521172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08389v2","created_at":"2026-05-18T00:04:08.521172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08389","created_at":"2026-05-18T00:04:08.521172+00:00"},{"alias_kind":"pith_short_12","alias_value":"T55XNG44XLW2","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T55XNG44XLW2AD3R","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T55XNG44","created_at":"2026-05-18T12:30:44.179134+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/T55XNG44XLW2AD3RAF6OB47JGN","json":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN.json","graph_json":"https://pith.science/api/pith-number/T55XNG44XLW2AD3RAF6OB47JGN/graph.json","events_json":"https://pith.science/api/pith-number/T55XNG44XLW2AD3RAF6OB47JGN/events.json","paper":"https://pith.science/paper/T55XNG44"},"agent_actions":{"view_html":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN","download_json":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN.json","view_paper":"https://pith.science/paper/T55XNG44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08389&json=true","fetch_graph":"https://pith.science/api/pith-number/T55XNG44XLW2AD3RAF6OB47JGN/graph.json","fetch_events":"https://pith.science/api/pith-number/T55XNG44XLW2AD3RAF6OB47JGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/action/storage_attestation","attest_author":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/action/author_attestation","sign_citation":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/action/citation_signature","submit_replication":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/action/replication_record"}},"created_at":"2026-05-18T00:04:08.521172+00:00","updated_at":"2026-05-18T00:04:08.521172+00:00"}