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 novel interleaving scheme for polar codes"
  Abstract: It's known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. We call the coupled information bits the correlated bits. In this paper, concatenation schemes are studied for polar codes (as inner codes) and LDPC codes (as outer codes). In a conventional concatenation scheme, to achieve a better BER performance, one can divide all $N_l$ bits in a LDPC block into $N_l$ polar blocks to completely de-correlate the possible coupled errors. In this paper, we propose a novel interleaving scheme between a LDPC code and a polar code which breaks the correlation of the errors among the correlated bits. This interleaving scheme still keeps the simple SC decoding of polar codes while achieves a comparable BER performance at a much smaller delay compared with a $N_l$-block delay scheme.

Connected through hyperedge HE-1 (induced by source paper "a correlation breaking interleaving of polar codes"):
  with members:
    - "on the error performance of systematic polar codes"
    - "fast polar decoders algorithm and implementation"
    - "finite length scaling for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"

Connected through hyperedge HE-2 (induced by source paper "a correlation breaking interleaving of polar codes in concatenated systems"):
  with members:
    - "on the error performance of systematic polar codes"
    - "fast polar decoders algorithm and implementation"
    - "finite length scaling for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "list decoding 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)