{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HCEW4VPD3MPCYDPVQ4MQQ5FH6Z","short_pith_number":"pith:HCEW4VPD","schema_version":"1.0","canonical_sha256":"38896e55e3db1e2c0df587190874a7f64c8532d681431500679d2031893f65d5","source":{"kind":"arxiv","id":"1111.0570","version":1},"attestation_state":"computed","paper":{"title":"Clique cover and graph separation: New incompressibility results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Magnus Wahlstr\\\"om, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Stefan Kratsch","submitted_at":"2011-11-02T17:28:08Z","abstract_excerpt":"The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. Although a framework for proving kernelization lower bounds has been discovered in 2008 and successfully applied multiple times over the last three years, establishing kernelization complexity of many important problems remains open. In this paper we show that, unless NP is a subset of coNP/poly and the polynomial hierarchy collapses up to its third level, the following parameterized problems do not admit a polynomial-time preprocessing algorithm that reduce"},"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":"1111.0570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-02T17:28:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f99ee3c21ee653185f8c1baca02ebccc28718c7aa26eea525170572c1d618df6","abstract_canon_sha256":"19fa1fdc6ec9322bc2a30987ac1c9319af593ceb26a07085c55ac5cd26466cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:44.669640Z","signature_b64":"MBsgVArj0ek2l7uBgnq3Rj9kwR8MQyYpFjroX8BWZ9n7Eqi2ykx4LTVM8yHl/MyKwvMmAqKCaPV9Yxos6tEnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38896e55e3db1e2c0df587190874a7f64c8532d681431500679d2031893f65d5","last_reissued_at":"2026-05-18T04:09:44.669156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:44.669156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique cover and graph separation: New incompressibility results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Magnus Wahlstr\\\"om, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Stefan Kratsch","submitted_at":"2011-11-02T17:28:08Z","abstract_excerpt":"The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. Although a framework for proving kernelization lower bounds has been discovered in 2008 and successfully applied multiple times over the last three years, establishing kernelization complexity of many important problems remains open. In this paper we show that, unless NP is a subset of coNP/poly and the polynomial hierarchy collapses up to its third level, the following parameterized problems do not admit a polynomial-time preprocessing algorithm that reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0570","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.0570","created_at":"2026-05-18T04:09:44.669225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0570v1","created_at":"2026-05-18T04:09:44.669225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0570","created_at":"2026-05-18T04:09:44.669225+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCEW4VPD3MPC","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCEW4VPD3MPCYDPV","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCEW4VPD","created_at":"2026-05-18T12:26:30.835961+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/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z","json":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z.json","graph_json":"https://pith.science/api/pith-number/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/graph.json","events_json":"https://pith.science/api/pith-number/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/events.json","paper":"https://pith.science/paper/HCEW4VPD"},"agent_actions":{"view_html":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z","download_json":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z.json","view_paper":"https://pith.science/paper/HCEW4VPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0570&json=true","fetch_graph":"https://pith.science/api/pith-number/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/action/storage_attestation","attest_author":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/action/author_attestation","sign_citation":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/action/citation_signature","submit_replication":"https://pith.science/pith/HCEW4VPD3MPCYDPVQ4MQQ5FH6Z/action/replication_record"}},"created_at":"2026-05-18T04:09:44.669225+00:00","updated_at":"2026-05-18T04:09:44.669225+00:00"}