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: "new lower and upper bounds for representing sequences"
  Abstract: Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between different upper bounds, and the few lower bounds, known for such a representation, and how they interact with the space used. In this article we prove a strong lower bound for $rank$, which holds for rather permissive assumptions on the space, and give matching upper bounds that require only a compressed representation of the sequence. Within this compressed space, operations $access$ and $select$ can be solved within almost-constant time.

Connected through hyperedge HE-1 (induced by source paper "run compressed rank select for large alphabets"):
  with members:
    - "optimal time text indexing in bwt runs bounded space"
    - "from theory to practice plug and play with succinct data structures"
    - "optimal lower and upper bounds for representing sequences"
    - "efficient fully compressed sequence representations"

Connected through hyperedge HE-2 (induced by source paper "succinct data structure for nearest colored node in a tree"):
  with members:
    - "efficient vertex label distance oracles for planar graphs"
    - "compressed subsequence matching and packed tree coloring"
    - "succinct representation of labeled trees"
    - "the power of dynamic distance oracles efficient dynamic algorithms for the steiner tree"
    - "improved distance oracles and spanners for vertex labeled graphs"
    - "optimal succinctness for range minimum queries"

Connected through hyperedge HE-3 (induced by source paper "optimal distance labeling schemes for trees"):
  with members:
    - "optimal induced universal graphs and adjacency labeling for trees"
    - "simpler faster and shorter labels for distances in graphs"
    - "near optimal adjacency labeling scheme for power law graphs"
    - "adjacency labeling schemes and induced universal graphs"
    - "near optimal labeling schemes for nearest common ancestors"
    - "fast exact shortest path distance queries on large networks by pruned landmark labeling"

Connected through hyperedge HE-4 (induced by source paper "compressed data structures for dynamic sequences"):
  with members:
    - "on line indexing for general alphabets via predecessor queries on subsets of an ordered list"
    - "optimal dynamic sequence representations"
    - "succinct representations of permutations and functions"
    - "cram compressed random access memory"
    - "succinct representations of dynamic strings"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-5 (induced by source paper "efficient compressed wavelet trees over large alphabets"):
  with members:
    - "optimal dynamic sequence representations"
    - "on compressing permutations and adaptive sorting"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "succinct representations of dynamic strings"
    - "efficient fully compressed sequence representations"
    - "range quantile queries another virtue of wavelet trees"
    - "fully functional static and dynamic succinct trees"
    - "fast in memory xpath search over compressed text and tree indexes"

Connected through hyperedge HE-6 (induced by source paper "efficient and compact representations of prefix codes"):
  with members:
    - "on compressing permutations and adaptive sorting"
    - "fixed block compression boosting in fm indexes"
    - "compressed representations of permutations and applications"
    - "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-7 (induced by source paper "spaces trees and colors the algorithmic landscape of document retrieval on sequences"):
  with members:
    - "orthogonal range searching for text indexing"
    - "optimal top k document retrieval"
    - "on optimal top k string retrieval"
    - "faster compact top k document retrieval"
    - "towards an optimal space and query time index for top k document retrieval"
    - "space efficient data analysis queries on grids"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "optimal trade off for succinct string indexes"

Connected through hyperedge HE-8 (induced by source paper "succinct representation of labeled trees"):
  with members:
    - "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"
    - "orderly spanning trees with applications"

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)