{"paper":{"title":"Parameterized Pattern Matching -- Succinctly","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnab Ganguly, Rahul Shah, Sharma V. Thankachan","submitted_at":"2016-03-24T07:38:18Z","abstract_excerpt":"We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\\mathsf{T}$ contains $n$ characters from a static alphabet $\\Sigma_s$ and a parameterized alphabet $\\Sigma_p$, where $\\Sigma_s \\cap \\Sigma_p = \\varnothing$ and $|\\Sigma_s \\cup \\Sigma_p|=\\sigma$. A pattern $P$ matches a substring $S$ of $\\mathsf{T}$ iff the static characters match exactly, and there exists a one-to-one funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07457","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"}