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 "minimizing communication in linear algebra"):
  Abstract: In 1981 Hong and Kung proved a lower bound on the amount of communication (amount of data moved between a small, fast memory and large, slow memory) needed to perform dense, n-by-n matrix multiplication using the conventional O(n3) algorithm, where the input matrices were too large to fit in the small, fast memory. In 2004 Irony, Toledo, and Tiskin gave a new proof of this result and extended it to the parallel case (where communication means the amount of data moved between processors). In both cases the lower bound may be expressed as Ω(#arithmetic_operations/M), where M is the size of the fast memory (or local memory in the parallel case). Here we generalize these results to a much wider variety of algorithms, including LU factorization, Cholesky factorization, LDLT factorization, QR factorization, the Gram–Schmidt algorithm, and algorithms for eigenvalues and singular values, i.e., essentially all direct methods of linear algebra. The proof works for dense or sparse matrices and for sequential or para...

Includes members:
  Member "lu factorization with panel rank revealing pivoting and its communication avoiding version":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an efficient sparsity preserving online algorithm for low rank approximation")
  Member "graph expansion and communication costs of fast matrix multiplication regular submission":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond reuse distance analysis dynamic analysis for characterization of data locality potential")
  Member "hybrid static dynamic scheduling for already optimized dense matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward a standard interface for user defined scheduling in openmp")
  Member "communication optimal parallel and sequential cholesky decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serverless straggler mitigation using local error correcting codes")
  Member "a class of parallel tiled linear algebra algorithms for multicore architectures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "task based gpu accelerated and robust library for solving dense nonsymmetric eigenvalue problems")

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)