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 "on finite length performance of polar codes stopping sets error floor and concatenated design"):
  Abstract: This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief propagation as the decoding method. We provide a stopping set analysis for the factor graph of polar codes, where we find the size of the minimum stopping set. We also find the girth of the graph for polar codes. Our analysis along with bit error rate (BER) simulations demonstrate that finite-length polar codes show superior error floor performance compared to the conventional capacity-approaching coding techniques. In order to take advantage from this property while avoiding the shortcomings of polar codes, we consider the idea of combining polar codes with other coding schemes. We propose a polar code-based concatenated scheme to be used in Optical Transport Networks (OTNs) as a potential real-world application. Comparing against conventional concatenation techniques for OTNs, we show that the proposed scheme outperforms the existing methods by closing the gap to the capacity while avoiding error floor, and maintaining a low complexity at the same time.

Includes members:
  Member "rate dependent analysis of the asymptotic behavior of channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability")
  Member "universal bounds on the scaling behavior of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "searching for voltage graph based ldpc tailbiting codes with large girth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "a variant of list plus crc concatenated polar code":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recursive descriptions of polar codes")
  Member "on the construction of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "how to construct 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)