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: "privacy preserving access of outsourced data via oblivious ram simulation"
  Abstract: Suppose a client, Alice, has outsourced her data to an external storage provider, Bob, because he has capacity for her massive data set, of size n, whereas her private storage is much smaller--say, of size O(n^{1/r}), for some constant r > 1. Alice trusts Bob to maintain her data, but she would like to keep its contents private. She can encrypt her data, of course, but she also wishes to keep her access patterns hidden from Bob as well. We describe schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithmic amortized increase in access times, with a very high probability of success, while keeping the external storage to be of size O(n). To achieve this, our algorithmic contributions include a parallel MapReduce cuckoo-hashing algorithm and an external-memory dataoblivious sorting algorithm.

Connected through hyperedge HE-1 (induced by source paper "lower bounds for oblivious near neighbor search"):
  with members:
    - "sanns scaling up secure approximate k nearest neighbors search"
    - "hardness of approximate nearest neighbor search"
    - "scalable secure computation of statistical functions with applications to k nearest neighbors"
    - "lower bounds for oblivious data structures"
    - "distributed pcp theorems for hardness of approximation in p"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "new unconditional hardness results for dynamic and online problems"
    - "secure k nearest neighbor query over encrypted data in outsourced environments"

Connected through hyperedge HE-2 (induced by source paper "stronger lower bounds for online oram"):
  with members:
    - "spectre attacks exploiting speculative execution"
    - "lower bounds for oblivious data structures"
    - "revisiting definitional foundations of oblivious ram for secure processor implementations"
    - "statistically secure oram with tilde o log 2 n overhead"
    - "oblivious ram simulation with efficient worst case access overhead"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-3 (induced by source paper "a double edged sword security threats and opportunities in one sided network communication"):
  with members:
    - "obladi oblivious serializable transactions in the cloud"
    - "the end of a myth distributed transactions can scale"
    - "rowhammer js a remote software induced fault attack in javascript"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "towards practical oblivious ram"

Connected through hyperedge HE-4 (induced by source paper "what storage access privacy is achievable with small overhead"):
  with members:
    - "accessing data while preserving privacy"
    - "root oram a tunable differentially private oblivious ram"
    - "differentially private oblivious ram"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "calibrating data to sensitivity in private data analysis"

Connected through hyperedge HE-5 (induced by source paper "sqoram read optimized sequential write only oblivious ram"):
  with members:
    - "datalair efficient block storage with plausible deniability against multi snapshot adversaries"
    - "deterministic stash free write only oram"
    - "oblivisync practical oblivious file backup and synchronization"
    - "oblivious ram simulation with efficient worst case access overhead"

Connected through hyperedge HE-6 (induced by source paper "an algorithmic framework for differentially private data analysis on trusted processors"):
  with members:
    - "the privacy blanket of the shuffle model"
    - "amplification by shuffling from local to central differential privacy via anonymity"
    - "distributed differential privacy via shuffling"
    - "practical locally private heavy hitters"
    - "cachezoom how sgx amplifies the power of cache attacks"
    - "software grand exposure sgx cache attacks are practical"
    - "towards practical differential privacy for sql queries"
    - "prochlo strong privacy for analytics in the crowd"

Connected through hyperedge HE-7 (induced by source paper "lower bounds for oblivious data structures"):
  with members:
    - "bios oram improved privacy preserving data access for parameterized outsourced storage"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "decreasekeys are expensive for external memory priority queues"
    - "cell probe lower bounds for dynamic problems via a new communication model"
    - "new unconditional hardness results for dynamic and online problems"
    - "the cell probe complexity of dynamic range counting"
    - "privacy preserving group data access via stateless oblivious ram simulation"

Connected through hyperedge HE-8 (induced by source paper "more is less perfectly secure oblivious algorithms in the multi server setting"):
  with members:
    - "sub logarithmic distributed oblivious ram with small block size"
    - "data oblivious external memory algorithms for the compaction selection and sorting of outsourced data"

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)