human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "self sustainability of energy harvesting systems concept analysis and design"
  Abstract: Ambient energy harvesting is touted as a low cost solution to prolong the life of low-powered devices, reduce the carbon footprint, and make the system self-sustainable. Most research to date have focused either on the physical aspects of energy conversion process or on optimal consumption policy of the harvested energy at the system level. However, although intuitively understood, to the best of our knowledge, the idea of self-sustainability is yet to be made precise and studied as a performance metric. In this paper, we provide a mathematical definition of the concept of self-sustainability of an energy harvesting system, based on the complementary idea of eventual outage. In particular, we analyze the harvest-store-consume system with infinite battery capacity, stochastic energy arrivals, and fixed energy consumption rate. Using the random walk theory, we identify the necessary condition for the system to be self-sustainable. General formulas are given for the self-sustainability probability in the form of integral equations. Since these integral equations are difficult to solve analytically, an exponential upper bound for eventual outage probability is given using martingales. This bound guarantees that the eventual outage probability can be made arbitrarily small simply by increasing the initial battery energy. We also give an asymptotic formula for eventual outage. For the special case when the energy arrival follows a Poisson process, we are able to find the exact formulas for the eventual outage probability. We also show that the harvest-store-consume system is mathematically equivalent to a $GI/G/1$ queueing system, which allows us to easily find the outage probability, in case the necessary condition for self-sustainability is violated. Monte-Carlo simulations verify our analysis.

Connected through hyperedge HE-1 (induced by source paper "on the performance of renewable energy powered uav assisted wireless communications"):
  with members:
    - "spatial and temporal management of cellular hetnets with multiple solar powered drones"
    - "extracting the most weighted throughput in uav empowered wireless systems with nonlinear energy harvester"
    - "optimal 3d trajectory design and resource allocation for solar powered uav communication systems"
    - "uav enabled wireless power transfer trajectory design and energy region characterization"
    - "optimal transport theory for power efficient deployment of unmanned aerial vehicles"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"
    - "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs"
    - "drone small cells in the clouds design deployment and performance analysis"

Connected through hyperedge HE-2 (induced by source paper "optimal energy distribution with energy packet networks"):
  with members:
    - "energy harvesting wireless communications a review of recent advances"
    - "adaptive dispatching of tasks in the cloud"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling in an energy harvesting communication system"

Question: Please tell me which class the center node 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)