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 "joint fronthaul multicast and cooperative beamforming for cache enabled cloud based small cell networks an mds codes aided approach"):
  Abstract: The performance of cloud-based small cell networks (C-SCNs) relies highly on a capacity-limited fronthaul, which degrade quality of service when it is saturated. Coded caching is a promising approach to addressing these challenges, as it provides abundant opportunities for fronthaul multicast and cooperative transmissions. This paper investigates a cache-enabled C-SCNs, in which small-cell base stations (SBSs) are connected to the central processor via fronthaul, and can prefetch popular contents by applying maximum distance separable (MDS) codes. To fully capture the benefits of fronthaul multicast and cooperative transmissions, an MDS codes-aided transmission scheme is first proposed. We formulate the problem to minimize the content delivery latency by jointly optimizing fronthaul bandwidth allocation, SBS clustering, and beamforming. To efficiently solve the resulting nonlinear integer programming problem, we propose a penalty-based design by leveraging variational reformulations of binary constraints. To improve the solution of the penalty-based design, a greedy SBS clustering design is also developed. Furthermore, closed-form characterization of the optimal solution is obtained, through which the benefits of MDS codes can be quantified. Simulation results are given to demonstrate the significant benefits of the proposed MDS codes-aided transmission scheme.

Includes members:
  Member "joint long term cache allocation and short term content delivery in green cloud small cell networks":
    also connected through other hyperedges:
      (none)
  Member "layered group sparse beamforming for cache enabled green wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint long term cache allocation and short term content delivery in green cloud small cell networks")
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "joint optimization of user association data delivery rate and precoding for cache enabled f rans":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hybrid precoder design for cache enabled millimeter wave radio access networks")
  Member "optimizing mds coded caching in wireless networks with device to device communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "centralized coded caching with user cooperation")
  Member "coded multicast fronthauling and edge caching for multi connectivity transmission in fog radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "delivery time minimization in edge caching synergistic benefits of subspace alignment and zero forcing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "full duplex enabled mobile edge caching from distributed to cooperative caching")
  Member "fronthauling for 5g lte u ultra dense cloud small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficient optimization of wireless powered 5g full duplex cellular networks a mean field game approach")

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)