adjacent_pair: ap-061834a1e0
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-061834a1e0 | problem | se-mo-38632 | Projective Plane of Order 12. I asked this question on the new Theoretical Computer Science "overflow" site, and commenters suggested I ask it here. That question is here , and it contains additional links, which I doubt I can embed here because I don't have enough reputation. Anyway, here goes: Obj | method | m-llm-driven-proof-search | LLM-driven proof search | adjacent-field | unknown | demand-led; novelty not scored | unasked | 2026-09-02T20:10:35Z | demand | 0.597 | demand 0.43 (stack exchange open-problems tag (mathoverflow, score 43, 2 ), shape compute-checkable-small-cases; 'LLM-driven proof search' applies and has 6 ingested titles | This problem carries external demand (stack exchange open-problems tag (mathoverflow, score 43, 2 ). 'LLM-driven proof search' 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? | openalex:W2946011656 openalex:W2963596026 arxiv:2009.03393 openalex:W3133204645 arxiv:2102.06203 |
Links from other tables
- 0 rows from pair_id in pair_answer