{"database": "team-science", "table": "adjacent_pair", "rows": [["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", null, "far", "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:10:07Z", 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-07dbd8b8dc"], "units": {}, "query_ms": 4.350029863417149, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}