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 "full coded caching gains for cache less users"):
  Abstract: The work identifies the performance limits of the multiple-input single-output broadcast channel where cache-aided users coincide with users that do not have caches. The main contribution is a new algorithm that employs perfect matchings on a bipartite graph to offer full multiplexing as well as full coded-caching gains to both cache-aided as well as cache-less users. This performance is shown to be within a factor of at most 3 from the optimal, under the assumption of linear one-shot schemes. #R##N#An interesting outcome is the following: starting from a single-stream centralized coded caching setting with normalized cache size $\gamma$, then every addition of an extra transmit antenna allows for the addition of approximately $1/\gamma$ extra \emph{cache-less} users, at no added delay costs. For example, starting from a single-stream coded caching setting with $\gamma = 1/100$, every addition of a transmit antenna, allows for serving approximately an additional $100$ more cache-less users, without any increase in the overall delay. Finally the work reveals the role of multiple antennas in removing the penalties typically associated to cache-size unevenness, as it shows that the performance in the presence of both cache-less and cache-aided users, matches the optimal (under uncoded cache placement) performance of the corresponding symmetric case where the same cumulative cache volume is split evenly across all users.

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 "benefits of coded placement for networks with heterogeneous cache sizes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case")
  Member "coded caching with shared caches fundamental limits with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "coded caching for heterogeneous systems an optimization perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  Member "centralized caching with unequal cache sizes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels")
  Member "adding transmitters dramatically boosts coded caching gains for finite file sizes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "coded caching with heterogeneous cache sizes and link qualities the two user case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "achieving spatial scalability for coded caching over wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching")

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)