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: "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"
  Abstract: High-order Discontinuous Galerkin (DG) methods promise to be an excellent discretisation paradigm for partial differential equation solvers by combining high arithmetic intensity with localised data access. They also facilitate dynamic adaptivity without the need for conformal meshes. A parallel evaluation of DG's weak formulation within a mesh traversal is non-trivial, as dependency graphs over dynamically adaptive meshes change, as causal constraints along resolution transitions have to be preserved, and as data sends along MPI domain boundaries have to be triggered in the correct order. We propose to process mesh elements subject to constraints with high priority or, where needed, serially throughout a traversal. The remaining cells form enclaves and are spawned into a task system. This introduces concurrency, mixes memory-intensive DG integrations with compute-bound Riemann solves, and overlaps computation and communication. We discuss implications on MPI and show that MPI parallelisation improves by a factor of three through enclave tasking, while we obtain an additional factor of two from shared memory if grids are dynamically adaptive.

Connected through hyperedge HE-1 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques"):
  with members:
    - "parallel performance of algebraic multigrid domain decomposition amg dd"
    - "stop talking to me a communication avoiding ader dg realisation"
    - "two particle in grid realisations on spacetrees"
    - "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes"
    - "swift using task based parallelism fully asynchronous communication and graph partition based domain decomposition for strong scaling on more than 100 000 cores"
    - "asynchronous mpi for the masses"

Connected through hyperedge HE-2 (induced by source paper "tasks unlimited lightweight task offloading exploiting mpi wait times for parallel adaptive mesh refinement"):
  with members:
    - "the peano software parallel automaton based dynamically adaptive grid traversals"
    - "exahype an engine for parallel dynamically adaptive simulations of wave problems"
    - "stop talking to me a communication avoiding ader dg realisation"
    - "studies on the energy and deep memory behaviour of a cache oblivious task based hyperbolic pde solver"
    - "swift using task based parallelism fully asynchronous communication and graph partition based domain decomposition for strong scaling on more than 100 000 cores"

Connected through hyperedge HE-3 (induced by source paper "role oriented code generation in an engine for solving hyperbolic pde systems"):
  with members:
    - "the peano software parallel automaton based dynamically adaptive grid traversals"
    - "exahype an engine for parallel dynamically adaptive simulations of wave problems"
    - "a modular and extensible software architecture for particle dynamics"

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.MS(Mathematical Software)