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 "design of polar codes in 5g new radio"):
  Abstract: Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5$^\text{th}$ generation wireless systems (5G) standardization process of the 3$^\text{rd}$ generation partnership project (3GPP) chose polar codes as a channel coding scheme. In this tutorial, we provide a description of the encoding process of polar codes foreseen by the 5G standard. We illustrate the struggles of designing a family of polar codes able to satisfy the demands of 5G systems, with particular attention to rate flexibility and low decoding latency. The result of these efforts is an elaborate framework that applies novel coding techniques to provide a solid channel code for NR requirements.

Includes members:
  Member "on list decoding of 5g nr polar codes":
    also connected through other hyperedges:
      (none)
  Member "parity check polar coding for 5g and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding")
  Member "design and implementation of a polar codes blind detection scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on list decoding of 5g nr polar codes")
  Member "circular buffer rate matched polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "improved successive cancellation flip decoding of polar codes based on error distribution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "partitioned list decoding of polar codes analysis and improvement of finite length performance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sublinear latency for simplified successive cancellation decoding of polar codes")
  Member "on the error probability of short concatenated polar and cyclic codes with interleaving":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient error correcting codes in the short blocklength regime")
  Member "on puncturing strategies for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rate matching for polar codes based on binary domination")

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)