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: "concatenated polar codes"
  Abstract: Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed designs improve the probability of error at the cost of significantly increased computational complexity \cite{KorUS09}). In this work we show how the the classical idea of code concatenation -- using "short" polar codes as inner codes and a "high-rate" Reed-Solomon code as the outer code -- results in substantially improved performance. In particular, code concatenation with a careful choice of parameters boosts the rate of decay of the probability of error to almost exponential in the block-length with essentially no loss in computational complexity. We demonstrate such performance improvements for three sets of information-theoretic problems -- a classical point-to-point channel coding problem, a class of multiple-input multiple output channel coding problems, and some network source coding problems.

Connected through hyperedge HE-1 (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-2 (induced by source paper "polar coding for the large hadron collider challenges in code concatenation"):
  with members:
    - "a correlation breaking interleaving of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "on the correlation between polarized becs"
    - "list decoding of polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "attaining capacity with algebraic geometry codes through the u u v construction and koetter vardy soft decoding"):
  with members:
    - "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"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "improving belief propagation decoding of polar codes using scattered exit charts"):
  with members:
    - "fast list decoders for polar codes"
    - "increasing the speed of polar list decoders"
    - "on the construction and decoding of concatenated 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"

Connected through hyperedge HE-5 (induced by source paper "fec assisted parallel decoding of polar coded frames design considerations"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "list decoding of polar codes"
    - "on the decoding complexity of cyclic codes up to the bch bound"

Connected through hyperedge HE-6 (induced by source paper "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"):
  with members:
    - "compound polar codes"
    - "on the construction and decoding of concatenated polar codes"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "how to construct polar codes"
    - "reduced complexity collaborative decoding of interleaved reed solomon and gabidulin codes"

Connected through hyperedge HE-7 (induced by source paper "rate dependent analysis of the asymptotic behavior of channel polarization"):
  with members:
    - "finite length scaling for polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "properties and construction of polar codes"
    - "polar codes for the m user mac"
    - "refined rate of channel polarization"

Connected through hyperedge HE-8 (induced by source paper "polar codes speed of polarization and polynomial gap to capacity"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "universal bounds on the scaling behavior of polar codes"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "capacity achieving multiwrite wom 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)