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: "a resource allocation based approach for corporate mobility as a service"
  Abstract: Corporate mobility is often based on fixed assignments of vehicles to employees. Relaxing these fixed assignments while including alternatives such as public transportation, bike sharing, and taxis for the employees' business and private trips could increase fleet utilization, foster the use of battery electric vehicles, and lower the costs for the companies' transportation needs. A system in which all employees specify their mobility demands gives rise to optimization problems concerning the assignment of company cars or alternative modes of transport to satisfy the needs of the users. In this work we introduce the NP-hard mobility offer allocation problem which has similarities to interval scheduling problems. We propose an integer linear programming model and heuristic solution approaches based on large neighborhood search. The efficiency of these methods is based on the usage of suitable conflict graphs. In a computational study, the approaches are evaluated and it is demonstrated that, depending on instances and run-time requirements, either solving the model exactly using a general purpose integer linear programming solver, fast greedy heuristics, or the adaptive large neighborhood search outperforms the others.

Connected through hyperedge HE-1 (induced by source paper "modeling and solving a vehicle sharing problem"):
  with members:
    - "modeling and solving the multimodal car and ride sharing problem"
    - "smoothed analysis of the successive shortest path algorithm"

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.AI(Artificial Intelligence)