{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BFO7PZGOH3SY275HD2MIPKCJON","short_pith_number":"pith:BFO7PZGO","schema_version":"1.0","canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","source":{"kind":"arxiv","id":"1507.05890","version":2},"attestation_state":"computed","paper":{"title":"On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen","submitted_at":"2015-07-21T16:04:51Z","abstract_excerpt":"Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vert"},"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":"1507.05890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T16:04:51Z","cross_cats_sorted":[],"title_canon_sha256":"e53d67edb5879fcaa7bc1c8611ef73599b975fcff1b406940c754d85fd2ff031","abstract_canon_sha256":"7a44b7b41d22d8fb9e04abb92ff0c77d8dad054edc5cc8fcc58f42690c1b37b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:22.014396Z","signature_b64":"SnPLCizIUAkEQC9uOZhsULiO6qE8TIk24f1ZjYSztw5MH98aOzBnZfzaowGQGxE9ar0sJa6T/EO0i7rdwImzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","last_reissued_at":"2026-05-18T01:36:22.013827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:22.013827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen","submitted_at":"2015-07-21T16:04:51Z","abstract_excerpt":"Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05890","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":"1507.05890","created_at":"2026-05-18T01:36:22.013907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05890v2","created_at":"2026-05-18T01:36:22.013907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05890","created_at":"2026-05-18T01:36:22.013907+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFO7PZGOH3SY","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFO7PZGOH3SY275H","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFO7PZGO","created_at":"2026-05-18T12:29:14.074870+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/BFO7PZGOH3SY275HD2MIPKCJON","json":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON.json","graph_json":"https://pith.science/api/pith-number/BFO7PZGOH3SY275HD2MIPKCJON/graph.json","events_json":"https://pith.science/api/pith-number/BFO7PZGOH3SY275HD2MIPKCJON/events.json","paper":"https://pith.science/paper/BFO7PZGO"},"agent_actions":{"view_html":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON","download_json":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON.json","view_paper":"https://pith.science/paper/BFO7PZGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05890&json=true","fetch_graph":"https://pith.science/api/pith-number/BFO7PZGOH3SY275HD2MIPKCJON/graph.json","fetch_events":"https://pith.science/api/pith-number/BFO7PZGOH3SY275HD2MIPKCJON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/action/storage_attestation","attest_author":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/action/author_attestation","sign_citation":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/action/citation_signature","submit_replication":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/action/replication_record"}},"created_at":"2026-05-18T01:36:22.013907+00:00","updated_at":"2026-05-18T01:36:22.013907+00:00"}