{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ALQAEWCEBQ5XMHG4R7XZIOSQLB","short_pith_number":"pith:ALQAEWCE","schema_version":"1.0","canonical_sha256":"02e00258440c3b761cdc8fef943a505852ac32332f24a662eacc940d7b7edc33","source":{"kind":"arxiv","id":"1609.05110","version":3},"attestation_state":"computed","paper":{"title":"Parameterized and Approximation Complexity of Partial VC Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina Bazgan, Florent Foucaud, Florian Sikora","submitted_at":"2016-09-16T15:42:43Z","abstract_excerpt":"We introduce the problem Partial VC Dimension that asks, given a hypergraph $H=(X,E)$ and integers $k$ and $\\ell$, whether one can select a set $C\\subseteq X$ of $k$ vertices of $H$ such that the set $\\{e\\cap C, e\\in E\\}$ of distinct hyperedge-intersections with $C$ has size at least $\\ell$. The sets $e\\cap C$ define equivalence classes over $E$. Partial VC Dimension is a generalization of VC Dimension, which corresponds to the case $\\ell=2^k$, and of Distinguishing Transversal, which corresponds to the case $\\ell=|E|$ (the latter is also known as Test Cover in the dual hypergraph). We also in"},"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":"1609.05110","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-16T15:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"ed41900ce0a63a9c091575ce9d292ee0be9fb5b788726afb9c42b0ed2db2609d","abstract_canon_sha256":"53cf8779e886432dc7b513a9e0fa911dcfa0b73a836b792c0b3c35d85829e6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.370254Z","signature_b64":"tSWxfeD09zU5ZPv/nezO9Yk5ZRtsuEVZi1WfZmyxLhywGwK7u//X0zsyFumxtXDtcPquliavDgU7U1uYmSE5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e00258440c3b761cdc8fef943a505852ac32332f24a662eacc940d7b7edc33","last_reissued_at":"2026-05-17T23:45:00.369518Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.369518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized and Approximation Complexity of Partial VC Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina Bazgan, Florent Foucaud, Florian Sikora","submitted_at":"2016-09-16T15:42:43Z","abstract_excerpt":"We introduce the problem Partial VC Dimension that asks, given a hypergraph $H=(X,E)$ and integers $k$ and $\\ell$, whether one can select a set $C\\subseteq X$ of $k$ vertices of $H$ such that the set $\\{e\\cap C, e\\in E\\}$ of distinct hyperedge-intersections with $C$ has size at least $\\ell$. The sets $e\\cap C$ define equivalence classes over $E$. Partial VC Dimension is a generalization of VC Dimension, which corresponds to the case $\\ell=2^k$, and of Distinguishing Transversal, which corresponds to the case $\\ell=|E|$ (the latter is also known as Test Cover in the dual hypergraph). We also in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05110","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":""},"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":"1609.05110","created_at":"2026-05-17T23:45:00.369636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05110v3","created_at":"2026-05-17T23:45:00.369636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05110","created_at":"2026-05-17T23:45:00.369636+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALQAEWCEBQ5X","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALQAEWCEBQ5XMHG4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALQAEWCE","created_at":"2026-05-18T12:30:07.202191+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/ALQAEWCEBQ5XMHG4R7XZIOSQLB","json":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB.json","graph_json":"https://pith.science/api/pith-number/ALQAEWCEBQ5XMHG4R7XZIOSQLB/graph.json","events_json":"https://pith.science/api/pith-number/ALQAEWCEBQ5XMHG4R7XZIOSQLB/events.json","paper":"https://pith.science/paper/ALQAEWCE"},"agent_actions":{"view_html":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB","download_json":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB.json","view_paper":"https://pith.science/paper/ALQAEWCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05110&json=true","fetch_graph":"https://pith.science/api/pith-number/ALQAEWCEBQ5XMHG4R7XZIOSQLB/graph.json","fetch_events":"https://pith.science/api/pith-number/ALQAEWCEBQ5XMHG4R7XZIOSQLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB/action/storage_attestation","attest_author":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB/action/author_attestation","sign_citation":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB/action/citation_signature","submit_replication":"https://pith.science/pith/ALQAEWCEBQ5XMHG4R7XZIOSQLB/action/replication_record"}},"created_at":"2026-05-17T23:45:00.369636+00:00","updated_at":"2026-05-17T23:45:00.369636+00:00"}