{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-03b20bb9b1", "problem", "se-cstheory-1814", "A combinatorial version for the polynomial Hirsch conjecture. Consider $t$ disjoint families of subsets of {1,2,\u2026,n}, ${\\cal F}_1,{\\cal F_2},\\dots {\\cal F_t}$ . Suppose that (*) For every $i \\lt j \\lt k$ and every $R \\in {\\cal F}_i$, and $T \\in {\\cal F}_k$, there is $S \\in {\\cal F}_j$ which contains", "method", "m-transformer-sequence-model", "transformer sequence model", null, "same-field", "unknown", "demand-led; novelty not scored", "unasked", null, "2026-09-02T20:10:35Z", "demand", 0.974, "demand 0.53 (stack exchange open-problems tag (cstheory, score 53, 1 answ), shape compute-checkable-small-cases; 'transformer sequence model' applies and has 65 ingested titles", "This problem carries external demand (stack exchange open-problems tag (cstheory, score 53, 1 answ). 'transformer sequence model' is the applicable method with the most track record in the graph. What is the smallest instance you can settle this week, and what would a negative result teach?", "arxiv:2312.02139 doi:10.18653/v1/n19-1423 arxiv:2004.05150 doi:10.1016/j.nlp.2024.100076 doi:10.1145/3712256.3726396"]], "columns": ["id", "a_kind", "a_ref", "a_label", "b_kind", "b_ref", "b_label", "bridge", "distance", "novelty", "evidence", "status", "asked_by", "created_ts", "signal", "score", "why", "prompt", "reading"], "primary_keys": ["id"], "primary_key_values": ["ap-03b20bb9b1"], "units": {}, "query_ms": 0.5689007230103016, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}