{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2PVVCCELGY2WQBRLUR4UGXNAK3","short_pith_number":"pith:2PVVCCEL","canonical_record":{"source":{"id":"1202.6642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T18:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"1c00435113d0d72f42333d38842c19e2259da1efebd676249097098b23cc10cd","abstract_canon_sha256":"ec3fc0afa0a25126f4917e9593aafd7ac66d4083bba2b4422e0789fa32307ac6"},"schema_version":"1.0"},"canonical_sha256":"d3eb51088b363568062ba479435da056d2f08e9c5283e5897453e3317535e664","source":{"kind":"arxiv","id":"1202.6642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6642","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6642v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6642","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"2PVVCCELGY2W","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PVVCCELGY2WQBRL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PVVCCEL","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2PVVCCELGY2WQBRLUR4UGXNAK3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T18:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"1c00435113d0d72f42333d38842c19e2259da1efebd676249097098b23cc10cd","abstract_canon_sha256":"ec3fc0afa0a25126f4917e9593aafd7ac66d4083bba2b4422e0789fa32307ac6"},"schema_version":"1.0"},"canonical_sha256":"d3eb51088b363568062ba479435da056d2f08e9c5283e5897453e3317535e664","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.007239Z","signature_b64":"TYpVJTqk1GX8/oBPmslmPDyAdGzPj1Jz7j+j86wKML9U9fv6OT28TeWBB2qPwRwwyiQkVNFftMg5PFsFJextDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3eb51088b363568062ba479435da056d2f08e9c5283e5897453e3317535e664","last_reissued_at":"2026-05-18T04:01:12.006738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.006738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6642","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:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eov+6hlvszBa54c++J8vN2BrM+9njrtgdQFnMDRCi6YnzbU9vKYC4wQ9JgqeQPd+xfDaIzfY1/2Qv56beNQTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:26:49.705176Z"},"content_sha256":"955546e1d565d6c8fff4d23a1ef28b4415d0de1c6f6d77df54fd6248843f1afb","schema_version":"1.0","event_id":"sha256:955546e1d565d6c8fff4d23a1ef28b4415d0de1c6f6d77df54fd6248843f1afb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2PVVCCELGY2WQBRLUR4UGXNAK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic parameterized connected vertex cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan","submitted_at":"2012-02-29T18:48:21Z","abstract_excerpt":"In the Connected Vertex Cover problem we are given an undirected graph G together with an integer k and we are to find a subset of vertices X of size at most k, such that X contains at least one end-point of each edge and moreover X induces a connected subgraph. For this problem we present a deterministic algorithm running in O(2^k n^O(1)) time and polynomial space, improving over previously best O(2.4882^k n^O(1)) deterministic algorithm and O(2^k n^O(1)) randomized algorithm. Furthermore, when usage of exponential space is allowed, we present an O(2^k k(n+m)) time algorithm that solves a mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6642","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:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kH60/uewG14MS5Jz38ZMlzh/lTeMiCzc5FEEFDf/RhRXi40mMS9O/uYVmW8XEKhvC0monuLff7IhbfawUU1yCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:26:49.705844Z"},"content_sha256":"bfff536c9538296522310f0dad6c8a63e133231a6bc1652638e16db0e1418336","schema_version":"1.0","event_id":"sha256:bfff536c9538296522310f0dad6c8a63e133231a6bc1652638e16db0e1418336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/bundle.json","state_url":"https://pith.science/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/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-26T20:26:49Z","links":{"resolver":"https://pith.science/pith/2PVVCCELGY2WQBRLUR4UGXNAK3","bundle":"https://pith.science/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/bundle.json","state":"https://pith.science/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PVVCCELGY2WQBRLUR4UGXNAK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2PVVCCELGY2WQBRLUR4UGXNAK3","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":"ec3fc0afa0a25126f4917e9593aafd7ac66d4083bba2b4422e0789fa32307ac6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T18:48:21Z","title_canon_sha256":"1c00435113d0d72f42333d38842c19e2259da1efebd676249097098b23cc10cd"},"schema_version":"1.0","source":{"id":"1202.6642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6642","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6642v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6642","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"2PVVCCELGY2W","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PVVCCELGY2WQBRL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PVVCCEL","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:bfff536c9538296522310f0dad6c8a63e133231a6bc1652638e16db0e1418336","target":"graph","created_at":"2026-05-18T04:01:12Z","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 Connected Vertex Cover problem we are given an undirected graph G together with an integer k and we are to find a subset of vertices X of size at most k, such that X contains at least one end-point of each edge and moreover X induces a connected subgraph. For this problem we present a deterministic algorithm running in O(2^k n^O(1)) time and polynomial space, improving over previously best O(2.4882^k n^O(1)) deterministic algorithm and O(2^k n^O(1)) randomized algorithm. Furthermore, when usage of exponential space is allowed, we present an O(2^k k(n+m)) time algorithm that solves a mor","authors_text":"Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T18:48:21Z","title":"Deterministic parameterized connected vertex cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6642","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:955546e1d565d6c8fff4d23a1ef28b4415d0de1c6f6d77df54fd6248843f1afb","target":"record","created_at":"2026-05-18T04:01:12Z","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":"ec3fc0afa0a25126f4917e9593aafd7ac66d4083bba2b4422e0789fa32307ac6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T18:48:21Z","title_canon_sha256":"1c00435113d0d72f42333d38842c19e2259da1efebd676249097098b23cc10cd"},"schema_version":"1.0","source":{"id":"1202.6642","kind":"arxiv","version":1}},"canonical_sha256":"d3eb51088b363568062ba479435da056d2f08e9c5283e5897453e3317535e664","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3eb51088b363568062ba479435da056d2f08e9c5283e5897453e3317535e664","first_computed_at":"2026-05-18T04:01:12.006738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:12.006738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYpVJTqk1GX8/oBPmslmPDyAdGzPj1Jz7j+j86wKML9U9fv6OT28TeWBB2qPwRwwyiQkVNFftMg5PFsFJextDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:12.007239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:955546e1d565d6c8fff4d23a1ef28b4415d0de1c6f6d77df54fd6248843f1afb","sha256:bfff536c9538296522310f0dad6c8a63e133231a6bc1652638e16db0e1418336"],"state_sha256":"021df4e9bd204e769b502af323838b181b642000ef79dd0a8f79b6f2b96c3321"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgZZQxq+LiVNYq1Jas3fC/s9EqTSswGxUQyZCFsA3Ln7ykbUgVo8h1N0IW4by6T2Bl/hoNVYwOxFQDWY+BLYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:26:49.709210Z","bundle_sha256":"4449b98421db490e47a1c4fd5fbc4474c998eb53223d29af6168c591f5ca10c4"}}