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 "hiring secretaries over time the benefit of concurrent employment"):
  Abstract: We consider a variant of the stochastic secretary problem where applicants need to be hired over time. Upon arrival of each applicant their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This decision is irrevocable, i.e., we can neither extend a contract nor dismiss a candidate once hired. In every time step, at least one candidate needs to be under contract, and our goal is to minimize the total hiring cost, which is the sum of the applicants' costs multiplied with their respective employment durations. #R##N#We provide a competitive online algorithm for the case that the applicants' costs are drawn independently from a known distribution. Specifically, the algorithm achieves a competitive ratio of $2.98$ for the case of uniform distributions, and we give a computational lower bound of~$2.14$. We are able to adapt our algorithm to stay competitive in settings where at most two applicants can be hired concurrently and/or the distribution of the applicants' costs is unknown. On the other hand, we show that concurrent employment is a necessary feature of competitive algorithms by showing that no algorithm has a competitive ratio better than $\Omega(\sqrt{n} / \log n)$ if concurrent employment is forbidden, even for uniform distributions and when the total number of time steps is known.

Includes members:
  Member "combinatorial prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "beyond matroids secretary problem and prophet inequality with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "the temp secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the warm starting sequential selection problem and its multi round extension")
  Member "online independent set beyond the worst case secretaries prophets and periods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust algorithms for the secretary problem")
  Member "polymatroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "predict and match prophet inequalities with uncertain supply")
  Member "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a permutation equivariant neural network architecture for auction design")

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)