{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VFK4RVYAXGMNGXP3TRBYRLU4IW","short_pith_number":"pith:VFK4RVYA","schema_version":"1.0","canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","source":{"kind":"arxiv","id":"2307.05701","version":2},"attestation_state":"computed","paper":{"title":"Computing Subset Vertex Covers in $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Jelle J. Oostveen, Johannes Rauch, Nick Brettell, Sukanya Pandey","submitted_at":"2023-07-11T18:08:02Z","abstract_excerpt":"We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph $G=(V,E)$, a subset $T\\subseteq V$ and integer $k$, if $V$ has a subset $S$ of size at most $k$, such that $S$ contains at least one end-vertex of every edge incident to a vertex of $T$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We solve two open problems from the literature by proving that Subset Vertex Cover is NP-complete on subcubic (claw,diamond)-free planar graphs and on $2$-unipolar graphs, a subclass of $2P_3$-free weakly chordal graphs. Our"},"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":"2307.05701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-11T18:08:02Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"224d66d2e276361b01092aeb7b51bed27695668da26e4b6ad552e20318b43744","abstract_canon_sha256":"9c3dfd41efdea6af6194b3eef27b8fb14d9f661f611bc313b5aa2cd1f0e6abae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:18.333126Z","signature_b64":"aeN3VG2UH1oaGRPwUmjE+CVVu71vuaSD+/wa6T6+f7siqbJX7JuZiXvopcE5zKeGjs2LLG2x6HmIKspzex2FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","last_reissued_at":"2026-07-05T09:57:18.332649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:18.332649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Subset Vertex Covers in $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Jelle J. Oostveen, Johannes Rauch, Nick Brettell, Sukanya Pandey","submitted_at":"2023-07-11T18:08:02Z","abstract_excerpt":"We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph $G=(V,E)$, a subset $T\\subseteq V$ and integer $k$, if $V$ has a subset $S$ of size at most $k$, such that $S$ contains at least one end-vertex of every edge incident to a vertex of $T$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We solve two open problems from the literature by proving that Subset Vertex Cover is NP-complete on subcubic (claw,diamond)-free planar graphs and on $2$-unipolar graphs, a subclass of $2P_3$-free weakly chordal graphs. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05701","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.05701/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":"2307.05701","created_at":"2026-07-05T09:57:18.332714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.05701v2","created_at":"2026-07-05T09:57:18.332714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05701","created_at":"2026-07-05T09:57:18.332714+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFK4RVYAXGMN","created_at":"2026-07-05T09:57:18.332714+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFK4RVYAXGMNGXP3","created_at":"2026-07-05T09:57:18.332714+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFK4RVYA","created_at":"2026-07-05T09:57:18.332714+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/VFK4RVYAXGMNGXP3TRBYRLU4IW","json":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW.json","graph_json":"https://pith.science/api/pith-number/VFK4RVYAXGMNGXP3TRBYRLU4IW/graph.json","events_json":"https://pith.science/api/pith-number/VFK4RVYAXGMNGXP3TRBYRLU4IW/events.json","paper":"https://pith.science/paper/VFK4RVYA"},"agent_actions":{"view_html":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW","download_json":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW.json","view_paper":"https://pith.science/paper/VFK4RVYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.05701&json=true","fetch_graph":"https://pith.science/api/pith-number/VFK4RVYAXGMNGXP3TRBYRLU4IW/graph.json","fetch_events":"https://pith.science/api/pith-number/VFK4RVYAXGMNGXP3TRBYRLU4IW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/action/storage_attestation","attest_author":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/action/author_attestation","sign_citation":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/action/citation_signature","submit_replication":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/action/replication_record"}},"created_at":"2026-07-05T09:57:18.332714+00:00","updated_at":"2026-07-05T09:57:18.332714+00:00"}