{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SAXTITWOKGTWY4XT6XCYNN2TD6","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":"b5fb39d4c4855835087b29dd12c83f1ec97640884e2232b61960f634bfbf5461","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-24T17:35:20Z","title_canon_sha256":"0f7bf4d357db6f94f52c6b79e2a31e248cecdc0d99428dd3d013dd7fedce5db9"},"schema_version":"1.0","source":{"id":"2301.10147","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10147","created_at":"2026-07-05T07:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10147v3","created_at":"2026-07-05T07:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10147","created_at":"2026-07-05T07:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"SAXTITWOKGTW","created_at":"2026-07-05T07:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"SAXTITWOKGTWY4XT","created_at":"2026-07-05T07:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"SAXTITWO","created_at":"2026-07-05T07:46:15Z"}],"graph_snapshots":[{"event_id":"sha256:11b7ef240c4e1c584d6a5e42c63b1432d4972c0ece20b009b5581b786f2c512d","target":"graph","created_at":"2026-07-05T07:46:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.10147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1977, Erd\\H{o}s and Hajnal made the conjecture that, for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ has a clique or stable set of size at least $|G|^c$; and they proved that this is true with $ |G|^c$ replaced by $2^{c\\sqrt{\\log |G|}}$. Until now, there has been no improvement on this result (for general $H$).\n  We prove a strengthening: that for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ with $|G|\\ge 2$ has a clique or stable set of size at least $$2^{c\\sqrt{\\log |G|\\log\\log|G|}}.$$ Indeed, we prove the corresponding strengthening of ","authors_text":"Alex Scott, Matija Buci\\'c, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-24T17:35:20Z","title":"Induced subgraph density. I. A loglog step towards Erdos-Hajnal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10147","kind":"arxiv","version":3},"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:5bf7ca3901479e539c9e9fe4b869fb2892d9ab37bb03afecd74a2313075b0b4b","target":"record","created_at":"2026-07-05T07:46:15Z","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":"b5fb39d4c4855835087b29dd12c83f1ec97640884e2232b61960f634bfbf5461","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-24T17:35:20Z","title_canon_sha256":"0f7bf4d357db6f94f52c6b79e2a31e248cecdc0d99428dd3d013dd7fedce5db9"},"schema_version":"1.0","source":{"id":"2301.10147","kind":"arxiv","version":3}},"canonical_sha256":"902f344ece51a76c72f3f5c586b7531fbfb677a4865f95a12a6d8edcb2354068","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"902f344ece51a76c72f3f5c586b7531fbfb677a4865f95a12a6d8edcb2354068","first_computed_at":"2026-07-05T07:46:15.509201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:15.509201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DCKJIZwYEn6wXHyG9Nad1pGxWSZ3E6iYu2GJIw2DPIe+Cc/NgdS0gDKGn93yuvGakaVAIwws7DqrzDDGqbPWBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:15.509689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10147","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bf7ca3901479e539c9e9fe4b869fb2892d9ab37bb03afecd74a2313075b0b4b","sha256:11b7ef240c4e1c584d6a5e42c63b1432d4972c0ece20b009b5581b786f2c512d"],"state_sha256":"7b557e3ee7367ba2af6d17178bb0c0eb575a49388052dd87b95c463a82f36eac"}