human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "faster dynamic compressed d ary relations"):
  Abstract: The \(k^2\)-tree is a successful compact representation of binary relations that exhibit sparseness and/or clustering properties. It can be extended to d dimensions, where it is called a \(k^d\)-tree. The representation boils down to a long bitvector. We show that interpreting the \(k^d\)-tree as a dynamic trie on the Morton codes of the points, instead of as a dynamic representation of the bitvector as done in previous work, yields operation times that are below the lower bound of dynamic bitvectors and offers improved time performance in practice.

Includes members:
  Member "compact and efficient representation of general graph databases":
    also connected through other hyperedges:
      (none)
  Member "towards a compact representation of temporal rasters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a compact representation of raster time series")
  Member "compressed representation of dynamic binary relations with applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressed data structures for binary relations in practice")
  Member "a succinct data structure for self indexing ternary relations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extending general compact querieable representations to gis applications")
  Member "aggregated 2d range queries on clustered points":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "path query data structures in practice")
  Member "layered label propagation a multiresolution coordinate free ordering for compressing social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "2ps high quality edge partitioning with two phase streaming")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "practical entropy compressed rank select dictionary":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bitvectors with runs and the successor predecessor problem")

Question: Please tell me which class the source paper 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)