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 "approaching the finite blocklength capacity within 0 025db by short polar codes and crc aided hybrid decoding"):
  Abstract: In this letter, we explore the performance limits of short polar codes and find that the maximum likelihood (ML) performance of a simple CRC-polar concatenated scheme can approach the finite blocklength capacity. Then, in order to approach the ML performance with a low average complexity, a CRC-aided hybrid decoding (CA-HD) algorithm is proposed and its decoding process is divided into two steps. In the first step, the received sequence is decoded by the adaptive successive cancellation list (ADSCL) decoding. In the second step, CRC-aided sphere decoding with a reasonable initial radius is used to decode the received sequence. To obtain the reasonable radius, the CRC bits of the survival paths in ADSCL are recalculated and the minimum Euclidean distance between the survival path and the received sequence is chosen as the initial radius. The simulation results show that CA-HD can achieve within about $0.025$dB of the finite blocklength capacity at the block error ratio $10^{-3}$ with code length $128$ and code rate $1/2$.

Includes members:
  Member "from sequential decoding to channel polarization and back again":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding")
  Member "llr based successive cancellation list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "low complexity sphere decoding of polar codes based on optimum path metric":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sphere constraint based enumeration methods to analyze the minimum weight distribution of polar codes")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  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 "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes theory and algorithms")

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)