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 "adaptive submodular ranking"):
  Abstract: We study a general adaptive ranking problem where an algorithm needs to perform a sequence of actions on a random user, drawn from a known distribution, so as to "satisfy" the user as early as possible. The satisfaction of each user is captured by an individual submodular function, where the user is said to be satisfied when the function value goes above some threshold. We obtain a logarithmic factor approximation algorithm for this adaptive ranking problem, which is the best possible. The adaptive ranking problem has many applications in active learning and ranking: it significantly generalizes previously-studied problems such as optimal decision trees, equivalence class determination, decision region determination and submodular cover. We also present some preliminary experimental results based on our algorithm.

Includes members:
  Member "approximation algorithms for optimal decision trees and adaptive tsp problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a tight analysis of greedy yields subexponential time approximation for uniform decision tree")
  Member "scenario submodular cover":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic submodular cover with limited adaptivity")
  Member "near optimal bayesian active learning for decision making":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptivity in adaptive submodularity")
  Member "submodular meets structured finding diverse subsets in exponentially large structured item sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diversity in machine learning")
  Member "analytical approach to parallel repetition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an improved algorithm for dynamic set cover")
  Member "a note on the generalized min sum set cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the online min sum set cover problem")
  Member "near optimal bayesian active learning with noisy observations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "active learning in the overparameterized and interpolating regime")
  Member "when lp is the cure for your matching woes improved bounds for stochastic matchings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "predict and match prophet inequalities with uncertain supply")

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)