{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FUMKL5F4WVFIMTGG3GBSXUTOXS","short_pith_number":"pith:FUMKL5F4","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"},"canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","source":{"kind":"arxiv","id":"2312.15572","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15572","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15572v3","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15572","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"FUMKL5F4WVFI","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_16","alias_value":"FUMKL5F4WVFIMTGG","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_8","alias_value":"FUMKL5F4","created_at":"2026-07-05T12:07:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FUMKL5F4WVFIMTGG3GBSXUTOXS","target":"record","payload":{"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"},"canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","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"},"source_kind":"arxiv","source_id":"2312.15572","source_version":3,"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-07-05T12:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MArew6WHdimElieZcgPmFQtwpnj/OnKqKdGrrpVmGaXznUPId1g4eQ3QCI+5iv8FcfJdPh04ycZ3xsC/6FjmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:01:44.577706Z"},"content_sha256":"8c7bff6c4071c19e74c944bd2740ed1f6e54bd963ca1621fdffd46f6b04f5632","schema_version":"1.0","event_id":"sha256:8c7bff6c4071c19e74c944bd2740ed1f6e54bd963ca1621fdffd46f6b04f5632"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FUMKL5F4WVFIMTGG3GBSXUTOXS","target":"graph","payload":{"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"},"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-07-05T12:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAt4hFjyLkhcG4ciZrFyPWamVIxzVT4ngyfuqIgDEM10xqbHiz5PBVa/sVbeIcZ14H62p7tEaezCNlOKvIspCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:01:44.578197Z"},"content_sha256":"0dd0942f7543f5607376a5ff1cdc7a1198c72229254ac68c0d2eaff0f66651f0","schema_version":"1.0","event_id":"sha256:0dd0942f7543f5607376a5ff1cdc7a1198c72229254ac68c0d2eaff0f66651f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/bundle.json","state_url":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/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-08-09T11:01:44Z","links":{"resolver":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS","bundle":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/bundle.json","state":"https://pith.science/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUMKL5F4WVFIMTGG3GBSXUTOXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FUMKL5F4WVFIMTGG3GBSXUTOXS","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":"1a906720522a16c394cbcc0a31b236850a56a085c27d9a7b9b70bfd9dbd34f09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-25T00:53:40Z","title_canon_sha256":"d444d180f52fd013a12582353d110f72580fa72c62dcb79ab2540e6479c23585"},"schema_version":"1.0","source":{"id":"2312.15572","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15572","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15572v3","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15572","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"FUMKL5F4WVFI","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_16","alias_value":"FUMKL5F4WVFIMTGG","created_at":"2026-07-05T12:07:52Z"},{"alias_kind":"pith_short_8","alias_value":"FUMKL5F4","created_at":"2026-07-05T12:07:52Z"}],"graph_snapshots":[{"event_id":"sha256:0dd0942f7543f5607376a5ff1cdc7a1198c72229254ac68c0d2eaff0f66651f0","target":"graph","created_at":"2026-07-05T12:07:52Z","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/2312.15572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-25T00:53:40Z","title":"Induced subgraph density. VI. Bounded VC-dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15572","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:8c7bff6c4071c19e74c944bd2740ed1f6e54bd963ca1621fdffd46f6b04f5632","target":"record","created_at":"2026-07-05T12:07:52Z","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":"1a906720522a16c394cbcc0a31b236850a56a085c27d9a7b9b70bfd9dbd34f09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-25T00:53:40Z","title_canon_sha256":"d444d180f52fd013a12582353d110f72580fa72c62dcb79ab2540e6479c23585"},"schema_version":"1.0","source":{"id":"2312.15572","kind":"arxiv","version":3}},"canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d18a5f4bcb54a864cc6d9832bd26ebc8dd7bddd4ec3af148d28d54b79191a99","first_computed_at":"2026-07-05T12:07:52.792183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:52.792183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ig7s0Zd/Q11yY/CbpybAnp0dIKp7sN+epyZO5cge4chCQ9qdTQZ4uEzOXMuE9r5dNAWq0IgnGh6oOSZLPgs8Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:52.792701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.15572","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c7bff6c4071c19e74c944bd2740ed1f6e54bd963ca1621fdffd46f6b04f5632","sha256:0dd0942f7543f5607376a5ff1cdc7a1198c72229254ac68c0d2eaff0f66651f0"],"state_sha256":"86a4d1e89fd49757e5251202f994988ef3061aef3d04bd6fdf81d100aca76c23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GK5aj407Znjb/d7e90zaegzF7nsEh46hpaw8UfPIx0pOLQlBBgZmt0PYIE8DGjQ0t/Qpz1GN9+EHlomqDCevCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:01:44.582920Z","bundle_sha256":"8ef2f3425de236d97ac63901389da4a52e238984f23838a74cc8c63165875ab2"}}