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: "bidirectional multi pair network with a mimo relay beamforming strategies and lack of duality"
  Abstract: We address the problem of a multi-user relay network, where multiple single-antenna node pairs want to exchange information by using a multiple antenna relay node. Due to the half-duplex constraint of the relay, the exchange of information takes place in two steps. In the first step, the nodes transmit their data to the relay, while in the second step, the relay is broadcasting the data by using linear and non-linear precoding strategies. We focus on the second step in this paper. We first consider the problem of maximizing the overall rate achievable using linear and dirty-paper type precoding strategies at the relay. Then, we consider minimizing the total power at the relay subject to individual SINR constraints using the same strategies at the relay. We show that the downlink-uplink duality does not hold for the setup considered here, which is a somewhat surprising result. We also show that the beamforming strategy which is optimal in the single-pair case performs very well in the multi-pair case for practically relevant SNR. The results are illustrated by numerical simulations.

Connected through hyperedge HE-1 (induced by source paper "multipair two way relay network with harvest then transmit users resolving pairwise uplink downlink coupling"):
  with members:
    - "rank two beamforming and power allocation in multicasting relay networks"
    - "on the efficiency of far field wireless power transfer"
    - "joint beamforming optimization and power control for full duplex mimo two way relay channel"
    - "spatial domain simultaneous information and power transfer for mimo channels"
    - "joint transceiver and power splitter design over two way relaying channel with lattice codes and energy harvesting"
    - "secure and green swipt in distributed antenna networks with limited backhaul capacity"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "beamforming for miso interference channels with qos and rf energy transfer"

Connected through hyperedge HE-2 (induced by source paper "cyclic communication and the inseparability of mimo multi way relay channels"):
  with members:
    - "spectral and energy efficiency in 3 way relay channels with circular message exchanges"
    - "simultaneous diagonalization on the dof region of the k user mimo multi way relay channel"
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "approximate sum capacity of the y channel"
    - "degrees of freedom for the mimo multi way relay channel"
    - "the deterministic multicast capacity of 4 node relay networks"
    - "the degrees of freedom of the mimo y channel"
    - "optimal transmit power allocation for mimo two way cognitive relay networks with multiple relays"

Connected through hyperedge HE-3 (induced by source paper "simultaneous diagonalization on the dof region of the k user mimo multi way relay channel"):
  with members:
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "approximate sum capacity of the y channel"
    - "degrees of freedom for the mimo multi way relay channel"
    - "the deterministic multicast capacity of 4 node relay networks"
    - "the degrees of freedom of the mimo y channel"
    - "optimal transmit power allocation for mimo two way cognitive relay networks with multiple relays"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "on the equal rate capacity of the awgn multiway relay channel"

Connected through hyperedge HE-4 (induced by source paper "approximate sum capacity of the y channel"):
  with members:
    - "degrees of freedom of two hop wireless networks everyone gets the entire cake"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the linear shift deterministic y channel"
    - "on the sum capacity of the y channel"
    - "the multi way relay channel"
    - "capacity region of the deterministic multi pair bi directional relay network"

Connected through hyperedge HE-5 (induced by source paper "the degrees of freedom of the mimo y channel"):
  with members:
    - "lattice coding for the two way two relay channel"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "on the sum capacity of the y channel"
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"
    - "capacity of the gaussian two way relay channel to within 1 2 bit"
    - "broadcast capacity region of two phase bidirectional relaying"

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)