human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "instantaneous relaying optimal strategies and interference neutralization"):
  Abstract: In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals whereas the dumb relays are only able to serve as amplifiers. As the dumb relays are oblivious to the source and destination nodes, the wireless network can be modeled as a relay network with smart instantaneous relay only: the signals of the source-destination link arrive at the same time as the source-relay-destination link. Recently, instantaneous relaying is shown to improve the degrees-of-freedom of the network as compared to the classical cut-set bound. In this paper, we study an achievable rate region and its boundary of the instantaneous interference relay channel in the scenario of (a) uninformed non-cooperative source-destination nodes (source and destination nodes are not aware of the existence of the relay and are non-cooperative) and (b) informed and cooperative source-destination nodes. Further, we examine the performance of interference neutralization: a relay strategy which is able to cancel interference signals at each destination node in the air. We observe that interference neutralization, although promised to achieve desired degrees-of-freedom, may not be feasible if the relay has limited power. Simulation results show that the optimal relay strategies improve the achievable rate region and provide better user-fairness in both uninformed non-cooperative and informed cooperative scenarios.

Includes members:
  Member "capacity of strong and very strong gaussian interference relay without delay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "causal relay networks")
  Member "aligned interference neutralization and the degrees of freedom of the 2 user interference channel with instantaneous relay":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperative algorithms for mimo amplify and forward relay networks")
  Member "rate region frontiers for n user interference channel with interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex radio for uplink downlink wireless access with spatially random nodes")
  Member "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation")
  Member "cooperative interference management with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "intelligent reflecting surface aided multiple access capacity region and deployment strategy")
  Member "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degrees of freedom region of the mimo interference channel with output feedback and delayed csit")
  Member "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "optimal beamforming for two way multi antenna relay channel with analogue network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")

Question: Please tell me which class the source paper 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)