{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KXHJM52ZKGSSFODGYAAY7OHUVJ","short_pith_number":"pith:KXHJM52Z","schema_version":"1.0","canonical_sha256":"55ce96775951a522b866c0018fb8f4aa41ba41501b08e63ac379da0c0b64633b","source":{"kind":"arxiv","id":"2211.01443","version":1},"attestation_state":"computed","paper":{"title":"Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2022-11-02T19:23:42Z","abstract_excerpt":"We study the complexity of computing (and approximating) VC Dimension and Littlestone's Dimension when we are given the concept class explicitly. We give a simple reduction from Maximum (Unbalanced) Biclique problem to approximating VC Dimension and Littlestone's Dimension. With this connection, we derive a range of hardness of approximation results and running time lower bounds. For example, under the (randomized) Gap-Exponential Time Hypothesis or the Strongish Planted Clique Hypothesis, we show a tight inapproximability result: both dimensions are hard to approximate to within a factor of $"},"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":"2211.01443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-02T19:23:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"562495dd92b7effa4e6be203735182b4139164cafcf1bab16148773c90cce191","abstract_canon_sha256":"f519dfc87b5eeca54ec6c50beb6964ad5b452787c4885c940867c1f88b1e288d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:56.099352Z","signature_b64":"HCiYevyf9mL0LKqWTpwNsZMcd1l9quldv+1PUsRhoSxpdPWU0PWys3INUjCzVIKAyhAbEAV85UBiGiGHKGJjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ce96775951a522b866c0018fb8f4aa41ba41501b08e63ac379da0c0b64633b","last_reissued_at":"2026-07-05T05:12:56.098924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:56.098924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2022-11-02T19:23:42Z","abstract_excerpt":"We study the complexity of computing (and approximating) VC Dimension and Littlestone's Dimension when we are given the concept class explicitly. We give a simple reduction from Maximum (Unbalanced) Biclique problem to approximating VC Dimension and Littlestone's Dimension. With this connection, we derive a range of hardness of approximation results and running time lower bounds. For example, under the (randomized) Gap-Exponential Time Hypothesis or the Strongish Planted Clique Hypothesis, we show a tight inapproximability result: both dimensions are hard to approximate to within a factor of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01443","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/2211.01443/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":"2211.01443","created_at":"2026-07-05T05:12:56.098979+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01443v1","created_at":"2026-07-05T05:12:56.098979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01443","created_at":"2026-07-05T05:12:56.098979+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXHJM52ZKGSS","created_at":"2026-07-05T05:12:56.098979+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXHJM52ZKGSSFODG","created_at":"2026-07-05T05:12:56.098979+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXHJM52Z","created_at":"2026-07-05T05:12:56.098979+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07155","citing_title":"Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ","json":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ.json","graph_json":"https://pith.science/api/pith-number/KXHJM52ZKGSSFODGYAAY7OHUVJ/graph.json","events_json":"https://pith.science/api/pith-number/KXHJM52ZKGSSFODGYAAY7OHUVJ/events.json","paper":"https://pith.science/paper/KXHJM52Z"},"agent_actions":{"view_html":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ","download_json":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ.json","view_paper":"https://pith.science/paper/KXHJM52Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01443&json=true","fetch_graph":"https://pith.science/api/pith-number/KXHJM52ZKGSSFODGYAAY7OHUVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KXHJM52ZKGSSFODGYAAY7OHUVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ/action/storage_attestation","attest_author":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ/action/author_attestation","sign_citation":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ/action/citation_signature","submit_replication":"https://pith.science/pith/KXHJM52ZKGSSFODGYAAY7OHUVJ/action/replication_record"}},"created_at":"2026-07-05T05:12:56.098979+00:00","updated_at":"2026-07-05T05:12:56.098979+00:00"}