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: "the peano software parallel automaton based dynamically adaptive grid traversals"
  Abstract: We discuss the design decisions, design alternatives, and rationale behind the third generation of Peano, a framework for dynamically adaptive Cartesian meshes derived from spacetrees. Peano ties the mesh traversal to the mesh storage and supports only one element-wise traversal order resulting from space-filling curves. The user is not free to choose a traversal order herself. The traversal can exploit regular grid subregions and shared memory as well as distributed memory systems with almost no modifications to a serial application code. We formalize the software design by means of two interacting automata—one automaton for the multiscale grid traversal and one for the application-specific algorithmic steps. This yields a callback-based programming paradigm. We further sketch the supported application types and the two data storage schemes realized before we detail high-performance computing aspects and lessons learned. Special emphasis is put on observations regarding the used programming idioms and algorithmic concepts. This transforms our report from a “one way to implement things” code description into a generic discussion and summary of some alternatives, rationale, and design decisions to be made for any tree-based adaptive mesh refinement software.

Connected through hyperedge HE-1 (induced by source paper "tasks unlimited lightweight task offloading exploiting mpi wait times for parallel adaptive mesh refinement"):
  with members:
    - "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"
    - "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"
    - "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-2 (induced by source paper "role oriented code generation in an engine for solving hyperbolic pde systems"):
  with members:
    - "exahype an engine for parallel dynamically adaptive simulations of wave problems"
    - "a modular and extensible software architecture for particle dynamics"
    - "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"

Connected through hyperedge HE-3 (induced by source paper "dynamically adaptive fas for an additively damped afac variant"):
  with members:
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "a survey of high level frameworks in block structured adaptive mesh refinement packages"

Connected through hyperedge HE-4 (induced by source paper "exahype an engine for parallel dynamically adaptive simulations of wave problems"):
  with members:
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "two particle in grid realisations on spacetrees"

Connected through hyperedge HE-5 (induced by source paper "stop talking to me a communication avoiding ader dg realisation"):
  with members:
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "communication reducing algorithms for distributed hierarchical n body problems with boundary distributions"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"

Connected through hyperedge HE-6 (induced by source paper "studies on the energy and deep memory behaviour of a cache oblivious task based hyperbolic pde solver"):
  with members:
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"

Connected through hyperedge HE-7 (induced by source paper "complex additive geometric multilevel solvers for helmholtz equations on spacetrees"):
  with members:
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "on the indefinite helmholtz equation complex stretched absorbing boundary layers iterative analysis and preconditioning"

Connected through hyperedge HE-8 (induced by source paper "two particle in grid realisations on spacetrees"):
  with members:
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"

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)