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: "capacity region of gaussian multiple access channels with energy harvesting and energy cooperation"
  Abstract: We consider the capacity region of a $K$-user multiple access channel (MAC) with energy harvesting transmitters. Each user stores and schedules the randomly arriving energy using an energy buffer. Users can also perform energy cooperation by transmitting energy to other users or receiving energy from them. We derive the capacity region of this channel and show that 1) the capacity region coincides with that of a traditional $K$-user Gaussian MAC with energy cooperation, where the average power constraints are equal to the battery recharging rates of the energy harvesting case; 2) each rate on the capacity region boundary can be achieved using the save-and-forward power control and a fixed energy cooperation policy.

Connected through hyperedge HE-1 (induced by source paper "fog assisted multi user swipt networks local computing or offloading"):
  with members:
    - "group cooperation with optimal resource allocation in wireless powered communication networks"
    - "simultaneous wireless information and power transfer in cooperative relay networks with rateless codes"
    - "joint offloading and computing optimization in wireless powered mobile edge computing systems"
    - "joint computation and communication cooperation for mobile edge computing"
    - "transceiver design to maximize the weighted sum secrecy rate in full duplex swipt systems"
    - "energy efficient resource allocation for mobile edge computation offloading"
    - "power delay tradeoff in multi user mobile edge computing systems"
    - "decentralized computation offloading game for mobile cloud computing"

Connected through hyperedge HE-2 (induced by source paper "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "capacity analysis of discrete energy harvesting channels"
    - "capacity of the energy harvesting gaussian mac"
    - "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost"
    - "weighted sum transmit power minimization for full duplex system with swipt and self energy recycling"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy recycling full duplex radios for next generation networks"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

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)