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: "optimal power allocation for outage minimization in fading channels with energy harvesting constraints"
  Abstract: This paper studies the optimal power allocation for outage minimization in point-to-point fading channels with the energy-harvesting constraints and channel distribution information (CDI) at the transmitter. Both the cases with non-causal and causal energy state information (ESI) are considered, which correspond to the energy harvesting rates being known and unknown prior to the transmissions, respectively. For the non-causal ESI case, the average outage probability minimization problem over a finite horizon is shown to be non-convex for a large class of practical fading channels. However, the globally optimal "offline" power allocation is obtained by a forward search algorithm with at most $N$ one-dimensional searches, and the optimal power profile is shown to be non-decreasing over time and have an interesting "save-then-transmit" structure. In particular, for the special case of N=1, our result revisits the classic outage capacity for fading channels with uniform power allocation. Moreover, for the case with causal ESI, we propose both the optimal and suboptimal "online" power allocation algorithms, by applying the technique of dynamic programming and exploring the structure of optimal offline solutions, respectively.

Connected through hyperedge HE-1 (induced by source paper "cognitive and energy harvesting based d2d communication in cellular networks stochastic geometry modeling and analysis"):
  with members:
    - "downlink cellular network analysis with multi slope path loss models"
    - "spectrum sharing for device to device communication in cellular networks"
    - "performance analysis of ambient rf energy harvesting a stochastic geometry approach"
    - "simultaneous information and energy transfer in large scale networks with without relaying"
    - "opportunistic wireless energy harvesting in cognitive radio networks"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"
    - "wireless information transfer with opportunistic energy harvesting"
    - "enabling wireless power transfer in cellular networks architecture modeling and deployment"

Connected through hyperedge HE-2 (induced by source paper "optimal scheduling and power allocation for two hop energy harvesting communication systems"):
  with members:
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "training optimization for energy harvesting communication systems"
    - "optimal transmission policies for energy harvesting two hop networks"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "two hop communication with energy harvesting"
    - "capacity of fading gaussian channel with an energy harvesting sensor node"

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.NI(Networking and Internet Architecture)