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 "lower bounds for oblivious data structures"):
  Abstract: An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for situations where one wishes to store the data structure at an untrusted server. One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). Until very recently, this resulted in an overhead of $\omega(\lg n)$ for the most natural setting of parameters. Moreover, a recent lower bound for ORAMs by Larsen and Nielsen [CRYPTO'18] show that they always incur an overhead of at least $\Omega(\lg n)$ if used in a black box manner. To circumvent the $\omega(\lg n)$ overhead, researchers have instead studied classic data structure problems more directly and have obtained efficient solutions for many such problems such as stacks, queues, deques, priority queues and search trees. However, none of these data structures process operations faster than $\Theta(\lg n)$, leaving open the question of whether even faster solutions exist. In this paper, we rule out this possibility by proving $\Omega(\lg n)$ lower bounds for oblivious stacks, queues, deques, priority queues and search trees.

Includes members:
  Member "bios oram improved privacy preserving data access for parameterized outsourced storage":
    also connected through other hyperedges:
      (none)
  Member "crossing the logarithmic barrier for dynamic boolean data structure lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "amortized dynamic cell probe lower bounds from four party communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "decreasekeys are expensive for external memory priority queues":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "external memory priority queues with decrease key and applications to graph algorithms")
  Member "cell probe lower bounds for dynamic problems via a new communication model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new amortized cell probe lower bounds for dynamic problems")
  Member "new unconditional hardness results for dynamic and online problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic matrix inverse improved algorithms and matching conditional lower bounds")
  Member "the cell probe complexity of dynamic range counting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "privacy preserving group data access via stateless oblivious ram simulation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dr sgx automated and adjustable side channel protection for sgx using data location randomization")

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)