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: "aspects of polar coded modulation"
  Abstract: We consider the joint design of polar coding and higher-order modulation schemes for ever increased spectral efficiency. The close connection between the polar code construction and the multi-level coding approach is described in detail. Relations between different modulation schemes such as bit-interleaved coded modulation (BICM) and multi-level coding (MLC) in case of polar-coded modulation as well as the influence of the applied labeling rule and the selection of frozen channels are demonstrated.

Connected through hyperedge HE-1 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels"):
  with members:
    - "throughput based design for polar coded modulation"
    - "list decoding of polar codes"
    - "precoding for outage probability minimization on block fading channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "space time coding techniques with bit interleaved coded modulations for mimo block fading channels"
    - "approximately universal codes over slow fading channels"
    - "channel combining and splitting for cutoff rate improvement"

Connected through hyperedge HE-2 (induced by source paper "space time polar coded modulation"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "polar coded modulation with optimal constellation labeling"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "polar coding for secure transmission and key agreement"
    - "polar codes are optimal for lossy 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)