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 "decentralized caching and coded delivery with distinct cache capacities"):
  Abstract: Decentralized proactive caching and coded delivery is studied in a content delivery network, where each user is equipped with a cache memory, not necessarily of equal capacity. Cache memories are filled in advance during the off-peak traffic period in a decentralized manner, i.e., without the knowledge of the number of active users, their identities, or their particular demands. User demands are revealed during the peak traffic period, and are served simultaneously through an error-free shared link. The goal is to find the minimum delivery rate during the peak traffic period that is sufficient to satisfy all possible demand combinations. A group-based decentralized caching and coded delivery scheme is proposed, and it is shown to improve upon the state-of-the-art in terms of the minimum required delivery rate when there are more users in the system than files. Numerical results indicate that the improvement is more significant as the cache capacities of the users become more skewed. A new lower bound on the delivery rate is also presented, which provides a tighter bound than the classical cut-set bound.

Includes members:
  Member "coded caching and content delivery with heterogeneous distortion requirements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "coded caching for a large number of users":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "fundamental limits of caching improved bounds with coded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "the performance analysis of coded cache in wireless fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cache aided communications with multiple antennas at finite snr")
  Member "online coded caching":
    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 "coded caching with nonuniform demands":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels")

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)