{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MO57QF6ODIZBJFB6X2BTHCQU5A","short_pith_number":"pith:MO57QF6O","canonical_record":{"source":{"id":"1810.04629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T16:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"b0b0427f0951fe772dd8ff90b60223b2b875c944ed08681bc5b105fddbc63a60","abstract_canon_sha256":"8e4cf2c7e62b56e6e5c3c669ecc65221a09b6b0f8698850efe695f9dcf935fa1"},"schema_version":"1.0"},"canonical_sha256":"63bbf817ce1a3214943ebe83338a14e80481ed7b93f8d5816872e2b02eba4d92","source":{"kind":"arxiv","id":"1810.04629","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04629","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04629v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04629","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"MO57QF6ODIZB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MO57QF6ODIZBJFB6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MO57QF6O","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MO57QF6ODIZBJFB6X2BTHCQU5A","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T16:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"b0b0427f0951fe772dd8ff90b60223b2b875c944ed08681bc5b105fddbc63a60","abstract_canon_sha256":"8e4cf2c7e62b56e6e5c3c669ecc65221a09b6b0f8698850efe695f9dcf935fa1"},"schema_version":"1.0"},"canonical_sha256":"63bbf817ce1a3214943ebe83338a14e80481ed7b93f8d5816872e2b02eba4d92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.221897Z","signature_b64":"hWrwZLcy7garCj2Xx95tiZRI5ef+ADhE3PmPKWYXIoPQJPNnAK0hFFmoiA00phTMN3jXz0FjjntkgCnQF6dOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63bbf817ce1a3214943ebe83338a14e80481ed7b93f8d5816872e2b02eba4d92","last_reissued_at":"2026-05-18T00:03:36.221264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.221264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04629","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-05-18T00:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7ebQVvmpS4Eocn62Ky3a0YMJKQ9NNKGjYRY6FKI3e+kxAaRThtfpephoTmV6P9MX/mWqdNFjaUnoxYwmCqtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:37:54.685341Z"},"content_sha256":"45be484605538c86573f0e45b0f418de9ac902a84c1ae22d913a55a0f31aaf9b","schema_version":"1.0","event_id":"sha256:45be484605538c86573f0e45b0f418de9ac902a84c1ae22d913a55a0f31aaf9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MO57QF6ODIZBJFB6X2BTHCQU5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extension of vertex cover and independent set in some classes of graphs and generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florian Sikora, Henning Fernau, J\\'er\\^ome Monnot, Katrin Casel, Mehdi Khosravian Ghadikolaei","submitted_at":"2018-10-10T16:40:26Z","abstract_excerpt":"We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \\subseteq V$, it is asked if there exists a minimal vertex cover (resp.\\ maximal independent set) $S$ with $U\\subseteq S$ (resp.\\ $U \\supseteq S$). Possibly contradicting intuition, these problems tend to be NP-hard, even in graph classes where the classical problem can be solved in polynomial time. Yet, we exhibit some graph classes where the extension variant remains polynomial-time solvable. We also study the parameterized complexity of these problems,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04629","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":""},"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-05-18T00:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYY85vp3gIRI5jiYIqp9dR8FYNZyJSyP3PSRlbbJ4tYrEKcHWpFzdTmuUftPhOc8hQexa32pPY8nVH08Z2O3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:37:54.685971Z"},"content_sha256":"6eeea2ce850256daa4a1993c5199d89ddd69ee0437f832cb148693773cf09e63","schema_version":"1.0","event_id":"sha256:6eeea2ce850256daa4a1993c5199d89ddd69ee0437f832cb148693773cf09e63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/bundle.json","state_url":"https://pith.science/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/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-06-08T10:37:54Z","links":{"resolver":"https://pith.science/pith/MO57QF6ODIZBJFB6X2BTHCQU5A","bundle":"https://pith.science/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/bundle.json","state":"https://pith.science/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MO57QF6ODIZBJFB6X2BTHCQU5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MO57QF6ODIZBJFB6X2BTHCQU5A","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":"8e4cf2c7e62b56e6e5c3c669ecc65221a09b6b0f8698850efe695f9dcf935fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T16:40:26Z","title_canon_sha256":"b0b0427f0951fe772dd8ff90b60223b2b875c944ed08681bc5b105fddbc63a60"},"schema_version":"1.0","source":{"id":"1810.04629","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04629","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04629v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04629","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"MO57QF6ODIZB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MO57QF6ODIZBJFB6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MO57QF6O","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:6eeea2ce850256daa4a1993c5199d89ddd69ee0437f832cb148693773cf09e63","target":"graph","created_at":"2026-05-18T00:03:36Z","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"},"paper":{"abstract_excerpt":"We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \\subseteq V$, it is asked if there exists a minimal vertex cover (resp.\\ maximal independent set) $S$ with $U\\subseteq S$ (resp.\\ $U \\supseteq S$). Possibly contradicting intuition, these problems tend to be NP-hard, even in graph classes where the classical problem can be solved in polynomial time. Yet, we exhibit some graph classes where the extension variant remains polynomial-time solvable. We also study the parameterized complexity of these problems,","authors_text":"Florian Sikora, Henning Fernau, J\\'er\\^ome Monnot, Katrin Casel, Mehdi Khosravian Ghadikolaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T16:40:26Z","title":"Extension of vertex cover and independent set in some classes of graphs and generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04629","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:45be484605538c86573f0e45b0f418de9ac902a84c1ae22d913a55a0f31aaf9b","target":"record","created_at":"2026-05-18T00:03:36Z","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":"8e4cf2c7e62b56e6e5c3c669ecc65221a09b6b0f8698850efe695f9dcf935fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-10T16:40:26Z","title_canon_sha256":"b0b0427f0951fe772dd8ff90b60223b2b875c944ed08681bc5b105fddbc63a60"},"schema_version":"1.0","source":{"id":"1810.04629","kind":"arxiv","version":2}},"canonical_sha256":"63bbf817ce1a3214943ebe83338a14e80481ed7b93f8d5816872e2b02eba4d92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63bbf817ce1a3214943ebe83338a14e80481ed7b93f8d5816872e2b02eba4d92","first_computed_at":"2026-05-18T00:03:36.221264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.221264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWrwZLcy7garCj2Xx95tiZRI5ef+ADhE3PmPKWYXIoPQJPNnAK0hFFmoiA00phTMN3jXz0FjjntkgCnQF6dOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.221897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04629","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45be484605538c86573f0e45b0f418de9ac902a84c1ae22d913a55a0f31aaf9b","sha256:6eeea2ce850256daa4a1993c5199d89ddd69ee0437f832cb148693773cf09e63"],"state_sha256":"71db6f30c7bbe2b43c837277e14f29382f783c2e92d68dad84ddd77e008d7fb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGxuktEzoL/Cb953SDsFcfdq2PuGyL7YTZNJg8rzUi4yKx0W3YfS05ecu+RUVPdLgT0pNpfsCTEzw51mKP1dAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:37:54.689162Z","bundle_sha256":"1fee7d3949eba4a059c2e6992bf1de9f3bde356c036e91ee7fa6356f0a3ae281"}}