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 "capacity achieving rate compatible polar codes"):
  Abstract: We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits the common characteristics of polar codes optimized for a sequence of successively degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity.

Includes members:
  Member "low complexity puncturing and shortening of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "capacity achieving rateless polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "circular buffer rate matched polar codes")
  Member "protograph based raptor like ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "a hybrid arq scheme based on polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of polar codes in 5g new radio")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reed muller codes theory and algorithms")
  Member "the compound capacity of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes and their quantum domain counterparts")

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)