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 "single server single message online private information retrieval with side information"):
  Abstract: In many practical settings, the user needs to retrieve information from a server in a periodic manner, over multiple rounds of communication. In this paper, we discuss the setting in which this information needs to be retrieved privately, such that the identity of all the information retrieved until the current round is protected. This setting can occur in practical situations in which the user needs to retrieve items from the server or a periodic basis, such that the privacy needs to be guaranteed for all the items been retrieved until the current round. We refer to this setting as an \emph{online private information retrieval} as the user does not know the identities of the future items that need to be retrieved from the server. #R##N#Following the previous line of work by Kadhe \emph{et al.}~we assume that the user knows a random subset of $M$ messages in the database as a side information which are unknown to the server. Focusing on scalar-linear settings, we characterize the \emph{per-round capacity}, i.e., the maximum achievable download rate at each round, and present a coding scheme that achieves this capacity. The key idea of our scheme is to utilize the data downloaded during the current round as a side information for the subsequent rounds. We show for the setting with $K$ messages stored at the server, the per-round capacity of the scalar-linear setting is $C_1= ({M+1})/{K}$ for round $i=1$ and ${C_i= {(2^{i-1}(M+1))}/{KM}}$ for round $i\geq2$, provided that ${K}/({M+1})$ is a power of $2$.

Includes members:
  Member "single server multi message individually private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private computation with individual and joint privacy")
  Member "multi message private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "on the capacity of single server multi message private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private computation with individual and joint privacy")
  Member "capacity of single server single message private information retrieval with coded side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private computation with individual and joint privacy")
  Member "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private computation with individual and joint privacy")
  Member "the capacity of cache aided private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")
  Member "cache aided private information retrieval with partially known uncoded prefetching fundamental limits":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private computation with individual and joint privacy")

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)