{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VFK4RVYAXGMNGXP3TRBYRLU4IW","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":"9c3dfd41efdea6af6194b3eef27b8fb14d9f661f611bc313b5aa2cd1f0e6abae","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-11T18:08:02Z","title_canon_sha256":"224d66d2e276361b01092aeb7b51bed27695668da26e4b6ad552e20318b43744"},"schema_version":"1.0","source":{"id":"2307.05701","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.05701","created_at":"2026-07-05T09:57:18Z"},{"alias_kind":"arxiv_version","alias_value":"2307.05701v2","created_at":"2026-07-05T09:57:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05701","created_at":"2026-07-05T09:57:18Z"},{"alias_kind":"pith_short_12","alias_value":"VFK4RVYAXGMN","created_at":"2026-07-05T09:57:18Z"},{"alias_kind":"pith_short_16","alias_value":"VFK4RVYAXGMNGXP3","created_at":"2026-07-05T09:57:18Z"},{"alias_kind":"pith_short_8","alias_value":"VFK4RVYA","created_at":"2026-07-05T09:57:18Z"}],"graph_snapshots":[{"event_id":"sha256:d860b36d6ca2b43d5d16b95b45475c558a9d1b0c24654e3518cd74c117205c6e","target":"graph","created_at":"2026-07-05T09:57:18Z","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/2307.05701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Jelle J. Oostveen, Johannes Rauch, Nick Brettell, Sukanya Pandey","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-11T18:08:02Z","title":"Computing Subset Vertex Covers in $H$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05701","kind":"arxiv","version":2},"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:3a3022c009161c25eae0df5db3c16e35b51af8a53b15f74a416cc6757dbda733","target":"record","created_at":"2026-07-05T09:57:18Z","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":"9c3dfd41efdea6af6194b3eef27b8fb14d9f661f611bc313b5aa2cd1f0e6abae","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-11T18:08:02Z","title_canon_sha256":"224d66d2e276361b01092aeb7b51bed27695668da26e4b6ad552e20318b43744"},"schema_version":"1.0","source":{"id":"2307.05701","kind":"arxiv","version":2}},"canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","first_computed_at":"2026-07-05T09:57:18.332649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:18.332649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aeN3VG2UH1oaGRPwUmjE+CVVu71vuaSD+/wa6T6+f7siqbJX7JuZiXvopcE5zKeGjs2LLG2x6HmIKspzex2FAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:18.333126Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.05701","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a3022c009161c25eae0df5db3c16e35b51af8a53b15f74a416cc6757dbda733","sha256:d860b36d6ca2b43d5d16b95b45475c558a9d1b0c24654e3518cd74c117205c6e"],"state_sha256":"6bb4febabd252c13a7baf64bcaf8eac6ed33dfedb9ee874a2309aca5dbc42176"}