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: "oblivious ram simulation with efficient worst case access overhead"
  Abstract: Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.

Connected through hyperedge HE-1 (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"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-2 (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"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-3 (induced by source paper "bios oram improved privacy preserving data access for parameterized outsourced storage"):
  with members:
    - "data oblivious graph algorithms in outsourced external memory"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "statistically secure oram with tilde o log 2 n overhead"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-4 (induced by source paper "revisiting definitional foundations of oblivious ram for secure processor implementations"):
  with members:
    - "flat oram a simplified write only oblivious ram construction for secure processors"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "towards practical oblivious ram"

Connected through hyperedge HE-5 (induced by source paper "cacheshuffle an oblivious shuffle algorithm using caches"):
  with members:
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "the melbourne shuffle improving oblivious storage in the cloud"
    - "privacy preserving group data access via stateless oblivious ram simulation"

Connected through hyperedge HE-6 (induced by source paper "seqoram a locality preserving write only oblivious ram"):
  with members:
    - "deterministic stash free write only oram"
    - "oblivisync practical oblivious file backup and synchronization"

Connected through hyperedge HE-7 (induced by source paper "flat oram a simplified write only oblivious ram construction for secure processors"):
  with members:
    - "connecting the dots privacy leakage via write access patterns to the main memory"
    - "revisiting definitional foundations of oblivious ram for secure processor implementations"
    - "deterministic stash free write only oram"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "towards practical oblivious ram"

Connected through hyperedge HE-8 (induced by source paper "the melbourne shuffle improving oblivious storage in the cloud"):
  with members:
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "anonymous card shuffling and its applications to parallel mixnets"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "towards practical oblivious ram"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "randomized shellsort a simple oblivious sorting algorithm"

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.CR(Cryptography and Security)