{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XDA6EKMYHHYJQLLVKCGPBJDHGC","short_pith_number":"pith:XDA6EKMY","schema_version":"1.0","canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","source":{"kind":"arxiv","id":"1206.5941","version":1},"attestation_state":"computed","paper":{"title":"Kernelization Lower Bounds By Cross-Composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2012-06-26T10:06:37Z","abstract_excerpt":"We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently construct an instance of Q with polynomially bounded parameter value that expresses the logical AND or 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) with a refinement by Dell and van Melkebeek (STOC 2010), we show that if an NP-hard problem OR-cross-composes into a parameterized problem Q then Q does not admi"},"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":"1206.5941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78bdd62dc74d0a67ba5af9bd4ad01b5471b7c1f81561fcd479f4bce1316edb71","abstract_canon_sha256":"e4c5aae65a479f9dee169d5293da0ff6de15f938abd4be26dc2fd4c354a9962e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.751532Z","signature_b64":"rAj6atH+7DNpMkhPZkXgc/VxiM4sxo5NOM7QIR3ksmAhz+1pFX+WG6kPqE/wzJPmFa7N90sw7pZraK+NQDuSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","last_reissued_at":"2026-05-18T02:21:08.750953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.750953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization Lower Bounds By Cross-Composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2012-06-26T10:06:37Z","abstract_excerpt":"We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently construct an instance of Q with polynomially bounded parameter value that expresses the logical AND or 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) with a refinement by Dell and van Melkebeek (STOC 2010), we show that if an NP-hard problem OR-cross-composes into a parameterized problem Q then Q does not admi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5941","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":"1206.5941","created_at":"2026-05-18T02:21:08.751042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5941v1","created_at":"2026-05-18T02:21:08.751042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5941","created_at":"2026-05-18T02:21:08.751042+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDA6EKMYHHYJ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDA6EKMYHHYJQLLV","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDA6EKMY","created_at":"2026-05-18T12:27:27.928770+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/XDA6EKMYHHYJQLLVKCGPBJDHGC","json":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC.json","graph_json":"https://pith.science/api/pith-number/XDA6EKMYHHYJQLLVKCGPBJDHGC/graph.json","events_json":"https://pith.science/api/pith-number/XDA6EKMYHHYJQLLVKCGPBJDHGC/events.json","paper":"https://pith.science/paper/XDA6EKMY"},"agent_actions":{"view_html":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC","download_json":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC.json","view_paper":"https://pith.science/paper/XDA6EKMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5941&json=true","fetch_graph":"https://pith.science/api/pith-number/XDA6EKMYHHYJQLLVKCGPBJDHGC/graph.json","fetch_events":"https://pith.science/api/pith-number/XDA6EKMYHHYJQLLVKCGPBJDHGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/action/storage_attestation","attest_author":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/action/author_attestation","sign_citation":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/action/citation_signature","submit_replication":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/action/replication_record"}},"created_at":"2026-05-18T02:21:08.751042+00:00","updated_at":"2026-05-18T02:21:08.751042+00:00"}