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 "on the limits of coexisting coverage and capacity in multi rat heterogeneous networks"):
  Abstract: This paper devises a general modeling and analyzing framework for a heterogeneous wireless network (HetNet) in which several wireless subnetworks coexist and use multiple radio access technologies (multi-RATs). The coexisting coverage and network capacity in such a multi-RAT HetNet are hardly investigated in prior works. To characterize the coexisting interactions in a multi-RAT HetNet, in this paper we consider a HetNet consisting of K-tier APs and two different RATs, RAT-L and RAT-U, are adopted in the HetNet. RAT-L is adopted by the access points (APs) in the first K-1 tiers and APs in the Kth tier only use RAT-U. Both noncrossing-RAT and crossing-RAT user association scenarios are considered. In each scenario, the void probability and channel access probability of the APs in each tier are first found and then the tight lower bounds and their lowest limits on the proposed coexisting coverage and network capacity are derived. We show that multi-RAT networks in general can achieve higher link coverage and capacity by using opportunistic CSMA/CA that avoids/alleviates severe interfering between all coexisting APs. Also, crossing-RAT user association is shown to achieve much higher coexisting coverage and network capacity than noncrossing-RAT user association. Finally, numerical simulations for the LTE-U and WiFi networks coexisting in the HetNet validate our findings.

Includes members:
  Member "fundamentals of the downlink green coverage and energy efficiency in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "modeling and performance analysis in cache enabled millimeter wave hetnets with access and backhaul integration")
  Member "coexisting success probability and throughput of multi rat wireless networks with unlicensed band access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "traffic management for heterogeneous networks with opportunistic unlicensed spectrum sharing")
  Member "random cell association and void probability in poisson distributed cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mmwave uav networks with multi cell association performance limit and optimization")
  Member "next generation m2m cellular networks challenges and practical considerations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a throughput and energy efficiency scheme for unlicensed massive machine type communications")
  Member "optimal cell load and throughput in green small cell networks with generalized cell association":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mmwave uav networks with multi cell association performance limit and optimization")
  Member "coexistence of wi fi and heterogeneous small cell networks sharing unlicensed spectrum":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "power allocation in multi user cellular networks deep reinforcement learning approaches")
  Member "adaptive downlink comp in heterogeneous cellular networks with imperfect overhead messaging":
    also connected through other hyperedges:
      (none)
  Member "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic geometry analysis of sojourn time in multi tier 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)