{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MYEMZZXTDXHZXINWXG2XLXS7WQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"08042c5903e6e43a01894598a9e03f5c687588c4cb1aa220d68fbf075414f3fb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-05T15:08:59Z","title_canon_sha256":"5acfcab4d800a0140c73f148a3e8bda4c30757fbb3904d3b71de8a3d34e2799e"},"schema_version":"1.0","source":{"id":"1511.01770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01770","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01770v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01770","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"MYEMZZXTDXHZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYEMZZXTDXHZXINW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYEMZZXT","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:4084ea94e7624d2293b069717dab76afe839ad27d1e34e48dd9cb0e865e93aad","target":"graph","created_at":"2026-05-18T01:27:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Both Emerite Neou, Romeo Rizzi, St\\'ephane Vialette","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-05T15:08:59Z","title":"Pattern matching in $(213,231)$-avoiding permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01770","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3d81942ccd5eeaa047ea70bdd2365445d6fe60c20798e7fac4f2721af5a3787","target":"record","created_at":"2026-05-18T01:27:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"08042c5903e6e43a01894598a9e03f5c687588c4cb1aa220d68fbf075414f3fb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-05T15:08:59Z","title_canon_sha256":"5acfcab4d800a0140c73f148a3e8bda4c30757fbb3904d3b71de8a3d34e2799e"},"schema_version":"1.0","source":{"id":"1511.01770","kind":"arxiv","version":1}},"canonical_sha256":"6608cce6f31dcf9ba1b6b9b575de5fb427ab5d671340ff27bdaf62e0dc60303b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6608cce6f31dcf9ba1b6b9b575de5fb427ab5d671340ff27bdaf62e0dc60303b","first_computed_at":"2026-05-18T01:27:39.846435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.846435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N3SXZNufvz4f5I55ukvrTFjg4nXb7oTsMPGUZoEljna72nSOt8/9DkYxhZlTZoBELekSfj8B+EwLnwlFEHpSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.846903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d81942ccd5eeaa047ea70bdd2365445d6fe60c20798e7fac4f2721af5a3787","sha256:4084ea94e7624d2293b069717dab76afe839ad27d1e34e48dd9cb0e865e93aad"],"state_sha256":"85291bdb9b1fdb719d57de0ac88943c6831d7072239e7c8b95a34489d2519848"}