adjacent_pair: ap-07dbd8b8dc
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-07dbd8b8dc | problem | wp-fair-division-215df9cd21 | A connected envy-free cake-cutting might take infinitely many queries to find. An EF1 allocation can always be found in finite time by checking all possible allocations, but this algorithm requires exponential run-time. | method | m-information-theoretic-bounds | information-theoretic bounds | far | 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:10:07Z |
Links from other tables
- 0 rows from pair_id in pair_answer