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 "a framework for the secretary problem on the intersection of matroids"):
  Abstract: The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arrival. The different applications that map to the secretary problem ask for different constraint families to be handled. The most prominent ones are matroid constraints, which both capture many relevant settings and admit strongly competitive secretary algorithms. However, dealing with more involved constraints proved to be much more difficult, and strong algorithms are known only for a few specific settings. In this paper, we present a general framework for dealing with the secretary problem over the intersection of several matroids. This framework allows us to combine and exploit the large set of matroid secretary algorithms known in the literature. As one consequence, we get constant-competitive secretary algorithms over the intersection of any constant number of matroids whose corresponding (single-)matroid secretary problems are currently known to have a constant-competitive algorithm. Moreover, we show that our results extend to submodular objectives.

Includes members:
  Member "secretary problems with non uniform arrival order":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random order models")
  Member "online contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "prophet inequalities with limited information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  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 "advances on matroid secretary problems free order model and laminar case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "matroid secretary for regular and decomposable matroids":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")

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)