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: "fuel optimal centralized coordination of truck platooning based on shortest paths"
  Abstract: Platooning is a way to significantly reduce fuel consumption of trucks. Vehicles that drive at close inter-vehicle distance assisted by automatic controllers experience substantially lower air-drag. In this paper, we deal with the problem of coordinating the formation and the breakup of platoons in a fuel-optimal way. We formulate an optimization problem which accounts for routing, speed-dependent fuel consumption, and platooning decisions. An algorithm to obtain an approximate solution to the problem is presented. It first determines the shortest path for each truck. Then, possible platoon configurations are identified. For a certain platoon configuration the optimal speed profile is the solution to a convex program. The algorithm is illustrated by a realistic example.

Connected through hyperedge HE-1 (induced by source paper "control of connected and automated vehicles state of the art and future challenges"):
  with members:
    - "trajectory planning under vehicle dimension constraints using sequential linear programming"
    - "a survey of motion planning and control techniques for self driving urban vehicles"
    - "least costly energy management for series hybrid electric vehicles"
    - "coordinating truck platooning by clustering pairwise fuel optimal plans"
    - "computing feasible vehicle platooning opportunities for transport assignments"
    - "cooperative look ahead control for fuel efficient and safe heavy duty vehicle platooning"

Connected through hyperedge HE-2 (induced by source paper "fuel efficient en route formation of truck platoons"):
  with members:
    - "coordinating truck platooning by clustering pairwise fuel optimal plans"
    - "cyber physical control of road freight transport"

Connected through hyperedge HE-3 (induced by source paper "computing feasible vehicle platooning opportunities for transport assignments"):
  with members:
    - "coordinating truck platooning by clustering pairwise fuel optimal plans"

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.SY(Systems and Control)