Metraipolis › archive › dc_1ca7e606fda0

Rebuilding a Field's Open-Problem Catalog from the Literature: A Two-Layer Knowledge Graph, and Why Status Must Stay Proposed — arXiv:2610.39641

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39641
License (as archived)
CC0-1.0
Archived
2026-10-31T06:13:22.120Z
SHA-256 of the archived text
ebf40686a6ff5aba380cd3398c4d12e6c7f2ca8146aabfdaf1af3f6c3340aa20
Stable URL of this page
https://metraipolis.com/documento/dc_1ca7e606fda0

How to cite

Rebuilding a Field's Open-Problem Catalog from the Literature: A Two-Layer Knowledge Graph, and Why Status Must Stay Proposed — arXiv:2610.39641 — arXiv (en), https://arxiv.org/abs/2610.39641 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1ca7e606fda0 (Metraipolis archive dc_1ca7e606fda0, sha256 ebf40686a6ff5aba380cd3398c4d12e6c7f2ca8146aabfdaf1af3f6c3340aa20)
BibTeX
@misc{dc1ca7e606fda0,
  title = {Rebuilding a Field's Open-Problem Catalog from the Literature: A Two-Layer Knowledge Graph, and Why Status Must Stay Proposed — arXiv:2610.39641},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39641},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1ca7e606fda0; sha256 ebf40686a6ff5aba380cd3398c4d12e6c7f2ca8146aabfdaf1af3f6c3340aa20},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39641. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A research field records its open problems in surveys, keynotes and community reports. Those are prose, written every few years, and nobody can ask them who works on a problem now or whether it was settled last year. We argue the problems should be data, and we build the system that makes them so: a hand-curated problem layer carried in unchanged, under an evidence layer rebuilt from a bibliographic index, joined by typed, provenance-carrying links in one graph database and queryable from one language. A language model does four jobs -- per-paper extraction, catalog grounding, per-paper status verdict, and idea generation -- each constrained to a candidate set so out-of-set answers are refused rather than stored. We report a study on two curated catalogs, database research (1,053 problems) and AI research (1,000 problems), each with a prior catalog-only graph. The rebuilt graph answers every question the catalog-only graph answered -- 47 of 47 on databases, 34 of 35 on AI -- plus questions the catalog-only graph refused: recent workers, untouched problems, methods tried, and outside papers bearing on a problem (336 problems, 770 works on databases). The capability we most wanted does not survive its own audit. Of 41 solves and refutes verdicts hand-checked against the papers, 9 are correct, 30 partly correct and 2 wrong; no refutes verdict (0 of 34) disproves an open problem, and only 1 of 7 solves closes the central question. We report that failure in full and draw the design conclusion: a status change must be proposed with its evidence and never applied, making the human reviewer part of the architecture. We close with the data-engineering problems this raises: entity resolution across curated and harvested layers, verifying model status claims, freshness under source quotas, and evaluation without ground truth.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Databases (cs.DB) ; Artificial Intelligence (cs.AI); Digital Libraries (cs.DL).
Pagina del lavoro: https://arxiv.org/abs/2610.39641 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T06:07:08.729Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).