adjacent_pair: ap-077e0120b2

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

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
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   adjacent-field novel 0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) ยท withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal) withdrawn   2026-09-02T18:02:06Z          

Links from other tables