{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T55XNG44XLW2AD3RAF6OB47JGN","short_pith_number":"pith:T55XNG44","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"},"canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","source":{"kind":"arxiv","id":"1610.08389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08389","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08389v2","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08389","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"T55XNG44XLW2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T55XNG44XLW2AD3R","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T55XNG44","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T55XNG44XLW2AD3RAF6OB47JGN","target":"record","payload":{"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"},"canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","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"},"source_kind":"arxiv","source_id":"1610.08389","source_version":2,"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-18T00:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V41vG/N2LvU6FuUznNbN2GnhH6uExnIq9dnPgadiI7il65Cp+fYT4rOi5Od5rfCf6sJr11prfvaUSgFMcEQzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:03:44.079256Z"},"content_sha256":"dc04396ff562f9309ce2d643cac6e9651b3739b1882db8842ae669ae440aa7f9","schema_version":"1.0","event_id":"sha256:dc04396ff562f9309ce2d643cac6e9651b3739b1882db8842ae669ae440aa7f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T55XNG44XLW2AD3RAF6OB47JGN","target":"graph","payload":{"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"},"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-18T00:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bz6ZBJzowjgwQkDwu/8/k3Iyn68WP6CN0j3Qi7I5JXvuSve9FDZ/5IjK7xLWDc+faWDFbAt0jmg74kJLERfLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:03:44.079623Z"},"content_sha256":"82d465c3894cf4df38e574b79aa41f52a022919d8f8e68316b21a3f9f1feda20","schema_version":"1.0","event_id":"sha256:82d465c3894cf4df38e574b79aa41f52a022919d8f8e68316b21a3f9f1feda20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/bundle.json","state_url":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T55XNG44XLW2AD3RAF6OB47JGN/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-23T13:03:44Z","links":{"resolver":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN","bundle":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/bundle.json","state":"https://pith.science/pith/T55XNG44XLW2AD3RAF6OB47JGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T55XNG44XLW2AD3RAF6OB47JGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T55XNG44XLW2AD3RAF6OB47JGN","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":"da6bfe2cc0b42f1fea2509a35697fd0aaab2a8f2f6c5b6951bbc38c2f31586db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T15:59:24Z","title_canon_sha256":"a970e0d58af7a7f0c4f36f2a36837c6a7f9ca114a7c9d5ddfe5ed788c7dde3e4"},"schema_version":"1.0","source":{"id":"1610.08389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08389","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08389v2","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08389","created_at":"2026-05-18T00:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"T55XNG44XLW2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T55XNG44XLW2AD3R","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T55XNG44","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:82d465c3894cf4df38e574b79aa41f52a022919d8f8e68316b21a3f9f1feda20","target":"graph","created_at":"2026-05-18T00:04:08Z","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":"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. ","authors_text":"Alexander Roberts, Alex Scott","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T15:59:24Z","title":"Stability results for graphs with a critical edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08389","kind":"arxiv","version":2},"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:dc04396ff562f9309ce2d643cac6e9651b3739b1882db8842ae669ae440aa7f9","target":"record","created_at":"2026-05-18T00:04:08Z","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":"da6bfe2cc0b42f1fea2509a35697fd0aaab2a8f2f6c5b6951bbc38c2f31586db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-26T15:59:24Z","title_canon_sha256":"a970e0d58af7a7f0c4f36f2a36837c6a7f9ca114a7c9d5ddfe5ed788c7dde3e4"},"schema_version":"1.0","source":{"id":"1610.08389","kind":"arxiv","version":2}},"canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f7b769b9cbaeda00f71017ce0f3e9334e993318e8d20247fbad1eef9d540217","first_computed_at":"2026-05-18T00:04:08.521084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:08.521084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0e3GZ718tGe/UAOnbx/I+qsIFVRtFUf55P0ehmChOpv61BgB2rkKXCkVS4DpymYq4unVT0WdYzFmRoIjbZxZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:08.521695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc04396ff562f9309ce2d643cac6e9651b3739b1882db8842ae669ae440aa7f9","sha256:82d465c3894cf4df38e574b79aa41f52a022919d8f8e68316b21a3f9f1feda20"],"state_sha256":"a19fd6667628712a2a50b7d6e45518a1c8cfb88a2f8fbeb74863562b242e1263"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4BsrH4XERXxrO6eGj2KwwD1hhnuzlqEfVBebscsQGd+U4moiQZIhCrwkIdl8qT1ycNfu2GkZYOjJI8f4sp4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:03:44.081578Z","bundle_sha256":"6104a64dffe6c4a454feff4c931dd129930024b95bdd0516c304b50eefc1bdb5"}}