{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MA3LP4EO3PM5TXC2VBCDN3CBOS","short_pith_number":"pith:MA3LP4EO","schema_version":"1.0","canonical_sha256":"6036b7f08edbd9d9dc5aa84436ec4174b830e4a4876fb2082625d91a774e6cb7","source":{"kind":"arxiv","id":"1110.0976","version":1},"attestation_state":"computed","paper":{"title":"Hierarchies of Inefficient Kernelizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Danny Hermelin, Karolina So{\\l}tys, Magnus Wahlstr\\\"om, Stefan Kratsch, Xi Wu","submitted_at":"2011-10-05T13:14:58Z","abstract_excerpt":"The framework of Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) allows us to exclude the existence of polynomial kernels for a range of problems under reasonable complexity-theoretical assumptions. However, there are also some issues that are not addressed by this framework, including the existence of Turing kernels such as the \"kernelization\" of Leaf Out Branching(k) into a disjunction over n instances of size poly(k). Observing that Turing kernels are preserved by polynomial parametric transformations, we define a kernelization hardness hierarchy, akin to the M- and W-h"},"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":"1110.0976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-05T13:14:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d656e1c909a97a0fa286e18d18d41c1479d45c38b9ed4a7d6bd53c5e0c7b216c","abstract_canon_sha256":"a8c8a62d6b344481f404e6d4f8d1d07ca88360bd20b838a992babf6113eef054"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.509833Z","signature_b64":"EWvdBp2jde1ph37M/Jf7XlnGA9StY0Wxhejksfc2lGAntUwLplekrG4+WZYqJgEh/o12B/tvKQalcm0M8B8IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6036b7f08edbd9d9dc5aa84436ec4174b830e4a4876fb2082625d91a774e6cb7","last_reissued_at":"2026-05-18T02:21:35.509375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.509375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchies of Inefficient Kernelizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Danny Hermelin, Karolina So{\\l}tys, Magnus Wahlstr\\\"om, Stefan Kratsch, Xi Wu","submitted_at":"2011-10-05T13:14:58Z","abstract_excerpt":"The framework of Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) allows us to exclude the existence of polynomial kernels for a range of problems under reasonable complexity-theoretical assumptions. However, there are also some issues that are not addressed by this framework, including the existence of Turing kernels such as the \"kernelization\" of Leaf Out Branching(k) into a disjunction over n instances of size poly(k). Observing that Turing kernels are preserved by polynomial parametric transformations, we define a kernelization hardness hierarchy, akin to the M- and W-h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0976","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":"1110.0976","created_at":"2026-05-18T02:21:35.509454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0976v1","created_at":"2026-05-18T02:21:35.509454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0976","created_at":"2026-05-18T02:21:35.509454+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA3LP4EO3PM5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA3LP4EO3PM5TXC2","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA3LP4EO","created_at":"2026-05-18T12:26:34.985390+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/MA3LP4EO3PM5TXC2VBCDN3CBOS","json":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS.json","graph_json":"https://pith.science/api/pith-number/MA3LP4EO3PM5TXC2VBCDN3CBOS/graph.json","events_json":"https://pith.science/api/pith-number/MA3LP4EO3PM5TXC2VBCDN3CBOS/events.json","paper":"https://pith.science/paper/MA3LP4EO"},"agent_actions":{"view_html":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS","download_json":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS.json","view_paper":"https://pith.science/paper/MA3LP4EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0976&json=true","fetch_graph":"https://pith.science/api/pith-number/MA3LP4EO3PM5TXC2VBCDN3CBOS/graph.json","fetch_events":"https://pith.science/api/pith-number/MA3LP4EO3PM5TXC2VBCDN3CBOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS/action/storage_attestation","attest_author":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS/action/author_attestation","sign_citation":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS/action/citation_signature","submit_replication":"https://pith.science/pith/MA3LP4EO3PM5TXC2VBCDN3CBOS/action/replication_record"}},"created_at":"2026-05-18T02:21:35.509454+00:00","updated_at":"2026-05-18T02:21:35.509454+00:00"}