{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FSUFJQKVYGEKDMJHVF7NR7JIZG","short_pith_number":"pith:FSUFJQKV","schema_version":"1.0","canonical_sha256":"2ca854c155c188a1b127a97ed8fd28c99f3eff8af22bef78ffd67c5fd72989f3","source":{"kind":"arxiv","id":"1610.03812","version":2},"attestation_state":"computed","paper":{"title":"Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Khaled Elbassioni","submitted_at":"2016-10-12T18:21:42Z","abstract_excerpt":"We consider the problem of finding a small hitting set in an {\\it infinite} range space $\\cF=(Q,\\cR)$ of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite dimensional convex relaxation can be solved (approximately) efficiently by multiplicative weight updates. As a consequence, we get an algorithm that finds, for any $\\delta>0$, a set of size $O(s_{\\cF}(z^*_\\cF))$ that hits $(1-\\delta)$-fraction of $\\cR$ (with respect to a given measure) in time proportional to $\\log(\\frac{1}{\\delta})$, where $s_{\\cF}(\\frac{1}{\\epsilon})$ is the size of the smallest $\\epsil"},"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":"1610.03812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-12T18:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"b68a9fde87eb0acbf9a9419a066cd02221d225ac058c751413278594af1e659f","abstract_canon_sha256":"0133ebaa48fbf3917d1eec7c76e54597e8c2a0be577175530b8d4d13be85b8e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:56.555921Z","signature_b64":"KzN7ghWaMXF/bBdDvQ+GqLVfU3oTJUzuh3VgVowPCrZgA2mnSy3aidpWniGA1gKP9tfh2IjanzkKx6br9By8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca854c155c188a1b127a97ed8fd28c99f3eff8af22bef78ffd67c5fd72989f3","last_reissued_at":"2026-05-18T00:50:56.555225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:56.555225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Khaled Elbassioni","submitted_at":"2016-10-12T18:21:42Z","abstract_excerpt":"We consider the problem of finding a small hitting set in an {\\it infinite} range space $\\cF=(Q,\\cR)$ of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite dimensional convex relaxation can be solved (approximately) efficiently by multiplicative weight updates. As a consequence, we get an algorithm that finds, for any $\\delta>0$, a set of size $O(s_{\\cF}(z^*_\\cF))$ that hits $(1-\\delta)$-fraction of $\\cR$ (with respect to a given measure) in time proportional to $\\log(\\frac{1}{\\delta})$, where $s_{\\cF}(\\frac{1}{\\epsilon})$ is the size of the smallest $\\epsil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03812","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1610.03812","created_at":"2026-05-18T00:50:56.555357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03812v2","created_at":"2026-05-18T00:50:56.555357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03812","created_at":"2026-05-18T00:50:56.555357+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSUFJQKVYGEK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSUFJQKVYGEKDMJH","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSUFJQKV","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.23297","citing_title":"A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG","json":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG.json","graph_json":"https://pith.science/api/pith-number/FSUFJQKVYGEKDMJHVF7NR7JIZG/graph.json","events_json":"https://pith.science/api/pith-number/FSUFJQKVYGEKDMJHVF7NR7JIZG/events.json","paper":"https://pith.science/paper/FSUFJQKV"},"agent_actions":{"view_html":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG","download_json":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG.json","view_paper":"https://pith.science/paper/FSUFJQKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03812&json=true","fetch_graph":"https://pith.science/api/pith-number/FSUFJQKVYGEKDMJHVF7NR7JIZG/graph.json","fetch_events":"https://pith.science/api/pith-number/FSUFJQKVYGEKDMJHVF7NR7JIZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG/action/storage_attestation","attest_author":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG/action/author_attestation","sign_citation":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG/action/citation_signature","submit_replication":"https://pith.science/pith/FSUFJQKVYGEKDMJHVF7NR7JIZG/action/replication_record"}},"created_at":"2026-05-18T00:50:56.555357+00:00","updated_at":"2026-05-18T00:50:56.555357+00:00"}