{"paper":{"title":"Inferring an Indeterminate String from a Prefix Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-02-27T11:59:01Z","abstract_excerpt":"An \\itbf{indeterminate string} (or, more simply, just a \\itbf{string}) $\\s{x} = \\s{x}[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$. We say that $\\s{x}[i_1]$ and $\\s{x}[i_2]$ \\itbf{match} (written $\\s{x}[i_1] \\match \\s{x}[i_2]$) if and only if $\\s{x}[i_1] \\cap \\s{x}[i_2] \\ne \\emptyset$. A \\itbf{feasible array} is an array $\\s{y} = \\s{y}[1..n]$ of integers such that $\\s{y}[1] = n$ and for every $i \\in 2..n$, $\\s{y}[i] \\in 0..n\\- i\\+ 1$. A \\itbf{prefix table} of a string $\\s{x}$ is an array $\\s{\\pi} = \\s{\\pi}[1..n]$ of integers such that, for every $i \\in 1..n$, $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07870","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"}