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: "construction and analysis of polar and concatenated polar codes practical approach"
  Abstract: We consider two problems related to polar codes. First is the problem of polar codes construction and analysis of their performance without Monte-Carlo method. The formulas proposed are the same as those in [Mori-Tanaka], yet we believe that our approach is original and has clear advantages. The resulting computational procedure is presented in a fast algorithm form which can be easily implemented on a computer. Secondly, we present an original method of construction of concatenated codes based on polar codes. We give an algorithm for construction of such codes and present numerical experiments showing significant performance improvement with respect to original polar codes proposed by Ar\i kan. We use the term \emph{concatenated code} not in its classical sense (e.g. [Forney]). However we believe that our usage is quite appropriate for the exploited construction. Further, we solve the optimization problem of choosing codes minimizing the block error of the whole concatenated code under the constraint of its fixed rate.

Connected through hyperedge HE-1 (induced by source paper "multi kernel polar codes concept and design principles"):
  with members:
    - "design of polar codes in 5g new radio"
    - "low complexity puncturing and shortening of polar codes"
    - "on the successive cancellation decoding of polar codes with arbitrary linear binary kernels"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "multi kernel construction of polar codes"
    - "binary polarization kernels from code decompositions"
    - "from polar to reed muller codes a technique to improve the finite length performance"

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"
    - "on the construction and decoding of concatenated polar codes"
    - "universal polar 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)