{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5BS3A6XJ4YDJCPGKY2WGOGQWEF","short_pith_number":"pith:5BS3A6XJ","schema_version":"1.0","canonical_sha256":"e865b07ae9e606913ccac6ac671a1621725c5c24095219c332aeffe6a752ed4f","source":{"kind":"arxiv","id":"2208.14132","version":3},"attestation_state":"computed","paper":{"title":"On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann, Anna Zych-Pawlewicz, Johannes Blum, Siddharth Gupta, Yann Disser","submitted_at":"2022-08-30T10:28:06Z","abstract_excerpt":"We consider the Sparse Hitting Set (Sparse-HS) problem, where we are given a set system $(V,\\mathcal{F},\\mathcal{B})$ with two families $\\mathcal{F},\\mathcal{B}$ of subsets of $V$. The task is to find a hitting set for $\\mathcal{F}$ that minimizes the maximum number of elements in any of the sets of $\\mathcal{B}$. Our focus is on determining the complexity of some special cases of Sparse-HS with respect to the sparseness $k$, which is the optimum number of hitting set elements in any set of $\\mathcal{B}$.\n  For the Sparse Vertex Cover (Sparse-VC) problem, $V$ is given by the vertex set of a gr"},"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":"2208.14132","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-08-30T10:28:06Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a1c05fd681a2eff63031f18e6cf66df8ffa5d40aa2bf4c177d7964e478050075","abstract_canon_sha256":"3d5b561abc6c0a65e140c9133fa0a6ac6a26e29601d9b4f62d53ee767dfb468a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:40.674639Z","signature_b64":"CGh1w+oIntIUhvGauwniFLBNGXywrR1SnX9IJp8M3VrH6+xwbtFxQDp9UywCvzjD4PhkV00d7qq+5hbe5GUZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e865b07ae9e606913ccac6ac671a1621725c5c24095219c332aeffe6a752ed4f","last_reissued_at":"2026-07-05T05:01:40.673978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:40.673978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann, Anna Zych-Pawlewicz, Johannes Blum, Siddharth Gupta, Yann Disser","submitted_at":"2022-08-30T10:28:06Z","abstract_excerpt":"We consider the Sparse Hitting Set (Sparse-HS) problem, where we are given a set system $(V,\\mathcal{F},\\mathcal{B})$ with two families $\\mathcal{F},\\mathcal{B}$ of subsets of $V$. The task is to find a hitting set for $\\mathcal{F}$ that minimizes the maximum number of elements in any of the sets of $\\mathcal{B}$. Our focus is on determining the complexity of some special cases of Sparse-HS with respect to the sparseness $k$, which is the optimum number of hitting set elements in any set of $\\mathcal{B}$.\n  For the Sparse Vertex Cover (Sparse-VC) problem, $V$ is given by the vertex set of a gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.14132","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.14132/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":"2208.14132","created_at":"2026-07-05T05:01:40.674063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.14132v3","created_at":"2026-07-05T05:01:40.674063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.14132","created_at":"2026-07-05T05:01:40.674063+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BS3A6XJ4YDJ","created_at":"2026-07-05T05:01:40.674063+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BS3A6XJ4YDJCPGK","created_at":"2026-07-05T05:01:40.674063+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BS3A6XJ","created_at":"2026-07-05T05:01:40.674063+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/5BS3A6XJ4YDJCPGKY2WGOGQWEF","json":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF.json","graph_json":"https://pith.science/api/pith-number/5BS3A6XJ4YDJCPGKY2WGOGQWEF/graph.json","events_json":"https://pith.science/api/pith-number/5BS3A6XJ4YDJCPGKY2WGOGQWEF/events.json","paper":"https://pith.science/paper/5BS3A6XJ"},"agent_actions":{"view_html":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF","download_json":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF.json","view_paper":"https://pith.science/paper/5BS3A6XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.14132&json=true","fetch_graph":"https://pith.science/api/pith-number/5BS3A6XJ4YDJCPGKY2WGOGQWEF/graph.json","fetch_events":"https://pith.science/api/pith-number/5BS3A6XJ4YDJCPGKY2WGOGQWEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF/action/storage_attestation","attest_author":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF/action/author_attestation","sign_citation":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF/action/citation_signature","submit_replication":"https://pith.science/pith/5BS3A6XJ4YDJCPGKY2WGOGQWEF/action/replication_record"}},"created_at":"2026-07-05T05:01:40.674063+00:00","updated_at":"2026-07-05T05:01:40.674063+00:00"}