human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a compressed gap data aware measure for indexable dictionaries"
  Abstract: We consider the problem of building a compressed fully-indexable dictionary over a set $S$ of $n$ items out of a universe $U=\{0,...,u-1\}$. We use gap-encoding combined with entropy compression in order to reduce the space of our structures. Let $H^{gap}_0$ be the zero-order empirical entropy of the gap stream. We observe that $nH^{gap}_0\in o(gap)$ if the gaps are highly compressible, and prove that $nH^{gap}_0 \leq n\log(u/n) + n$ bits. This upper bound is smaller than the worst-case size of the Elias $\delta$-encoded gap stream. Our aim is, therefore, to obtain a data structure having $nH^{gap}_0$ as leading term in its space complexity. We propose a fully-indexable dictionary that supports rank and select queries in $\mathcal{O}(\log\log u)$ time and requires $nH^{gap}_0 + \mathcal{O}(n) + \mathcal{O}(u/polylog(u))$ bits of space. If $n\in\Theta(u/polylog(u))$ and $H^{gap}_0\in\mathcal{O}(1)$ (e.g. regularly spaced items), ours is the first solution answering all queries in $\mathcal{O}(\log\log n)$ time while requiring only $\mathcal{O}(n)$ bits of space.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)