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: "compound polar codes"
  Abstract: A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar codes and then discuss our proposed scheme. Instead of encoding separately across the individual underlying channels, which requires multiple encoders and decoders, we take advantage of the recursive structure of polar codes to construct a unified scheme with a single encoder and decoder that can be used over the multi-channels. We prove that the scheme achieves the capacity over this multi-channel. Numerical analysis and simulation results for BICM channels at finite block lengths shows a considerable improvement in the probability of error comparing to a conventional separated scheme.

Connected through hyperedge HE-1 (induced by source paper "design of polar codes for parallel channels with an average power constraint"):
  with members:
    - "efficient polar code construction for higher order modulation"
    - "list decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (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-3 (induced by source paper "a low complexity recursive approach toward code domain noma for massive communications"):
  with members:
    - "practical power balanced non orthogonal multiple access"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"

Connected through hyperedge HE-4 (induced by source paper "relaxed polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "polar codes for broadcast channels"
    - "fast polar decoders algorithm and implementation"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "universal polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "list decoding of polar codes"
    - "polar codes for the two user multiple access channel"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-6 (induced by source paper "flexible and low complexity encoding and decoding of systematic polar codes"):
  with members:
    - "low latency software polar decoders"
    - "on the error performance of systematic polar codes"
    - "fast polar decoders algorithm and implementation"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-7 (induced by source paper "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"):
  with members:
    - "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"
    - "concatenated polar codes"

Connected through hyperedge HE-8 (induced by source paper "universal source polarization and an application to a multi user problem"):
  with members:
    - "universal polar codes for more capable and less noisy channels and sources"
    - "conditions for robustness of polar codes in the presence of channel mismatch"
    - "universal polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the compound capacity of polar codes"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

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)