human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the error probability of short concatenated polar and cyclic codes with interleaving"
  Abstract: In this paper, the analysis of the performance of the concatenation of a short polar code with an outer binary linear block code is addressed from a distance spectrum viewpoint. The analysis targets the case where an outer cyclic code is employed together with an inner systematic polar code. A concatenated code ensemble is introduced placing an interleaver at the input of the polar encoder. The introduced ensemble allows deriving bounds on the achievable error rates under maximum likelihood decoding, by applying the union bound to the (expurgated) average weight enumerators. The analysis suggests the need of careful optimization of the outer code, to attain low error floors.

Connected through hyperedge HE-1 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on puncturing strategies for polar codes"
    - "polar code construction for list decoding"

Connected through hyperedge HE-2 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"

Connected through hyperedge HE-3 (induced by source paper "polar code construction for list decoding"):
  with members:
    - "minimum distance based construction of multi kernel polar codes"
    - "code design for short blocks a survey"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "performance of polar codes for channel and source coding"

Question: Please tell me which class the center node 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)