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: "does gaussian approximation work well for the long length polar code construction"
  Abstract: Gaussian approximation (GA) is widely used to construct polar codes. However when the code length is long, the subchannel selection inaccuracy due to the calculation error of conventional approximate GA (AGA), which uses a two-segment approximation function, results in a catastrophic performance loss. In this paper, new principles to design the GA approximation functions for polar codes are proposed. First, we introduce the concepts of polarization violation set (PVS) and polarization reversal set (PRS) to explain the essential reasons that the conventional AGA scheme cannot work well for the long-length polar code construction. In fact, these two sets will lead to the rank error of subsequent subchannels, which means the orders of subchannels are misaligned, which is a severe problem for polar code construction. Second, we propose a new metric, named cumulative-logarithmic error (CLE), to quantitatively evaluate the remainder approximation error of AGA in logarithm. We derive the upper bound of CLE to simplify its calculation. Finally, guided by PVS, PRS and CLE bound analysis, we propose new construction rules based on a multi-segment approximation function, which obviously improve the calculation accuracy of AGA so as to ensure the excellent performance of polar codes especially for the long code lengths. Numerical and simulation results indicate that the proposed AGA schemes are critical to construct the high-performance polar codes.

Connected through hyperedge HE-1 (induced by source paper "sphere constraint based enumeration methods to analyze the minimum weight distribution of polar codes"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "low complexity sphere decoding of polar codes based on optimum path metric"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "capacity approaching polar codes with long codewords and successive cancellation decoding based on improved gaussian approximation"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "a comparative study of polar code constructions for the awgn channel"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the compound capacity of polar codes"

Connected through hyperedge HE-3 (induced by source paper "interleaved polar i polar codes"):
  with members:
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "llr based successive cancellation list decoding of polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "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-4 (induced by source paper "a general construction and encoder implementation of polar codes"):
  with members:
    - "auto generation of pipelined hardware designs for polar encoder"
    - "low complexity puncturing and shortening of polar codes"
    - "rate compatible punctured polar codes optimal construction based on polar spectra"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "polar codes analysis and construction based on polar spectrum"):
  with members:
    - "design of polar codes in 5g new radio"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "optimal puncturing of polar codes with a fixed information set"):
  with members:
    - "polarization weight family methods for polar code construction"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "performance and construction of polar codes on 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)