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: "modelling dynamic route choice of pedestrians to assess the criticality of building evacuation"
  Abstract: This paper presents an event-driven way finding algorithm for pedestrians in an evacuation scenario, which operates on a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect pedestrians include the identification of a jam situation and/or identification of a better route than the current. This study considers two types of pedestrians: familiar and unfamiliar with the facility. Four strategies are modelled to cover those groups. The modelled strategies are the shortest path (local and global); They are combined with a quickest path approach, which is based on an observation principle. In the quickest path approach, pedestrians take their decisions based on the observed environment and are routed dynamically in the network using an appropriate cost benefit analysis function. The dynamic modelling of route choice with different strategies and types of pedestrians considers the manifold of in uences which appears in the real system and raises questions about the criticality of an evacuation process. To address this question criteria are elaborated. The criteria we focus on in this contribution are the evacuation time, the individual times spent in jam, the jam size evolution and the overall jam size itself. The in uences of the different strategies on those evaluation criteria are investigated. The sensibility of the system to disturbances (e.g. broken escape route) is also analysed. Keywords: pedestrian dynamics, routing, quickest path, evacuation, jam, critical state

Connected through hyperedge HE-1 (induced by source paper "pedestrian route choice by iterated equilibrium search"):
  with members:
    - "dynamic assignment in microsimulations of pedestrians"
    - "the use of dynamic distance potential fields for pedestrian flow around corners"
    - "pedestrian flow at bottlenecks validation and calibration of vissim s social force model of pedestrian traffic and its empirical foundations"

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.OH(Other Computer Science)