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 simulated greedy algorithm for several submodular matroid secretary problems"
  Abstract: We study the matroid secretary problems with submodular valuation functions. In these problems, the elements arrive in random order. When one element arrives, we have to make an immediate and irrevocable decision on whether to accept it or not. The set of accepted elements must form an {\em independent set} in a predefined matroid. Our objective is to maximize the value of the accepted elements. In this paper, we focus on the case that the valuation function is a non-negative and monotonically non-decreasing submodular function. #R##N#We introduce a general algorithm for such {\em submodular matroid secretary problems}. In particular, we obtain constant competitive algorithms for the cases of laminar matroids and transversal matroids. Our algorithms can be further applied to any independent set system defined by the intersection of a {\em constant} number of laminar matroids, while still achieving constant competitive ratios. Notice that laminar matroids generalize uniform matroids and partition matroids. #R##N#On the other hand, when the underlying valuation function is linear, our algorithm achieves a competitive ratio of 9.6 for laminar matroids, which significantly improves the previous result.

Connected through hyperedge HE-1 (induced by source paper "an improved algorithm for the submodular secretary problem with a cardinality constraint"):
  with members:
    - "combinatorial prophet inequalities"
    - "constrained submodular maximization via a non symmetric technique"
    - "submodular secretary problems cardinality matching and linear constraints"
    - "building a good team secretary problems and the supermodular degree"
    - "the submodular secretary problem goes linear"
    - "constrained non monotone submodular maximization offline and secretary algorithms"

Connected through hyperedge HE-2 (induced by source paper "strong algorithms for the ordinal matroid secretary problem"):
  with members:
    - "combinatorial secretary problems with ordinal information"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "secretary problems with non uniform arrival order"
    - "the submodular secretary problem goes linear"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "prophet inequalities with limited information"

Connected through hyperedge HE-3 (induced by source paper "submodular secretary problems cardinality matching and linear constraints"):
  with members:
    - "building a good team secretary problems and the supermodular degree"
    - "fast algorithms for online stochastic convex programming"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "a dynamic near optimal algorithm for online linear programming"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-4 (induced by source paper "think eternally improved algorithms for the temp secretary problem and extensions"):
  with members:
    - "fast algorithms for online stochastic convex programming"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "a dynamic near optimal algorithm for online linear programming"

Connected through hyperedge HE-5 (induced by source paper "the submodular secretary problem goes linear"):
  with members:
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"
    - "prophet inequalities with limited information"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"
    - "secretary problems with convex costs"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "constrained non monotone submodular maximization offline and secretary algorithms"

Connected through hyperedge HE-6 (induced by source paper "building a good team secretary problems and the supermodular degree"):
  with members:
    - "constrained monotone function maximization and the supermodular degree"
    - "a unifying hierarchy of valuations with complements and substitutes"
    - "prophet inequalities with limited information"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary problem in the random assignment model"

Connected through hyperedge HE-7 (induced by source paper "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"):
  with members:
    - "prophet inequalities with limited information"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"
    - "on variants of the matroid secretary problem"
    - "secretary problems with convex costs"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "matroid secretary problem in the random assignment model"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-8 (induced by source paper "advances on matroid secretary problems free order model and laminar case"):
  with members:
    - "prophet inequalities with limited information"
    - "matroid secretary for regular and decomposable matroids"
    - "on variants of the matroid secretary problem"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "matroid secretary problem in the random assignment model"
    - "algorithms for secretary problems on graphs and hypergraphs"

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)