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: "randomized scheduling algorithm for queueing networks"
  Abstract: There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we consider two representative models. One, a model for the collection of wireless nodes communicating through a shared medium, that represents randomly varying number of packets in the queues at the nodes of networks. Two, a buffered circuit switched network model for an optical core of future Internet, to capture the randomness in calls or flows present in the network. The maximum weight scheduling policy proposed by Tassiulas and Ephremide in 1992 leads to a myopic and stable policy for the packet-level wireless network model. But computationally it is very expensive (NP-hard) and centralized. It is not applicable to the buffered circuit switched network due to the requirement of non-premption of the calls in the service. As the main contribution of this paper, we present a stable scheduling algorithm for both of these models. The algorithm is myopic, distributed and performs few logical operations at each node per unit time.

Connected through hyperedge HE-1 (induced by source paper "on non preemptive vm scheduling in the cloud"):
  with members:
    - "scheduling storms and streams in the cloud"
    - "research directions in network service chaining"

Connected through hyperedge HE-2 (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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "scheduling storms and streams in the cloud"):
  with members:
    - "recent advances in graph partitioning"
    - "on the design of efficient csma algorithms for wireless networks"

Connected through hyperedge HE-4 (induced by source paper "speeding up glauber dynamics for random generation of independent sets"):
  with members:
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "message passing for maximum weight independent set"

Connected through hyperedge HE-5 (induced by source paper "concave switching in single and multihop networks"):
  with members:
    - "queue length asymptotics for generalized max weight scheduling in the presence of heavy tailed traffic"

Connected through hyperedge HE-6 (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"
    - "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"

Connected through hyperedge HE-7 (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"
    - "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"
    - "distributed link scheduling with constant overhead"

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"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "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"

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)