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 "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets"):
  Abstract: In this paper, we investigate the optimal caching policy, respectively, maximizing the success probability and area spectral efficiency (ASE) in a cache-enabled heterogeneous network (HetNet), where a tier of multi-antenna macro base stations (MBSs) is overlaid with a tier of helpers with caches. Under the probabilistic caching framework, we resort to stochastic geometry theory to derive the success probability and ASE. After finding the optimal caching policies, we analyze the impact of critical system parameters and compare the ASE with traditional HetNet where the MBS tier is overlaid by a tier of pico BSs (PBSs) with limited-capacity backhaul. Analytical and numerical results show that the optimal caching probability is less skewed among helpers to maximize the success probability when the ratios of MBS-to-helper density, MBS-to-helper transmit power, user-to-helper density, or the rate requirement are small, but is more skewed to maximize the ASE in general. Compared with traditional HetNet, the helper density is much lower than the PBS density to achieve the same target ASE. The helper density can be reduced by increasing cache size. With given total cache size within an area, there exists an optimal helper node density that maximizes the ASE.

Includes members:
  Member "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "optimal content placement for offloading in cache enabled heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "edge caching for coverage and capacity aided heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "cache enabled heterogeneous cellular networks comparison and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing performance of random caching in large scale heterogeneous wireless networks with random discontinuous transmission")
  Member "energy efficiency of downlink networks with caching at base stations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  Member "optimal caching placement for d2d assisted wireless caching networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cacheable and non cacheable traffic interplay in a relay assisted wireless network")
  Member "analysis on cache enabled wireless heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online convex optimization for caching 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)