human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "queue based random access algorithms fluid limits and stability issues"
  Abstract: We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. Unfortunately, the type of activation rules for which throughput optimality has been established, may result in excessive queue lengths and delays. The use of more aggressive/persistent access schemes can improve the delay performance, but does not offer any universal maximum-stability guarantees. In order to gain qualitative insight and investigate the (in)stability properties of more aggressive/persistent activation rules, we examine fluid limits where the dynamics are scaled in space and time. In some situations, the fluid limits have smooth deterministic features and maximum stability is maintained, while in other scenarios they exhibit random oscillatory characteristics, giving rise to major technical challenges. In the latter regime, more aggressive access schemes continue to provide maximum stability in some networks, but may cause instability in others. Simulation experiments are conducted to illustrate and validate the analytical results.

Connected through hyperedge HE-1 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks"):
  with members:
    - "open access full duplex wireless in the orbit testbed"
    - "resource allocation and rate gains in practical full duplex systems"
    - "on the capacity regions of single channel and multi channel full duplex links"
    - "probabilistic medium access control for full duplex networks with half duplex clients"
    - "prototyping real time full duplex radios"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"
    - "pushing the limits of full duplex design and real time implementation"

Connected through hyperedge HE-2 (induced by source paper "on the analysis of partially homogeneous nearest neighbour random walks in the quarter plane"):
  with members:
    - "performance analysis of a cooperative wireless network with adaptive relays"
    - "stability conditions for a decentralised medium access algorithm single and multi hop networks"
    - "stable throughput and delay analysis of a random access network with queue aware transmission"

Connected through hyperedge HE-3 (induced by source paper "explicit back off rates for achieving target throughputs in csma ca networks"):
  with members:
    - "csma using the bethe approximation scheduling and utility maximization"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "throughput optimal random access with order optimal delay"
    - "analysis of frequency agile csma wireless networks"
    - "performance of csma in multi channel wireless networks"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"

Connected through hyperedge HE-4 (induced by source paper "maximizing broadcast throughput under ultra low power constraints"):
  with members:
    - "robust neighbor discovery in multi hop multi channel heterogeneous wireless networks"
    - "panda neighbor discovery on a power harvesting budget"
    - "energy harvesting wireless communications a review of recent advances"
    - "on heterogeneous neighbor discovery in wireless sensor networks"
    - "movers and shakers kinetic energy harvesting for the internet of things"
    - "on the design of efficient csma algorithms for wireless networks"

Question: Please tell me which class the center node 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)