human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "position weighted backpressure intersection control for urban networks"):
  Abstract: Abstract   Decentralized intersection control techniques have received recent attention in the literature as means to overcome scalability issues associated with network-wide intersection control. Chief among these techniques are backpressure (BP) control algorithms, which were originally developed of for large wireless networks. In addition to being light-weight computationally, they come with guarantees of performance at the network level, specifically in terms of network-wide stability. The dynamics in backpressure control are represented using networks of point queues and this also applies to all of the applications to traffic control. As such, BP in traffic fail to capture the spatial distribution of vehicles along the intersection links and, consequently, spill-back dynamics.  This paper derives a position weighted backpressure (PWBP) control policy for network traffic applying continuum modeling principles of traffic dynamics and thus capture the spatial distribution of vehicles along network roads and spill-back dynamics. PWBP inherits the computational advantages of traditional BP. To prove stability of PWBP, (i) a Lyapunov functional that captures the spatial distribution of vehicles is developed; (ii) the capacity region of the network is formally defined in the context of macroscopic network traffic; and (iii) it is proved, when exogenous arrival rates are within the capacity region, that PWBP control is network stabilizing. We conduct comparisons against a real-world adaptive control implementation for an isolated intersection. Comparisons are also performed against other BP approaches in addition to optimized fixed timing control at the network level. These experiments demonstrate the superiority of PWBP over the other control policies in terms of capacity region, network-wide delay, congestion propagation speed, recoverability from heavy congestion (outside of the capacity region), and response to incidents.

Includes members:
  Member "traffic state estimation using stochastic lagrangian dynamics":
    also connected through other hyperedges:
      (none)
  Member "distributed traffic signal control for maximum network throughput":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coordination of autonomous vehicles taxonomy and survey")

Question: Please tell me which class the source paper 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.SY(Systems and Control)