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 "full duplex radio for uplink downlink wireless access with spatially random nodes"):
  Abstract: A full-duplex (FD) multiple antenna access point (AP) communicating with single antenna half-duplex (HD) spatially random users to support simultaneous uplink (UL)/downlink (DL) transmissions is investigated. Since FD nodes are inherently constrained by the loopback interference (LI), we study precoding schemes for the AP based on maximum ratio combining (MRC)/maximal ratio transmission (MRT), zero-forcing, and the optimal scheme for UL and DL sum rate maximization using tools from stochastic geometry. In order to shed insights into the systems performance, simple expressions for single antenna/perfect LI cancellation/negligible internode interference cases are also presented. We show that FD precoding at AP improves the UL/DL sum rate and hence a doubling of the performance of the HD mode is achievable. In particular, our results show that these impressive performance gains remain substantially intact even if the LI cancellation is imperfect. Furthermore, relative performance gap between FD and HD modes increases as the number of transmit/receive antennas becomes large, while with the MRC/MRT scheme, increasing the receive antenna number at FD AP, is more beneficial in terms of sum rate than increasing the transmit antenna number.

Includes members:
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")
  Member "joint beamforming optimization and power control for full duplex mimo two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  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 "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")
  Member "hybrid full half duplex system analysis in heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "widely linear digital self interference cancellation in direct conversion full duplex transceiver":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "a stochastic geometry analysis of inter cell interference coordination and intra cell diversity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sir analysis via signal fractions")

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)