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: "studies on the energy and deep memory behaviour of a cache oblivious task based hyperbolic pde solver"
  Abstract: We study the behaviour of a seismic simulation on a server with an Intel Optane memory subsystem. The simulation uses the ExaHyPE engine. ExaHyPE combines dynamically adaptive meshes (AMR) with ADER-DG. It is parallelised using tasks, and it is cache efficient. AMR plus ADER-DG yields a task graph which is highly dynamic in nature and comprises both arithmetically expensive and bandwidth-intense tasks. Despite this inhomogeneous character, our code benefits from AVX vectorization, though it suffers from memory access bursts. We show that a frequency reduction of the chip does not mitigate burst effects although it improves the code's energy-to-solution. Even worse, the burst's latency dependence becomes worse once we add Optane. However, in cases where memory-intense and computationally expensive tasks overlap, ExaHype's cache-oblivious implementation can exploit the Intel Memory Drive Technology (IMDT) virtualizing the extra memory layer, and it suffers only from a less than 3x performance decline per degree of freedom versus pure DDR4 memory. We thus propose that upcoming supercomputing simulation codes with dynamic, inhomogeneous task graphs require algorithms and task schedulers which actively prefetch data, intermix tasks of different character, and apply frequency control to or switch off the memory if appropriate.

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

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)