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: "stop talking to me a communication avoiding ader dg realisation"
  Abstract: We present a communication- and data-sensitive formulation of ADER-DG for hyperbolic differential equation systems. Sensitive here has multiple flavours: First, the formulation reduces the persistent memory footprint. This reduces pressure on the memory subsystem. Second, the formulation realises the underlying predictor-corrector scheme with single-touch semantics, i.e., each degree of freedom is read on average only once per time step from the main memory. This reduces communication through the memory controllers. Third, the formulation breaks up the tight coupling of the explicit time stepping's algorithmic steps to mesh traversals. This averages out data access peaks. Different operations and algorithmic steps are ran on different grid entities. Finally, the formulation hides distributed memory data transfer behind the computation aligned with the mesh traversal. This reduces pressure on the machine interconnects. All techniques applied by our formulation are elaborated by means of a rigorous task formalism. They break up ADER-DG's tight causal coupling of compute steps and can be generalised to other predictor-corrector schemes.

Connected through hyperedge HE-1 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals"):
  with members:
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "complex additive geometric multilevel solvers for helmholtz equations on spacetrees"
    - "two particle in grid realisations on spacetrees"
    - "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes"
    - "how many three dimensional hilbert curves are there"
    - "morton curve segments produce no more than two distinct face connected subdomains"
    - "bounds on the number of discontinuities of morton type space filling curves"
    - "a survey of high level frameworks in block structured adaptive mesh refinement packages"

Connected through hyperedge HE-2 (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"
    - "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"
    - "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-3 (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"
    - "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-4 (induced by source paper "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"):
  with members:
    - "exahype an engine for parallel dynamically adaptive simulations of wave problems"
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "fast matrix free evaluation of discontinuous galerkin finite element operators"
    - "asynchronous mpi for the masses"
    - "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)