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 "stochastic packing integer programs with few queries"):
  Abstract: We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables in the objective vector. We are allowed to reveal each entry of the objective vector by conducting a query, and the task is to find a good solution by conducting a small number of queries. We propose a general framework of adaptive and non-adaptive algorithms for this problem, and provide a unified methodology for analyzing the performance of those algorithms. We also demonstrate our framework by applying it to a variety of stochastic combinatorial optimization problems such as matching, matroid, and stable set problems.

Includes members:
  Member "the stochastic matching problem beating half with a non adaptive algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic matching with few queries 1 varepsilon approximation")
  Member "almost optimal stochastic weighted matching with few queries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic matching with few queries 1 varepsilon approximation")
  Member "adaptivity gaps for stochastic probing submodular and xos functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pandora s box problem with order constraints")
  Member "ignorance is almost bliss near optimal stochastic matching with few queries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stochastic matching with few queries 1 varepsilon approximation")
  Member "generalized hypergraph matching via iterated packing and local ratio":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integrality gaps for bounded color matchings")
  Member "submodular stochastic probing on matroids":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning optimal search algorithms from data")
  Member "a stochastic probing problem with applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning optimal search algorithms from data")
  Member "iterative packing for demand and hypergraph matching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "integrality gaps for bounded color matchings")

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.DS(Data Structures and Algorithms)