{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MRZ5KAJFKISHCRPILMYAUJOWVR","short_pith_number":"pith:MRZ5KAJF","schema_version":"1.0","canonical_sha256":"6473d5012552247145e85b300a25d6ac7588a32ce5c0dcc32aefb4e0e10467c2","source":{"kind":"arxiv","id":"1207.4900","version":1},"attestation_state":"computed","paper":{"title":"Kernel Bounds for Structural Parameterizations of Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2012-07-20T10:09:36Z","abstract_excerpt":"Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for Pathwidth with respect to other, structural, parameters. Our main result is that, unless NP is in coNP/poly, Pathwidth admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition from Cutwidth. The cross-composition works also for Treewidth, improving over previous lower bounds b"},"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":"1207.4900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-20T10:09:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d58c2455b59aee7422c9a7a8bc479e5c9ee17396c8089ee99e430c8ff5f54747","abstract_canon_sha256":"40a35ef87a80dd07923f9e66c6cd84295cfeb8969bb6abb0099b7cb683486017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.124127Z","signature_b64":"Wta7mJcFRgvahO8LPHJYW/2WGu54nStN9gkGFT6ep5Ndp8LZQlMn46HG1PnkyXOxwBW3xfdmanewguSD0fn4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6473d5012552247145e85b300a25d6ac7588a32ce5c0dcc32aefb4e0e10467c2","last_reissued_at":"2026-05-18T02:21:08.123554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.123554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernel Bounds for Structural Parameterizations of Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2012-07-20T10:09:36Z","abstract_excerpt":"Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for Pathwidth with respect to other, structural, parameters. Our main result is that, unless NP is in coNP/poly, Pathwidth admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition from Cutwidth. The cross-composition works also for Treewidth, improving over previous lower bounds b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4900","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":"1207.4900","created_at":"2026-05-18T02:21:08.123644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4900v1","created_at":"2026-05-18T02:21:08.123644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4900","created_at":"2026-05-18T02:21:08.123644+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRZ5KAJFKISH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRZ5KAJFKISHCRPI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRZ5KAJF","created_at":"2026-05-18T12:27:14.488303+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/MRZ5KAJFKISHCRPILMYAUJOWVR","json":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR.json","graph_json":"https://pith.science/api/pith-number/MRZ5KAJFKISHCRPILMYAUJOWVR/graph.json","events_json":"https://pith.science/api/pith-number/MRZ5KAJFKISHCRPILMYAUJOWVR/events.json","paper":"https://pith.science/paper/MRZ5KAJF"},"agent_actions":{"view_html":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR","download_json":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR.json","view_paper":"https://pith.science/paper/MRZ5KAJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4900&json=true","fetch_graph":"https://pith.science/api/pith-number/MRZ5KAJFKISHCRPILMYAUJOWVR/graph.json","fetch_events":"https://pith.science/api/pith-number/MRZ5KAJFKISHCRPILMYAUJOWVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR/action/storage_attestation","attest_author":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR/action/author_attestation","sign_citation":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR/action/citation_signature","submit_replication":"https://pith.science/pith/MRZ5KAJFKISHCRPILMYAUJOWVR/action/replication_record"}},"created_at":"2026-05-18T02:21:08.123644+00:00","updated_at":"2026-05-18T02:21:08.123644+00:00"}