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: "compressed representations of permutations and applications"
  Abstract: We explore various techniques to compress a permutation $\pi$ over n integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi$(i) and the application of its inverse $\pi^{-1}(i)$ in small time. Our compression schemes yield several interesting byproducts, in many cases matching, improving or extending the best existing results on applications such as the encoding of a permutation in order to support iterated applications $\pi^k(i)$ of it, of integer functions, and of inverted lists and suffix arrays.

Connected through hyperedge HE-1 (induced by source paper "compression in the space of permutations"):
  with members:
    - "rate distortion for ranking with incomplete information"
    - "constructions of rank modulation codes"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-2 (induced by source paper "new techniques and tighter bounds for local computation algorithms"):
  with members:
    - "local computation algorithms for graphs of non constant degrees"
    - "an improved distributed algorithm for maximal independent set"
    - "distributed maximum matching in bounded degree graphs"
    - "a local computation approximation scheme to maximum matching"
    - "local computation mechanism design"
    - "the locality of distributed symmetry breaking"
    - "converting online algorithms to local computation algorithms"
    - "space efficient local computation algorithms"

Connected through hyperedge HE-3 (induced by source paper "efficient and compact representations of prefix codes"):
  with members:
    - "new lower and upper bounds for representing sequences"
    - "on compressing permutations and adaptive sorting"
    - "fixed block compression boosting in fm indexes"
    - "fast and compact prefix codes"
    - "worst case optimal adaptive prefix coding"
    - "dynamic asymmetric communication"
    - "large alphabets and incompressibility"
    - "time space trade offs for predecessor search"

Connected through hyperedge HE-4 (induced by source paper "a succinct grammar compression"):
  with members:
    - "cram compressed random access memory"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-5 (induced by source paper "compact binary relation representations with rich functionality"):
  with members:
    - "sorted range reporting"
    - "optimal dynamic sequence representations"
    - "orthogonal range searching on the ram revisited"
    - "space efficient data analysis queries on grids"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "fully functional static and dynamic succinct trees"
    - "optimal succinctness for range minimum queries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-6 (induced by source paper "optimal dynamic sequence representations"):
  with members:
    - "new lower and upper bounds for representing sequences"
    - "a dynamic stabbing max data structure with sub logarithmic query time"
    - "fixed block compression boosting in fm indexes"
    - "succinct representations of dynamic strings"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-7 (induced by source paper "optimal prefix free code in linear time"):
  with members:
    - "a generic top down dynamic programming approach to prefix free coding"

Connected through hyperedge HE-8 (induced by source paper "new lower and upper bounds for representing sequences"):
  with members:
    - "optimal trade off for succinct string indexes"
    - "efficient fully compressed sequence representations"
    - "fast in memory xpath search over compressed text and tree indexes"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "large alphabets and incompressibility"
    - "practical entropy compressed rank select dictionary"
    - "time space trade offs for predecessor search"

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)