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: "a channel that heats up"
  Abstract: Motivated by on-chip communication, a channel model is proposed where the variance of the additive noise depends on the weighted sum of the past channel input powers. For this channel, an expression for the capacity per unit cost is derived, and it is shown that the expression holds also in the presence of feedback.

Connected through hyperedge HE-1 (induced by source paper "low snr capacity of noncoherent fading channels"):
  with members:
    - "multipath channels of bounded capacity"
    - "low snr capacity of fading channels mimo and delay spread"
    - "optimal constellations for the low snr noncoherent mimo block rayleigh fading channel"
    - "on the low snr capacity of peak limited non coherent fading channels with memory"
    - "low snr capacity of fading channels with peak and average power constraints"
    - "how good is phase shift keying for peak limited rayleigh fading channels in the low snr regime"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-2 (induced by source paper "the price of certainty waterslide curves and the gap to capacity"):
  with members:
    - "a hot channel"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "optimal memoryless encoding for low power off chip data buses"
    - "capacity achieving codes with bounded graphical complexity on noisy channels"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-3 (induced by source paper "green codes energy efficient short range communication"):
  with members:
    - "the price of certainty waterslide curves and the gap to capacity"

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)