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 "sok cryptographically protected database search"):
  Abstract: Protected database search systems cryptographically isolate the roles of reading from, writing to, and administering the database. This separation limits unnecessary administrator access and protects data in the case of system breaches. Since protected search was introduced in 2000, the area has grown rapidly; systems are offered by academia, start-ups, and established companies. #R##N#However, there is no best protected search system or set of techniques. Design of such systems is a balancing act between security, functionality, performance, and usability. This challenge is made more difficult by ongoing database specialization, as some users will want the functionality of SQL, NoSQL, or NewSQL databases. This database evolution will continue, and the protected search community should be able to quickly provide functionality consistent with newly invented databases. #R##N#At the same time, the community must accurately and clearly characterize the tradeoffs between different approaches. To address these challenges, we provide the following contributions: #R##N#1) An identification of the important primitive operations across database paradigms. We find there are a small number of base operations that can be used and combined to support a large number of database paradigms. #R##N#2) An evaluation of the current state of protected search systems in implementing these base operations. This evaluation describes the main approaches and tradeoffs for each base operation. Furthermore, it puts protected search in the context of unprotected search, identifying key gaps in functionality. #R##N#3) An analysis of attacks against protected search for different base queries. #R##N#4) A roadmap and tools for transforming a protected search system into a protected database, including an open-source performance evaluation platform and initial user opinions of protected search.

Includes members:
  Member "associative array model of sql nosql and newsql databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ai data wrangling with associative arrays")
  Member "the bigdawg polystore system and architecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ai data wrangling with associative arrays")
  Member "pope partial order preserving encoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cpar cloud assisted privacy preserving image annotation with randomized kd forest")
  Member "graphs matrices and the graphblas seven good reasons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "automatically harnessing sparse acceleration")
  Member "graphulo implementation of server side sparse matrix multiply in the accumulo database":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "streaming 1 9 billion hypersparse network updates per second with d4m")
  Member "graphulo linear algebra graph kernels for nosql databases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "a practical oblivious map data structure with secure deletion and history independence":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "oblidb oblivious query processing for secure databases")
  Member "d4m bringing associative arrays to database engines":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ai enabling technologies a survey")

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