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: "on the design of efficient csma algorithms for wireless networks"
  Abstract: Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Rajagopalan, Shah, and Shin (2009) shows that, if the link weights are chosen to be of the form log(log(q)) (where q is the queue-length), then throughput optimality is achieved. In this paper, we tighten their result by showing that throughput optimality is preserved even with weight functions of the form log(q)/g(q), where g(q) can be a function that increases arbitrarily slowly. The significance of the result is due to the fact that weight functions of the form log(q)/g(q) seem to achieve the best delay performance in practice.

Connected through hyperedge HE-1 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks"):
  with members:
    - "on the effect of channel fading on greedy scheduling"
    - "internet of things iot a vision architectural elements and future directions"
    - "one to rule them all a general randomized algorithm for buffer management with bounded delay"
    - "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-2 (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"
    - "queue based random access algorithms fluid limits and stability issues"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-3 (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"
    - "queue based random access algorithms fluid limits and stability issues"
    - "movers and shakers kinetic energy harvesting for the internet of things"

Connected through hyperedge HE-4 (induced by source paper "scheduling storms and streams in the cloud"):
  with members:
    - "recent advances in graph partitioning"
    - "randomized scheduling algorithm for queueing networks"

Connected through hyperedge HE-5 (induced by source paper "exploiting the past to reduce delay in csma scheduling a high order markov chain approach"):
  with members:
    - "throughput optimal random access with order optimal delay"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "randomized scheduling algorithm for queueing networks"
    - "distributed link scheduling with constant overhead"

Connected through hyperedge HE-6 (induced by source paper "a fast csma algorithm for deadline constrained scheduling over wireless fading channels"):
  with members:
    - "throughput optimal random access with order optimal delay"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-7 (induced by source paper "utility optimization in heterogeneous networks via csma based algorithms"):
  with members:
    - "multi carrier multi rate utility optimization in heterogeneous networks via csma based algorithms"
    - "distributed resource allocation for proportional fairness in multi band wireless systems"
    - "refim a practical interference management in heterogeneous wireless access networks"

Connected through hyperedge HE-8 (induced by source paper "multi carrier multi rate utility optimization in heterogeneous networks via csma based algorithms"):
  with members:
    - "distributed resource allocation for proportional fairness in multi band wireless systems"
    - "refim a practical interference management in heterogeneous wireless access 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)