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 caching improved delivery rate cache capacity trade off"):
  Abstract: We consider a centralized coded caching system consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link. Each user is equipped with a local cache of capacity MF bits. The contents can be proactively cached into the user caches by the server over low traffic period; however, without the knowledge of the user demands. During the peak traffic period each user requests a single file from the database. The goal is to utilize the user caches in order to minimize the number of bits delivered by the server over a shared link, known as the delivery rate, to satisfy all the user demands. We propose a novel coded caching algorithm for the cache capacity of M = N−1 K , when N and K have a common divisor greater than 1, and satisfy 4 ≤ N < K ≤ 3N 2 . It is shown that the proposed scheme achieves a smaller delivery rate than the existing coded caching schemes in the literature for 1 K ≤M ≤ N K when N < K < 3N 2 , and 1 K ≤M ≤ 2N K when K = 3N 2 .

Includes members:
  Member "noisy broadcast networks with receiver caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "centralized coded caching for heterogeneous lossy requests":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cache aided content delivery over erasure broadcast channels")
  Member "decentralized coded caching with distinct cache capacities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching")
  Member "wireless content caching for small cell and d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified framework for constructing centralized coded caching schemes")
  Member "on caching with more users than files":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "joint cache channel coding over erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "the performance analysis of coded cache in wireless fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cache aided communications with multiple antennas at finite snr")
  Member "distortion memory tradeoffs in cache aided wireless video delivery":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "device to device coded caching with distinct cache 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)