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 performance of systematic polar codes"
  Abstract: Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In this paper, we set the theoretical framework to analyze the performance of systematic polar codes. The exact evaluation of the BER of systematic polar codes conditioned on the BER of non-systematic polar codes involves in $2^{NR}$ terms where $N$ is the code block length and $R$ is the code rate, resulting in a prohibitive number of computations for large block lengths. By analyzing the polar code construction and the successive-cancellation (SC) decoding process, we use a statistical model to quantify the advantage of systematic polar codes over non-systematic polar codes, so called the systematic gain in this paper. A composite model is proposed to approximate the dominant error cases in the SC decoding process. This composite model divides the errors into independent regions and coupled regions, controlled by a coupling coefficient. Based on this model, the systematic gain can be conveniently calculated. Numerical simulations are provided in the paper showing very close approximations of the proposed model in quantifying the systematic gain.

Connected through hyperedge HE-1 (induced by source paper "a correlation breaking interleaving of polar codes"):
  with members:
    - "a novel interleaving scheme for 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:
    - "a novel interleaving scheme for 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-3 (induced by source paper "polar codes for secret sharing"):
  with members:
    - "combining and steganography of 3 d face textures"

Connected through hyperedge HE-4 (induced by source paper "flexible and low complexity encoding and decoding of systematic polar codes"):
  with members:
    - "low latency software polar decoders"
    - "fast polar decoders algorithm and implementation"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "compound polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-5 (induced by source paper "a novel interleaving scheme for polar codes"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-6 (induced by source paper "a low complexity encoding algorithm for systematic polar codes"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "fast polar decoders algorithm and implementation"
    - "recursive descriptions of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)