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: "algorithms for secretary problems on graphs and hypergraphs"
  Abstract: We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We develop an 8-competitive algorithm for the following secretary problem: Initially given R, and the size of L, the algorithm receives the vertices of L sequentially, in a random order. When a vertex l \in L is seen, all edges incident to l are revealed, together with their weights. The algorithm must immediately either match l to an available vertex of R, or decide that l will remain unmatched. #R##N#Dimitrov and Plaxton show a 16-competitive algorithm for the transversal matroid secretary problem, which is the special case with weights on vertices, not edges. (Equivalently, one may assume that for each l \in L, the weights on all edges incident to l are identical.) We use a similar algorithm, but simplify and improve the analysis to obtain a better competitive ratio for the more general problem. Perhaps of more interest is the fact that our analysis is easily extended to obtain competitive algorithms for similar problems, such as to find disjoint sets of edges in hypergraphs where edges arrive online. We also introduce secretary problems with adversarially chosen groups. Finally, we give a 2e-competitive algorithm for the secretary problem on graphic matroids, where, with edges appearing online, the goal is to find a maximum-weight acyclic subgraph of a given graph.

Connected through hyperedge HE-1 (induced by source paper "random order models"):
  with members:
    - "robust algorithms for the secretary problem"
    - "prophet secretary for combinatorial auctions and matroids"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "secretary problems with non uniform arrival order"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "prophet inequalities with limited information"
    - "primal beats dual on online packing lps in the random order model"

Connected through hyperedge HE-2 (induced by source paper "robust algorithms for the secretary problem"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "stochastic bandits robust to adversarial corruptions"
    - "learning geometric concepts with nasty noise"
    - "learning from untrusted data"
    - "agnostic estimation of mean and covariance"
    - "robust estimators in high dimensions without the computational intractability"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"

Connected through hyperedge HE-3 (induced by source paper "prophets secretaries and maximizing the probability of choosing the best"):
  with members:
    - "stochastic k server how should uber work"
    - "prophet secretary for combinatorial auctions and matroids"
    - "online matroid intersection beating half for random arrival"
    - "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"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "mechanism design via correlation gap"

Connected through hyperedge HE-4 (induced by source paper "online matching with stochastic rewards optimal competitive ratio via path based formulation"):
  with members:
    - "online allocation of reusable resources achieving optimal competitive ratio"
    - "online primal dual meets online matching with stochastic rewards configuration lp to the rescue"
    - "vertex weighted online stochastic matching with patience constraints"
    - "new algorithms better bounds and a novel model for online stochastic matching"
    - "budget optimal task allocation for reliable crowdsourcing systems"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "online stochastic matching online actions based on offline statistics"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-5 (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-6 (induced by source paper "secretary ranking with minimal inversions"):
  with members:
    - "active ranking from pairwise comparisons and when parametric assumptions don t help"
    - "top k ranking from pairwise comparisons when spectral ranking is optimal"
    - "parallel algorithms for select and partition with noisy comparisons"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "secretary problems with non uniform arrival order"
    - "spectral mle top k rank aggregation from pairwise comparisons"
    - "pricing online decisions beyond auctions"
    - "simple robust and optimal ranking from pairwise comparisons"

Connected through hyperedge HE-7 (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 temp secretary problem"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "online trading as a secretary problem"):
  with members:
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "fixed price approximability of the optimal gain from trade"
    - "online market intermediation"
    - "sbba a strongly budget balanced double auction mechanism"
    - "combinatorial auctions via posted prices"

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)