adjacent_pair: ap-02011c51b9

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-02011c51b9 problem ax-2605.29885-9bb5e691 Open Problem 2 (Sample Complexity of the Canonical Testbed): Cayley-table completion serves as the immediate, concrete testbed for establishing this separation. Because finite groups are linearly full-rank ( $r=n$ ), applying standard matrix completion theory yields vacuous bounds exceeding $\mathca method m-spectral-graph-theory spectral graph theory   adjacent-field novel 0 ingested titles mention both sides (text proxy for #177) unasked   2026-09-02T20:10:35Z transplant 1.946 'spectral graph theory' has 6 ingested titles (home field mathematics); problem is computer science / shape compute-checkable-small-cases (tractability 1.0); 0 titles use the method with this problem's terms 'spectral graph theory' has a track record in mathematics (6 ingested titles). What is the object it consumes in computer science's problem, and what would the first small instance look like? If the method cannot see the problem's structure, name the missing translation. openalex:W3214375535 doi:10.1109/tpami.2024.3362475 doi:10.1103/physrevlett.66.2396 arxiv:1901.10159 doi:10.1162/089976698300017467

Links from other tables