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: "compact binary relation representations with rich functionality"
  Abstract: Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operations required to fit one particular application. We identify many of those operations arising in applications and generalize them into a wide set of desirable queries for a binary relation representation. We also identify reductions among those operations. We then introduce several novel binary relation representations, some simple and some quite sophisticated, that not only are space-efficient but also efficiently support a large subset of the desired queries.

Connected through hyperedge HE-1 (induced by source paper "compressed data structures for binary relations in practice"):
  with members:
    - "compressed representation of dynamic binary relations with applications"
    - "simd compression and the intersection of sorted integers"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"

Connected through hyperedge HE-2 (induced by source paper "energy consumption in compact integer vectors a study case"):
  with members:
    - "energy efficient algorithms"
    - "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"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-3 (induced by source paper "grammar compressed sequences with rank select support"):
  with members:
    - "queries on lz bounded encodings"
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "a succinct grammar compression"
    - "data structure lower bounds on random access to grammar compressed strings"
    - "optimal lower and upper bounds for representing sequences"
    - "on compressing permutations and adaptive sorting"
    - "optimal trade off for succinct string indexes"
    - "efficient fully compressed sequence representations"

Connected through hyperedge HE-4 (induced by source paper "a succinct data structure for self indexing ternary relations"):
  with members:
    - "compressed k2 triples for full in memory rdf engines"

Connected through hyperedge HE-5 (induced by source paper "aggregated 2d range queries on clustered points"):
  with members:
    - "faster compressed quadtrees"
    - "space efficient data analysis queries on grids"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-6 (induced by source paper "orthogonal range searching for text indexing"):
  with members:
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "binary jumbled string matching for highly run length compressible texts"
    - "linear space substring range counting over polylogarithmic alphabets"
    - "on optimal top k string retrieval"
    - "sorted range reporting"
    - "orthogonal range searching on the ram revisited"
    - "improved grammar based compressed indexes"
    - "encoding 2 d range maximum queries"

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)