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 information retrieval from a cellular network with caching at the edge"):
  Abstract: We consider the problem of downloading content from a cellular network where content is cached at the wireless edge while achieving privacy. In particular, we consider private information retrieval (PIR) of content from a library of files, i.e., the user wishes to download a file and does not want the network to learn any information about which file she is interested in. To reduce the backhaul usage, content is cached at the wireless edge in a number of small-cell base stations (SBSs) using maximum distance separable codes. We propose a PIR scheme for this scenario that achieves privacy against a number of spy SBSs that (possibly) collaborate. The proposed PIR scheme is an extension of a recently introduced scheme by Kumar et al. to the case of multiple code rates, suitable for the scenario where files have different popularities. We then derive the backhaul rate and optimize the content placement to minimize it. We prove that uniform content placement is optimal, i.e., all files that are cached should be stored using the same code rate. This is in contrast to the case where no PIR is required. Furthermore, we show numerically that popular content placement is optimal for some scenarios.

Includes members:
  Member "converse for multi server single message pir with side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "the capacity of private information retrieval from decentralized uncoded caching databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "latent variable private information retrieval")
  Member "achieving private information retrieval capacity in distributed storage using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  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 "cache aided private information retrieval with partially known uncoded prefetching fundamental limits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private computation with individual and joint privacy")
  Member "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)