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 "transport capacity of distributed wireless csma networks"):
  Abstract: In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal capacity scaling law, we show that the optimal capacity scaling law can be achieved using entirely distributed routing and scheduling algorithms. Specifically, we consider a network with nodes Poissonly distributed with unit intensity on a $\sqrt{n}\times\sqrt{n}$ square $B_{n}\subset\Re^{2}$. Furthermore, each node chooses its destination randomly and independently and transmits following a CSMA protocol. By resorting to the percolation theory and by carefully tuning the three controllable parameters in CSMA protocols, i.e. transmission power, carrier-sensing threshold and count-down timer, we show that a throughput of $\Theta\left(\frac{1}{\sqrt{n}}\right)$ is achievable in distributed CSMA networks. Furthermore, we derive the pre-constant preceding the order of the transport capacity by giving an upper and a lower bound of the transport capacity. The tightness of the bounds is validated using simulations.

Includes members:
  Member "towards a simple relationship to estimate the capacity of static and mobile wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput of infrastructure based cooperative vehicular networks")
  Member "high sir transmission capacity of wireless networks with general fading and node distribution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on interference dynamics in matern networks")
  Member "on the throughput delay trade off in georouting networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards a simple relationship to estimate the capacity of static and mobile wireless networks")
  Member "capacity of large scale csma wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective static and adaptive carrier sensing for dense wireless csma networks")
  Member "mean interference in hard core wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "effective carrier sensing in csma networks under cumulative interference":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a stackelberg game model for overlay d2d transmission with heterogeneous rate requirements")

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)