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: "permutation decoding of polar codes"
  Abstract: A new permutation decoding approach for polar codes is presented. The complexity of the algorithm is similar to that of a successive cancellation list (SCL) decoder, while it can be implemented with the latency of a successive cancellation decoder. As opposed to the SCL algorithm, the sorting operation is not used in the proposed method. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.

Connected through hyperedge HE-1 (induced by source paper "partially symmetric monomial codes"):
  with members:
    - "recursive projection aggregation decoding of reed muller codes"
    - "a new permutation decoding method for reed muller codes"
    - "soft decision decoding of reed muller codes recursive lists"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "reed muller codes achieve capacity on erasure channels"
    - "list decoding of polar codes"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-2 (induced by source paper "scan list decoding of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "belief propagation list decoding of polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "on the construction of g_n coset codes for parallel decoding"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "a new permutation decoding method for reed muller codes"
    - "a 5 16gbps decoder asic for polar code in 16nm finfet"
    - "a flip syndrome list polar decoder architecture for ultra low latency communications"
    - "strange attractor for efficient polar code design"
    - "reed muller codes achieve capacity on erasure channels"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of 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)