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: "common message broadcast channels with feedback in the nonasymptotic regime full feedback"
  Abstract: We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case. In particular, for a certain class of antisymmetric broadcast channels, we show that the dispersion is halved. For the variable-length-code setup, we demonstrate that the channel dispersion is zero.

Connected through hyperedge HE-1 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "low latency short packet transmissions fixed length or harq"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "moderate deviation asymptotics for variable length codes with feedback"
    - "coherent multiple antenna block fading channels at finite blocklength"

Connected through hyperedge HE-2 (induced by source paper "on the reliability function of the common message broadcast channel with variable length feedback"):
  with members:
    - "on awgn channels and gaussian macs with variable length feedback"
    - "on gaussian macs with variable length feedback and non vanishing error probabilities"
    - "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "on using feedback in a gaussian channel"
    - "broadcasting a common message with variable length stop feedback codes"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"
    - "error exponents for the gaussian channel with active noisy feedback"

Connected through hyperedge HE-3 (induced by source paper "on gaussian macs with variable length feedback and non vanishing error probabilities"):
  with members:
    - "nonasymptotic coding rate bounds for binary erasure channels with feedback"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "on using feedback in a gaussian channel"
    - "broadcasting a common message with variable length stop feedback codes"
    - "on the dispersions of three network information theory problems"
    - "capacity and coding for the ising channel with feedback"

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)