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 finite length performance of polar codes stopping sets error floor and concatenated design"
  Abstract: This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief propagation as the decoding method. We provide a stopping set analysis for the factor graph of polar codes, where we find the size of the minimum stopping set. We also find the girth of the graph for polar codes. Our analysis along with bit error rate (BER) simulations demonstrate that finite-length polar codes show superior error floor performance compared to the conventional capacity-approaching coding techniques. In order to take advantage from this property while avoiding the shortcomings of polar codes, we consider the idea of combining polar codes with other coding schemes. We propose a polar code-based concatenated scheme to be used in Optical Transport Networks (OTNs) as a potential real-world application. Comparing against conventional concatenation techniques for OTNs, we show that the proposed scheme outperforms the existing methods by closing the gap to the capacity while avoiding error floor, and maintaining a low complexity at the same time.

Connected through hyperedge HE-1 (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"
    - "does gaussian approximation work well for the long length polar code construction"
    - "universal 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"
    - "the compound capacity of polar codes"

Connected through hyperedge HE-2 (induced by source paper "partially permuted multi trellis belief propagation for polar codes"):
  with members:
    - "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"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "partitioned successive cancellation list decoding of polar codes"
    - "list decoding of 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-3 (induced by source paper "threshold secure coding with shared key"):
  with members:
    - "distributed multi user secret sharing"
    - "rate compatible polar codes for wireless channels"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "enumeration of minimum hamming weight polar codewords with sublinear complexity"):
  with members:
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "fast simplified successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"

Connected through hyperedge HE-5 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "on puncturing strategies for polar codes"

Connected through hyperedge HE-6 (induced by source paper "polar like codes and asymptotic tradeoff among block length code rate and error probability"):
  with members:
    - "performance bounds of concatenated polar coding schemes"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "a note on some inequalities used in channel polarization and polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"

Connected through hyperedge HE-7 (induced by source paper "study of polarization driven shortening for polar codes designed with the gaussian approximation"):
  with members:
    - "low complexity puncturing and shortening of polar codes"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "rate compatible punctured polar codes optimal construction based on polar spectra"
    - "capacity achieving rate compatible polar codes"
    - "a hybrid arq scheme based on polar codes"
    - "a practical approach to polar codes"

Connected through hyperedge HE-8 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

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)