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: "from theory to practice plug and play with succinct data structures"
  Abstract: Engineering efficient implementations of compact and succinct structures is a time-consuming and challenging task, since there is no standard library of easy-to- use, highly optimized, and composable components. One consequence is that measuring the practical impact of new theoretical proposals is a difficult task, since older base- line implementations may not rely on the same basic components, and reimplementing from scratch can be very time-consuming. In this paper we present a framework for experimentation with succinct data structures, providing a large set of configurable components, together with tests, benchmarks, and tools to analyze resource requirements. We demonstrate the functionality of the framework by recomposing succinct solutions for document retrieval.

Connected through hyperedge HE-1 (induced by source paper "bitvectors with runs and the successor predecessor problem"):
  with members:
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-2 (induced by source paper "lempel ziv like parsing in small space"):
  with members:
    - "at the roots of dictionary compression string attractors"
    - "relations between greedy and bit optimal lz77 encodings"
    - "lz end parsing in compressed space"
    - "approximating lz77 via small space multiple pattern matching"
    - "lempel ziv parsing in external memory"
    - "linear time lempel ziv factorization simple fast small"
    - "relative lempel ziv factorization for efficient storage and retrieval of web collections"
    - "large alphabets and incompressibility"

Connected through hyperedge HE-3 (induced by source paper "dynamic path decomposed tries"):
  with members:
    - "dynamic packed compact tries revisited"
    - "separate chaining meets compact hashing"
    - "m bonsai a practical compact dynamic trie"
    - "packed compact tries a fast and efficient data structure for online string processing"
    - "a framework of dynamic data structures for string processing"
    - "practical evaluation of lempel ziv 78 and lempel ziv welch tries"
    - "fast compressed tries through path decompositions"

Connected through hyperedge HE-4 (induced by source paper "b bit sketch trie scalable similarity search on integer sketches"):
  with members:
    - "pigeonring a principle for faster thresholded similarity search"
    - "linearized gmm kernels and normalized random fourier features"
    - "fast exact search in hamming space with multi index hashing"
    - "searching in one billion vectors re rank with source coding"
    - "b bit minwise hashing"

Connected through hyperedge HE-5 (induced by source paper "gract a grammar based compressed index for trajectory data"):
  with members:
    - "one pass error bounded trajectory simplification"
    - "gract a grammar based compressed representation of trajectories"
    - "queries on lz bounded encodings"
    - "press a novel framework of trajectory compression in road networks"
    - "succinct representations of permutations and functions"

Connected through hyperedge HE-6 (induced by source paper "simulating the dna string graph in succinct space"):
  with members:
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"
    - "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-7 (induced by source paper "an index for sequencing reads based on the colored de bruijn graph"):
  with members:
    - "variable order de bruijn graphs"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-8 (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"
    - "practical entropy compressed rank select dictionary"

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)