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 "cache enabled broadcast packet erasure channels with state feedback"):
  Abstract: We consider a cache-enabled K-user broadcast erasure packet channel in which a server with a library of N files wishes to deliver a requested file to each user who is equipped with a cache of a finite memory M. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by decentralized cache placement, we characterize the optimal rate region as a function of the memory size, the erasure probability. The proposed delivery scheme, based on the scheme proposed by Gatzianas et al., exploits the receiver side information established during the placement phase. Our results enable us to quantify the net benefits of decentralized coded caching in the presence of erasure. The role of state feedback is found useful especially when the erasure probability is large and/or the normalized memory size is small.

Includes members:
  Member "joint cache channel coding over erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "effect of number of users in multi level coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "the performance analysis of coded cache in wireless fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cache aided communications with multiple antennas at finite snr")
  Member "coded caching with nonuniform demands":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels")
  Member "fundamental limits of distributed caching in d2d wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "multiuser broadcast erasure channel with feedback capacity and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "benefits of coding on age of information in broadcast networks")

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)