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 contract design for crowdsourcing markets bandit algorithms for repeated principal agent problems"):
  Abstract: Crowdsourcing markets have emerged as a popular platform for matching available workers with tasks to complete. The payment for a particular task is typically set by the task's requester, and may be adjusted based on the quality of the completed work, for example, through the use of "bonus" payments. In this paper, we study the requester's problem of dynamically adjusting quality-contingent payments for tasks. We consider a multi-round version of the well-known principal-agent model, whereby in each round a worker makes a strategic choice of the effort level which is not directly observable by the requester. In particular, our formulation significantly generalizes the budget-free online task pricing problems studied in prior work. #R##N#We treat this problem as a multi-armed bandit problem, with each "arm" representing a potential contract. To cope with the large (and in fact, infinite) number of arms, we propose a new algorithm, AgnosticZooming, which discretizes the contract space into a finite number of regions, effectively treating each region as a single arm. This discretization is adaptively refined, so that more promising regions of the contract space are eventually discretized more finely. We analyze this algorithm, showing that it achieves regret sublinear in the time horizon and substantially improves over non-adaptive discretization (which is the only competing approach in the literature). #R##N#Our results advance the state of art on several different topics: the theory of crowdsourcing markets, principal-agent problems, multi-armed bandits, and dynamic pricing.

Includes members:
  Member "contextual bandits with global constraints and objective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "matching while learning")
  Member "incentivizing high quality crowdwork":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "crowdsourcing the perception of machine teaching")
  Member "bandits with concave rewards and convex knapsacks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploration exploitation in constrained mdps")
  Member "resourceful contextual bandits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "advances in bandits with knapsacks")
  Member "bandit algorithms for tree search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bayesian optimization for backpropagation in monte carlo tree search")
  Member "bandits with knapsacks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploration exploitation in constrained mdps")
  Member "regret analysis of stochastic and nonstochastic multi armed bandit problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi source domain adaptation for text classification via distancenet bandits")
  Member "dynamic pricing with limited supply":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "advances in bandits with knapsacks")

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)