{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UIMWGLFYQL4W6SDDLJV5ISL6FD","short_pith_number":"pith:UIMWGLFY","canonical_record":{"source":{"id":"1203.0833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-05T09:00:23Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"35f803c7683d7658be7bf97adacf8823a7bbc4449d4697bca21acb399a7040a4","abstract_canon_sha256":"e973d567d0ad755b2f3bf99741efad38191d015e092b20357f460140903d7f5d"},"schema_version":"1.0"},"canonical_sha256":"a219632cb882f96f48635a6bd4497e28fcaac067c42cc2c68f25fe0b1f982272","source":{"kind":"arxiv","id":"1203.0833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0833","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0833v2","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0833","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"UIMWGLFYQL4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UIMWGLFYQL4W6SDD","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UIMWGLFY","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UIMWGLFYQL4W6SDDLJV5ISL6FD","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-05T09:00:23Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"35f803c7683d7658be7bf97adacf8823a7bbc4449d4697bca21acb399a7040a4","abstract_canon_sha256":"e973d567d0ad755b2f3bf99741efad38191d015e092b20357f460140903d7f5d"},"schema_version":"1.0"},"canonical_sha256":"a219632cb882f96f48635a6bd4497e28fcaac067c42cc2c68f25fe0b1f982272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:15.173993Z","signature_b64":"vM1wzpExwue89GxbFJqq6LwV2/o5qgL07Ytzbr4qGXJpfheqNe9MtbxWdfRkSCmacD2aCDCPfydwrtTiqMyRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a219632cb882f96f48635a6bd4497e28fcaac067c42cc2c68f25fe0b1f982272","last_reissued_at":"2026-05-18T04:00:15.173228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:15.173228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0833","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-18T04:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wbj9wrresS3opQRfPExtY87csMOJ0dZugN89N98IuDI/u20X2WVqU1DHyoUs+gdofiGA47JtI4JDAF/c50IkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:26:14.940519Z"},"content_sha256":"5561c50c318ca7e3e09368244f58753d1510b8c97fbd066c9373e549bf52e3c6","schema_version":"1.0","event_id":"sha256:5561c50c318ca7e3e09368244f58753d1510b8c97fbd066c9373e549bf52e3c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UIMWGLFYQL4W6SDDLJV5ISL6FD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Parameterized Algorithms using Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, N. S. Narayanaswamy, Saket Saurabh, Venkatesh Raman","submitted_at":"2012-03-05T09:00:23Z","abstract_excerpt":"We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxation of the problem. By carefully analyzing the change in the LP value in the branching steps, we argue that combining previously known preprocessing rules with the most straightforward branching algorithm yields an $O^*((2.618)^k)$ algorithm for the problem. Here $k$ is the excess of the vertex cover size over the LP optimum, and we write $O^*(f(k))$ for a time complexity of the form $O(f(k)n^{O(1)})$, where $f "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0833","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-18T04:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMj5K7ybOCaRFp7hM2IuRDJOcDmu9mILiJIvtvvtdKAwxLYW2XWj93eY9d7ZFBiTrnJF8Ep0KbMpSnO+OpeiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:26:14.941129Z"},"content_sha256":"f7e5eca9a13d7d861e8c96e6dcd663a0dfae071866dc5a0cb23ef23ded9f8225","schema_version":"1.0","event_id":"sha256:f7e5eca9a13d7d861e8c96e6dcd663a0dfae071866dc5a0cb23ef23ded9f8225"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/bundle.json","state_url":"https://pith.science/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/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-20T20:26:14Z","links":{"resolver":"https://pith.science/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD","bundle":"https://pith.science/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/bundle.json","state":"https://pith.science/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIMWGLFYQL4W6SDDLJV5ISL6FD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UIMWGLFYQL4W6SDDLJV5ISL6FD","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":"e973d567d0ad755b2f3bf99741efad38191d015e092b20357f460140903d7f5d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-05T09:00:23Z","title_canon_sha256":"35f803c7683d7658be7bf97adacf8823a7bbc4449d4697bca21acb399a7040a4"},"schema_version":"1.0","source":{"id":"1203.0833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0833","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0833v2","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0833","created_at":"2026-05-18T04:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"UIMWGLFYQL4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UIMWGLFYQL4W6SDD","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UIMWGLFY","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:f7e5eca9a13d7d861e8c96e6dcd663a0dfae071866dc5a0cb23ef23ded9f8225","target":"graph","created_at":"2026-05-18T04:00:15Z","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 investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxation of the problem. By carefully analyzing the change in the LP value in the branching steps, we argue that combining previously known preprocessing rules with the most straightforward branching algorithm yields an $O^*((2.618)^k)$ algorithm for the problem. Here $k$ is the excess of the vertex cover size over the LP optimum, and we write $O^*(f(k))$ for a time complexity of the form $O(f(k)n^{O(1)})$, where $f ","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, N. S. Narayanaswamy, Saket Saurabh, Venkatesh Raman","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-05T09:00:23Z","title":"Faster Parameterized Algorithms using Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0833","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:5561c50c318ca7e3e09368244f58753d1510b8c97fbd066c9373e549bf52e3c6","target":"record","created_at":"2026-05-18T04:00:15Z","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":"e973d567d0ad755b2f3bf99741efad38191d015e092b20357f460140903d7f5d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-05T09:00:23Z","title_canon_sha256":"35f803c7683d7658be7bf97adacf8823a7bbc4449d4697bca21acb399a7040a4"},"schema_version":"1.0","source":{"id":"1203.0833","kind":"arxiv","version":2}},"canonical_sha256":"a219632cb882f96f48635a6bd4497e28fcaac067c42cc2c68f25fe0b1f982272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a219632cb882f96f48635a6bd4497e28fcaac067c42cc2c68f25fe0b1f982272","first_computed_at":"2026-05-18T04:00:15.173228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:15.173228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vM1wzpExwue89GxbFJqq6LwV2/o5qgL07Ytzbr4qGXJpfheqNe9MtbxWdfRkSCmacD2aCDCPfydwrtTiqMyRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:15.173993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5561c50c318ca7e3e09368244f58753d1510b8c97fbd066c9373e549bf52e3c6","sha256:f7e5eca9a13d7d861e8c96e6dcd663a0dfae071866dc5a0cb23ef23ded9f8225"],"state_sha256":"abb234ffc20d68a1b10b4c164e78615c1094cd7a5d29d70570671ccc714499cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMOi0NOQ3Jp315jcjt6u0xnNYundeQsrDRvz+nluaSoYXpKQePG8QU3r1RMZFMBiWmPE7n5PbD2eUWEnnmjWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:26:14.945280Z","bundle_sha256":"135e8442dd2c89b5be1af8f170919dc177f7c0b32f0783db94075fc30da80e71"}}