{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WLYGSNI5NCNIR2XBUIKAXNXXYC","short_pith_number":"pith:WLYGSNI5","schema_version":"1.0","canonical_sha256":"b2f069351d689a88eae1a2140bb6f7c0aa695f0c1101f70f3028c014e374b1c3","source":{"kind":"arxiv","id":"2005.13938","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.13938","created_at":"2026-07-05T03:25:28.548298+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.13938v3","created_at":"2026-07-05T03:25:28.548298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13938","created_at":"2026-07-05T03:25:28.548298+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLYGSNI5NCNI","created_at":"2026-07-05T03:25:28.548298+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLYGSNI5NCNIR2XB","created_at":"2026-07-05T03:25:28.548298+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLYGSNI5","created_at":"2026-07-05T03:25:28.548298+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/WLYGSNI5NCNIR2XBUIKAXNXXYC","json":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC.json","graph_json":"https://pith.science/api/pith-number/WLYGSNI5NCNIR2XBUIKAXNXXYC/graph.json","events_json":"https://pith.science/api/pith-number/WLYGSNI5NCNIR2XBUIKAXNXXYC/events.json","paper":"https://pith.science/paper/WLYGSNI5"},"agent_actions":{"view_html":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC","download_json":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC.json","view_paper":"https://pith.science/paper/WLYGSNI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.13938&json=true","fetch_graph":"https://pith.science/api/pith-number/WLYGSNI5NCNIR2XBUIKAXNXXYC/graph.json","fetch_events":"https://pith.science/api/pith-number/WLYGSNI5NCNIR2XBUIKAXNXXYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/action/storage_attestation","attest_author":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/action/author_attestation","sign_citation":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/action/citation_signature","submit_replication":"https://pith.science/pith/WLYGSNI5NCNIR2XBUIKAXNXXYC/action/replication_record"}},"created_at":"2026-07-05T03:25:28.548298+00:00","updated_at":"2026-07-05T03:25:28.548298+00:00"}