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 "optimal content placement for offloading in cache enabled heterogeneous wireless networks"):
  Abstract: Caching at base stations (BSs) is a promising way to offload traffic and eliminate backhaul bottleneck in heterogeneous networks (HetNets). In this paper, we investigate the optimal content placement maximizing the successful offloading probability in a cache-enabled HetNet where a tier of multi-antenna macro BSs (MBSs) is overlaid with a tier of helpers with caches. Based on probabilistic caching framework, we resort to stochastic geometry theory to derive the closed-form successful offloading probability and formulate the caching probability optimization problem, which is not concave in general. In two extreme cases with high and low user-to-helper density ratios, we obtain the optimal caching probability and analyze the impacts of BS density and transmit power of the two tiers and the signal-to-interference-plus-noise ratio (SINR) threshold. In general case, we obtain the optimal caching probability that maximizes the lower bound of successful offloading probability and analyze the impact of user density. Simulation and numerical results show that when the ratios of MBS-to-helper density, MBS-to-helper transmit power and user-to-helper density, and the SINR threshold are large, the optimal caching policy tends to cache the most popular files everywhere.

Includes members:
  Member "energy efficiency of downlink networks with caching at base stations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "cacheable and non cacheable traffic interplay in a relay assisted wireless network")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online convex optimization for caching networks")
  Member "offloading in heterogeneous networks modeling analysis and design insights":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastic geometry analysis of sojourn time in multi tier cellular networks")
  Member "coverage and economy of cellular networks with many base stations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coverage analysis of 3 d dense cellular networks with realistic propagation conditions")
  Member "femtocaching and device to device collaboration a new architecture for wireless video distribution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "multi antenna communication in ad hoc networks achieving mimo gains with simo transmission":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular 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)