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 "private proximity retrieval codes"):
  Abstract: A \emph{private proximity retrieval} (\emph{PPR}) scheme is a protocol which allows a user to retrieve the identities of all records in a database that are within some distance $r$ from the user's record $x$. The user's \emph{privacy} at each server is given by the fraction of the record $x$ that is kept private. In this paper, this research is initiated and protocols that offer trade-offs between privacy and computational complexity and storage are studied. In particular, we assume that each server stores a copy of the database and study the required minimum number of servers by our protocol which provides a given privacy level. Each server gets a query in the protocol and the set of queries forms a code. We study the family of codes generated by the set of queries and in particular the minimum number of codewords in such a code which is the minimum number of servers required for the protocol. These codes are closely related to a family of codes known as \emph{covering designs}. We introduce several lower bounds on the sizes of such codes as well as several constructions. This work focuses on the case when the records are binary vectors together with the Hamming distance. Other metrics such as the Johnson metric are also investigated.

Includes members:
  Member "capacity of private linear computation for coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private computation with individual and joint privacy")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "private computation of systematically encoded data with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of private monomial computation")
  Member "private polynomial computation from lagrange encoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the capacity of private monomial computation")
  Member "achieving private information retrieval capacity in distributed storage using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  Member "the capacity of private information retrieval from byzantine and colluding databases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "private function retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private computation with individual and joint privacy")
  Member "linear symmetric private information retrieval for mds coded distributed storage with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers")

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.IT(Information Theory)