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 "a high efficiency mac protocol for wlans providing fairness in dense scenarios"):
  Abstract: Collisions are a main cause of throughput degradation in wireless local area networks. The current contention mechanism used in the IEEE 802.11 networks is called carrier sense multiple access with collision avoidance (CSMA/CA). It uses a binary exponential backoff technique to randomize each contender attempt of transmitting, effectively reducing the collision probability. Nevertheless, CSMA/CA relies on a random backoff that while effective and fully decentralized, in principle is unable to completely eliminate collisions, therefore degrading the network throughput as more contenders attempt to share the channel. To overcome these situations, carrier sense multiple access with enhanced collision avoidance (CSMA/ECA) is able to create a collision-free schedule in a fully decentralized manner using a deterministic backoff after successful transmissions. Hysteresis and fair share are two extensions of CSMA/ECA to support a large number of contenders in a collision-free schedule. CSMA/ECA offers better throughput than CSMA/CA and short-term throughput fairness. This paper describes CSMA/ECA and its extensions. In addition, it provides the first evaluation results of CSMA/ECA with non-saturated traffic, channel errors, and its performance when coexisting with CSMA/CA nodes. Furthermore, it describes the effects of imperfect clocks over CSMA/ECA and presents a mechanism to leverage the impact of channel errors and the addition/withdrawal of nodes over collision-free schedules. Finally, the experimental results on throughput and lost frames from a CSMA/ECA implementation using commercial hardware and open-source firmware are presented.

Includes members:
  Member "ieee 802 11ax high efficiency wlans":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")
  Member "implementation and experimental evaluation of a collision free mac protocol for wlans":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "collision free operation in high density wlan deployments")
  Member "future evolution of csma protocols for the ieee 802 11 standard":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "advanced ieee 802 11ax tcp aware scheduling under unreliable channels")
  Member "decentralised learning macs for collision free access in wlans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost sharing games for energy efficient multi hop broadcast in wireless networks")
  Member "towards a collision free wlan dynamic parameter adjustment in csma e2ca":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mu mimo mac protocols for wireless local area networks a survey")
  Member "design and analysis of an asynchronous zero collision mac protocol":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "traffic differentiation in dense collision free wlans using csma eca")
  Member "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coexistence mechanism between embb and urllc in 5g 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.NI(Networking and Internet Architecture)