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: "a variant of list plus crc concatenated polar code"
  Abstract: A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach.

Connected through hyperedge HE-1 (induced by source paper "recursive descriptions of polar codes"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "binary polarization kernels from code decompositions"
    - "a scalable successive cancellation decoder for polar codes"

Connected through hyperedge HE-2 (induced by source paper "on finite length performance of polar codes stopping sets error floor and concatenated design"):
  with members:
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "universal bounds on the scaling behavior of polar codes"
    - "list decoding of polar codes"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"

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)