Dataset

MOOC-CS Configuration Used in Hierarchical Prerequisite RAG (225 Concepts, 516 Edges, 1,016 QA)

In this paper, MOOC-CS is consumed as a prerequisite graph with 225225 concepts, 516516 prerequisite edges, and 1,0161{,}016 QA pairs derived from the MOOCCubeX computer-science curriculum, with prerequisite-relation lineage from Pan et al. (2017). Graph descriptors computed from the released graph and concept texts are: mean depth 7.27.2, fraction of nodes with depth 1\geq 1 equal to 77.3%77.3\%, mean degree 4.64.6, and mean concept-text length 6.16.1 tokens. Compared to LectureBank-Full, MOOC-CS is deeper but sparser in degree and uses much shorter concept texts.

0

1

Updated 2026-05-17

Contributors are:

Who are from:

Tags

Science

Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls