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 computation with individual and joint privacy"):
  Abstract: This paper considers the problem of single-server Private Computation (PC) in the presence of Side Information (SI). In this problem, there is a server that stores $K$ i.i.d. messages, and a user who has a subset of $M$ uncoded messages or a coded linear combination of them as side information, where the identities of these messages are unknown to the server. The user wants to privately compute (via downloading information from the server) a linear combination of a subset of $D$ other messages, where the identities of these messages must be kept private individually or jointly. For each setting, we define the capacity as the supremum of all achievable download rates. #R##N#We characterize the capacity of both PC with coded and uncoded SI when individual privacy is required, for all $K, M, D$. Our results indicate that both settings have the same capacity. In addition, we establish a non-trivial lower bound on the capacity of PC with coded SI when joint privacy is required, for a range of parameters $K, M, D$. This lower bound is the same as the lower bound we previously established on the capacity of PC with uncoded SI when joint privacy is required.

Includes members:
  Member "on an equivalence between single server pir with side information and locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the role of coded side information in single server private information retrieval")
  Member "private information retrieval with private coded side information the multi server case":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private sequential function computation")
  Member "single server single message online private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the role of coded side information in single server private information retrieval")
  Member "single server multi message individually private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the role of coded side information in single server private information retrieval")
  Member "the role of coded side information in single server private information retrieval":
    also connected through other hyperedges:
      (none)
  Member "multi server private information retrieval with coded side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the role of coded side information in single server private information retrieval")
  Member "achievable rate of private function retrieval from mds coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of private monomial computation")
  Member "multi message private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")

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)