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 "the temp secretary problem"):
  Abstract: We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of Finding a large independent set in a random unit interval graph.

Includes members:
  Member "o log log rank competitive ratio for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "online independent set beyond the worst case secretaries prophets and periods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust algorithms for the secretary problem")
  Member "primal beats dual on online packing lps in the random order model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "random order models")
  Member "algorithms for secretary problems on graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random order models")

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)