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: "towards a communication theoretic understanding of system level power consumption"
  Abstract: Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This paper models the required decoding power and investigates the minimization of total system power from two complementary perspectives. #R##N#First, an isolated point-to-point link is considered. Using new lower bounds on the complexity of message-passing decoding, lower bounds are derived on decoding power. These bounds show that 1) there is a fundamental tradeoff between transmit and decoding power; 2) unlike the implications of the traditional "waterfall" curve which focuses on transmit power, the total power must diverge to infinity as error probability goes to zero; 3) Regular LDPCs, and not their known capacity-achieving irregular counterparts, can be shown to be power order optimal in some cases; and 4) the optimizing transmit power is bounded away from the Shannon limit. #R##N#Second, we consider a collection of links. When systems both generate and face interference, coding allows a system to support a higher density of transmitter-receiver pairs (assuming interference is treated as noise). However, at low densities, uncoded transmission may be more power-efficient in some cases.

Connected through hyperedge HE-1 (induced by source paper "energy efficient beam coordination strategies with rate dependent processing power"):
  with members:
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "energy efficient precoder design for mimo ofdm with rate dependent circuit power"
    - "pilot reuse for massive mimo transmission over spatially correlated rayleigh fading channels"
    - "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"
    - "on the optimum energy efficiency for flat fading channels with rate dependent circuit power"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"

Connected through hyperedge HE-2 (induced by source paper "performance of energy harvesting receivers with power optimization"):
  with members:
    - "end to end throughput maximization for underlay multi hop cognitive radio networks with rf energy harvesting"
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "robust resource allocation for mimo wireless powered communication networks based on a non linear eh model"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "energy cooperation in energy harvesting communications"
    - "opportunistic wireless energy harvesting in cognitive radio networks"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"

Connected through hyperedge HE-3 (induced by source paper "energy management for energy harvesting wireless sensors with adaptive retransmission"):
  with members:
    - "outage minimization for a fading wireless link with energy harvesting transmitter and receiver"
    - "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "energy optimal transmission scheduling in wireless sensor networks"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-4 (induced by source paper "on the total power capacity of regular ldpc codes with iterative message passing decoders"):
  with members:
    - "on the energy complexity of ldpc decoder circuits"
    - "energy consumption of vlsi decoders"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "two bit message passing decoders for ldpc codes over the binary symmetric channel"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "energy harvesting wireless communications a review of recent advances"):
  with members:
    - "renewable powered cellular networks energy field modeling and network coverage"
    - "dynamic compression transmission for energy harvesting multihop networks with correlated sources"
    - "constrained codes for joint energy and information transfer"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "spatial throughput of mobile ad hoc networks powered by energy harvesting"
    - "energy cooperation in energy harvesting communications"
    - "interactive joint transfer of energy and information"
    - "opportunistic wireless energy harvesting in cognitive radio networks"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes constructed from protographs"):
  with members:
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "spatially coupled random access on graphs"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-7 (induced by source paper "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"):
  with members:
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "convex separable problems with linear constraints in signal processing and communications"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "energy cooperation in energy harvesting communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal scheduling and power allocation for two hop energy harvesting communication systems"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "training optimization for energy harvesting communication systems"

Connected through hyperedge HE-8 (induced by source paper "outage minimization for a fading wireless link with energy harvesting transmitter and receiver"):
  with members:
    - "spatial throughput of mobile ad hoc networks powered by energy harvesting"
    - "energy cooperation in energy harvesting communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "optimal save then transmit protocol for energy harvesting wireless transmitters"
    - "two hop communication with energy harvesting"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"

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)