{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LZEILM33AISACK6G3R37LRSU42","short_pith_number":"pith:LZEILM33","schema_version":"1.0","canonical_sha256":"5e4885b37b0224012bc6dc77f5c654e68e67d46cdf69e5c1a68a7359e4b82772","source":{"kind":"arxiv","id":"2111.09671","version":1},"attestation_state":"computed","paper":{"title":"A Variant of the VC-dimension with Applications to Depth-3 Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Navid Talebanfard, Peter Frankl, Svyatoslav Gryaznov","submitted_at":"2021-11-18T13:04:55Z","abstract_excerpt":"We introduce the following variant of the VC-dimension. Given $S \\subseteq \\{0, 1\\}^n$ and a positive integer $d$, we define $\\mathbb{U}_d(S)$ to be the size of the largest subset $I \\subseteq [n]$ such that the projection of $S$ on every subset of $I$ of size $d$ is the $d$-dimensional cube. We show that determining the largest cardinality of a set with a given $\\mathbb{U}_d$ dimension is equivalent to a Tur\\'an-type problem related to the total number of cliques in a $d$-uniform hypergraph. This allows us to beat the Sauer--Shelah lemma for this notion of dimension. We use this to obtain sev"},"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":"2111.09671","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-18T13:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"a5c291badc68b3f75d2ccc485207823596ad4ab204b9a5506242f07233d9091d","abstract_canon_sha256":"bfba3d86e2bf3ca3c4993173bc205e3d856c2266bf95a0fa46829fcfdffa819d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:48.539144Z","signature_b64":"gU4XPwtmc/qwH3pl2KbNO+OedQqobFYwnmrrNSwXHH49C44wcefAOs+NAOLkJINkwtpsEkBq4P3VV0DZKl/UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4885b37b0224012bc6dc77f5c654e68e67d46cdf69e5c1a68a7359e4b82772","last_reissued_at":"2026-07-05T04:34:48.538653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:48.538653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Variant of the VC-dimension with Applications to Depth-3 Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Navid Talebanfard, Peter Frankl, Svyatoslav Gryaznov","submitted_at":"2021-11-18T13:04:55Z","abstract_excerpt":"We introduce the following variant of the VC-dimension. Given $S \\subseteq \\{0, 1\\}^n$ and a positive integer $d$, we define $\\mathbb{U}_d(S)$ to be the size of the largest subset $I \\subseteq [n]$ such that the projection of $S$ on every subset of $I$ of size $d$ is the $d$-dimensional cube. We show that determining the largest cardinality of a set with a given $\\mathbb{U}_d$ dimension is equivalent to a Tur\\'an-type problem related to the total number of cliques in a $d$-uniform hypergraph. This allows us to beat the Sauer--Shelah lemma for this notion of dimension. We use this to obtain sev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09671","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/2111.09671/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":"2111.09671","created_at":"2026-07-05T04:34:48.538711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.09671v1","created_at":"2026-07-05T04:34:48.538711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09671","created_at":"2026-07-05T04:34:48.538711+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZEILM33AISA","created_at":"2026-07-05T04:34:48.538711+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZEILM33AISACK6G","created_at":"2026-07-05T04:34:48.538711+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZEILM33","created_at":"2026-07-05T04:34:48.538711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42","json":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42.json","graph_json":"https://pith.science/api/pith-number/LZEILM33AISACK6G3R37LRSU42/graph.json","events_json":"https://pith.science/api/pith-number/LZEILM33AISACK6G3R37LRSU42/events.json","paper":"https://pith.science/paper/LZEILM33"},"agent_actions":{"view_html":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42","download_json":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42.json","view_paper":"https://pith.science/paper/LZEILM33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.09671&json=true","fetch_graph":"https://pith.science/api/pith-number/LZEILM33AISACK6G3R37LRSU42/graph.json","fetch_events":"https://pith.science/api/pith-number/LZEILM33AISACK6G3R37LRSU42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42/action/storage_attestation","attest_author":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42/action/author_attestation","sign_citation":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42/action/citation_signature","submit_replication":"https://pith.science/pith/LZEILM33AISACK6G3R37LRSU42/action/replication_record"}},"created_at":"2026-07-05T04:34:48.538711+00:00","updated_at":"2026-07-05T04:34:48.538711+00:00"}