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: "cooperative driving at unsignalized intersections using tree search"
  Abstract: In this paper, we propose a new cooperative driving strategy for connected and automated vehicles (CAVs) at unsignalized intersections. Based on the tree representation of the solution space for the passing order, we combine Monte Carlo tree search (MCTS) and some heuristic rules to find a nearly global-optimal passing order (leaf node) within a very short planning time. Testing results show that this new strategy can keep a good tradeoff between performance and computation flexibility.

Connected through hyperedge HE-1 (induced by source paper "a right of way based strategy to implement safe and efficient driving at non signalized intersections for automated vehicles"):
  with members:
    - "a right of way assignment strategy to ensure traffic safety and efficiency in lane change"
    - "a grouping based cooperative driving strategy for cavs merging problems"
    - "on a formal model of safe and scalable self driving cars"

Connected through hyperedge HE-2 (induced by source paper "a bi level cooperative driving strategy allowing lane changes"):
  with members:
    - "a new microscopic traffic model using a spring mass damper clutch system"
    - "a grouping based cooperative driving strategy for cavs merging problems"

Connected through hyperedge HE-3 (induced by source paper "a right of way assignment strategy to ensure traffic safety and efficiency in lane change"):
  with members:
    - "a grouping based cooperative driving strategy for cavs merging problems"
    - "on a formal model of safe and scalable self driving cars"

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.MA(Multiagent Systems)