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 "the effective entropy of next previous larger smaller value queries"):
  Abstract: We study the problem of storing the minimum number of bits required to answer next/previous larger/smaller value queries on an array $A$ of $n$ numbers, without storing $A$. We show that these queries can be answered by storing at most $3.701 n$ bits. Our result improves the result of Jo and Satti [TCS 2016] that gives an upper bound of $4.088n$ bits for this problem.

Includes members:
  Member "simultaneous encodings for range and next previous larger smaller value queries":
    also connected through other hyperedges:
      (none)
  Member "an encoding for order preserving matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "string periods in the order preserving model")
  Member "optimal encodings for range top k selection and min max":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "encoding two dimensional range top k queries revisited")
  Member "combined data structure for previous and next smaller values":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space efficient construction of lyndon arrays in linear time")

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)