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: "biomolecular electrostatics using a fast multipole bem on up to 512 gpus and a billion unknowns"
  Abstract: Abstract   We present teraflop-scale calculations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration. The algorithmic acceleration is achieved with the fast multipole method ( fmm ) in conjunction with a boundary element method ( bem ) formulation of the continuum electrostatic model, as well as the  bibee  approximation to  bem . The hardware acceleration is achieved through graphics processors,  gpu s. We demonstrate the power of our algorithms and software for the calculation of the electrostatic interactions between biological molecules in solution. The applications demonstrated include the electrostatics of protein–drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of lysozyme molecules. The parallel scalability of the software was studied in a cluster at the Nagasaki Advanced Computing Center, using 128 nodes, each with 4  gpu s. Delicate tuning has resulted in strong scaling with parallel efficiency of 0.8 for 256 and 0.5 for 512  gpu s. The largest application run, with over 20 million atoms and one billion unknowns, required only one minute on 512  gpu s. We are currently adapting our  bem  software to solve the linearized Poisson–Boltzmann equation for dilute ionic solutions, and it is also designed to be flexible enough to be extended for a variety of integral equation problems, ranging from Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flow.

Connected through hyperedge HE-1 (induced by source paper "communication reducing algorithms for distributed hierarchical n body problems with boundary distributions"):
  with members:
    - "asynchronous execution of the fast multipole method using charm"
    - "communication complexity of the fast multipole method and its algebraic variants"
    - "an inventory of three dimensional hilbert space filling curves"

Connected through hyperedge HE-2 (induced by source paper "steklov spectral geometry for extrinsic shape analysis"):
  with members:
    - "boundary first flattening"
    - "on the optimality of shape and data representation in the spectral domain"
    - "geodesics in heat a new approach to computing distance based on heat flow"

Connected through hyperedge HE-3 (induced by source paper "fast multipole method as a matrix free hierarchical low rank approximation"):
  with members:
    - "a fast block low rank dense solver with applications to finite element matrices"
    - "a distributed memory package for dense hierarchically semi separable matrix computations using randomization"
    - "askit approximate skeletonization kernel independent treecode in high dimensions"
    - "petascale turbulence simulation using a highly parallel fast multipole method on gpus"
    - "fast multipole preconditioners for sparse matrices arising from elliptic equations"

Connected through hyperedge HE-4 (induced by source paper "pipelined iterative solvers with kernel fusion for graphics processing units"):
  with members:
    - "a unified sparse matrix data format for efficient general sparse matrix vector multiplication on modern processors with wide simd units"
    - "performance evaluation of sparse matrix multiplication kernels on intel xeon phi"
    - "a performance comparison of cuda and opencl"

Connected through hyperedge HE-5 (induced by source paper "petascale turbulence simulation using a highly parallel fast multipole method on gpus"):
  with members:
    - "fmm based vortex method for simulation of isotropic turbulence on gpus compared with a spectral method"

Connected through hyperedge HE-6 (induced by source paper "a tuned and scalable fast multipole method as a preeminent algorithm for exascale systems"):
  with members:
    - "petascale turbulence simulation using a highly parallel fast multipole method on gpus"
    - "petfmm a dynamically load balancing parallel fast multipole library"

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)