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 single antenna rayleigh block fading channels at finite blocklength"):
  Abstract: This paper concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation of the maximum coding rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals L over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate already at SNR values of 15 dB and when the number of coherence intervals is 10 or more.

Includes members:
  Member "low complexity joint channel estimation and list decoding of short codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "successive cancellation list decoding of product codes with reed muller component codes")
  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 "efficient error correcting codes in the short blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an efficient algorithm for designing optimal crcs for tail biting convolutional codes")
  Member "short packets over block memoryless fading channels pilot assisted or noncoherent transmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "coherent multiple antenna block fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "short packet communications over multiple antenna rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "diversity versus multiplexing at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels")

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)