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 "random caching in backhaul limited multi antenna networks analysis and area spectrum efficiency optimization"):
  Abstract: Caching at base stations is a promising technology to satisfy the increasing capacity requirements and reduce the backhaul loads in future wireless networks. Careful design of random caching can fully exploit the file popularity and achieve good performance. However, previous works on random caching scheme usually assumed single antenna at BSs and users, which is not the case in practical multi-antenna networks. In this paper, we consider the analysis and optimization in the cache-enabled multi-antenna networks with limited backhaul. We first derive a closed-form expression and a simple tight upper bound of the successful transmission probability, using tools from stochastic geometry and a gamma approximation. Based on the analytic results, we then consider the area spectrum efficiency maximization by optimizing design parameters, which is a complicated mixed-integer optimization problem. After analyzing the optimal properties, we obtain a local optimal solution with lower complexity. To further simplify the optimization, we then solve an asymptotic optimization problem in the high user density region, using the upper bound as the objective function. Numerical simulations show that the asymptotic optimal caching scheme achieves better performance over existing caching schemes. The analysis and optimization results provide insightful design guidelines for random caching in practical networks.

Includes members:
  Member "coverage analysis for millimeter wave networks the impact of directional antenna arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analyzing the tradeoffs in using millimeter wave directional links for high data rate tactile internet applications")
  Member "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "a tractable framework for performance analysis of dense multi antenna networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "cooperative caching and transmission design in cluster centric small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "cache enabled heterogeneous cellular networks optimal tier level content placement":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "content centric sparse multicast beamforming for cache enabled cloud ran":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "analysis on cache enabled wireless heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")

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)