{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3CMWD645OPRVSGA5JJN6KW5NIQ","short_pith_number":"pith:3CMWD645","canonical_record":{"source":{"id":"1208.1248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T19:23:26Z","cross_cats_sorted":[],"title_canon_sha256":"1cf8461601d2b0333b0ff1f17f8a6645299ab33613c91f8626a9050d43a8667b","abstract_canon_sha256":"f5fff37beec9b4fc4360b3af0d416884ec02eaab5eaf608c5890b8dbb5bf129e"},"schema_version":"1.0"},"canonical_sha256":"d89961fb9d73e359181d4a5be55bad4421f05293acc37cae3b104606b76147e5","source":{"kind":"arxiv","id":"1208.1248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1248","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1248v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1248","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"3CMWD645OPRV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3CMWD645OPRVSGA5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3CMWD645","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3CMWD645OPRVSGA5JJN6KW5NIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T19:23:26Z","cross_cats_sorted":[],"title_canon_sha256":"1cf8461601d2b0333b0ff1f17f8a6645299ab33613c91f8626a9050d43a8667b","abstract_canon_sha256":"f5fff37beec9b4fc4360b3af0d416884ec02eaab5eaf608c5890b8dbb5bf129e"},"schema_version":"1.0"},"canonical_sha256":"d89961fb9d73e359181d4a5be55bad4421f05293acc37cae3b104606b76147e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.222015Z","signature_b64":"VFP8oU6nVYIDI1KjbKYcbhiTQAnpfggUDeIAAOM6KokDIZyHMCuvRQOEVSwlIQLzICinmBQ1Ik4+5vVovTsYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d89961fb9d73e359181d4a5be55bad4421f05293acc37cae3b104606b76147e5","last_reissued_at":"2026-05-18T03:49:20.221286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.221286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1248","source_version":1,"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-18T03:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sOcrfZXEGD6O8AOiH6MtD8fHO9N5EiDRjMzHquE2MsU11X+VN6aTKzDVNxS1569VRVAcpLuK02k7uMmBlK3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:26:58.795652Z"},"content_sha256":"1139f88f10d45d9aae30ab4a4938d4074f8f20e389056ca961ab9143ef668407","schema_version":"1.0","event_id":"sha256:1139f88f10d45d9aae30ab4a4938d4074f8f20e389056ca961ab9143ef668407"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3CMWD645OPRVSGA5JJN6KW5NIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On fixed-parameter algorithms for Split Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan","submitted_at":"2012-08-06T19:23:26Z","abstract_excerpt":"In the Split Vertex Deletion problem, given a graph G and an integer k, we ask whether one can delete k vertices from the graph G to obtain a split graph (i.e., a graph, whose vertex set can be partitioned into two sets: one inducing a clique and the second one inducing an independent set). In this paper we study fixed-parameter algorithms for Split Vertex Deletion parameterized by k: we show that, up to a factor quasipolynomial in k and polynomial in n, the Split Vertex Deletion problem can be solved in the same time as the well-studied Vertex Cover problem. Plugging the currently best fixed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1248","kind":"arxiv","version":1},"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-18T03:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCzNKw87rfIctPePFVkF/8U5k9v5SCy8+tOcUvRZb4n5dEQb12ZWy5ZGU0tWDRzEbJOWlf8RdoijVc8uKCJ7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:26:58.796287Z"},"content_sha256":"9bbfcfa5245d6d8d45dc1f310069c4597f4698f3281461241c919de8ef4cba96","schema_version":"1.0","event_id":"sha256:9bbfcfa5245d6d8d45dc1f310069c4597f4698f3281461241c919de8ef4cba96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/bundle.json","state_url":"https://pith.science/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/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-05-31T08:26:58Z","links":{"resolver":"https://pith.science/pith/3CMWD645OPRVSGA5JJN6KW5NIQ","bundle":"https://pith.science/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/bundle.json","state":"https://pith.science/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CMWD645OPRVSGA5JJN6KW5NIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3CMWD645OPRVSGA5JJN6KW5NIQ","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":"f5fff37beec9b4fc4360b3af0d416884ec02eaab5eaf608c5890b8dbb5bf129e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T19:23:26Z","title_canon_sha256":"1cf8461601d2b0333b0ff1f17f8a6645299ab33613c91f8626a9050d43a8667b"},"schema_version":"1.0","source":{"id":"1208.1248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1248","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1248v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1248","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"3CMWD645OPRV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3CMWD645OPRVSGA5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3CMWD645","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:9bbfcfa5245d6d8d45dc1f310069c4597f4698f3281461241c919de8ef4cba96","target":"graph","created_at":"2026-05-18T03:49:20Z","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":"In the Split Vertex Deletion problem, given a graph G and an integer k, we ask whether one can delete k vertices from the graph G to obtain a split graph (i.e., a graph, whose vertex set can be partitioned into two sets: one inducing a clique and the second one inducing an independent set). In this paper we study fixed-parameter algorithms for Split Vertex Deletion parameterized by k: we show that, up to a factor quasipolynomial in k and polynomial in n, the Split Vertex Deletion problem can be solved in the same time as the well-studied Vertex Cover problem. Plugging the currently best fixed-","authors_text":"Marcin Pilipczuk, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T19:23:26Z","title":"On fixed-parameter algorithms for Split Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1248","kind":"arxiv","version":1},"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:1139f88f10d45d9aae30ab4a4938d4074f8f20e389056ca961ab9143ef668407","target":"record","created_at":"2026-05-18T03:49:20Z","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":"f5fff37beec9b4fc4360b3af0d416884ec02eaab5eaf608c5890b8dbb5bf129e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T19:23:26Z","title_canon_sha256":"1cf8461601d2b0333b0ff1f17f8a6645299ab33613c91f8626a9050d43a8667b"},"schema_version":"1.0","source":{"id":"1208.1248","kind":"arxiv","version":1}},"canonical_sha256":"d89961fb9d73e359181d4a5be55bad4421f05293acc37cae3b104606b76147e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d89961fb9d73e359181d4a5be55bad4421f05293acc37cae3b104606b76147e5","first_computed_at":"2026-05-18T03:49:20.221286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.221286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VFP8oU6nVYIDI1KjbKYcbhiTQAnpfggUDeIAAOM6KokDIZyHMCuvRQOEVSwlIQLzICinmBQ1Ik4+5vVovTsYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.222015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1139f88f10d45d9aae30ab4a4938d4074f8f20e389056ca961ab9143ef668407","sha256:9bbfcfa5245d6d8d45dc1f310069c4597f4698f3281461241c919de8ef4cba96"],"state_sha256":"6d94f17b5d0f4350cae33efa79e918b452ea5d9977f9b332b800c42b80eae602"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dmh3PmDY8n+FtgwBIyG2kK6DQnMUJ97o8L+QQghOGk8eXGeTL7q3wl85eATACn5hEereHiDuXV/upDHJ8mAWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:26:58.799947Z","bundle_sha256":"b47c93d774af32fdd0ac4d24e07034c239e077f18ccbbc4c9445d8ab3bad85d5"}}