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: "capacity achieving rateless polar codes"
  Abstract: A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show that this scheme is capacity-achieving, i.e. its information rate is as good as the best code specifically designed for the unknown channel. Previous rateless coding schemes are designed for specific classes of channels such as AWGN channels, binary erasure channels, etc. but the proposed rateless coding scheme is capacity-achieving for broad classes of channels as long as they are ordered via degradation. Moreover, it inherits the conceptual and computational simplicity of polar codes.

Connected through hyperedge HE-1 (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"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-2 (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 rate compatible polar codes"
    - "protograph based raptor like ldpc codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"

Connected through hyperedge HE-3 (induced by source paper "arum polar coded harq scheme based on incremental channel polarization"):
  with members:
    - "circular buffer rate matched polar codes"
    - "an incremental redundancy harq scheme for polar code"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "an efficient construction of rate compatible punctured polar rcpp codes using hierarchical puncturing"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "capacity achieving rate compatible polar codes"
    - "protograph based raptor like ldpc codes"
    - "a hybrid arq scheme based on polar codes"
    - "list decoding of 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 "an incremental redundancy harq scheme for polar code"):
  with members:
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rate compatible polar codes"
    - "a hybrid arq scheme based on polar codes"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "syndrome coupled rate compatible error correcting codes"):
  with members:
    - "capacity achieving rate compatible polar codes"

Connected through hyperedge HE-7 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-8 (induced by source paper "capacity achieving rate compatible polar codes for general channels"):
  with members:
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "capacity achieving rate compatible polar codes"
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "on the construction of polar codes"
    - "how to construct 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)