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 "fundamentals of heterogeneous cellular networks with energy harvesting"):
  Abstract: We develop a new tractable model for K-tier heterogeneous cellular networks (HetNets), where each base station (BS) is powered solely by a self-contained energy harvesting module. The BSs across tiers differ in terms of the energy harvesting rate, energy storage capacity, transmit power and deployment density. Since a BS may not always have enough energy, it may need to be kept OFF and allowed to recharge while nearby users are served by neighboring BSs that are ON. We show that the fraction of time a k^{th} tier BS can be kept ON, termed availability \rho_k, is a fundamental metric of interest. Using tools from random walk theory, fixed point analysis and stochastic geometry, we characterize the set of K-tuples (\rho_1, \rho_2, ... \rho_K), termed the availability region, that is achievable by general uncoordinated operational strategies, where the decision to toggle the current ON/OFF state of a BS is taken independently of the other BSs. If the availability vector corresponding to the optimal system performance, e.g., in terms of rate, lies in this availability region, there is no performance loss due to the presence of unreliable energy sources. As a part of our analysis, we model the temporal dynamics of the energy level at each BS as a birth-death process, derive the energy utilization rate, and use hitting/stopping time analysis to prove that there exists a fundamental limit on \rho_k that cannot be surpassed by any uncoordinated strategy.

Includes members:
  Member "spatial throughput of mobile ad hoc networks powered by energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "throughput and energy efficiency analysis of small cell networks with multi antenna base stations":
    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 "sinr based k coverage probability in cellular networks with arbitrary shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion")
  Member "downlink mimo hetnets modeling ordering results and performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "downlink rate distribution in heterogeneous cellular networks under generalized cell selection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "offloading in heterogeneous networks modeling analysis and design insights":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "modeling non uniform ue distributions in downlink cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fog massive mimo a user centric seamless hot spot architecture")
  Member "analytical modeling of uplink cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynamic tdd interference analysis in macro cell and small cell deployments")

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)