{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FUMKL5F4WVFIMTGG3GBSXUTOXS","short_pith_number":"pith:FUMKL5F4","schema_version":"1.0","canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","source":{"kind":"arxiv","id":"2312.15572","version":3},"attestation_state":"computed","paper":{"title":"Induced subgraph density. VI. Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2023-12-25T00:53:40Z","abstract_excerpt":"We confirm a conjecture of Fox, Pach, and Suk, that for every $d>0$, there exists $c>0$ such that every $n$-vertex graph of VC-dimension at most $d$ has a clique or stable set of size at least $n^c$. This implies that, in the language of model theory, every graph definable in NIP structures has a clique or anti-clique of polynomial size, settling a conjecture of Chernikov, Starchenko, and Thomas.\n  Our result also implies that every two-colourable tournament satisfies the tournament version of the Erd\\H{o}s-Hajnal conjecture, which completes the verification of the conjecture for six-vertex to"},"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":"2312.15572","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-25T00:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"d444d180f52fd013a12582353d110f72580fa72c62dcb79ab2540e6479c23585","abstract_canon_sha256":"1a906720522a16c394cbcc0a31b236850a56a085c27d9a7b9b70bfd9dbd34f09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:52.792701Z","signature_b64":"Ig7s0Zd/Q11yY/CbpybAnp0dIKp7sN+epyZO5cge4chCQ9qdTQZ4uEzOXMuE9r5dNAWq0IgnGh6oOSZLPgs8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","last_reissued_at":"2026-07-05T12:07:52.792183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:52.792183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraph density. VI. Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2023-12-25T00:53:40Z","abstract_excerpt":"We confirm a conjecture of Fox, Pach, and Suk, that for every $d>0$, there exists $c>0$ such that every $n$-vertex graph of VC-dimension at most $d$ has a clique or stable set of size at least $n^c$. This implies that, in the language of model theory, every graph definable in NIP structures has a clique or anti-clique of polynomial size, settling a conjecture of Chernikov, Starchenko, and Thomas.\n  Our result also implies that every two-colourable tournament satisfies the tournament version of the Erd\\H{o}s-Hajnal conjecture, which completes the verification of the conjecture for six-vertex to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15572","kind":"arxiv","version":3},"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/2312.15572/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":"2312.15572","created_at":"2026-07-05T12:07:52.792244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15572v3","created_at":"2026-07-05T12:07:52.792244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15572","created_at":"2026-07-05T12:07:52.792244+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUMKL5F4WVFI","created_at":"2026-07-05T12:07:52.792244+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUMKL5F4WVFIMTGG","created_at":"2026-07-05T12:07:52.792244+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUMKL5F4","created_at":"2026-07-05T12:07:52.792244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21640","citing_title":"The Twin-Width of Graphs of Bounded VC-Dimension","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2501.13850","citing_title":"Uniform set systems with small VC-dimension","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS","json":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS.json","graph_json":"https://pith.science/api/pith-number/FUMKL5F4WVFIMTGG3GBSXUTOXS/graph.json","events_json":"https://pith.science/api/pith-number/FUMKL5F4WVFIMTGG3GBSXUTOXS/events.json","paper":"https://pith.science/paper/FUMKL5F4"},"agent_actions":{"view_html":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS","download_json":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS.json","view_paper":"https://pith.science/paper/FUMKL5F4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15572&json=true","fetch_graph":"https://pith.science/api/pith-number/FUMKL5F4WVFIMTGG3GBSXUTOXS/graph.json","fetch_events":"https://pith.science/api/pith-number/FUMKL5F4WVFIMTGG3GBSXUTOXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/action/storage_attestation","attest_author":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/action/author_attestation","sign_citation":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/action/citation_signature","submit_replication":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/action/replication_record"}},"created_at":"2026-07-05T12:07:52.792244+00:00","updated_at":"2026-07-05T12:07:52.792244+00:00"}