{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MYEMZZXTDXHZXINWXG2XLXS7WQ","short_pith_number":"pith:MYEMZZXT","schema_version":"1.0","canonical_sha256":"6608cce6f31dcf9ba1b6b9b575de5fb427ab5d671340ff27bdaf62e0dc60303b","source":{"kind":"arxiv","id":"1511.01770","version":1},"attestation_state":"computed","paper":{"title":"Pattern matching in $(213,231)$-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Both Emerite Neou, Romeo Rizzi, St\\'ephane Vialette","submitted_at":"2015-11-05T15:08:59Z","abstract_excerpt":"Given permutations $\\sigma \\in S_k$ and $\\pi \\in S_n$ with $k<n$, the \\emph{pattern matching} problem is to decide whether $\\pi$ matches $\\sigma$ as an order-isomorphic subsequence. We give a linear-time algorithm in case both $\\pi$ and $\\sigma$ avoid the two size-$3$ permutations $213$ and $231$. For the special case where only $\\sigma$ avoids $213$ and $231$, we present a $O(max(kn^2,n^2\\log(\\log(n)))$ time algorithm. We extend our research to bivincular patterns that avoid $213$ and $231$ and present a $O(kn^4)$ time algorithm. Finally we look at the related problem of the longest subsequen"},"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":"1511.01770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-05T15:08:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5acfcab4d800a0140c73f148a3e8bda4c30757fbb3904d3b71de8a3d34e2799e","abstract_canon_sha256":"08042c5903e6e43a01894598a9e03f5c687588c4cb1aa220d68fbf075414f3fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.846903Z","signature_b64":"N3SXZNufvz4f5I55ukvrTFjg4nXb7oTsMPGUZoEljna72nSOt8/9DkYxhZlTZoBELekSfj8B+EwLnwlFEHpSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6608cce6f31dcf9ba1b6b9b575de5fb427ab5d671340ff27bdaf62e0dc60303b","last_reissued_at":"2026-05-18T01:27:39.846435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.846435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern matching in $(213,231)$-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Both Emerite Neou, Romeo Rizzi, St\\'ephane Vialette","submitted_at":"2015-11-05T15:08:59Z","abstract_excerpt":"Given permutations $\\sigma \\in S_k$ and $\\pi \\in S_n$ with $k<n$, the \\emph{pattern matching} problem is to decide whether $\\pi$ matches $\\sigma$ as an order-isomorphic subsequence. We give a linear-time algorithm in case both $\\pi$ and $\\sigma$ avoid the two size-$3$ permutations $213$ and $231$. For the special case where only $\\sigma$ avoids $213$ and $231$, we present a $O(max(kn^2,n^2\\log(\\log(n)))$ time algorithm. We extend our research to bivincular patterns that avoid $213$ and $231$ and present a $O(kn^4)$ time algorithm. Finally we look at the related problem of the longest subsequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01770","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":"1511.01770","created_at":"2026-05-18T01:27:39.846513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01770v1","created_at":"2026-05-18T01:27:39.846513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01770","created_at":"2026-05-18T01:27:39.846513+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYEMZZXTDXHZ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYEMZZXTDXHZXINW","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYEMZZXT","created_at":"2026-05-18T12:29:32.376354+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/MYEMZZXTDXHZXINWXG2XLXS7WQ","json":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ.json","graph_json":"https://pith.science/api/pith-number/MYEMZZXTDXHZXINWXG2XLXS7WQ/graph.json","events_json":"https://pith.science/api/pith-number/MYEMZZXTDXHZXINWXG2XLXS7WQ/events.json","paper":"https://pith.science/paper/MYEMZZXT"},"agent_actions":{"view_html":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ","download_json":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ.json","view_paper":"https://pith.science/paper/MYEMZZXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01770&json=true","fetch_graph":"https://pith.science/api/pith-number/MYEMZZXTDXHZXINWXG2XLXS7WQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MYEMZZXTDXHZXINWXG2XLXS7WQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ/action/storage_attestation","attest_author":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ/action/author_attestation","sign_citation":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ/action/citation_signature","submit_replication":"https://pith.science/pith/MYEMZZXTDXHZXINWXG2XLXS7WQ/action/replication_record"}},"created_at":"2026-05-18T01:27:39.846513+00:00","updated_at":"2026-05-18T01:27:39.846513+00:00"}