human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "exahype an engine for parallel dynamically adaptive simulations of wave problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tasks unlimited lightweight task offloading exploiting mpi wait times for parallel adaptive mesh refinement")
  Member "stop talking to me a communication avoiding ader dg realisation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals")
  Member "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals")
  Member "fast matrix free evaluation of discontinuous galerkin finite element operators":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the deal ii finite element library design features and insights")
  Member "asynchronous mpi for the masses":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques")
  Member "likwid a lightweight performance oriented tool suite for x86 multicore environments":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lbmpy a flexible code generation toolkit for highly efficient lattice boltzmann simulations")
  Member "likwid a lightweight performance oriented tool suite for x86 multicore environments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lbmpy a flexible code generation toolkit for highly efficient lattice boltzmann simulations")

Question: Please tell me which class the source paper 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)