{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:H6IRDLQB4E5Z4DQ4N2ELMGPKME","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":"71d2bf5c676829c75aba408e821655c8130888d87421b9ddfcfd4ae56bcfb25e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T07:33:36Z","title_canon_sha256":"9d79fb0baf3fe229e3aa9d69a84339b83721a860b74a025b8e18cbee54e0ed6c"},"schema_version":"1.0","source":{"id":"2307.00801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.00801","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2307.00801v2","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00801","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"H6IRDLQB4E5Z","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"H6IRDLQB4E5Z4DQ4","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"H6IRDLQB","created_at":"2026-07-05T09:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:982112985b027d196a1f4ed654e9caa67e26b28e8f345409729e6ad3ae6007f7","target":"graph","created_at":"2026-07-05T09:04:28Z","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/2307.00801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A well-known theorem of R\\\"odl says that for every graph $H$, and every $\\epsilon>0$, there exists $\\delta>0$ such that if $G$ does not contain an induced copy of $H$, then there exists $X\\subseteq V(G)$ with $|X|\\ge \\delta|G|$ such that one of $G[X],\\overline{G}[X]$ has edge-density at most $\\epsilon$. But how does $\\delta$ depend on $\\epsilon$? Fox and Sudakov conjectured that the dependence is at most polynomial: that for all $H$ there exists $c>0$ such that for all $\\epsilon$ with $0<\\epsilon\\le 1/2$, R\\\"odl's theorem holds with $\\delta=\\epsilon^c$. This conjecture implies the Erd\\H{o}s-Ha","authors_text":"Alex Scott, Jacob Fox, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T07:33:36Z","title":"Induced subgraph density. II. Sparse and dense sets in cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00801","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:0ce8eb5af41a21cff5b4c51cd3b7b90a6275e07b468d4f219dd9f47aa21884e1","target":"record","created_at":"2026-07-05T09:04:28Z","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":"71d2bf5c676829c75aba408e821655c8130888d87421b9ddfcfd4ae56bcfb25e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T07:33:36Z","title_canon_sha256":"9d79fb0baf3fe229e3aa9d69a84339b83721a860b74a025b8e18cbee54e0ed6c"},"schema_version":"1.0","source":{"id":"2307.00801","kind":"arxiv","version":2}},"canonical_sha256":"3f9111ae01e13b9e0e1c6e88b619ea6117a5bf2e1a1dee8b4d17ac25372e3c3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f9111ae01e13b9e0e1c6e88b619ea6117a5bf2e1a1dee8b4d17ac25372e3c3c","first_computed_at":"2026-07-05T09:04:28.612965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:04:28.612965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B8AhZm7MO3jBlpF7uC3upVeIWLGJNdmF9Tfm/Sh70BacWbqJW5gWXZgCPq1T8YU5RbGBnGYMjWtWz/cKKg/6DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:04:28.613457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.00801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ce8eb5af41a21cff5b4c51cd3b7b90a6275e07b468d4f219dd9f47aa21884e1","sha256:982112985b027d196a1f4ed654e9caa67e26b28e8f345409729e6ad3ae6007f7"],"state_sha256":"8834f1883c6a845ed28469711e90e9889e85bdea2ac2c0e7be21d787c29ec231"}