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: "a practical oblivious map data structure with secure deletion and history independence"
  Abstract: We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding. We also present a new history-independent data structure (a HIRB tree) that can be stored within a vORAM. Together, this construction provides an efficient and practical oblivious data structure (ODS) for a key/value map, and goes further to provide an additional privacy guarantee as compared to prior ODS maps: even upon client compromise, deleted data and the history of old operations remain hidden to the attacker. #R##N#We implement and measure the performance of our system using Amazon Web Services, and the single-operation time for a realistic database (up to $2^{18}$ entries) is less than 1 second. This represents a 100x speed-up compared to the current best oblivious map data structure (which provides neither secure deletion nor history independence) by Wang et al. (CCS 14).

Connected through hyperedge HE-1 (induced by source paper "oblidb oblivious query processing for secure databases"):
  with members:
    - "sgxpectre stealing intel secrets from sgx enclaves via speculative execution"
    - "obladi oblivious serializable transactions in the cloud"
    - "the pyramid scheme oblivious ram for trusted processors"
    - "stealthdb a scalable encrypted database with full sql query support"
    - "software grand exposure sgx cache attacks are practical"
    - "prochlo strong privacy for analytics in the crowd"
    - "sok cryptographically protected database search"
    - "hardidx practical and secure index with sgx"

Connected through hyperedge HE-2 (induced by source paper "sok cryptographically protected database search"):
  with members:
    - "associative array model of sql nosql and newsql databases"
    - "the bigdawg polystore system and architecture"
    - "pope partial order preserving encoding"
    - "graphs matrices and the graphblas seven good reasons"
    - "graphulo implementation of server side sparse matrix multiply in the accumulo database"
    - "graphulo linear algebra graph kernels for nosql databases"
    - "d4m bringing associative arrays to database engines"
    - "computing on masked data to improve the security of big data"

Connected through hyperedge HE-3 (induced by source paper "deterministic stash free write only oram"):
  with members:
    - "datalair efficient block storage with plausible deniability against multi snapshot adversaries"
    - "oblivisync practical oblivious file backup and synchronization"

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)