{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RB53BPQ7EXWAM75V4KQQ6GHDUY","short_pith_number":"pith:RB53BPQ7","schema_version":"1.0","canonical_sha256":"887bb0be1f25ec067fb5e2a10f18e3a61fed49f8ed77c03f1430b2a249ee3570","source":{"kind":"arxiv","id":"1705.02822","version":2},"attestation_state":"computed","paper":{"title":"Rank Vertex Cover as a Natural Problem for Algebraic Compression","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Meirav Zehavi, Saket Saurabh, Syed Mohammad Meesum","submitted_at":"2017-05-08T10:56:28Z","abstract_excerpt":"The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on representative sets has finally answered this question in the affirmative [FOCS 2012]. In this paper, we present an alternative, algebraic compression of the Vertex Cover Above LP problem into the Rank Vertex Cover problem. Here, the input consists of a graph G, a parameter k, and a bijection between V (G) and the set of columns of a representation of a matr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.02822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T10:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"62154846e329f2f5de14d0ab6dd49a51da77ed25dfe20f17ca2a2cbc63803ade","abstract_canon_sha256":"4d23d2a4d3b77b584fb80794f3951181629baaff7a46c868da4fde88a2fbf2a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.844489Z","signature_b64":"lSJERX5JM9c24Tt8146Mxx8kbcjryTbGV7JVyRJED5nIe7xnimneTaGbV6wdnzXD4YwysDwofYXeLQiAQ7pEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"887bb0be1f25ec067fb5e2a10f18e3a61fed49f8ed77c03f1430b2a249ee3570","last_reissued_at":"2026-05-18T00:44:43.843852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.843852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank Vertex Cover as a Natural Problem for Algebraic Compression","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Meirav Zehavi, Saket Saurabh, Syed Mohammad Meesum","submitted_at":"2017-05-08T10:56:28Z","abstract_excerpt":"The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on representative sets has finally answered this question in the affirmative [FOCS 2012]. In this paper, we present an alternative, algebraic compression of the Vertex Cover Above LP problem into the Rank Vertex Cover problem. Here, the input consists of a graph G, a parameter k, and a bijection between V (G) and the set of columns of a representation of a matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02822","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02822","created_at":"2026-05-18T00:44:43.843959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02822v2","created_at":"2026-05-18T00:44:43.843959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02822","created_at":"2026-05-18T00:44:43.843959+00:00"},{"alias_kind":"pith_short_12","alias_value":"RB53BPQ7EXWA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RB53BPQ7EXWAM75V","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RB53BPQ7","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY","json":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY.json","graph_json":"https://pith.science/api/pith-number/RB53BPQ7EXWAM75V4KQQ6GHDUY/graph.json","events_json":"https://pith.science/api/pith-number/RB53BPQ7EXWAM75V4KQQ6GHDUY/events.json","paper":"https://pith.science/paper/RB53BPQ7"},"agent_actions":{"view_html":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY","download_json":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY.json","view_paper":"https://pith.science/paper/RB53BPQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02822&json=true","fetch_graph":"https://pith.science/api/pith-number/RB53BPQ7EXWAM75V4KQQ6GHDUY/graph.json","fetch_events":"https://pith.science/api/pith-number/RB53BPQ7EXWAM75V4KQQ6GHDUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY/action/storage_attestation","attest_author":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY/action/author_attestation","sign_citation":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY/action/citation_signature","submit_replication":"https://pith.science/pith/RB53BPQ7EXWAM75V4KQQ6GHDUY/action/replication_record"}},"created_at":"2026-05-18T00:44:43.843959+00:00","updated_at":"2026-05-18T00:44:43.843959+00:00"}