{"paper":{"title":"Tractable Gap-Constraint Languages for Complex Event Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.FL"],"primary_cat":"cs.DS","authors_text":"Antoine Amarilli, Florin Manea, Markus L. Schmid, Tina Ringleb","submitted_at":"2026-06-17T09:55:08Z","abstract_excerpt":"For strings $u, D \\in \\Sigma^*$, a subsequence embedding of $u$ in $D$ is a function $e \\colon \\{1, 2, \\ldots, |u|\\} \\to \\{1, 2, \\ldots, |D|\\}$ with $e(i) < e(i+1)$ for every $i \\in \\{1, 2, \\ldots, |u|-1\\}$ and the $i$-th symbol of $u$ equals the $e(i)$-th symbol of $D$. A gap-constraint for $u$ is a triple $(i, j, L)$ with $1 \\leq i < j \\leq |u|$ and $L$ is a regular language over $\\Sigma$. An embedding $e$ satisfies a gap-constraint $(i, j, L)$ if the factor of $D$ strictly between positions $e(i)$ and $e(j)$ is a word from $L$. We investigate the subsequence matching problem with gap-constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18878","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.18878/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}