{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3ZXU3W6DGKK2DGQ74WH6PYCREK","short_pith_number":"pith:3ZXU3W6D","schema_version":"1.0","canonical_sha256":"de6f4ddbc33295a19a1fe58fe7e05122a980caa0f026b48c7f139a529a362763","source":{"kind":"arxiv","id":"1406.1158","version":2},"attestation_state":"computed","paper":{"title":"Kernelization lower bound for Permutation Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Pawel Komosa","submitted_at":"2014-06-04T19:32:04Z","abstract_excerpt":"A permutation $\\pi$ contains a permutation $\\sigma$ as a pattern if it contains a subsequence of length $|\\sigma|$ whose elements are in the same relative order as in the permutation $\\sigma$. This notion plays a major role in enumerative combinatorics. We prove that the problem does not have a polynomial kernel (under the widely believed complexity assumption $\\mbox{NP} \\not\\subseteq \\mbox{co-NP}/\\mbox{poly}$) by introducing a new polynomial reduction from the clique problem to permutation pattern matching."},"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":"1406.1158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-04T19:32:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c872c01829ecb2cb3a63bc89e76fdc010a9337d765fb0da3d96bea82aa6d0dba","abstract_canon_sha256":"a56fbbf85f16165b7b31d14748fd980afbddb9fc1c46d9c00131fd3940297494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:38.926149Z","signature_b64":"YcmJo1fDEGSZTYVQQ0/IA/GICdUGXTyrfHdwtZ7AretALPoPfuqlCT1vvLEXg0wYXyse17sQddrDWWbZBZN4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6f4ddbc33295a19a1fe58fe7e05122a980caa0f026b48c7f139a529a362763","last_reissued_at":"2026-05-18T02:29:38.925774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:38.925774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization lower bound for Permutation Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Pawel Komosa","submitted_at":"2014-06-04T19:32:04Z","abstract_excerpt":"A permutation $\\pi$ contains a permutation $\\sigma$ as a pattern if it contains a subsequence of length $|\\sigma|$ whose elements are in the same relative order as in the permutation $\\sigma$. This notion plays a major role in enumerative combinatorics. We prove that the problem does not have a polynomial kernel (under the widely believed complexity assumption $\\mbox{NP} \\not\\subseteq \\mbox{co-NP}/\\mbox{poly}$) by introducing a new polynomial reduction from the clique problem to permutation pattern matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1158","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":"1406.1158","created_at":"2026-05-18T02:29:38.925835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1158v2","created_at":"2026-05-18T02:29:38.925835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1158","created_at":"2026-05-18T02:29:38.925835+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZXU3W6DGKK2","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZXU3W6DGKK2DGQ7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZXU3W6D","created_at":"2026-05-18T12:28:11.866339+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/3ZXU3W6DGKK2DGQ74WH6PYCREK","json":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK.json","graph_json":"https://pith.science/api/pith-number/3ZXU3W6DGKK2DGQ74WH6PYCREK/graph.json","events_json":"https://pith.science/api/pith-number/3ZXU3W6DGKK2DGQ74WH6PYCREK/events.json","paper":"https://pith.science/paper/3ZXU3W6D"},"agent_actions":{"view_html":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK","download_json":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK.json","view_paper":"https://pith.science/paper/3ZXU3W6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1158&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZXU3W6DGKK2DGQ74WH6PYCREK/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZXU3W6DGKK2DGQ74WH6PYCREK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK/action/storage_attestation","attest_author":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK/action/author_attestation","sign_citation":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK/action/citation_signature","submit_replication":"https://pith.science/pith/3ZXU3W6DGKK2DGQ74WH6PYCREK/action/replication_record"}},"created_at":"2026-05-18T02:29:38.925835+00:00","updated_at":"2026-05-18T02:29:38.925835+00:00"}