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: "matroid secretary problem in the random assignment model"
  Abstract: In the Matroid Secretary Problem, introduced by Babaioff et al. [SODA 2007], the elements of a given matroid are presented to an online algorithm in random order. When an element is revealed, the algorithm learns its weight and decides whether or not to select it under the restriction that the selected elements form an independent set in the matroid. The objective is to maximize the total weight of the chosen elements. In the most studied version of this problem, the algorithm has no information about the weights beforehand. We refer to this as the zero information model. In this paper we study a different model, also proposed by Babaioff et al., in which the relative order of the weights is random in the matroid. To be precise, in the random assignment model, an adversary selects a collection of weights that are randomly assigned to the elements of the matroid. Later, the elements are revealed to the algorithm in a random order independent of the assignment. #R##N#Our main result is the first constant competitive algorithm for the matroid secretary problem in the random assignment model. This solves an open question of Babaioff et al. Our algorithm achieves a competitive ratio of $2e^2/(e-1)$. It exploits the notion of principal partition of a matroid, its decomposition into uniformly dense minors, and a $2e$-competitive algorithm for uniformly dense matroids we also develop. As additional results, we present simple constant competitive algorithms in the zero information model for various classes of matroids including cographic, low density and the case when every element is in a small cocircuit. In the same model, we also give a $ke$-competitive algorithm for $k$-column sparse linear matroids, and a new $O(\log r)$-competitive algorithm for general matroids of rank $r$ which only uses the relative order of the weights seen and not their numerical value, as previously needed.

Connected through hyperedge HE-1 (induced by source paper "submodular matroid secretary problem with shortlists"):
  with members:
    - "quasi polynomial algorithms for submodular tree orienteering and other directed network design problems"
    - "submodular streaming in all its glory tight approximation minimum memory and low adaptive complexity"
    - "submodular secretary problem with shortlists"
    - "do less get more streaming submodular maximization with subsampling"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "a logarithmic integrality gap bound for directed steiner tree in quasi bipartite graphs"
    - "submodular secretary problems cardinality matching and linear constraints"
    - "streaming algorithms for submodular function maximization"

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 "combinatorial secretary problems with ordinal information"):
  with members:
    - "randomized social choice functions under metric preferences"
    - "primal beats dual on online packing lps in the random order model"
    - "advances on matroid secretary problems free order model and laminar case"

Connected through hyperedge HE-4 (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"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"

Connected through hyperedge HE-5 (induced by source paper "online contention resolution schemes"):
  with members:
    - "the submodular secretary problem goes linear"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "submodular stochastic probing on matroids"
    - "a stochastic probing problem with applications"
    - "matroid prophet inequalities"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "mechanism design via correlation gap"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"

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"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"

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"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-8 (induced by source paper "o log log rank competitive ratio 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"
    - "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)