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 "implementation and experimental evaluation of a collision free mac protocol for wlans"):
  Abstract: Collisions are a main cause of throughput degradation in Wireless LANs. The current contention mechanism for these networks is based on a random backoff strategy to avoid collisions with other transmitters. Even though it can reduce the probability of collisions, the random backoff prevents users from achieving Collision-Free schedules, where the channel would be used more efficiently. Modifying the contention mechanism by waiting for a deterministic timer after successful transmissions, users would be able to construct a Collision-Free schedule among successful contenders. This work shows the experimental results of a Collision-Free MAC (CF-MAC) protocol for WLANs using commercial hardware and open firmware for wireless network cards which is able to support many users. Testbed results show that the proposed CF-MAC protocol leads to a better distribution of the available bandwidth among users, higher throughput and lower losses than the unmodified WLANs clients using a legacy firmware.

Includes members:
  Member "fairness in collision free wlans":
    also connected through other hyperedges:
      (none)
  Member "future evolution of csma protocols for the ieee 802 11 standard":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "cost sharing games for energy efficient multi hop broadcast in wireless networks")
  Member "on the distributed construction of a collision free schedule in multi hop packet radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "uni mumac a unified down up link mu mimo mac protocol for ieee 802 11ac wlans")
  Member "towards a collision free wlan dynamic parameter adjustment in csma e2ca":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a high efficiency mac protocol for wlans providing fairness in dense scenarios")
  Member "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)