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: "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
  Abstract: It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is "almost" time-reversible. Second, we propose transmission-length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.

Connected through hyperedge HE-1 (induced by source paper "throughput optimal decentralized scheduling with single bit state feedback for a class of queueing systems"):
  with members:
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"
    - "message passing for maximum weight independent set"

Connected through hyperedge HE-2 (induced by source paper "heat diffusion pareto optimal dynamic routing for time varying wireless networks"):
  with members:
    - "empirical evaluation of the heat diffusion collection protocol for wireless sensor networks"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "backpressure with adaptive redundancy bwar"
    - "distributed link scheduling with constant overhead"

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"
    - "queue based random access algorithms fluid limits and stability issues"
    - "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 "properties of an aloha like stability region"):
  with members:
    - "log convexity of rate region in 802 11e wlans"
    - "geometric approximations of some aloha like stability regions"

Connected through hyperedge HE-5 (induced by source paper "a stackelberg game model for overlay d2d transmission with heterogeneous rate requirements"):
  with members:
    - "a survey on device to device communication in cellular networks"
    - "spectrum sharing for device to device communication in cellular networks"
    - "aloha games with spatial reuse"
    - "how penalty leads to improvement a measurement study of wireless backoff"
    - "effective carrier sensing in csma networks under cumulative interference"

Connected through hyperedge HE-6 (induced by source paper "a common information based multiple access protocol achieving full throughput and linear delay"):
  with members:
    - "adversarial multiple access channels with individual injection rates"
    - "decentralized stochastic control with partial history sharing a common information approach"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "csma using the bethe approximation scheduling and utility maximization"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "csma over time varying channels optimality uniqueness and limited backoff rate"
    - "complexity of inference in graphical models"
    - "throughput optimal random access with order optimal delay"
    - "applications of belief propagation in csma wireless networks"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "csma over time varying channels optimality uniqueness and limited backoff rate"):
  with members:
    - "a fast csma algorithm for deadline constrained scheduling over wireless fading channels"
    - "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"

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)