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: "simple channel coding bounds"
  Abstract: New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergence", which is a generalization of Renyi's divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.

Connected through hyperedge HE-1 (induced by source paper "on the conditional smooth renyi entropy and its applications in guessing and source coding"):
  with members:
    - "non asymptotic fundamental limits of guessing subject to distortion"
    - "a characterization of guesswork on swiftly tilting curves"
    - "non asymptotic and asymptotic fundamental limits of guessing subject to distortion"
    - "multi user guesswork and brute force security"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "variable length compression allowing errors extended"
    - "variable length compression allowing errors"
    - "guesswork large deviations and shannon entropy"

Connected through hyperedge HE-2 (induced by source paper "a finite block length achievability bound for low probability of detection communication"):
  with members:
    - "covert communication with finite blocklength in awgn channels"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-3 (induced by source paper "on achievable rates of awgn energy harvesting channels with block energy arrival and non vanishing error probabilities"):
  with members:
    - "finite blocklength achievable rates for energy harvesting awgn channels with infinite buffer"
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy harvesting wireless communications a review of recent advances"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "second order coding rates for channels with state"

Connected through hyperedge HE-4 (induced by source paper "a tight upper bound on the second order coding rate of parallel gaussian channels with feedback"):
  with members:
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-5 (induced by source paper "beta beta bounds finite blocklength analog of the golden formula"):
  with members:
    - "minimum energy to send k bits over multiple antenna fading channels"

Connected through hyperedge HE-6 (induced by source paper "a proof of the strong converse theorem for gaussian multiple access channels"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "a case where interference does not affect the channel dispersion"
    - "on the dispersions of three network information theory problems"
    - "second order rate region of constant composition codes for the multiple access channel"
    - "a finite blocklength perspective on gaussian multi access channels"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-7 (induced by source paper "achievable rates for gaussian degraded relay channels with non vanishing error probabilities"):
  with members:
    - "on the reliability function of the discrete memoryless relay channel"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "optimum power control at finite blocklength"

Connected through hyperedge HE-8 (induced by source paper "fundamental limits of communication with low probability of detection"):
  with members:
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "effective secrecy reliability confusion and stealth"

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)