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 "optimal puncturing of polar codes with a fixed information set"):
  Abstract: For a given polar code construction, the existing literature on puncturing for polar codes focuses in finding the optimal puncturing pattern, and then re-selecting the information set. This paper devotes itself to find the optimal puncturing pattern when the information set is fixed. Puncturing the coded bits corresponding to the worst quality bit channels, called the worst quality puncturing (WQP), is proposed, which is analyzed to minimize the bit channel quality loss at the punctured positions. Simulation results show that WQP outperforms the best existing puncturing schemes when the information set is fixed.

Includes members:
  Member "polarization weight family methods for polar code construction":
    also connected through other hyperedges:
      (none)
  Member "does gaussian approximation work well for the long length polar code construction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sphere constraint based enumeration methods to analyze the minimum weight distribution of polar codes")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "performance and construction of polar codes on symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)