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 "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  Abstract: The centralized coded caching problem is studied under heterogeneous cache sizes and channel qualities from the server to the users, focusing on the two-user case. More specifically, a server holding $N$ files is considered to be serving two users with different cache sizes, each requesting a single file, and it is assumed that in addition to the shared common link, each user also has a private link from the server available during the delivery phase. Optimal caching and delivery strategies that minimize the worst-case delivery time are presented for any number of files, $N$. The converse proof benefits from Tian's observation that it suffices to consider file-index symmetric caching schemes, while the achievability scheme is obtained through memory-sharing among certain special points. The optimal scheme is shown to exploit all of the private link capacities by transmitting part of the corresponding user's request in an uncoded manner. When there are no private links, the results presented here improve upon the known results in the literature for i) equal cache sizes and arbitrary number of files; and ii) unequal cache sizes and $N=2$ files.

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 "on the fundamental limits of fog ran cache aided networks with downlink and sidelink communications")
  Member "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  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 "coded caching in a multi server system with random topology":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "routing based delivery in combination type networks with random topology")
  Member "benefits of cache assignment on degraded broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on the optimality of separation between caching and delivery in general cache networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asynchronous coded caching")
  Member "cache aided content delivery over erasure broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)