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 "transmission capacity of full duplex mimo ad hoc network with limited self interference cancellation"):
  Abstract: In this paper, we propose a joint transceiver beamforming design to mitigate self-interference and inter-node interference simultaneously for full-duplex multiple-input and multiple-output ad-hoc network, and derive the transmission capacity upper bound (TC-UB) for the considered network. Condition on a specified transceiver antenna's configuration, we allow the self-interference effect to be cancelled at transmitter side, and offer an additional degree-of-freedom at receiver side for more inter-node interference cancellation. In addition, due to the imperfect self-interference channel estimation, the derivation of TC-UB needs to take the channel estimation error into account. In this case, the conventional method to obtain the TC-UB is not applicable. This motivates us to exploit the dominating interferer region and then utilize Newton-Raphson method to iteratively formulate the TC-UB. The results show that the derived TC-UB is quite close to the actual one especially when the number of receive-antenna is small. Moreover, our proposed beamforming design outperforms the existing beamforming strategies.

Includes members:
  Member "full duplex mimo small cell networks with interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")
  Member "full duplex radio for uplink downlink wireless access with spatially random nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the outage analysis and finite snr diversity multiplexing tradeoff of hybrid duplex systems for aeronautical communications")
  Member "passive self interference suppression for full duplex infrastructure nodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi objective antenna selection in a full duplex base station")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "multi antenna communication in ad hoc networks achieving mimo gains with simo transmission":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")

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)