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: "application tailored linear algebra algorithms a search based approach"
  Abstract: In this paper, we tackle the problem of automatically generating algorithms for linear algebra operations by taking advantage of problem-specific knowledge. In most situations, users possess much more information about the problem at hand than what current libraries and computing environments accept; evidence shows that if properly exploited, such information leads to uncommon/unexpected speedups. We introduce a knowledge-aware linear algebra compiler that allows users to input matrix equations together with properties about the operands and the problem itself; for instance, they can specify that the equation is part of a sequence, and how successive instances are related to one another. The compiler exploits all this information to guide the generation of algorithms, to limit the size of the search space, and to avoid redundant computations. We applied the compiler to equations arising as part of sensitivity and genome studies; the algorithms produced exhibit, respectively, 100- and 1000-fold speedups.

Connected through hyperedge HE-1 (induced by source paper "the generalized matrix chain algorithm"):
  with members:
    - "non linear associative commutative many to one pattern matching with sequence variables"
    - "deriving correct high performance algorithms"
    - "a dual method for computing power transfer distribution factors"
    - "sparsity based correction of exponential artifacts"
    - "a parallel implementation of the ensemble kalman filter based on modified cholesky decomposition"
    - "consistent discretization and minimization of the l1 norm on manifolds"
    - "the elaps framework experimental linear algebra performance studies"
    - "on a natural dynamics for linear programming"

Connected through hyperedge HE-2 (induced by source paper "program generation for small scale linear algebra applications"):
  with members:
    - "julia a fresh approach to numerical computing"
    - "automatic generation of loop invariants for matrix operations"
    - "knowledge based automatic generation of partitioned matrix expressions"

Connected through hyperedge HE-3 (induced by source paper "towards automatic learning of heuristics for mechanical transformations of procedural code"):
  with members:
    - "towards a semantics aware transformation toolchain for heterogeneous systems"
    - "towards an efficient use of the blas library for multilinear tensor contractions"
    - "reinforcement learning a survey"

Connected through hyperedge HE-4 (induced by source paper "towards a semantics aware transformation toolchain for heterogeneous systems"):
  with members:
    - "towards automatic learning of heuristics for mechanical transformations of procedural code"

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)