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: "uncertainty quantification for an optical grating coupler with an adjoint based leja adaptive collocation method"
  Abstract: This paper addresses uncertainties arising in the nano-scale fabrication of optical devices. The stochastic collocation method is used to propagate uncertainties in material and geometry to the scattering parameters of the system. A dimension-adaptive scheme based on Leja nodes is employed to reduce the computational complexity. By combining the Leja adaptive algorithm with an adjoint-based error indicator, an even smaller complexity is obtained. The scheme's efficiency is demonstrated by numerical results for an optical grating coupler. For this model problem, the adaptive strategy allows to compute statistical moments, probabilities and global sensitivity indices, taking into account a moderately high number of uncertain input parameters. In particular, it is found that geometric sensitivities outweigh sensitivities with respect to material parameters for the considered setting.

Connected through hyperedge HE-1 (induced by source paper "robust adaptive least squares polynomial chaos expansions in high frequency applications"):
  with members:
    - "assessing the performance of leja and clenshaw curtis collocation for computational electromagnetics with random input data"
    - "enhancing l 1 minimization estimates of polynomial chaos expansions using basis selection"

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)