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 wireless networks with full duplex radios"):
  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. 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 always achieved by scheduling all concurrently transmitting nodes to work in FD mode instead of a mixed FD/HD mode or HD mode regardless of the network configurations. Moreover, the throughput gain of using FD transmission over HD transmission is analytically lower and upper bounded.

Includes members:
  Member "pushing the limits of full duplex design and real time implementation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")
  Member "virtual full duplex wireless communication via rapid on off division duplex":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressed neighbour discovery using sparse kerdock matrices")
  Member "neighbor discovery for wireless networks via compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse activity detection for massive connectivity")
  Member "virtual full duplex wireless broadcasting via compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery")
  Member "two way transmission capacity of wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "full duplex mimo small cell networks with interference cancellation")

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)