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: "bilayer protograph codes for half duplex relay channels"
  Abstract: This paper presents a high-performing LDPC code for the relay channel that addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality and are not easily adapted, without extensive re-optimization, for various channel conditions. This paper presents a code for the relay channel that combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a protograph. In addition to the contribution to relay encoding, we also produce an improved family of protograph codes for the point-to-point AWGN channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity.

Connected through hyperedge HE-1 (induced by source paper "coding and system design for quantize map and forward relaying"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "parallel bit interleaved coded modulation"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "interference mitigation through limited receiver cooperation"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "coding for the non orthogonal amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "performance analysis of protograph ldpc codes for nakagami m fading relay channels"):
  with members:
    - "performance analysis of protograph based ldpc codes with spatial diversity"

Connected through hyperedge HE-3 (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"
    - "threshold saturation on bms channels via spatial coupling"
    - "split extended ldpc codes for coded cooperation"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "bilayer ldpc convolutional codes for half duplex relay channels"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "rate equivocation optimal spatially coupled ldpc codes for the bec wiretap channel"
    - "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)