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 "rnn decoding of linear block codes"):
  Abstract: Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network architecture can improve on standard belief propagation decoding, despite the large example space. In this paper we introduce a recurrent neural network architecture for decoding linear block codes. Our method shows comparable bit error rate results compared to the feed-forward neural network with significantly less parameters. We also demonstrate improved performance over belief propagation on sparser Tanner graph representations of the codes. Furthermore, we demonstrate that the RNN decoder can be used to improve the performance or alternatively reduce the computational complexity of the mRRD algorithm for low complexity, close to optimal, decoding of short BCH codes.

Includes members:
  Member "an introduction to deep learning for the physical layer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on machine learning based performance improvement of wireless networks phy mac and network layer")
  Member "neural offset min sum decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep learning for ul dl channel calibration in generic massive mimo systems")
  Member "on deep learning based channel decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design of capacity approaching low density parity check codes using recurrent neural networks")
  Member "learning to decode linear codes using deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a deep learning framework for optimization of miso downlink beamforming")
  Member "quantized neural networks training neural networks with low precision weights and activations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "switchable precision neural networks")
  Member "effective approaches to attention based neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "attention over parameters for dialogue systems")
  Member "deep residual learning for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "efficient maximum likelihood decoding of linear block codes on binary memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep learning methods for improved decoding of linear codes")

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)