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 "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user"):
  Abstract: We consider a centralized caching network, where a server serves several groups of users, each having a common shared fixed-size cache and requesting multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an efficient file delivery scheme by the server to meet the multi-requests of all user-groups. Specifically, the stored coded packets of each cache are classified into four types based on the composition of the file fragments. For each packet type, the corresponding delivery strategy is developed. The rate as well as the worst rate of the proposed delivery scheme are analyzed. We show that our caching model and delivery scheme can incorporate some existing coded caching schemes as special cases. Moreover, for the special case of uniform requests and uncoded prefetching, we make a comparison with an existing scheme, and show that our approach achieves better performance. We also provide numerical results on the delivery rate for the proposed scheme.

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 "novel decentralized coded caching through coded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement")
  Member "modeling analysis and optimization of coded caching in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "from uncoded prefetching to coded prefetching in coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coded caching for heterogeneous systems an optimization perspective")
  Member "fundamental limits of caching improved bounds with coded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "caching and delivery via interference elimination":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "improved approximation of storage rate tradeoff for caching with multiple demands":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "content caching and delivery over heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes")

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)