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 "on coded caching with private demands"):
  Abstract: Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the user's local cache memory without knowledge of later demands. For the shared-link caching model, Maddah-Ali and Niesen (MAN) proposed a two-phase (placement and delivery phases) coded caching strategy, which is order optimal within a constant factor. However, in the MAN scheme, each user can obtain the information about the demands of other users, i.e., the MAN scheme is inherently prone to tampering and spying the activity/demands of other users. In this paper, we formulate a shared-link caching model with private demands. Our goal is to design a two-phase private caching scheme with minimum load while preserving the privacy of the demands of each user with respect to other users. Two private caching schemes are proposed with some (order) optimality results. We also propose a private scheme to further reduce the transmitted load for the case where each user has a distinct request, e.g., in practical asynchronous streaming users always have distinct demands. Finally, this scheme is extended to the general demand case, which is order optimal for any memory size, but with an extremely high sub-packetization level. While the ensemble of our results essentially close the problem of (order) optimal coded caching subject to the privacy of users' demands, the problem of how to achieve this optimality in the small memory regime without an exponentially large expansion of the sub-packetization order remains as an interesting open problem for future investigation.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "the capacity of private information retrieval from uncoded storage constrained databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "device to device secure coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "secrecy capacity memory tradeoff of erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the caching broadcast channel with a wire and cache tapping adversary of type ii")
  Member "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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-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)