{"database": "team-science", "table": "open_problem", "rows": [["ax-2605.30389-1e86dbdc", "Question 2: Is it true that, for every alphabet $\\Sigma$ with at least two symbols, $\\operatorname{ID}_{\\Sigma}(p)=2|p|-\\#\\operatorname{var}(p)-1,$ (1) where $|p|$ is the length, namely the number of variables and constants in $p$ , and $\\#\\operatorname{var}(p)$ is the number of distinct variables in $p$ ?", "computer science / cs.FL", "enumerated in arXiv paper titled 'open problems' (formal problem environment): The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory", "https://arxiv.org/abs/2605.30389", null, "open", null, "ts-synth", "compute-checkable-small-cases", "2026-09-02T17:57:21Z", "2026-09-02T17:57:21Z"]], "columns": ["id", "statement", "domain", "sourced_how", "source_url", "cheapest_test", "status", "claimed_by", "sourced_by", "shape", "created_ts", "updated_ts"], "primary_keys": ["id"], "primary_key_values": ["ax-2605.30389-1e86dbdc"], "units": {}, "query_ms": 0.5995789542794228, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}