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 "dynamic path decomposed tries"):
  Abstract: A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation. When limited to static applications, there are a number of highly-compressed keyword dictionaries based on the advancements of practical succinct data structures. However, as most succinct data structures are only efficient in the static case, it is still difficult to implement a keyword dictionary that is space efficient and dynamic. In this article, we propose such a keyword dictionary. Our main idea is to embrace the path decomposition technique, which was proposed for constructing cache-friendly tries. To store the path-decomposed trie in small memory, we design data structures based on recent compact hash trie representations. Exhaustive experiments on real-world datasets reveal that our dynamic keyword dictionary needs up to 68% less space than the existing smallest ones.

Includes members:
  Member "dynamic packed compact tries revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "top tree compression of tries")
  Member "separate chaining meets compact hashing":
    also connected through other hyperedges:
      (none)
  Member "m bonsai a practical compact dynamic trie":
    also connected through other hyperedges:
      (none)
  Member "packed compact tries a fast and efficient data structure for online string processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "top tree compression of tries")
  Member "a framework of dynamic data structures for string processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compact and efficient representation of general graph databases")
  Member "practical evaluation of lempel ziv 78 and lempel ziv welch tries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "separate chaining meets compact hashing")
  Member "from theory to practice plug and play with succinct data structures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bitvectors with runs and the successor predecessor problem")
  Member "fast compressed tries through path decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "top tree compression of tries")

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)