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: "ils mpm an implicit level set based material point method for frictional particulate contact mechanics of deformable particles"
  Abstract: Finite element simulations of frictional multi-body contact problems via conformal meshes can be challenging and computationally demanding. To render geometrical features, unstructured meshes must be used and this unavoidably increases the degrees of freedom and therefore makes the construction of slave/master pairs more demanding. In this work, we introduce an implicit material point method designed to bypass the meshing of bodies by employing level set functions to represent boundaries at structured grids. This implicit function representation provides an elegant mean to link an unbiased intermediate reference surface with the true boundaries by closest point projection as shown in leichner et al. (2019). We then enforce the contact constraints by a penalty method where the Coulomb friction law is implemented as an elastoplastic constitutive model such that a return mapping algorithm can be used to provide constitutive updates for both the stick and slip states. To evolve the geometry of the contacts properly, the Hamilton-Jacobi equation is solved incrementally such that the level set and material points are both updated accord to the deformation field. To improve the accuracy and regularity of the numerical integration of the material point method, a moving least square method is used to project numerical values of the material points back to the standard locations for Gaussian-Legendre quadrature. Several benchmarks are used to verify the proposed model. Comparisons with discrete element simulations are made to analyze the importance of stress fields on predicting the macroscopic responses of granular assemblies.

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