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 "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"):
  Abstract: This paper investigates the throughput for wireless network with full-duplex radios using stochastic geometry. Full-duplex (FD) radios can exchange data simultaneously with each other. On the other hand, the downside of FD transmission is that it will inevitably cause extra interference to the network compared to half-duplex (HD) transmission. Moreover, the residual self-interference has negative effects on the network throughput. In this paper, we focus on a wireless network of nodes with both HD and FD capabilities and derive and optimize the throughput in such a network. Our analytical result shows that if the network is adapting an ALOHA protocol, the maximal throughput is achieved by scheduling all concurrently transmitting nodes to work in either FD mode or HD mode depending on one simple condition. Moreover, the effects of imperfect self-interference cancellation on the signal-to-interference ratio (SIR) loss and throughput are also analyzed based on our mathematical model. We rigorously quantify the impact of imperfect self-interference cancellation on the throughput gain, transmission range, and other metrics, and we establish the minimum amount of self-interference suppression needed for FD to be beneficial.

Includes members:
  Member "full duplex mimo small cell networks performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "environment aware minimum cost wireless backhaul network planning with full duplex links")
  Member "outage analysis of full duplex architectures in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "directional antennas for interference management in full duplex cellular networks")
  Member "asymptotic deployment gain a simple approach to characterize the sinr distribution in general cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "the mean interference to signal ratio and its key role in cellular and amorphous networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sir analysis via signal fractions")
  Member "throughput analysis for wireless networks with full duplex radios":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of joint pairing and mode selection in d2d communications with fd radios")
  Member "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "pushing the limits of full duplex design and real time implementation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")

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)