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: "transmit power minimization for wireless networks with energy harvesting relays"
  Abstract: Energy harvesting (EH) has recently emerged as a key technology for green communications as it can power wireless networks with renewable energy sources. However, directly replacing the conventional non-EH transmitters by EH nodes will be a challenge. In this paper, we propose to deploy extra EH nodes as relays over an existing non-EH network. Specifically, the considered non-EH network consists of multiple source-destination (S-D) pairs. The deployed EH relays will take turns to assist each S-D pair, and energy diversity can be achieved to combat the low-EH rate of each EH relay. To make the best of these EH relays, with the source transmit power minimization as the design objective, we formulate a joint power assignment and relay selection problem, which, however, is NP-hard. We thus propose a general framework to develop efficient suboptimal algorithms, which is mainly based on a sufficient condition for the feasibility of the optimization problem. This condition yields useful design insights and also reveals an energy hardening effect, which provides the possibility to exempt the requirement of noncausal EH information. Simulation results will show that the proposed co-operation strategy can achieve near-optimal performance and provide significant power savings. Compared to the greedy co-operation method that only optimizes the performance of the current transmission block, the proposed strategy can achieve the same performance with much fewer relays, and the performance gap increases with the number of S-D pairs.

Connected through hyperedge HE-1 (induced by source paper "a survey on mobile edge computing the communication perspective"):
  with members:
    - "mobile edge computing fog et al a survey and analysis of security threats and challenges"
    - "joint energy minimization and resource allocation in c ran with mobile cloud"
    - "latency optimization for resource allocation in mobile edge computation offloading"
    - "a survey on mobile edge networks convergence of computing caching and communications"
    - "proactive edge computing in latency constrained fog networks"
    - "computation peer offloading for energy constrained mobile edge computing in small cell networks"
    - "mobile edge computing a survey on architecture and computation offloading"
    - "online placement of multi component applications in edge computing environments"

Connected through hyperedge HE-2 (induced by source paper "grid energy consumption and qos tradeoff in hybrid energy supply wireless networks"):
  with members:
    - "energy harvesting wireless communications a review of recent advances"
    - "comp meets smart grid a new communication and energy cooperation paradigm"
    - "energy harvesting small cell networks feasibility deployment and operation"
    - "a lyapunov optimization approach for green cellular networks with hybrid energy supplies"
    - "cost minimization for fading channels with energy harvesting and conventional energy"
    - "power allocation for conventional and buffer aided link adaptive relaying systems with energy harvesting nodes"
    - "multiuser joint energy bandwidth allocation with energy harvesting part i optimum algorithm multiple point to point channels"
    - "base station sleeping and resource allocation in renewable energy powered cellular networks"

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)