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: "methods for analytical understanding of agent based modeling of complex systems"
  Abstract: Von Neuman's work on universal machines and the hardware development have allowed the simulation of dynamical systems through a large set of interacting agents. This is a bottom-up approach which tries to derive global properties of a complex system through local interaction rules and agent behaviour. Traditionally, such systems are modeled and simulated through top-down methods based on differential equations. Agent-Based Modeling has the advantage of simplicity and low computational cost. However, unlike differential equations, there is no standard way to express agent behaviour. Besides, it is not clear how to analytically predict the results obtained by the simulation. In this paper we survey some of these methods. For expressing agent behaviour formal methods, like Stochastic Process Algebras have been used. Such approach is useful if the global properties of interest can be expressed as a function of stochastic time series. However, if space variables must be considered, we shall change the focus. In this case, multiscale techniques, based on Chapman-Enskog expansion, was used to establish the connection between the microscopic dynamics and the macroscopic observables. Also, we use data mining techniques,like Principal Component Analysis (PCA), to study agent systems like Cellular Automata. With the help of these tools we will discuss a simple society model, a Lattice Gas Automaton for fluid modeling, and knowledge discovery in CA databases. Besides, we show the capabilities of the NetLogo, a software for agent simulation of complex system and show our experience about.

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.GR(Graphics)