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 "the generalized matrix chain algorithm"):
  Abstract: In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem consists in finding the parenthesization of a matrix product M := A1 A2 ⋯ An that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated expressions, involving transposition, inversion, and matrix properties. Indeed, the computation of such expressions relies on a set of computational kernels that offer functionality well beyond the simple matrix product. The challenge then shifts from finding an optimal parenthesization to finding an optimal mapping of the input expression to the available kernels. Furthermore, it is often the case that a solution based on the minimization of scalar operations does not result in the optimal solution in terms of execution time. In our experiments, the generated code outperforms other libraries and languages on average by a factor of about 9. The motivation for this work comes from the fact that—despite great advances in the development of compilers—the task of mapping linear algebra problems to optimized kernels is still to be done manually. In order to relieve the user from this complex task, new techniques for the compilation of linear algebra expressions have to be developed.

Includes members:
  Member "non linear associative commutative many to one pattern matching with sequence variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linnea automatic generation of efficient linear algebra programs")
  Member "deriving correct high performance algorithms":
    also connected through other hyperedges:
      (none)
  Member "a dual method for computing power transfer distribution factors":
    also connected through other hyperedges:
      (none)
  Member "sparsity based correction of exponential artifacts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linnea automatic generation of efficient linear algebra programs")
  Member "a parallel implementation of the ensemble kalman filter based on modified cholesky decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linnea automatic generation of efficient linear algebra programs")
  Member "consistent discretization and minimization of the l1 norm on manifolds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse image reconstruction on the sphere analysis and synthesis")
  Member "the elaps framework experimental linear algebra performance studies":
    also connected through other hyperedges:
      (none)
  Member "on a natural dynamics for linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linnea automatic generation of efficient linear algebra programs")

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.MS(Mathematical Software)