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: "on variants of the matroid secretary problem"
  Abstract: We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the "random assignment" model where the weights are assigned randomly to the elements of a matroid, and then the elements arrive on-line in an adversarial order (extending a result of Soto \cite{Soto11}). This is under the assumption that the matroid is known in advance. If the matroid is unknown in advance, we present an $O(\log r \log n)$-approximation, and prove that a better than $O(\log n / \log \log n)$ approximation is impossible. This resolves an open question posed by Babaioff et al. \cite{BIK07}. #R##N#As a natural special case, we also consider the classical secretary problem where the number of candidates $n$ is unknown in advance. If $n$ is chosen by an adversary from $\{1,...,N\}$, we provide a nearly tight answer, by providing an algorithm that chooses the best candidate with probability at least $1/(H_{N-1}+1)$ and prove that a probability better than $1/H_N$ cannot be achieved (where $H_N$ is the $N$-th harmonic number).

Connected through hyperedge HE-1 (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-2 (induced by source paper "a framework for the secretary problem on the intersection of matroids"):
  with members:
    - "secretary problems with non uniform arrival order"
    - "online contention resolution schemes"
    - "prophet inequalities with limited information"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "polymatroid prophet inequalities"
    - "matroid prophet inequalities"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"

Connected through hyperedge HE-3 (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"
    - "secretary problems with convex costs"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"
    - "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-4 (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"
    - "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-5 (induced by source paper "solving multi choice secretary problem in parallel an optimal observation selection protocol"):
  with members:
    - "a primal dual continuous lp method on the multi choice multi best secretary problem"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"
    - "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-6 (induced by source paper "the secretary returns"):
  with members:
    - "models for truthful online double auctions"
    - "online vertex weighted bipartite matching and single bid budgeted allocations"
    - "matroid secretary problem in the random assignment model"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-7 (induced by source paper "prophet inequalities with limited information"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "matroid prophet inequalities"
    - "advances on matroid secretary problems free order model and laminar case"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "the power of randomness in bayesian optimal mechanism design"
    - "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"
    - "the simulated greedy algorithm for several submodular matroid secretary problems"
    - "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)