{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L5GDHFE7G53GNKYMM2PBGHWJOR","short_pith_number":"pith:L5GDHFE7","canonical_record":{"source":{"id":"1110.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"df8357ca9e8fedc5db6e30a93c4f035c7be1d29ff9f9eb6bf777fd47c86d8d7f","abstract_canon_sha256":"292443902a35910ecb028f1bc496f3aff7c8651c817df70068e9eb15b746b575"},"schema_version":"1.0"},"canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","source":{"kind":"arxiv","id":"1110.1964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1964","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1964v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1964","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"L5GDHFE7G53G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L5GDHFE7G53GNKYM","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L5GDHFE7","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L5GDHFE7G53GNKYMM2PBGHWJOR","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"df8357ca9e8fedc5db6e30a93c4f035c7be1d29ff9f9eb6bf777fd47c86d8d7f","abstract_canon_sha256":"292443902a35910ecb028f1bc496f3aff7c8651c817df70068e9eb15b746b575"},"schema_version":"1.0"},"canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.227501Z","signature_b64":"HiPdPXoOqHKUpS3oNAQJQoa2ws3YPFkr9swH0FNMBghI1u3+IHNIJtwbS/u+byRXJSJxEiEHUs739GdXFe9DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","last_reissued_at":"2026-05-18T04:11:19.226998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.226998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1964","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-18T04:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuDkJnQebKsfAkHDr8kG3/x+2hE3U2R+LPzOSiBwPtzDpMHUxdo842BqMpci6w4FehCP8mpKFb4dfjKeRiO1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:03:48.607832Z"},"content_sha256":"46fec1bade9fb87037df486d1221e05c4386c7b7f04c2043ea8c558fec65befb","schema_version":"1.0","event_id":"sha256:46fec1bade9fb87037df486d1221e05c4386c7b7f04c2043ea8c558fec65befb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L5GDHFE7G53GNKYMM2PBGHWJOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards optimal kernel for connected vertex cover in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Karol Suchan, Lukasz Kowalik, Marcin Pilipczuk","submitted_at":"2011-10-10T09:06:27Z","abstract_excerpt":"We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of coNP/poly), for planar graphs Guo and Niedermeier [ICALP'08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS'11] to 4k. The constant 4 here is so small that a natural question arises: could it be already an optimal value for this problem? In this paper we answer this quesion in negative: we show a (11/3)k-ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1964","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-18T04:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlJYlHJc0JRgyrMISoZSdnyl3tS9okyps1lJbwcu5E2Sn2Z3/KFv81ilpL6c1VFbUtGAFFGHHEHAF7mLdcRFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:03:48.608543Z"},"content_sha256":"04fa586a2af3fd9fc2850fd06b6e172eb5e8bce40527977be4b33cc2186fa258","schema_version":"1.0","event_id":"sha256:04fa586a2af3fd9fc2850fd06b6e172eb5e8bce40527977be4b33cc2186fa258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/bundle.json","state_url":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/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-27T08:03:48Z","links":{"resolver":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR","bundle":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/bundle.json","state":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L5GDHFE7G53GNKYMM2PBGHWJOR","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":"292443902a35910ecb028f1bc496f3aff7c8651c817df70068e9eb15b746b575","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","title_canon_sha256":"df8357ca9e8fedc5db6e30a93c4f035c7be1d29ff9f9eb6bf777fd47c86d8d7f"},"schema_version":"1.0","source":{"id":"1110.1964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1964","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1964v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1964","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"L5GDHFE7G53G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L5GDHFE7G53GNKYM","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L5GDHFE7","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:04fa586a2af3fd9fc2850fd06b6e172eb5e8bce40527977be4b33cc2186fa258","target":"graph","created_at":"2026-05-18T04:11:19Z","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 study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of coNP/poly), for planar graphs Guo and Niedermeier [ICALP'08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS'11] to 4k. The constant 4 here is so small that a natural question arises: could it be already an optimal value for this problem? In this paper we answer this quesion in negative: we show a (11/3)k-ve","authors_text":"Karol Suchan, Lukasz Kowalik, Marcin Pilipczuk","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","title":"Towards optimal kernel for connected vertex cover in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1964","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:46fec1bade9fb87037df486d1221e05c4386c7b7f04c2043ea8c558fec65befb","target":"record","created_at":"2026-05-18T04:11:19Z","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":"292443902a35910ecb028f1bc496f3aff7c8651c817df70068e9eb15b746b575","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","title_canon_sha256":"df8357ca9e8fedc5db6e30a93c4f035c7be1d29ff9f9eb6bf777fd47c86d8d7f"},"schema_version":"1.0","source":{"id":"1110.1964","kind":"arxiv","version":1}},"canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","first_computed_at":"2026-05-18T04:11:19.226998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:19.226998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HiPdPXoOqHKUpS3oNAQJQoa2ws3YPFkr9swH0FNMBghI1u3+IHNIJtwbS/u+byRXJSJxEiEHUs739GdXFe9DDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:19.227501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46fec1bade9fb87037df486d1221e05c4386c7b7f04c2043ea8c558fec65befb","sha256:04fa586a2af3fd9fc2850fd06b6e172eb5e8bce40527977be4b33cc2186fa258"],"state_sha256":"72df7830ef0d65d5fd09729aeba5e05ce5e0b167c65f83f2bace7511c9ef67f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDxLsSEIPAJGDcnYAIsSOkuB/CvGI8ctuMGZxJKh2redgUihRDhZwqtyBWTK1SQNl2ZZu/swPcymHirw5Ui6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:03:48.612353Z","bundle_sha256":"83c9e41bef25aac88b6a441ae7f4c02b0f605eaecfad3775b27083b15ca51a1e"}}