human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "the warm starting sequential selection problem and its multi round extension"):
  with members:
    - "strong algorithms for the ordinal matroid secretary problem"
    - "learning in the repeated secretary problem"
    - "a framework for the secretary problem on the intersection of matroids"
    - "think eternally improved algorithms for the temp secretary problem and extensions"
    - "building a good team secretary problems and the supermodular degree"

Connected through hyperedge HE-2 (induced by source paper "packing returning secretaries"):
  with members:
    - "combinatorial secretary problems with ordinal information"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "submodular secretary problems cardinality matching and linear constraints"
    - "the submodular secretary problem goes linear"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-3 (induced by source paper "hiring secretaries over time the benefit of concurrent employment"):
  with members:
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "polymatroid prophet inequalities"
    - "matroid prophet inequalities"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"

Connected through hyperedge HE-4 (induced by source paper "know when to persist deriving value from a stream buffer"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "think eternally improved algorithms for the temp secretary problem and extensions"

Question: Please tell me which class the center node 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)