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 "flexible ir harq scheme for polar coded modulation"):
  Abstract: A flexible incremental redundancy hybrid auto- mated repeat request (IR-HARQ) scheme for polar codes is proposed based on dynamically frozen bits and the quasi-uniform puncturing (QUP) algorithm. The length of each transmission is not restricted to a power of two. It is applicable for the binary input additive white Gaussian noise (biAWGN) channel as well as higher-order modulation. Simulation results show that this scheme has similar performance as directly designed polar codes with QUP and outperforms LTE-turbo and 5G-LDPC codes with IR-HARQ.

Includes members:
  Member "an incremental redundancy harq scheme for polar code":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "arum polar coded harq scheme based on incremental channel polarization")
  Member "efficient polar code construction for higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite level quantization procedures for construction and decoding of polar codes")
  Member "bit permuted coded modulation for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient polar code construction for higher order modulation")
  Member "capacity achieving rateless polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "circular buffer rate matched polar codes")
  Member "capacity achieving rate compatible polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "protograph based raptor like ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "a practical approach to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)