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: "practical entropy compressed rank select dictionary"
  Abstract: Rank/Select dictionaries are data structures for an ordered set $S \subset \{0,1,...,n-1\}$ to compute $\rank(x,S)$ (the number of elements in $S$ which are no greater than $x$), and $\select(i,S)$ (the $i$-th smallest element in $S$), which are the fundamental components of \emph{succinct data structures} of strings, trees, graphs, etc. In those data structures, however, only asymptotic behavior has been considered and their performance for real data is not satisfactory. In this paper, we propose novel four Rank/Select dictionaries, esp, recrank, vcode and sdarray, each of which is small if the number of elements in $S$ is small, and indeed close to $nH_0(S)$ ($H_0(S) \leq 1$ is the zero-th order \textit{empirical entropy} of $S$) in practice, and its query time is superior to the previous ones. Experimental results reveal the characteristics of our data structures and also show that these data structures are superior to existing implementations in both size and query time.

Connected through hyperedge HE-1 (induced by source paper "bitvectors with runs and the successor predecessor problem"):
  with members:
    - "from theory to practice plug and play with succinct data structures"

Connected through hyperedge HE-2 (induced by source paper "semantrix a compressed semantic matrix"):
  with members:
    - "new structures to solve aggregated queries for trips over public transportation networks"

Connected through hyperedge HE-3 (induced by source paper "revisiting compact rdf stores based on k2 trees"):
  with members:
    - "an empirical study of real world sparql queries"

Connected through hyperedge HE-4 (induced by source paper "energy consumption in compact integer vectors a study case"):
  with members:
    - "energy efficient algorithms"
    - "compact binary relation representations with rich functionality"
    - "optimal lower and upper bounds for representing sequences"
    - "on compressing permutations and adaptive sorting"
    - "orthogonal range searching on the ram revisited"
    - "succinct representations of permutations and functions"
    - "fully functional static and dynamic succinct trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-5 (induced by source paper "faster dynamic compressed d ary relations"):
  with members:
    - "compact and efficient representation of general graph databases"
    - "towards a compact representation of temporal rasters"
    - "compressed representation of dynamic binary relations with applications"
    - "a succinct data structure for self indexing ternary relations"
    - "aggregated 2d range queries on clustered points"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-6 (induced by source paper "an index for sequencing reads based on the colored de bruijn graph"):
  with members:
    - "variable order de bruijn graphs"
    - "from theory to practice plug and play with succinct data structures"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-7 (induced by source paper "algorithms to compute the burrows wheeler similarity distribution"):
  with members:
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "a framework for space efficient string kernels"
    - "from theory to practice plug and play with succinct data structures"

Connected through hyperedge HE-8 (induced by source paper "enumerative data compression with non uniquely decodable codes"):
  with members:
    - "enumeration of sequences with large alphabets"
    - "non prefix free codes for constrained sequences"

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)