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 coded caching in wireless networks trade off between storage and latency"):
  Abstract: This paper studies the decentralized coded caching for a Fog Radio Access Network (F-RAN), whereby two edge-nodes (ENs) connected to a cloud server via fronthaul links with limited capacity are serving the requests of $K_r$ users. We consider all ENs and users are equipped with caches. A decentralized content placement is proposed to independently store contents at each network node during the off-peak hours. After that, we design a coded delivery scheme in order to deliver the user demands during the peak-hours under the objective of minimizing the normalized delivery time (NDT), which refers to the worst case delivery latency. An information-theoretic lower bound on the minimum NDT is derived for arbitrary number of ENs and users. We evaluate numerically the performance of the decentralized scheme. Additionally, we prove the approximate optimality of the decentralized scheme for a special case when the caches are only available at the ENs.

Includes members:
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "degrees of freedom of cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cloud and cache aided wireless networks fundamental latency trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving spatial scalability for coded caching over wireless networks")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)