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 "short packet transmission via variable length codes in the presence of noisy stop feedback"):
  Abstract: We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. By numerically evaluating our bound, we illustrate that, for fixed latency and reliability constraints, noise in the feedback link can cause a significant increase in the minimum average service time, to the extent that fixed-length codes without feedback may be preferable in some scenarios.

Includes members:
  Member "fast harq over finite blocklength codes a technique for low latency reliable communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of noma current status and open research challenges")
  Member "low latency short packet transmissions fixed length or harq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "ultra reliable and low latency wireless communication tail risk and scale":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis")
  Member "energy latency tradeoff in ultra reliable low latency communication with retransmissions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "short packets over block memoryless fading channels pilot assisted or noncoherent transmission":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "moderate deviation asymptotics for variable length codes with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite blocklength analysis of energy harvesting channels")
  Member "coherent multiple antenna block fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "saddlepoint approximations for short packet wireless communications")

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)