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: "an information theoretic characterization of channels that die"
  Abstract: Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities. We provide a partial ordering of communication channels. A dynamic programming formulation is used to show the structural result that channel state feedback does not improve performance.

Connected through hyperedge HE-1 (induced by source paper "on the throughput of channels that wear out"):
  with members:
    - "energy harvesting transmitters that heat up throughput maximization under temperature constraints"
    - "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"
    - "channels that heat up"

Connected through hyperedge HE-2 (induced by source paper "capacity of electron based communication over bacterial cables the full csi case"):
  with members:
    - "a stochastic model for electron transfer in bacterial cables"
    - "diffusion based nanonetworking a new modulation technique and performance analysis"
    - "capacity of discrete molecular diffusion channels"
    - "the poisson channel with side information"

Connected through hyperedge HE-3 (induced by source paper "communication strategies for low latency trading"):
  with members:
    - "low latency communications"

Connected through hyperedge HE-4 (induced by source paper "the third order term in the normal approximation for singular channels"):
  with members:
    - "channels with cost constraints strong converse and dispersion"
    - "second order coding rates for channels with state"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "peak to average power ratio of good codes for gaussian channel"
    - "moderate deviations in channel coding"
    - "refinement of the sphere packing bound asymmetric channels"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-5 (induced by source paper "moderate deviations in channel coding"):
  with members:
    - "on the dispersions of three network information theory problems"
    - "refinement of the random coding bound"
    - "finite dimensional infinite constellations"
    - "moderate deviations analysis of binary hypothesis testing"
    - "refinement of the sphere packing bound asymmetric channels"
    - "fixed length lossy compression in the finite blocklength regime"
    - "on refined versions of the azuma hoeffding inequality with applications in information theory"
    - "the dispersion of lossy source coding"

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)