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: "split extended ldpc codes for coded cooperation"
  Abstract: We propose a new code design that aims to distribute an LDPC code over a relay channel. It is based on a split-and-extend approach, which allows the relay to split the set of bits connected to some parity-check of the LDPC code into two or several subsets. Subsequently, the sums of bits within each subset are used in a repeat-accumulate manner in order to generate extra bits sent from the relay toward the destination. We show that the proposed design yields LDPC codes with enhanced correction capacity and can be advantageously applied to existing codes, which allows for addressing cooperation issues for evolving standards. Finally, we derive density evolution equations for the proposed design, and we show that Split-Extended LDPC codes can approach very closely the capacity of the Gaussian relay channel.

Connected through hyperedge HE-1 (induced by source paper "threshold improvement of low density lattice codes via spatial coupling"):
  with members:
    - "threshold saturation on channels with memory via spatial coupling"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "coupled graphical models and their thresholds"
    - "improvement of bp based cdma multiuser detection by spatial coupling"
    - "spatially coupled codes over the multiple access channel"
    - "spatially coupled protograph based ldpc codes for decode and forward in erasure relay channel"
    - "the effect of spatial coupling on compressive sensing"
    - "threshold saturation on bms channels via spatial coupling"

Connected through hyperedge HE-2 (induced by source paper "spatially coupled protograph based ldpc codes for decode and forward in erasure relay channel"):
  with members:
    - "threshold saturation on channels with memory via spatial coupling"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "spatially coupled codes over the multiple access channel"
    - "bilayer protograph codes for half duplex relay channels"
    - "threshold saturation on bms channels via spatial coupling"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "bilayer low density parity check codes for decode and forward in relay channels"

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)