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: "mergeable dictionaries with shifts"
  Abstract: We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search, split, and make-set operations are the usual well-known textbook operations. The merge operation merges two sets and the shift operation adds or subtracts an integer from all elements in a set. Note that unlike the join operation on standard balanced search tree structures, such as AVL trees or 2-4 trees, the merge operation has no restriction on the key space of the input sets and supports merging arbitrarily interleaved sets. This problem is a key component in searching Lempel-Ziv compressed texts, in the mergeable trees problem, and in the union-split-find problem. #R##N#We present the first solution achieving O(log U) amortized time for all operations, where {1, 2, ..., U} is the universe of the sets. This bound is optimal when the size of the universe is polynomially bounded by the sum of the sizes of the sets. Our solution is simple and based on a novel extension of biased search trees.

Connected through hyperedge HE-1 (induced by source paper "decompressing lempel ziv compressed text"):
  with members:
    - "time space trade offs for lempel ziv compressed indexing"
    - "lempel ziv decoding in external memory"
    - "approximating lz77 via small space multiple pattern matching"
    - "linear time lempel ziv factorization simple fast small"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"

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)