{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IRBWV4QV2HMPNOOYKBODQTJCKV","short_pith_number":"pith:IRBWV4QV","schema_version":"1.0","canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","source":{"kind":"arxiv","id":"2010.00726","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph regularity and higher arity VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Artem Chernikov, Henry Towsner","submitted_at":"2020-10-01T23:41:20Z","abstract_excerpt":"We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary cylinder sets.\n  In the language of hypergraph regularity, this shows that when H is a k'-uniform hypergraph with small VC_k-dimension for some k<k', the decomposition of H given by hypergraph regularity only needs the first k levels---one can approximate H using sets of vertices, sets of pairs, and so on up to sets of k-tuples---and that on mos"},"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":"2010.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"5412f30a27392230923215b65dbce607e405a934a7856eb9e609f0b902551399","abstract_canon_sha256":"6868e9c8dfb8de8fb2adbbf3513881d72215118f3aa21b86b30c2026428cda8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:46.732604Z","signature_b64":"GMe42dQEi+7cGY0RwPlHLjZPoeDRRpFAP/lT5GglpZ35uMsYHJ3E6KY3RGlhE8VYnYV0Ij4d1jkcxtznw68eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","last_reissued_at":"2026-07-05T01:39:46.732177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:46.732177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph regularity and higher arity VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Artem Chernikov, Henry Towsner","submitted_at":"2020-10-01T23:41:20Z","abstract_excerpt":"We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary cylinder sets.\n  In the language of hypergraph regularity, this shows that when H is a k'-uniform hypergraph with small VC_k-dimension for some k<k', the decomposition of H given by hypergraph regularity only needs the first k levels---one can approximate H using sets of vertices, sets of pairs, and so on up to sets of k-tuples---and that on mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00726","kind":"arxiv","version":1},"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/2010.00726/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":"2010.00726","created_at":"2026-07-05T01:39:46.732232+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00726v1","created_at":"2026-07-05T01:39:46.732232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00726","created_at":"2026-07-05T01:39:46.732232+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRBWV4QV2HMP","created_at":"2026-07-05T01:39:46.732232+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRBWV4QV2HMPNOOY","created_at":"2026-07-05T01:39:46.732232+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRBWV4QV","created_at":"2026-07-05T01:39:46.732232+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18533","citing_title":"On the notion of a patterning property in model theory","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18123","citing_title":"Fractional Helly property and combinatorics of forking in NTP$_2$ theories","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26754","citing_title":"A note on quantitative stability in Hilbert spaces","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04714","citing_title":"On n-distality, n-triviality and hypergraph regularity in NIP theories","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV","json":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV.json","graph_json":"https://pith.science/api/pith-number/IRBWV4QV2HMPNOOYKBODQTJCKV/graph.json","events_json":"https://pith.science/api/pith-number/IRBWV4QV2HMPNOOYKBODQTJCKV/events.json","paper":"https://pith.science/paper/IRBWV4QV"},"agent_actions":{"view_html":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV","download_json":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV.json","view_paper":"https://pith.science/paper/IRBWV4QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00726&json=true","fetch_graph":"https://pith.science/api/pith-number/IRBWV4QV2HMPNOOYKBODQTJCKV/graph.json","fetch_events":"https://pith.science/api/pith-number/IRBWV4QV2HMPNOOYKBODQTJCKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/action/storage_attestation","attest_author":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/action/author_attestation","sign_citation":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/action/citation_signature","submit_replication":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/action/replication_record"}},"created_at":"2026-07-05T01:39:46.732232+00:00","updated_at":"2026-07-05T01:39:46.732232+00:00"}