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 "probabilistic medium access control for full duplex networks with half duplex clients"):
  Abstract: The feasibility of practical in-band full-duplex radios has recently been demonstrated experimentally. One way to leverage full-duplex in a network setting is to enable three-node full-duplex, where a full- duplex access point (AP) transmits data to one node yet simultaneously receives data from another node. Such three-node full-duplex communication however introduces inter-client interference, directly impacting the full-duplex gain. It hence may not always be beneficial to enable three-node full-duplex transmissions. In this paper, we present a distributed full-duplex medium access control (MAC) protocol that allows an AP to adaptively switch between full-duplex and half-duplex modes. We formulate a model that determines the probabilities of full-duplex and half-duplex access so as to maximize the expected network throughput. A MAC protocol is further proposed to enable the AP and clients to contend for either full-duplex or half-duplex transmissions based on their assigned probabilities in a distributed way. Our evaluation shows that, by combining the advantages of centralized probabilistic scheduling and distributed random access, our design improves the overall throughput by 2.70x and 1.53x, on average, as compared to half-duplex 802.11 and greedy downlink-uplink client pairing.

Includes members:
  Member "full duplex radio for uplink downlink wireless access with spatially random nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transmission capacity of full duplex mimo ad hoc network with limited self interference cancellation")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "distributed full duplex via wireless side channels bounds and protocols":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cache aided full duplex small cells")
  Member "full duplex bidirectional mimo achievable rates under limited dynamic range":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "pushing the limits of full duplex design and real time implementation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")
  Member "cellular systems with full duplex compress and forward relaying and cooperative base stations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hardware impairments aware transceiver design for full duplex amplify and forward mimo relaying")

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.NI(Networking and Internet Architecture)