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: "clblast a tuned opencl blas library"
  Abstract: This work introduces CLBlast, an open-source BLAS library providing optimized OpenCL routines to accelerate dense linear algebra for a wide variety of devices. It is targeted at machine learning and HPC applications and thus provides a fast matrix-multiplication routine (GEMM) to accelerate the core of many applications (e.g. deep learning, iterative solvers, astrophysics, computational fluid dynamics, quantum chemistry). CLBlast has five main advantages over other OpenCL BLAS libraries: 1) it is optimized for and tested on a large variety of OpenCL devices including less commonly used devices such as embedded and low-power GPUs, 2) it can be explicitly tuned for specific problem-sizes on specific hardware platforms, 3) it can perform operations in half-precision floating-point FP16 saving bandwidth, time and energy, 4) it has an optional CUDA back-end, 5) and it can combine multiple operations in a single batched routine, accelerating smaller problems significantly. This paper describes the library and demonstrates the advantages of CLBlast experimentally for different use-cases on a wide variety of OpenCL hardware.

Connected through hyperedge HE-1 (induced by source paper "towards automated kernel selection in machine learning systems a sycl case study"):
  with members:
    - "accelerated neural networks on opencl devices using sycl dnn"
    - "mobilenetv2 inverted residuals and linear bottlenecks"
    - "machine learning based auto tuning for enhanced opencl performance portability"
    - "deep residual learning for image recognition"
    - "cltune a generic auto tuner for opencl kernels"
    - "very deep convolutional networks for large scale image recognition"

Connected through hyperedge HE-2 (induced by source paper "the linear algebra mapping problem"):
  with members:
    - "automatic generation of efficient linear algebra programs"
    - "the generalized matrix chain algorithm"
    - "image restoration by iterative denoising and backward projections"
    - "recursive algorithms for dense linear algebra the relapack collection"
    - "sparsity based correction of exponential artifacts"
    - "on a natural dynamics for linear programming"
    - "julia a fresh approach to numerical computing"
    - "linview incremental view maintenance for complex analytical queries"

Connected through hyperedge HE-3 (induced by source paper "type directed program synthesis and constraint generation for library portability"):
  with members:
    - "stepping stones to inductive synthesis of low level looping programs"
    - "souper a synthesizing superoptimizer"
    - "yolo9000 better faster stronger"
    - "xnor net imagenet classification using binary convolutional neural networks"
    - "the scalability efficiency maintainability portability trade off in simulation software engineering examples and a preliminary systematic literature review"
    - "you only look once unified real time object detection"
    - "synthesis of recursive adt transformations from reusable templates"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-4 (induced by source paper "cross platform performance portability using highly parametrized sycl kernels"):
  with members:
    - "deep residual learning for image recognition"
    - "fast algorithms for convolutional neural networks"
    - "very deep convolutional networks for large scale image recognition"
    - "cudnn efficient primitives for deep learning"

Connected through hyperedge HE-5 (induced by source paper "type directed program synthesis and constraint generation for accelerator library portability"):
  with members:
    - "stepping stones to inductive synthesis of low level looping programs"
    - "souper a synthesizing superoptimizer"
    - "the scalability efficiency maintainability portability trade off in simulation software engineering examples and a preliminary systematic literature review"
    - "a theory of formal synthesis via inductive learning"

Connected through hyperedge HE-6 (induced by source paper "gpu based parallel computation support for stan"):
  with members:
    - "deep probabilistic programming languages a qualitative study"
    - "pyro deep universal probabilistic programming"
    - "mxnet a flexible and efficient machine learning library for heterogeneous distributed systems"

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)