{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZA2TLPR6DFIU6XPHZ2TSZKKYWY","short_pith_number":"pith:ZA2TLPR6","schema_version":"1.0","canonical_sha256":"c83535be3e19514f5de7cea72ca958b616cdfd49ba22ffe3a0bb09efc0ad44af","source":{"kind":"arxiv","id":"1011.4224","version":2},"attestation_state":"computed","paper":{"title":"Cross-Composition: A New Technique for Kernelization Lower Bounds","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2010-11-18T16:30:44Z","abstract_excerpt":"We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with polynomially bounded parameter value can express the logical OR of a sequence of instances of L. Building on work by Bodlaender et al. (ICALP 2008) and using a result by Fortnow and Santhanam (STOC 2008) we show that if an NP-complete problem cross-composes into a parameterized problem Q then Q does not admit a polynomial kernel unless the polynomial hierarchy collapses. Our technique generalizes and strength"},"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":"1011.4224","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-11-18T16:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"d0a4dea0953c34bd96d26a346247ba16935271d83da0e8fd4331eb4c736b46be","abstract_canon_sha256":"3e3e196d94af97f868c8b0c61aa2c5f3df854c61ac209038894a0832a409bca6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.298787Z","signature_b64":"kv9pCkjBlch6ycT2zfxTBNUVnmwWZEf2lJM38fnIwTdXDZ5AKG2GFzFHtJINOI9M79GcjbNfCe9H0GVN/lreDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83535be3e19514f5de7cea72ca958b616cdfd49ba22ffe3a0bb09efc0ad44af","last_reissued_at":"2026-05-18T02:23:36.297995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.297995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Composition: A New Technique for Kernelization Lower Bounds","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2010-11-18T16:30:44Z","abstract_excerpt":"We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with polynomially bounded parameter value can express the logical OR of a sequence of instances of L. Building on work by Bodlaender et al. (ICALP 2008) and using a result by Fortnow and Santhanam (STOC 2008) we show that if an NP-complete problem cross-composes into a parameterized problem Q then Q does not admit a polynomial kernel unless the polynomial hierarchy collapses. Our technique generalizes and strength"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4224","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":"1011.4224","created_at":"2026-05-18T02:23:36.298122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4224v2","created_at":"2026-05-18T02:23:36.298122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4224","created_at":"2026-05-18T02:23:36.298122+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA2TLPR6DFIU","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA2TLPR6DFIU6XPH","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA2TLPR6","created_at":"2026-05-18T12:26:17.028572+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/ZA2TLPR6DFIU6XPHZ2TSZKKYWY","json":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY.json","graph_json":"https://pith.science/api/pith-number/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/graph.json","events_json":"https://pith.science/api/pith-number/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/events.json","paper":"https://pith.science/paper/ZA2TLPR6"},"agent_actions":{"view_html":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY","download_json":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY.json","view_paper":"https://pith.science/paper/ZA2TLPR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4224&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/action/storage_attestation","attest_author":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/action/author_attestation","sign_citation":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/action/citation_signature","submit_replication":"https://pith.science/pith/ZA2TLPR6DFIU6XPHZ2TSZKKYWY/action/replication_record"}},"created_at":"2026-05-18T02:23:36.298122+00:00","updated_at":"2026-05-18T02:23:36.298122+00:00"}