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 to apply assignment methods that were developed for vehicular traffic to pedestrian microsimulations"):
  Abstract: Applying assignment methods to compute user-equilibrium route choice is very common in traffic planning. It is common sense that vehicular traffic arranges in a user-equilibrium based on generalized costs in which travel time is a major factor. Surprisingly travel time has not received much attention for the route choice of pedestrians. In microscopic simulations of pedestrians the vastly dominating paradigm for the computation of the preferred walking direction is set into the direction of the (spatially) shortest path. For situations where pedestrians have travel time as primary determinant for their walking behavior it would be desirable to also have an assignment method in pedestrian simulations. To apply existing (road traffic) assignment methods with simulations of pedestrians one has to reduce the nondenumerably many possible pedestrian trajectories to a small subset of routes which represent the main, relevant, and significantly distinguished routing alternatives. All except one of these routes will mark detours, i.e. not the shortest connection between origin and destination. The proposed assignment method is intended to work with common operational models of pedestrian dynamics. These - as mentioned before - usually send pedestrians into the direction of the spatially shortest path. Thus, all detouring routes have to be equipped with intermediate destinations, such that pedestrians can do a detour as a piecewise connection of segments on which they walk into the direction of the shortest path. One has then to take care that the transgression from one segment to the following one no artifacts are introduced into the pedestrian trajectory.

Includes members:
  Member "pedestrian route choice by iterated equilibrium search":
    also connected through other hyperedges:
      (none)
  Member "dynamic assignment in microsimulations of pedestrians":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pedestrian route choice by iterated equilibrium search")

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.CE(Computational Engineering, Finance, and Science)