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 "computing feasible vehicle platooning opportunities for transport assignments"):
  Abstract: Vehicle platooning facilitates the partial automation of vehicles and can significantly reduce fuel consumption. Mobile communication infrastructure makes it possible to dynamically coordinate the formation of platoons en route. We consider a centralized system that provides trucks with routes and speed profiles allowing them to dynamically form platoons during their journeys. For this to work, all possible pairs of vehicles that can platoon based on their location, destination, and other constraints have to be identified. The presented approach scales well to large vehicle fleets and realistic road networks by extracting features from the transport assignments of the vehicles and rules out a majority of possible pairs based on these features only. Merely a small number of remaining pairs are considered in depth by a complete and computationally expensive algorithm. This algorithm conclusively decides if platooning is possible for a pair based on the complete data associated with the two vehicles. We derive appropriate features for the problem and demonstrate the effectiveness of the approach in a simulation example.

Includes members:
  Member "fuel optimal centralized coordination of truck platooning based on shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "control of connected and automated vehicles state of the art and future challenges")
  Member "coordinating truck platooning by clustering pairwise fuel optimal plans":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "control of connected and automated vehicles state of the art and future challenges")

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)