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: "control of robotic mobility on demand systems a queueing theoretical perspective"
  Abstract: In this paper we present and analyze a queueing-theoretical model for autonomous mobility-on-demand (MOD) systems where robotic, self-driving vehicles transport customers within an urban environment and rebalance themselves to ensure acceptable quality of service throughout the entire network. We cast an autonomous MOD system within a closed Jackson network model with passenger loss. It is shown that an optimal rebalancing algorithm minimizing the number of (autonomously) rebalancing vehicles and keeping vehicles availabilities balanced throughout the network can be found by solving a linear program. The theoretical insights are used to design a robust, real-time rebalancing algorithm, which is applied to a case study of New York City. The case study shows that the current taxi demand in Manhattan can be met with about 8,000 robotic vehicles (roughly 60% of the size of the current taxi fleet). Finally, we extend our queueing-theoretical setup to include congestion effects, and we study the impact of autonomously rebalancing vehicles on overall congestion. Collectively, this paper provides a rigorous approach to the problem of system-wide coordination of autonomously driving vehicles, and provides one of the first characterizations of the sustainability benefits of robotic transportation networks.

Connected through hyperedge HE-1 (induced by source paper "repositioning bikes with carrier vehicles and bike trailers in bike sharing systems"):
  with members:
    - "dynamic vehicle redistribution and online price incentives in shared mobility systems"

Connected through hyperedge HE-2 (induced by source paper "online matching in a ride sharing platform"):
  with members:
    - "online stochastic matching beating 1 1 e"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-3 (induced by source paper "flow a modular learning framework for autonomy in traffic"):
  with members:
    - "dissipation of stop and go waves via control of autonomous vehicles field experiments"
    - "textworld a learning environment for text based games"
    - "simulation to scaled city zero shot policy transfer for traffic control via autonomous vehicles"
    - "expert level control of ramp metering based on multi task deep reinforcement learning"
    - "rllib abstractions for distributed reinforcement learning"
    - "learning combinatorial optimization algorithms over graphs"
    - "end to end learning for self driving cars"
    - "torchcraft a library for machine learning research on real time strategy games"

Connected through hyperedge HE-4 (induced by source paper "data driven robust taxi dispatch under demand uncertainties"):
  with members:
    - "taxi dispatch with real time sensing data in metropolitan areas a receding horizon control approach"

Connected through hyperedge HE-5 (induced by source paper "managing autonomous mobility on demand systems for better passenger experience"):
  with members:
    - "toward large scale agent guidance in an urban taxi service"

Connected through hyperedge HE-6 (induced by source paper "a queueing network approach to the analysis and control of mobility on demand systems"):
  with members:
    - "gaussian process based decentralized data fusion and active sensing for mobility on demand system"

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.RO(Robotics)