{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S25OZVM7QFFWTPME7VD5R36X74","short_pith_number":"pith:S25OZVM7","schema_version":"1.0","canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","source":{"kind":"arxiv","id":"1706.08050","version":3},"attestation_state":"computed","paper":{"title":"Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Martin Milani\\v{c}, Matthew Johnson, Nina Chiarelli, Tatiana R. Hartinger","submitted_at":"2017-06-25T08:00:56Z","abstract_excerpt":"We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these variants are NP-complete for general graphs. A graph $G$ is $H$-free for some graph $H$ if $G$ contains no induced subgraph isomorphic to $H$. It is known that Connected Vertex Cover is NP-complete even for $H$-free graphs if $H$ contains a claw or a cycle. We show that the two other connected variants also remain NP-complete if $H$ contains a cycle or claw. In the"},"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":"1706.08050","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-25T08:00:56Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"6764661d9f58db2013db75db5e941b892012846c6a0ba1c01f239f4297eda13f","abstract_canon_sha256":"bfb3e33b090cb5d7958424e28433e68babba5b662e4f707924a3dcac09cfaf2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:37.049081Z","signature_b64":"6aHa/TvANalMo0yMQFFfTSsxgr7XTHMTeNtBYrOoTjbf8AJU19OuAhEckyWt1IB6cMz+OStYvH3u9kTfTYu2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","last_reissued_at":"2026-05-18T00:34:37.048700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:37.048700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Martin Milani\\v{c}, Matthew Johnson, Nina Chiarelli, Tatiana R. Hartinger","submitted_at":"2017-06-25T08:00:56Z","abstract_excerpt":"We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these variants are NP-complete for general graphs. A graph $G$ is $H$-free for some graph $H$ if $G$ contains no induced subgraph isomorphic to $H$. It is known that Connected Vertex Cover is NP-complete even for $H$-free graphs if $H$ contains a claw or a cycle. We show that the two other connected variants also remain NP-complete if $H$ contains a cycle or claw. In the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08050","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":"1706.08050","created_at":"2026-05-18T00:34:37.048758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08050v3","created_at":"2026-05-18T00:34:37.048758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08050","created_at":"2026-05-18T00:34:37.048758+00:00"},{"alias_kind":"pith_short_12","alias_value":"S25OZVM7QFFW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S25OZVM7QFFWTPME","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S25OZVM7","created_at":"2026-05-18T12:31:43.269735+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/S25OZVM7QFFWTPME7VD5R36X74","json":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74.json","graph_json":"https://pith.science/api/pith-number/S25OZVM7QFFWTPME7VD5R36X74/graph.json","events_json":"https://pith.science/api/pith-number/S25OZVM7QFFWTPME7VD5R36X74/events.json","paper":"https://pith.science/paper/S25OZVM7"},"agent_actions":{"view_html":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74","download_json":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74.json","view_paper":"https://pith.science/paper/S25OZVM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08050&json=true","fetch_graph":"https://pith.science/api/pith-number/S25OZVM7QFFWTPME7VD5R36X74/graph.json","fetch_events":"https://pith.science/api/pith-number/S25OZVM7QFFWTPME7VD5R36X74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/action/storage_attestation","attest_author":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/action/author_attestation","sign_citation":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/action/citation_signature","submit_replication":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/action/replication_record"}},"created_at":"2026-05-18T00:34:37.048758+00:00","updated_at":"2026-05-18T00:34:37.048758+00:00"}