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 "how will the presence of autonomous vehicles affect the equilibrium state of traffic networks"):
  Abstract: It is known that connected and autonomous vehicles are capable of maintaining shorter headways and distances when they form platoons of vehicles. Thus, such technologies can result in increases in the capacities of traffic networks. Consequently, it is envisioned that their deployment will boost the network mobility. In this paper, we verify the validity of this impact under selfish routing behavior of drivers in traffic networks with mixed autonomy, i.e. traffic networks with both regular and autonomous vehicles. We consider a nonatomic routing game on a network with inelastic (fixed) demands for the set of network O/D pairs, and study how replacing a fraction of regular vehicles by autonomous vehicles will affect the mobility of the network. Using the well known US bureau of public roads (BPR) traffic delay models, we show that the resulting Wardrop equilibrium is not necessarily unique even in its weak sense for networks with mixed autonomy. We state the conditions under which the total network delay is guaranteed not to increase as a result of autonomy increase. However, we show that when these conditions do not hold, counter intuitive behaviors may occur: the total delay can grow by increasing the network autonomy. In particular, we prove that for networks with a single O/D pair, if the road degrees of asymmetry are homogeneous, the total delay is 1) unique, and 2) a nonincreasing continuous function of network autonomy fraction. We show that for heterogeneous degrees of asymmetry, the total delay is not unique, and it can further grow with autonomy increase. We demonstrate that similar behaviors may be observed in networks with multiple O/D pairs. We further bound such performance degradations due to the introduction of autonomy in homogeneous networks.

Includes members:
  Member "dissipation of stop and go waves via control of autonomous vehicles field experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "watch your back backdoor attacks in deep reinforcement learning based autonomous vehicle control systems")
  Member "a game theoretic macroscopic model of bypassing at traffic diverges with applications to mixed autonomy networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pricing traffic networks with mixed vehicle autonomy")
  Member "measuring impact of adaptive and cooperative adaptive cruise control on throughput of signalized intersections":
    also connected through other hyperedges:
      (none)

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.GT(Computer Science and Game Theory)