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 "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.

Includes members:
  Member "stop talking to me a communication avoiding ader dg realisation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques")
  Member "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamically adaptive fas for an additively damped afac variant")
  Member "complex additive geometric multilevel solvers for helmholtz equations on spacetrees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non conforming mesh refinement for high order finite elements")
  Member "two particle in grid realisations on spacetrees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques")
  Member "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques")
  Member "how many three dimensional hilbert curves are there":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a scaled space filling curve index applied to tropical rain forest tree distributions")
  Member "morton curve segments produce no more than two distinct face connected subdomains":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a scalable parallel finite element framework for growing geometries application to metal additive manufacturing")
  Member "bounds on the number of discontinuities of morton type space filling curves":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "enhancing speed and scalability of the parflow simulation code")

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)