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 "polar codes and their quantum domain counterparts"):
  Abstract: Arikan’s polar codes are capable of approaching Shannon’s capacity at a low encoding and decoding complexity, while conveniently supporting rate adaptation. By virtue of these attractive features, polar codes have found their way into the 5G New Radio (NR). Hence, in this paper we provide a comprehensive survey of polar codes, highlighting the major milestones achieved in the last decade. Furthermore, we also provide tutorial insights into the operation of the polar encoder, decoders as well as their code construction methods. We also extend our discussions to quantum polar codes with an emphasis on the underlying quantum-to-classical isomorphism and the syndrome-based quantum polar decoders.

Includes members:
  Member "reinforcement learning for nested polar code construction":
    also connected through other hyperedges:
      (none)
  Member "decoder tailored polar code design using the genetic algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning based polar code design")
  Member "genetic algorithm based polar code construction for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "improved bit flipping algorithm for successive cancellation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep learning aided successive cancellation decoding of polar codes")
  Member "design of polar codes in 5g new radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar decreasing monomial cartesian codes")
  Member "belief propagation decoding of polar codes on permuted factor graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "crc aided belief propagation list decoding of polar codes")
  Member "improved successive cancellation flip decoding of polar codes based on error distribution":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep learning aided successive cancellation decoding of polar codes")
  Member "belief propagation list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")

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)