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: "channel combining and splitting for cutoff rate improvement"
  Abstract: The cutoff rate $R_0(W)$ of a discrete memoryless channel (DMC) $W$ is often used as a figure of merit, alongside the channel capacity $C(W)$. Given a channel $W$ consisting of two possibly correlated subchannels $W_1$, $W_2$, the capacity function always satisfies $C(W_1)+C(W_2) \le C(W)$, while there are examples for which $R_0(W_1)+R_0(W_2) > R_0(W)$. This fact that cutoff rate can be ``created'' by channel splitting was noticed by Massey in his study of an optical modulation system modeled as a $M$'ary erasure channel. This paper demonstrates that similar gains in cutoff rate can be achieved for general DMC's by methods of channel combining and splitting. Relation of the proposed method to Pinsker's early work on cutoff rate improvement and to Imai-Hirakawa multi-level coding are also discussed.

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"
    - "aspects of polar coded modulation"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on the origin of polar coding"):
  with members:
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "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-3 (induced by source paper "polar codes with higher order memory"):
  with members:
    - "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"
    - "on the rate of channel polarization"

Connected through hyperedge HE-4 (induced by source paper "re proving channel polarization theorems an extremality and robustness analysis"):
  with members:
    - "universal polar codes for more capable and less noisy channels and sources"
    - "the symmetric convex ordering a novel partial order for b dmcs ordering the information sets of polar codes"
    - "properties of the polarization transformations for the likelihood ratios of symmetric b dmcs"
    - "extremality for gallager s reliability function e_0"
    - "extremes of error exponents"
    - "list decoding of polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-5 (induced by source paper "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"):
  with members:
    - "on the rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "why block length and delay behave differently if feedback is present"):
  with members:
    - "the price of ignorance the impact of side information on delay for lossless source coding"
    - "balancing forward and feedback error correction for erasure channels with unreliable feedback"

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)