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: "a practical approach to polar codes"
  Abstract: In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density Parity-Check (LDPC) codes. We will show that our proposed scheme outperforms conventional concatenation schemes formed by LDPC and Reed-Solomon (RS) codes. We then study two rate-compatible coding schemes using polar codes. We will see that polar codes can be designed as universally capacity achieving rate-compatible codes over a set of physically degraded channels. We also study the effect of puncturing on polar codes to design rate-compatible codes.

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

Connected through hyperedge HE-2 (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"
    - "does gaussian approximation work well for the long length polar code construction"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "optimal puncturing of polar codes with a fixed information set"):
  with members:
    - "polarization weight family methods for polar code construction"
    - "does gaussian approximation work well for the long length polar code construction"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (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-5 (induced by source paper "circular buffer rate matched polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "relaxed polar codes"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "multi kernel construction of polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"

Connected through hyperedge HE-6 (induced by source paper "flexible ir harq scheme for polar coded modulation"):
  with members:
    - "an incremental redundancy harq scheme for polar code"
    - "efficient polar code construction for higher order modulation"
    - "bit permuted coded modulation for polar codes"
    - "capacity achieving rateless polar codes"
    - "capacity achieving rate compatible polar codes"
    - "protograph based raptor like ldpc codes"
    - "list decoding 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"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"

Connected through hyperedge HE-8 (induced by source paper "channel estimation with systematic polar codes"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "performance of polar codes for channel and source coding"

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)