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: "throughput optimal random access with order optimal delay"
  Abstract: In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low (average) packet delay for large wireless networks. In particular, the delay under U-CSMA policy becomes order-optimal. For one-hop traffic, delay is defined to be order-optimal if it is O(1), i.e., it stays bounded, as the network-size increases to infinity. Using mean field theory techniques, we analytically show that for torus (grid-like) interference topologies with one-hop traffic, to achieve a network load of $\rho$, the delay under U-CSMA policy becomes $O(1/(1-\rho)^{3})$ as the network-size increases, and hence, delay becomes order optimal. We conduct simulations for general random geometric interference topologies under U-CSMA policy combined with congestion control to maximize a network-wide utility. These simulations confirm that order optimality holds, and that we can use U-CSMA policy jointly with congestion control to operate close to the optimal utility with a low packet delay in arbitrarily large random geometric topologies. To the best of our knowledge, it is for the first time that a simple distributed scheduling policy is proposed that in addition to throughput/utility-optimality exhibits delay order-optimality.

Connected through hyperedge HE-1 (induced by source paper "efficient csma using regional free energy approximations"):
  with members:
    - "explicit back off rates for achieving target throughputs in csma ca networks"
    - "free energy approximations for csma networks"
    - "adaptive csma under the sinr model efficient approximation algorithms for throughput and utility maximization"
    - "csma using the bethe approximation scheduling and utility maximization"
    - "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"

Connected through hyperedge HE-2 (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"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "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-3 (induced by source paper "optimal csma based wireless communication with worst case delay and non uniform sizes"):
  with members:
    - "a fast csma algorithm for deadline constrained scheduling over wireless fading channels"
    - "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"

Connected through hyperedge HE-4 (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"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "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-5 (induced by source paper "exploiting the past to reduce delay in csma scheduling a high order markov chain approach"):
  with members:
    - "on the design of efficient csma algorithms for 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"
    - "distributed link scheduling with constant overhead"

Connected through hyperedge HE-6 (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"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "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 "queue based random access algorithms fluid limits and stability issues"):
  with members:
    - "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 "delay performance and mixing times in random access networks"):
  with members:
    - "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.IT(Information Theory)