{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MG6ZGTMQWDTXAIGDI65WC3AIMS","short_pith_number":"pith:MG6ZGTMQ","schema_version":"1.0","canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","source":{"kind":"arxiv","id":"1307.3073","version":2},"attestation_state":"computed","paper":{"title":"Finding small patterns in permutations in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-07-11T11:50:48Z","abstract_excerpt":"Given two permutations $\\sigma$ and $\\pi$, the \\textsc{Permutation Pattern} problem asks if $\\sigma$ is a subpattern of $\\pi$. We show that the problem can be solved in time $2^{O(\\ell^2\\log \\ell)}\\cdot n$, where $\\ell=|\\sigma|$ and $n=|\\pi|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found.\n  We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $\\sigma$ as a subpattern of $\\pi$, or finds a decomposition of $\\pi$ whose width is bounded"},"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":"1307.3073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-11T11:50:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d90f8e76d3958835f1ab237f8804ae9a4404f85a7be8a39c9fb385501a57942d","abstract_canon_sha256":"9aab7c0f10afecf3e33ce1253735825966d198d6784b7944cb028852a026e894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:24.686878Z","signature_b64":"Z1hIj6IRXAsZMWSe2072wgt+nvSLz/dXqrP+xdL9Y1Apn+SJGLGQMurlF8/KW52fevXfoJph/uKjGGsQ1RlXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bd934d90b0e77020c347bb616c08648bddd1eb0f2f128c7b0f8d8ee6d5e4af","last_reissued_at":"2026-05-18T03:08:24.686293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:24.686293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding small patterns in permutations in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-07-11T11:50:48Z","abstract_excerpt":"Given two permutations $\\sigma$ and $\\pi$, the \\textsc{Permutation Pattern} problem asks if $\\sigma$ is a subpattern of $\\pi$. We show that the problem can be solved in time $2^{O(\\ell^2\\log \\ell)}\\cdot n$, where $\\ell=|\\sigma|$ and $n=|\\pi|$. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found.\n  We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds $\\sigma$ as a subpattern of $\\pi$, or finds a decomposition of $\\pi$ whose width is bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3073","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":"1307.3073","created_at":"2026-05-18T03:08:24.686395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3073v2","created_at":"2026-05-18T03:08:24.686395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3073","created_at":"2026-05-18T03:08:24.686395+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG6ZGTMQWDTX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG6ZGTMQWDTXAIGD","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG6ZGTMQ","created_at":"2026-05-18T12:27:52.871228+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/MG6ZGTMQWDTXAIGDI65WC3AIMS","json":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS.json","graph_json":"https://pith.science/api/pith-number/MG6ZGTMQWDTXAIGDI65WC3AIMS/graph.json","events_json":"https://pith.science/api/pith-number/MG6ZGTMQWDTXAIGDI65WC3AIMS/events.json","paper":"https://pith.science/paper/MG6ZGTMQ"},"agent_actions":{"view_html":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS","download_json":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS.json","view_paper":"https://pith.science/paper/MG6ZGTMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3073&json=true","fetch_graph":"https://pith.science/api/pith-number/MG6ZGTMQWDTXAIGDI65WC3AIMS/graph.json","fetch_events":"https://pith.science/api/pith-number/MG6ZGTMQWDTXAIGDI65WC3AIMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/action/storage_attestation","attest_author":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/action/author_attestation","sign_citation":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/action/citation_signature","submit_replication":"https://pith.science/pith/MG6ZGTMQWDTXAIGDI65WC3AIMS/action/replication_record"}},"created_at":"2026-05-18T03:08:24.686395+00:00","updated_at":"2026-05-18T03:08:24.686395+00:00"}