human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the reliability function of the common message broadcast channel with variable length feedback"):
  Abstract: We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically degraded. For the achievability part, we adapt Yamamoto and Itoh's coding scheme by controlling the expectation of the maximum of a set of stopping times. For the converse part, we adapt Burnashev's proof techniques for establishing the reliability functions for (point-to-point) discrete memoryless channels with variable-length feedback and sequential hypothesis testing.

Includes members:
  Member "common message broadcast channels with feedback in the nonasymptotic regime full feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "on awgn channels and gaussian macs with variable length feedback":
    also connected through other hyperedges:
      (none)
  Member "on gaussian macs with variable length feedback and non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance of viterbi decoding with and without arq on rician fading channels")
  Member "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on gaussian macs with variable length feedback and non vanishing error probabilities")
  Member "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a tight upper bound on the second order coding rate of parallel gaussian channels with feedback")
  Member "on using feedback in a gaussian channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on gaussian macs with variable length feedback and non vanishing error probabilities")
  Member "broadcasting a common message with variable length stop feedback codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "common message broadcast channels with feedback in the nonasymptotic regime full feedback")
  Member "opportunistic capacity and error exponent regions for compound channel with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "moderate deviation asymptotics for variable length codes with feedback")

Question: Please tell me which class the source paper 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)