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 "probo versatile bayesian optimization using any probabilistic programming language"):
  Abstract: Optimizing an expensive-to-query function is a common task in science and engineering, where it is beneficial to keep the number of queries to a minimum. A popular strategy is Bayesian optimization (BO), which leverages probabilistic models for this task. Most BO today uses Gaussian processes (GPs), or a few other surrogate models. However, there is a broad set of Bayesian modeling techniques that could be used to capture complex systems and reduce the number of queries in BO. Probabilistic programming languages (PPLs) are modern tools that allow for flexible model definition, prior specification, model composition, and automatic inference. In this paper, we develop ProBO, a BO procedure that uses only standard operations common to most PPLs. This allows a user to drop in a model built with an arbitrary PPL and use it directly in BO. We describe acquisition functions for ProBO, and strategies for efficiently optimizing these functions given complex models or costly inference procedures. Using existing PPLs, we implement new models to aid in a few challenging optimization settings, and demonstrate these on model hyperparameter and architecture search tasks.

Includes members:
  Member "neural architecture search with bayesian optimisation and optimal transport":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "real time federated evolutionary neural architecture search")
  Member "inference compilation and universal probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning compositional rules via neural program synthesis")
  Member "deep amortized inference for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meta learning of sequential strategies")
  Member "neural architecture search with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "venture a higher order probabilistic programming platform with programmable inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastically differentiable probabilistic programs")
  Member "approximate bayesian image interpretation using generative probabilistic graphics programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "are we done with object recognition the icub robot s perspective")
  Member "information theoretic regret bounds for gaussian process optimization in the bandit setting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient and robust algorithms for adversarial linear contextual bandits")

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