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: "energy harvesting transmitters that heat up throughput maximization under temperature constraints"
  Abstract: Motivated by the damage due to heating in sensor operation, we consider the throughput optimal offline data scheduling problem in an energy harvesting transmitter, such that the resulting temperature remains below a critical level. We model the temperature dynamics of the transmitter as a linear system and determine the optimal transmit power policy under such temperature constraints as well as energy harvesting constraints over an additive white Gaussian noise channel. We first derive the structural properties of the solution for the general case with multiple energy arrivals. We show that the optimal power policy is piecewise monotone decreasing with possible jumps at the energy harvesting instants. We derive analytical expressions for the optimal solution in the single energy arrival case. We show that, in the single energy arrival case, the optimal power is monotone decreasing, the resulting temperature is monotone increasing, and both remain constant after the temperature hits the critical level. We then generalize the solution for the multiple energy arrival case.

Connected through hyperedge HE-1 (induced by source paper "coded status updates in an energy harvesting erasure channel"):
  with members:
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "timely updates over an erasure channel"
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "age minimization in energy harvesting communications energy controlled delays"
    - "age minimal transmission in energy harvesting two hop networks"
    - "update or wait how to keep your data fresh"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"

Connected through hyperedge HE-2 (induced by source paper "scheduling a human channel"):
  with members:
    - "near optimal online distortion minimization for energy harvesting nodes"
    - "energy harvesting communications under explicit and implicit temperature constraints"
    - "channels that heat up"

Connected through hyperedge HE-3 (induced by source paper "energy harvesting communications under explicit and implicit temperature constraints"):
  with members:
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "energy harvesting two hop communication networks"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "on channels with action dependent states"
    - "broadcasting with an energy harvesting rechargeable transmitter"

Connected through hyperedge HE-4 (induced by source paper "on the throughput of channels that wear out"):
  with members:
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "dissipation of information in channels with input constraints"
    - "channels with cost constraints strong converse and dispersion"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "an information theoretic characterization of channels that die"
    - "channels that heat up"

Connected through hyperedge HE-5 (induced by source paper "energy latency and reliability tradeoffs in coding circuits"):
  with members:
    - "on the total power capacity of regular ldpc codes with iterative message passing decoders"
    - "information theory of molecular communication directions and challenges"
    - "on scaling rules for energy of vlsi polar encoders and decoders"
    - "information friction and its implications on minimum energy required for communication"
    - "on the energy complexity of ldpc decoder circuits"
    - "energy efficient decoders for compressive sensing fundamental limits and implementations"
    - "modeling and energy optimization of ldpc decoder circuits with timing violations"
    - "computing linear transformations with unreliable components"

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)