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 "a high level characterisation and generalisation of communication avoiding programming techniques"):
  Abstract: Today's hardware's explosion of concurrency plus the explosion of data we build upon in both machine learning and scientific simulations have multifaceted impact on how we write our codes. They have changed our notion of performance and, hence, of what a good code is: Good code has, first of all, to be able to exploit the unprecedented levels of parallelism. To do so, it has to manage to move the compute data into the compute facilities on time. As communication and memory bandwidth cannot keep pace with the growth in compute capabilities and as latency increases---at least relative to what the hardware could do---communication-avoiding techniques gain importance. We characterise and classify the field of communication-avoiding algorithms. A review of some examples of communication-avoiding programming by means of our new terminology shows that we are well-advised to broaden our notion of "communication-avoiding" and to look beyond numerical linear algebra. An abstraction, generalisation and weakening of the term enriches our toolset of how to tackle the data movement challenges. Through this, we eventually gain access to a richer set of tools that we can use to deliver proper code for current and upcoming hardware generations.

Includes members:
  Member "parallel performance of algebraic multigrid domain decomposition amg dd":
    also connected through other hyperedges:
      (none)
  Member "stop talking to me a communication avoiding ader dg realisation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals")
  Member "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tasks unlimited lightweight task offloading exploiting mpi wait times for parallel adaptive mesh refinement")
  Member "two particle in grid realisations on spacetrees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals")
  Member "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the peano software parallel automaton based dynamically adaptive grid traversals")
  Member "swift using task based parallelism fully asynchronous communication and graph partition based domain decomposition for strong scaling on more than 100 000 cores":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "honing and proofing astrophysical codes on the road to exascale experiences from code modernization on many core systems")
  Member "asynchronous mpi for the masses":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes")

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.DC(Distributed, Parallel, and Cluster Computing)