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 "pandora s box problem with order constraints"):
  Abstract: The Pandora's Box Problem, originally formalized by Weitzman in 1979, models selection from set of random, alternative options, when evaluation is costly. This includes, for example, the problem of hiring a skilled worker, where only one hire can be made, but the evaluation of each candidate is an expensive procedure. Weitzman showed that the Pandora's Box Problem admits an elegant, simple solution, where the options are considered in decreasing order of reservation value,i.e., the value that reduces to zero the expected marginal gain for opening the box. We study for the first time this problem when order - or precedence - constraints are imposed between the boxes. We show that, despite the difficulty of defining reservation values for the boxes which take into account both in-depth and in-breath exploration of the various options, greedy optimal strategies exist and can be efficiently computed for tree-like order constraints. We also prove that finding approximately optimal adaptive search strategies is NP-hard when certain matroid constraints are used to further restrict the set of boxes which may be opened, or when the order constraints are given as reachability constraints on a DAG. We complement the above result by giving approximate adaptive search strategies based on a connection between optimal adaptive strategies and non-adaptive strategies with bounded adaptivity gap for a carefully relaxed version of the problem.

Includes members:
  Member "near optimal adaptivity gaps for stochastic multi value probing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback")
  Member "pandora s problem with nonobligatory inspection":
    also connected through other hyperedges:
      (none)
  Member "generalizing complex hypotheses on product distributions auctions prophet inequalities and pandora s problem":
    also connected through other hyperedges:
      (none)
  Member "submodular maximization beyond non negativity guarantees fast algorithms and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "regularized submodular maximization at scale")
  Member "guess free maximization of submodular and linear sums":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "regularized submodular maximization at scale")
  Member "the price of information in combinatorial optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple 1 1 e approximation for oblivious bipartite matching")
  Member "adaptivity gaps for stochastic probing submodular and xos functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online")
  Member "optimal approximation for submodular and supermodular optimization with bounded curvature":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "regularized submodular maximization at scale")

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.GT(Computer Science and Game Theory)