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 "fundamental limits of device to device private caching with trusted server"):
  Abstract: In the coded caching problem as originally formulated by Maddah-Ali and Niesen, a server communicates via a noiseless broadcast link to multiple users that have local storage capability. In order for a user to decode the desired file from the coded multicast transmission, the demands of all the users must be globally known, which may violate the privacy of the users. To overcome this privacy problem, Wan and Caire recently proposed several schemes that attain coded multicasting gain while simultaneously guarantee information theoretic privacy of the users'demands. In device to device (D2D) networks, the demand privacy problem is further exacerbated by the fact that each user is also a transmitter, which should know the demanded messages of the other users in order to form coded multicast transmissions. This paper solves this seemingly unfeasible problem with the aid of a trusted server. Specifically, during the delivery phase, the trusted server collects the users' demands and sends a query to each user, who then broadcasts multicast packets according to this query. The main contribution of this paper is the development of novel achievable schemes and converse bounds for D2D private caching with a trusted server, where users may be colluding, that are to within a constant factor of one another.

Includes members:
  Member "on coded caching with private demands":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "subpacketization in coded caching with demand privacy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "device to device private caching with trusted server")
  Member "embedded index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure decentralized pliable index coding")
  Member "private pliable index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure decentralized pliable index coding")
  Member "demand private coded caching and the exact trade off for n k 2":
    also connected through other hyperedges:
      (none)
  Member "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "demand private coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subpacketization in coded caching with demand privacy")
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)