{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H6IRDLQB4E5Z4DQ4N2ELMGPKME","short_pith_number":"pith:H6IRDLQB","schema_version":"1.0","canonical_sha256":"3f9111ae01e13b9e0e1c6e88b619ea6117a5bf2e1a1dee8b4d17ac25372e3c3c","source":{"kind":"arxiv","id":"2307.00801","version":2},"attestation_state":"computed","paper":{"title":"Induced subgraph density. II. Sparse and dense sets in cographs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Jacob Fox, Paul Seymour, Tung Nguyen","submitted_at":"2023-07-03T07:33:36Z","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"},"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":"2307.00801","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T07:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"9d79fb0baf3fe229e3aa9d69a84339b83721a860b74a025b8e18cbee54e0ed6c","abstract_canon_sha256":"71d2bf5c676829c75aba408e821655c8130888d87421b9ddfcfd4ae56bcfb25e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:28.613457Z","signature_b64":"B8AhZm7MO3jBlpF7uC3upVeIWLGJNdmF9Tfm/Sh70BacWbqJW5gWXZgCPq1T8YU5RbGBnGYMjWtWz/cKKg/6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9111ae01e13b9e0e1c6e88b619ea6117a5bf2e1a1dee8b4d17ac25372e3c3c","last_reissued_at":"2026-07-05T09:04:28.612965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:28.612965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraph density. II. Sparse and dense sets in cographs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Jacob Fox, Paul Seymour, Tung Nguyen","submitted_at":"2023-07-03T07:33:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00801","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.00801/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.00801","created_at":"2026-07-05T09:04:28.613023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.00801v2","created_at":"2026-07-05T09:04:28.613023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00801","created_at":"2026-07-05T09:04:28.613023+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6IRDLQB4E5Z","created_at":"2026-07-05T09:04:28.613023+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6IRDLQB4E5Z4DQ4","created_at":"2026-07-05T09:04:28.613023+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6IRDLQB","created_at":"2026-07-05T09:04:28.613023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2307.06455","citing_title":"Induced subgraph density. IV. New graphs with the Erd\\H{o}s-Hajnal property","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME","json":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME.json","graph_json":"https://pith.science/api/pith-number/H6IRDLQB4E5Z4DQ4N2ELMGPKME/graph.json","events_json":"https://pith.science/api/pith-number/H6IRDLQB4E5Z4DQ4N2ELMGPKME/events.json","paper":"https://pith.science/paper/H6IRDLQB"},"agent_actions":{"view_html":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME","download_json":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME.json","view_paper":"https://pith.science/paper/H6IRDLQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.00801&json=true","fetch_graph":"https://pith.science/api/pith-number/H6IRDLQB4E5Z4DQ4N2ELMGPKME/graph.json","fetch_events":"https://pith.science/api/pith-number/H6IRDLQB4E5Z4DQ4N2ELMGPKME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME/action/storage_attestation","attest_author":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME/action/author_attestation","sign_citation":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME/action/citation_signature","submit_replication":"https://pith.science/pith/H6IRDLQB4E5Z4DQ4N2ELMGPKME/action/replication_record"}},"created_at":"2026-07-05T09:04:28.613023+00:00","updated_at":"2026-07-05T09:04:28.613023+00:00"}