{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VFK4RVYAXGMNGXP3TRBYRLU4IW","short_pith_number":"pith:VFK4RVYA","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"},"canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","source":{"kind":"arxiv","id":"2307.05701","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VFK4RVYAXGMNGXP3TRBYRLU4IW","target":"record","payload":{"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"},"canonical_sha256":"a955c8d700b998d35dfb9c4388ae9c4583564e691c893d241559e5dfb92b4bea","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"},"source_kind":"arxiv","source_id":"2307.05701","source_version":2,"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-05T09:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odHEKuxIJpTgupDP+6fxklpYB1VhZ9DS/bqTKJjCapc7unBhmSdvh2vrbCjlJRSKDyuXlVpFSSZIrIL8dUj0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T03:58:11.011403Z"},"content_sha256":"3a3022c009161c25eae0df5db3c16e35b51af8a53b15f74a416cc6757dbda733","schema_version":"1.0","event_id":"sha256:3a3022c009161c25eae0df5db3c16e35b51af8a53b15f74a416cc6757dbda733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VFK4RVYAXGMNGXP3TRBYRLU4IW","target":"graph","payload":{"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"},"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-05T09:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghTukWFkbVthIMwV6u2crzYTQHvZd+FTLkSxG4oBK5FIzddQ6KpAiYe52emg+9FoS1Hz+a/sn4U1fVPn0tmiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T03:58:11.011931Z"},"content_sha256":"d860b36d6ca2b43d5d16b95b45475c558a9d1b0c24654e3518cd74c117205c6e","schema_version":"1.0","event_id":"sha256:d860b36d6ca2b43d5d16b95b45475c558a9d1b0c24654e3518cd74c117205c6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/bundle.json","state_url":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/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-22T03:58:11Z","links":{"resolver":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW","bundle":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/bundle.json","state":"https://pith.science/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFK4RVYAXGMNGXP3TRBYRLU4IW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgMbsukkDTwcJtPhcQmlUZV76KWAK6/zU101QNkYO+JqCfvhJvOK8NzwsGx1xnfpS9/X7/KQON1FdzK3uVITCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T03:58:11.016932Z","bundle_sha256":"8fb5ed3428a6777ed86976e1687c5f220b5efa7d1c4455c42c4d59e8a025072d"}}