{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S25OZVM7QFFWTPME7VD5R36X74","short_pith_number":"pith:S25OZVM7","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"},"canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","source":{"kind":"arxiv","id":"1706.08050","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08050","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08050v3","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08050","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"S25OZVM7QFFW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S25OZVM7QFFWTPME","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S25OZVM7","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S25OZVM7QFFWTPME7VD5R36X74","target":"record","payload":{"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"},"canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","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"},"source_kind":"arxiv","source_id":"1706.08050","source_version":3,"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-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtfBy/fEXqnyLB9IhdmWHYeaIl4weH+GpUdDZISM7j+JGNMA7F5g95TadyvgROB3vsnlY3V4QFa+O7xfaTSzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:02:26.018055Z"},"content_sha256":"de26f3b46f4e17f03019bd35b1fe63dbcac53086118a20c5453fff01ae88865b","schema_version":"1.0","event_id":"sha256:de26f3b46f4e17f03019bd35b1fe63dbcac53086118a20c5453fff01ae88865b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S25OZVM7QFFWTPME7VD5R36X74","target":"graph","payload":{"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"},"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-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4TzoNV0cMWWIvmoMcWVP2SM/VtLdAt/9MPqEaSts0Dt++UmlxW4dJz7npU9B752op7PC2JjEDgHRt2ZhYgvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:02:26.018415Z"},"content_sha256":"b6c7bba39df4a12e12235b90a987493c7c6c203935b55b31be571b965a762515","schema_version":"1.0","event_id":"sha256:b6c7bba39df4a12e12235b90a987493c7c6c203935b55b31be571b965a762515"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/bundle.json","state_url":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S25OZVM7QFFWTPME7VD5R36X74/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-06-28T06:02:26Z","links":{"resolver":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74","bundle":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/bundle.json","state":"https://pith.science/pith/S25OZVM7QFFWTPME7VD5R36X74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S25OZVM7QFFWTPME7VD5R36X74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S25OZVM7QFFWTPME7VD5R36X74","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":"bfb3e33b090cb5d7958424e28433e68babba5b662e4f707924a3dcac09cfaf2a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-25T08:00:56Z","title_canon_sha256":"6764661d9f58db2013db75db5e941b892012846c6a0ba1c01f239f4297eda13f"},"schema_version":"1.0","source":{"id":"1706.08050","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08050","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08050v3","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08050","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"S25OZVM7QFFW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S25OZVM7QFFWTPME","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S25OZVM7","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:b6c7bba39df4a12e12235b90a987493c7c6c203935b55b31be571b965a762515","target":"graph","created_at":"2026-05-18T00:34:37Z","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":"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","authors_text":"Dani\\\"el Paulusma, Martin Milani\\v{c}, Matthew Johnson, Nina Chiarelli, Tatiana R. Hartinger","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-25T08:00:56Z","title":"Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08050","kind":"arxiv","version":3},"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:de26f3b46f4e17f03019bd35b1fe63dbcac53086118a20c5453fff01ae88865b","target":"record","created_at":"2026-05-18T00:34:37Z","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":"bfb3e33b090cb5d7958424e28433e68babba5b662e4f707924a3dcac09cfaf2a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-25T08:00:56Z","title_canon_sha256":"6764661d9f58db2013db75db5e941b892012846c6a0ba1c01f239f4297eda13f"},"schema_version":"1.0","source":{"id":"1706.08050","kind":"arxiv","version":3}},"canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96baecd59f814b69bd84fd47d8efd7ff39469df2e421c764b6a754927f7797f7","first_computed_at":"2026-05-18T00:34:37.048700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:37.048700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6aHa/TvANalMo0yMQFFfTSsxgr7XTHMTeNtBYrOoTjbf8AJU19OuAhEckyWt1IB6cMz+OStYvH3u9kTfTYu2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:37.049081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08050","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de26f3b46f4e17f03019bd35b1fe63dbcac53086118a20c5453fff01ae88865b","sha256:b6c7bba39df4a12e12235b90a987493c7c6c203935b55b31be571b965a762515"],"state_sha256":"f8aa12baf1bd453e9ac81e43d493a373965514fb23cfbbb166908e9e34bdf10d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZZJ+L20fgAcNQwVds8le0Ks8p5YMUhw4KuQ4pyRwAJOiUYH98eWwEOLXly8fWduu8MfuPsd0J9dTfKOFbVIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:02:26.020262Z","bundle_sha256":"ffed1b743c2f12924acd2efec8425595bb2e3018544c01e0369ddf8c4ea919a1"}}