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: "optimal dnn primitive selection with partitioned boolean quadratic programming"
  Abstract: Deep Neural Networks (DNNs) require very large amounts of computation both for training and for inference when deployed in the field. Many different algorithms have been proposed to implement the most computationally expensive layers of DNNs. Further, each of these algorithms has a large number of variants, which offer different trade-offs of parallelism, data locality, memory footprint, and execution time. In addition, specific algorithms operate much more efficiently on specialized data layouts and formats. #R##N#We state the problem of optimal primitive selection in the presence of data format transformations, and show that it is NP-hard by demonstrating an embedding in the Partitioned Boolean Quadratic Assignment problem (PBQP). #R##N#We propose an analytic solution via a PBQP solver, and evaluate our approach experimentally by optimizing several popular DNNs using a library of more than 70 DNN primitives, on an embedded platform and a general purpose platform. We show experimentally that significant gains are possible versus the state of the art vendor libraries by using a principled analytic solution to the problem of layout selection in the presence of data format transformations.

Connected through hyperedge HE-1 (induced by source paper "searching for winograd aware quantized networks"):
  with members:
    - "a study of bfloat16 for deep learning training"
    - "winograd convolution for dnns beyond linear polynomials"
    - "visual wake words dataset"
    - "sparse sparse architecture search for cnns on resource constrained microcontrollers"
    - "gated scnn gated shape cnns for semantic segmentation"
    - "searching for mobilenetv3"
    - "efficient winograd convolution via integer arithmetic"
    - "differentiable soft quantization bridging full precision and low bit neural networks"

Connected through hyperedge HE-2 (induced by source paper "performance oriented neural architecture search"):
  with members:
    - "synetgy algorithm hardware co design for convnet accelerators on embedded fpgas"
    - "quenn quantization engine for low power neural networks"
    - "streaming end to end speech recognition for mobile devices"
    - "proxylessnas direct neural architecture search on target task and hardware"
    - "speech commands a dataset for limited vocabulary speech recognition"
    - "hello edge keyword spotting on microcontrollers"
    - "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size"
    - "smash one shot model architecture search through hypernetworks"

Connected through hyperedge HE-3 (induced by source paper "benanza automatic mu benchmark generation to compute lower bound latency and inform optimizations of deep learning models on gpus"):
  with members:
    - "a survey on compiler autotuning using machine learning"
    - "miopen an open source library for deep learning primitives"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "xsp across stack profiling and analysis of machine learning models on gpus"
    - "neurovectorizer end to end vectorization with deep reinforcement learning"
    - "analysis of dawnbench a time to accuracy machine learning performance benchmark"
    - "arcface additive angular margin loss for deep face recognition"
    - "shufflenet an extremely efficient convolutional neural network for mobile devices"

Connected through hyperedge HE-4 (induced by source paper "fusionstitching boosting execution efficiency of memory intensive computations for dl workloads"):
  with members:
    - "billion scale commodity embedding for e commerce recommendation in alibaba"
    - "attention focusing for neural machine translation by bridging source and target embeddings"
    - "deep residual learning for image recognition"
    - "mxnet a flexible and efficient machine learning library for heterogeneous distributed systems"
    - "rethinking the inception architecture for computer vision"
    - "efficient kernel fusion techniques for massive video data analysis on gpgpus"
    - "very deep convolutional networks for large scale image recognition"

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.PF(Performance)