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 low density parity check codes for decode and forward in relay channels"
  Abstract: This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using low-density parity-check (LDPC) codes. Bilayer LDPC codes are devised to approach the theoretically promised rate of the DF relaying strategy by incorporating relay-generated parity bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at the destination. To analyze the performance of bilayer LDPC codes, bilayer density evolution is devised as an extension of the standard density evolution algorithm. Based on bilayer density evolution, a design methodology is developed for the bilayer codes in which the degree distribution is iteratively improved using linear programming. Further, in order to approach to the theoretical DF rate for a wide range of channel parameters, this paper proposes two different forms of bilayer codes: the bilayer-expurgated and bilayer-lengthened codes. It is demonstrated that the rate of a properly designed bilayer LDPC code can closely approach the theoretical DF limit. Finally, it is shown that a generalized version of the proposed bilayer code construction is applicable to relay networks with multiple relays.

Connected through hyperedge HE-1 (induced by source paper "capacity limits of full duplex cellular network"):
  with members:
    - "resource allocation and rate gains in practical full duplex systems"
    - "fundamental limits of spectrum sharing full duplex multicell networks"
    - "opportunistic scheduling for full duplex uplink downlink networks"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "in band full duplex wireless challenges and opportunities"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "gaussian interference channel capacity to within one bit"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "ldpc codes with local and global decoding"):
  with members:
    - "multi block interleaved codes for local and global read access"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-3 (induced by source paper "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes for decode and forward relaying of two correlated sources over the bec"):
  with members:
    - "source channel coding theorems for the multiple access relay channel"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "bilayer ldpc convolutional codes for half duplex relay channels"
    - "ldpc code design for transmission of correlated sources across noisy channels without csit"
    - "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity"
    - "can iterative decoding for erasure correlated sources be universal"
    - "network information flow with correlated sources"

Connected through hyperedge HE-5 (induced by source paper "coding and system design for quantize map and forward relaying"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "bilayer protograph codes for half duplex relay channels"
    - "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"
    - "coding for the non orthogonal amplify and forward cooperative channel"

Connected through hyperedge HE-6 (induced by source paper "distributed soft coding with a soft input soft output siso relay encoder in parallel relay channels"):
  with members:
    - "distributed raptor coding for erasure channels partially and fully coded cooperation"
    - "performance analysis of hybrid relay selection in cooperative wireless systems"
    - "optimal relay functionality for snr maximization in memoryless relay networks"

Connected through hyperedge HE-7 (induced by source paper "on the performance of low density parity check codes for gaussian interference channels"):
  with members:
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-8 (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"
    - "split extended ldpc codes for coded cooperation"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless 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)