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: "fast compressed tries through path decompositions"
  Abstract: Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many variants and implementations to overcome some of their limitations. We explore new succinct representations of path-decomposed tries and experimentally evaluate the corresponding reduction in space usage and memory latency, comparing with the state of the art. We study two cases of applications: (1) a compressed dictionary for (compressed) strings, and (2) a monotone minimal perfect hash for strings that preserves their lexicographic order. #R##N#For (1), we obtain data structures that outperform other state-of-the-art compressed dictionaries in space efficiency, while obtaining predictable query times that are competitive with data structures preferred by the practitioners. In (2), our tries perform several times faster than other trie-based monotone perfect hash functions, while occupying nearly the same space.

Connected through hyperedge HE-1 (induced by source paper "top tree compression of tries"):
  with members:
    - "dynamic packed compact tries revisited"
    - "universal compressed text indexing"
    - "packed compact tries a fast and efficient data structure for online string processing"
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "time space trade offs for lempel ziv compressed indexing"
    - "compressed indexing with signature grammars"
    - "deterministic indexing for packed strings"
    - "composite repetition aware data structures"

Connected through hyperedge HE-2 (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"
    - "from theory to practice plug and play with succinct data structures"

Connected through hyperedge HE-3 (induced by source paper "improved compressed string dictionaries"):
  with members:
    - "dynamic packed compact tries revisited"
    - "deterministic indexing for packed strings"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-4 (induced by source paper "dynamic packed compact tries revisited"):
  with members:
    - "top tree compression of tries"

Connected through hyperedge HE-5 (induced by source paper "lz compressed string dictionaries"):
  with members:
    - "compressed string dictionaries"

Connected through hyperedge HE-6 (induced by source paper "the wavelet trie maintaining an indexed sequence of strings in compressed space"):
  with members:
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-7 (induced by source paper "external memory bisimulation reduction of big graphs"):
  with members:
    - "efficient external memory bisimulation on dags"

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)