{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-077e0120b2", "problem", "wp-mathematics-1352d2701b", "The universality problem for C -free graphs: For which finite sets C of graphs does the class of C -free countable graphs have a universal member under strong embeddings? [ 161 ]", "method", "m-llm-driven-proof-search", "LLM-driven proof search", null, "adjacent-field", "novel", "0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) \u00b7 withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal)", "withdrawn", null, "2026-09-02T18:02:06Z", null, null, null, null, null]], "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-077e0120b2"], "units": {}, "query_ms": 1.3247579336166382, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}