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 "red blue pebbling revisited near optimal parallel matrix matrix multiplication"):
  Abstract: We propose COSMA: a parallel matrix-matrix multiplication algorithm that is near communication-optimal for all combinations of matrix dimensions, processor counts, and memory sizes. The key idea behind COSMA is to derive an optimal (up to a factor of 0.03\% for 10MB of fast memory) sequential schedule and then parallelize it, preserving I/O optimality. To achieve this, we use the red-blue pebble game to precisely model MMM dependencies and derive a constructive and tight sequential and parallel I/O lower bound proofs. Compared to 2D or 3D algorithms, which fix processor decomposition upfront and then map it to the matrix dimensions, it reduces communication volume by up to $\sqrt{3}$ times. COSMA outperforms the established ScaLAPACK, CARMA, and CTF algorithms in all scenarios up to 12.8x (2.2x on average), achieving up to 88\% of Piz Daint's peak performance. Our work does not require any hand tuning and is maintained as an open source implementation.

Includes members:
  Member "demystifying parallel and distributed deep learning an in depth concurrency analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "increasing the efficiency of sparse matrix matrix multiplication with a 2 5d algorithm and one sided mpi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dbcsr a library for dense matrix multiplications on distributed gpu accelerated systems")
  Member "pushing the bounds for matrix matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automated derivation of parametric data movement lower bounds for affine programs")
  Member "scaling betweenness centrality using communication efficient sparse matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified iteration space transformation framework for sparse and dense tensor algebra")
  Member "mathematical foundations of the graphblas":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "75 000 000 000 streaming inserts second using hierarchical hypersparse graphblas matrices")
  Member "enabling highly scalable remote memory access programming with mpi 3 one sided":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "i o efficient algorithms for matrix computations":
    also connected through other hyperedges:
      (none)

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.CC(Computational Complexity)