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: "practical design space exploration"
  Abstract: Multi-objective optimization is a crucial matter in computer systems design space exploration because real-world applications often rely on a trade-off between several objectives. Derivatives are usually not available or impractical to compute and the feasibility of an experiment can not always be determined in advance. These problems are particularly difficult when the feasible region is relatively small, and it may be prohibitive to even find a feasible experiment, let alone an optimal one. #R##N#We introduce a new methodology and corresponding software framework, HyperMapper 2.0, which handles multi-objective optimization, unknown feasibility constraints, and categorical/ordinal variables. This new methodology also supports injection of user prior knowledge in the search when available. All of these features are common requirements in computer systems but rarely exposed in existing design space exploration systems. The proposed methodology follows a white-box model which is simple to understand and interpret (unlike, for example, neural networks) and can be used by the user to better understand the results of the automatic search. #R##N#We apply and evaluate the new methodology to automatic static tuning of hardware accelerators within the recently introduced Spatial programming language, with minimization of design runtime and compute logic under the constraint of the design fitting in a target field programmable gate array chip. Our results show that HyperMapper 2.0 provides better Pareto fronts compared to state-of-the-art baselines, with better or competitive hypervolume indicator and with 8x improvement in sampling budget for most of the benchmarks explored.

Connected through hyperedge HE-1 (induced by source paper "flexibo cost aware multi objective optimization of deep neural networks"):
  with members:
    - "transfer learning for performance modeling of deep neural network systems"
    - "fixynn efficient hardware for mobile computer vision via transfer learning"
    - "learning software configuration spaces a systematic literature review"
    - "multi objective bayesian optimisation with preferences over objectives"
    - "a flexible framework for multi objective bayesian optimization using random scalarizations"
    - "ordered preference elicitation strategies for supporting multi objective decision making"
    - "towards automated deep learning efficient joint neural architecture and hyperparameter search"
    - "proxylessnas direct neural architecture search on target task and hardware"

Connected through hyperedge HE-2 (induced by source paper "polystore accelerated polystore system for heterogeneous workloads"):
  with members:
    - "relay a new ir for machine learning frameworks"
    - "rheemix in the data jungle a cross platform query optimizer"
    - "in rdbms hardware acceleration of advanced analytics"
    - "in datacenter performance analysis of a tensor processing unit"
    - "empowering in memory relational database engines with native graph processing"
    - "algorithmic performance accuracy trade off in 3d vision applications using hypermapper"
    - "pipegen data pipe generator for hybrid analytics"
    - "the bigdawg polystore system and architecture"

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.LG(Machine Learning)