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 construction and decoding of concatenated polar codes"
  Abstract: A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $\epsilon > 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-\epsilon}}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-\eps}}$, the frame error probability of Arikan's polar codes. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.

Connected through hyperedge HE-1 (induced by source paper "rate matching for polar codes based on binary domination"):
  with members:
    - "circular buffer rate matched polar codes"
    - "on puncturing strategies for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "capacity achieving rate compatible polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (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-3 (induced by source paper "construction of polar codes for arbitrary discrete memoryless channels"):
  with members:
    - "a comparative study of polar code constructions for the awgn channel"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "practical polar code construction using generalised generator matrices"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "channel upgradation for non binary input alphabets and macs"
    - "universal polar codes"
    - "constructing polar codes using iterative bit channel upgrading"

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"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "a practical approach to polar codes"
    - "concatenated 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 "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"):
  with members:
    - "compound 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"
    - "concatenated polar codes"

Connected through hyperedge HE-6 (induced by source paper "a scalable successive cancellation decoder for polar codes"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "hardware architecture for list sc decoding of polar codes"
    - "list decoding of polar codes"
    - "hardware implementation of successive cancellation decoders for polar codes"
    - "how to construct polar codes"
    - "reduced latency sc polar decoder architectures"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "increasing the speed of polar list decoders"):
  with members:
    - "fast polar decoders algorithm and implementation"
    - "fast software polar decoders"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "an efficient length and rate preserving concatenation of polar and repetition codes"):
  with members:
    - "list decoding of polar codes"
    - "reduced complexity collaborative decoding of interleaved reed solomon and gabidulin codes"
    - "concatenated 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)