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: "recovering multiplexing loss through successive relaying using repetition coding"
  Abstract: In this paper, a transmission protocol is studied for a two relay wireless network in which simple repetition coding is applied at the relays. Information-theoretic achievable rates for this transmission scheme are given, and a space-time V-BLAST signalling and detection method that can approach them is developed. It is shown through the diversity multiplexing tradeoff analysis that this transmission scheme can recover the multiplexing loss of the half-duplex relay network, while retaining some diversity gain. This scheme is also compared with conventional transmission protocols that exploit only the diversity of the network at the cost of a multiplexing loss. It is shown that the new transmission protocol offers significant performance advantages over conventional protocols, especially when the interference between the two relays is sufficiently strong.

Connected through hyperedge HE-1 (induced by source paper "alternate distributed beamforming for decode and forward multi relay systems using buffers"):
  with members:
    - "buffer aided relaying with adaptive link selection"
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source"):
  with members:
    - "decoupled uplink and downlink in a wireless system with buffer aided relaying"
    - "virtual full duplex buffer aided relaying in the presence of inter relay interference"
    - "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"
    - "selective cooperative relaying over time varying channels"
    - "superposition coded concurrent decode and forward relaying"
    - "a simple cooperative diversity method based on network path selection"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-3 (induced by source paper "power allocation and effective capacity of af successive relays"):
  with members:
    - "effective capacity of receive antenna selection mimo ostbc systems in co channel interference"
    - "characterization of effective capacity in antenna selection mimo systems"
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-4 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks"):
  with members:
    - "on the degrees of freedom of the large scale interfering two way relay network"
    - "codebook based opportunistic interference alignment"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "opportunistic downlink interference alignment"
    - "parallel opportunistic routing in wireless networks"
    - "opportunistic interference alignment for mimo interfering multiple access channels"
    - "degrees of freedom of two hop wireless networks everyone gets the entire cake"
    - "opportunistic interference mitigation achieves optimal degrees of freedom in wireless multi cell uplink networks"

Connected through hyperedge HE-5 (induced by source paper "relay pair selection with source precoding in buffer aided successive opportunistic relaying"):
  with members:
    - "decoupled uplink and downlink in a wireless system with buffer aided relaying"
    - "virtual full duplex buffer aided relaying in the presence of inter relay interference"
    - "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"
    - "selective cooperative relaying over time varying channels"
    - "superposition coded concurrent decode and forward relaying"
    - "a simple cooperative diversity method based on network path selection"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-6 (induced by source paper "symbol level selective full duplex relaying with power and location optimization"):
  with members:
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-7 (induced by source paper "virtual full duplex buffer aided relaying in the presence of inter relay interference"):
  with members:
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "buffer aided relaying with adaptive link selection"
    - "adaptive mode selection in bidirectional buffer aided relay networks with fixed transmit powers"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "experiment driven characterization of full duplex wireless systems"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-8 (induced by source paper "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"):
  with members:
    - "buffer aided relaying with adaptive link selection"
    - "opportunistic buffered decode wait and forward obdwf protocol for mobile wireless relay networks"
    - "relay selection for two way relaying with amplify and forward protocols"
    - "splitting algorithms for fast relay selection generalizations analysis and a unified view"
    - "superposition coded concurrent decode and forward relaying"
    - "a simple cooperative diversity method based on network path selection"

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)