{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WLYGSNI5NCNIR2XBUIKAXNXXYC","short_pith_number":"pith:WLYGSNI5","canonical_record":{"source":{"id":"2005.13938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-28T12:09:04Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3350e83f6913e60f171ef0a524e29fa09258a62b42c4158d499e5cb9239d4abc","abstract_canon_sha256":"7ebbd44dd3e42e5fc3feb693e5ec4ca0d5f3526c005952254a08981609a7d567"},"schema_version":"1.0"},"canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","source":{"kind":"arxiv","id":"2005.13938","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13938","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13938v3","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13938","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"WLYGSNI5NCNI","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_16","alias_value":"WLYGSNI5NCNIR2XB","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_8","alias_value":"WLYGSNI5","created_at":"2026-07-05T03:25:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WLYGSNI5NCNIR2XBUIKAXNXXYC","target":"record","payload":{"canonical_record":{"source":{"id":"2005.13938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-28T12:09:04Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3350e83f6913e60f171ef0a524e29fa09258a62b42c4158d499e5cb9239d4abc","abstract_canon_sha256":"7ebbd44dd3e42e5fc3feb693e5ec4ca0d5f3526c005952254a08981609a7d567"},"schema_version":"1.0"},"canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:28.548674Z","signature_b64":"B0KGufifLfCnYVAW2b6anoR4qxPey4SOlOtsvW2mCSICOeSSjK+p0yWjI5LK+6Zmej0YN9ZzZQJdDeULrl/ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","last_reissued_at":"2026-07-05T03:25:28.548242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:28.548242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.13938","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-07-05T03:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYSYMGnZ25XxzStZ9fECxYs/52sIVivZ4UAP5rj9Q5ylZln62YPl7tVgL6jOp5eMTsUb9hWXdd3+W3loqK3mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:29:56.525540Z"},"content_sha256":"1fb77359de8c13c47c6fe55a4c10c01db36a36d9e01fd58c2b7f774a39b30c3c","schema_version":"1.0","event_id":"sha256:1fb77359de8c13c47c6fe55a4c10c01db36a36d9e01fd58c2b7f774a39b30c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WLYGSNI5NCNIR2XBUIKAXNXXYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Subset Transversals in $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Giacomo Paesani, Matthew Johnson, Nick Brettell","submitted_at":"2020-05-28T12:09:04Z","abstract_excerpt":"We study the computational complexity of two well-known graph transversal problems, namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the input to $H$-free graphs, that is, to graphs that do not contain some fixed graph~$H$ as an induced subgraph. By combining known and new results, we determine the computational complexity of both problems on $H$-free graphs for every graph $H$ except when $H=sP_1+P_4$ for some $s\\geq 1$. As part of our approach, we introduce the Subset Vertex Cover problem and prove that it is polynomial-time solvable for $(sP_1+P_4)$-free gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13938","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/2005.13938/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"},"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-07-05T03:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLQJ1bk09qVb6IOJrPmRn5nxc8NG3s9RwtiPiqtduIr6/g0m+Eic8GbCEzHU3SXK20HUqLePE5UWAP7ZtEN0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:29:56.526327Z"},"content_sha256":"b017a99349ddd153193ba18370385f031f7c5f4f77dcc2b76ca802109137fdd4","schema_version":"1.0","event_id":"sha256:b017a99349ddd153193ba18370385f031f7c5f4f77dcc2b76ca802109137fdd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/bundle.json","state_url":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/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-08-21T23:29:56Z","links":{"resolver":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC","bundle":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/bundle.json","state":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WLYGSNI5NCNIR2XBUIKAXNXXYC","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":"7ebbd44dd3e42e5fc3feb693e5ec4ca0d5f3526c005952254a08981609a7d567","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-28T12:09:04Z","title_canon_sha256":"3350e83f6913e60f171ef0a524e29fa09258a62b42c4158d499e5cb9239d4abc"},"schema_version":"1.0","source":{"id":"2005.13938","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13938","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13938v3","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13938","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"WLYGSNI5NCNI","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_16","alias_value":"WLYGSNI5NCNIR2XB","created_at":"2026-07-05T03:25:28Z"},{"alias_kind":"pith_short_8","alias_value":"WLYGSNI5","created_at":"2026-07-05T03:25:28Z"}],"graph_snapshots":[{"event_id":"sha256:b017a99349ddd153193ba18370385f031f7c5f4f77dcc2b76ca802109137fdd4","target":"graph","created_at":"2026-07-05T03:25:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.13938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computational complexity of two well-known graph transversal problems, namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the input to $H$-free graphs, that is, to graphs that do not contain some fixed graph~$H$ as an induced subgraph. By combining known and new results, we determine the computational complexity of both problems on $H$-free graphs for every graph $H$ except when $H=sP_1+P_4$ for some $s\\geq 1$. As part of our approach, we introduce the Subset Vertex Cover problem and prove that it is polynomial-time solvable for $(sP_1+P_4)$-free gr","authors_text":"Dani\\\"el Paulusma, Giacomo Paesani, Matthew Johnson, Nick Brettell","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-28T12:09:04Z","title":"Computing Subset Transversals in $H$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13938","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:1fb77359de8c13c47c6fe55a4c10c01db36a36d9e01fd58c2b7f774a39b30c3c","target":"record","created_at":"2026-07-05T03:25:28Z","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":"7ebbd44dd3e42e5fc3feb693e5ec4ca0d5f3526c005952254a08981609a7d567","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-28T12:09:04Z","title_canon_sha256":"3350e83f6913e60f171ef0a524e29fa09258a62b42c4158d499e5cb9239d4abc"},"schema_version":"1.0","source":{"id":"2005.13938","kind":"arxiv","version":3}},"canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","first_computed_at":"2026-07-05T03:25:28.548242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:25:28.548242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0KGufifLfCnYVAW2b6anoR4qxPey4SOlOtsvW2mCSICOeSSjK+p0yWjI5LK+6Zmej0YN9ZzZQJdDeULrl/ZCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:25:28.548674Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.13938","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fb77359de8c13c47c6fe55a4c10c01db36a36d9e01fd58c2b7f774a39b30c3c","sha256:b017a99349ddd153193ba18370385f031f7c5f4f77dcc2b76ca802109137fdd4"],"state_sha256":"3138473167e7647a6568af54468bf790b8bcc0ef7b28e21cb72ebfe4b435c2f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/ZAm8Bpj3TINIXdXbl2GWrTY+7Nm1E0gbOKuhgVTqIHH1+o8s207+FX9Jgr32KdN+Yt+YhjcemsYiiFKpv6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:29:56.530721Z","bundle_sha256":"1439ec4db2733852632396f271e818f1c1a39be1583bb1b45b9b560f49db9f2d"}}