{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BFO7PZGOH3SY275HD2MIPKCJON","short_pith_number":"pith:BFO7PZGO","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"},"canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","source":{"kind":"arxiv","id":"1507.05890","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05890","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05890v2","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05890","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"BFO7PZGOH3SY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BFO7PZGOH3SY275H","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BFO7PZGO","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BFO7PZGOH3SY275HD2MIPKCJON","target":"record","payload":{"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"},"canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","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"},"source_kind":"arxiv","source_id":"1507.05890","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mniSpXoG6/O6NYW2HntP351rVgU/DdiMJz7hlk1tR/TU2RB21MjP6EH8xwoMKadnyalu342AudPEWH13+bqnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:16:16.409697Z"},"content_sha256":"729d91d432c7c21d6c58ce1cf4449e00febcd40ffed299873edac3c34eef95e3","schema_version":"1.0","event_id":"sha256:729d91d432c7c21d6c58ce1cf4449e00febcd40ffed299873edac3c34eef95e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BFO7PZGOH3SY275HD2MIPKCJON","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSWDxlHwIADb2Ng5IBIuDH6eC2uVXrjMQYIM7fVqGSTzCATCZywsQIJgV7SxYCTlGWpBSd8GFGIpesjoJY9nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:16:16.410079Z"},"content_sha256":"c9d47401195999e43cbc3a83948ff7ced390981eaff4bccc5802a8a8ed3d2dfd","schema_version":"1.0","event_id":"sha256:c9d47401195999e43cbc3a83948ff7ced390981eaff4bccc5802a8a8ed3d2dfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/bundle.json","state_url":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFO7PZGOH3SY275HD2MIPKCJON/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T08:16:16Z","links":{"resolver":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON","bundle":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/bundle.json","state":"https://pith.science/pith/BFO7PZGOH3SY275HD2MIPKCJON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFO7PZGOH3SY275HD2MIPKCJON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BFO7PZGOH3SY275HD2MIPKCJON","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a44b7b41d22d8fb9e04abb92ff0c77d8dad054edc5cc8fcc58f42690c1b37b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T16:04:51Z","title_canon_sha256":"e53d67edb5879fcaa7bc1c8611ef73599b975fcff1b406940c754d85fd2ff031"},"schema_version":"1.0","source":{"id":"1507.05890","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05890","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05890v2","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05890","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"BFO7PZGOH3SY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BFO7PZGOH3SY275H","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BFO7PZGO","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:c9d47401195999e43cbc3a83948ff7ced390981eaff4bccc5802a8a8ed3d2dfd","target":"graph","created_at":"2026-05-18T01:36:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bart M. P. Jansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T16:04:51Z","title":"On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05890","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:729d91d432c7c21d6c58ce1cf4449e00febcd40ffed299873edac3c34eef95e3","target":"record","created_at":"2026-05-18T01:36:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a44b7b41d22d8fb9e04abb92ff0c77d8dad054edc5cc8fcc58f42690c1b37b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-21T16:04:51Z","title_canon_sha256":"e53d67edb5879fcaa7bc1c8611ef73599b975fcff1b406940c754d85fd2ff031"},"schema_version":"1.0","source":{"id":"1507.05890","kind":"arxiv","version":2}},"canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"095df7e4ce3ee58d7fa71e9887a8497363e4e35697d80d0ea77970cce70773a2","first_computed_at":"2026-05-18T01:36:22.013827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:22.013827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SnPLCizIUAkEQC9uOZhsULiO6qE8TIk24f1ZjYSztw5MH98aOzBnZfzaowGQGxE9ar0sJa6T/EO0i7rdwImzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:22.014396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05890","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:729d91d432c7c21d6c58ce1cf4449e00febcd40ffed299873edac3c34eef95e3","sha256:c9d47401195999e43cbc3a83948ff7ced390981eaff4bccc5802a8a8ed3d2dfd"],"state_sha256":"70f23f5d759d9ccdacfbeb5b40dcfd83cb540f6fa7c2a006bbe89ef37214cec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgrMasS1ySWS8VDEWQr4BuMZM8Lmko0E8I1KU/+79AppZ8Nv3WZqJtTyQJn9AHrtGNC1vgRjvquDKhIkSM4DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:16:16.412847Z","bundle_sha256":"f5b0cefb6db27e3466c271de6989066195c6a14659bb6d5fd94f71569edc8d79"}}