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: "secretary problems with non uniform arrival order"
  Abstract: For many online problems, it is known that the uniform arrival order enables the design of algorithms with much better performance guarantees than under worst-case. The quintessential example is the secretary problem. If the sequence of elements is presented in uniformly random order there is an algorithm that picks the maximum value with probability 1/e, whereas no non-trivial performance guarantee is possible if the elements arrive in worst-case order. This work initiates an investigation into relaxations of the random-ordering hypothesis in online algorithms, by focusing on the secretary problems. We present two sets of properties of distributions over permutations as sufficient conditions, called the block-independence property and uniform-induced-ordering property. We show these two are asymptotically equivalent by borrowing some techniques from the approximation theory. Moreover, we show they both imply the existence of secretary algorithms with constant probability of correct selection, approaching the optimal constant 1/e in the limit. We substantiate our idea by providing several constructions of distributions that satisfy block-independence. We also show that {\Theta}(log log n) is the minimum entropy of any permutation distribution that permits constant probability of correct selection in the secretary problem with n elements. While our block-independence condition is sufficient for constant probability of correct selection, it is not necessary; however, we present complexity-theoretic evidence that no simple necessary and sufficient criterion exists. Finally, we explore the extent to which the performance guarantees of other algorithms are preserved when one relaxes the uniform random ordering assumption, obtaining a positive result for Kleinberg's multiple-choice secretary algorithm and a negative result for the weighted bipartite matching algorithm of Korula and Pal.

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"
    - "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"
    - "fast incremental and personalized pagerank"

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 "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"
    - "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"
    - "polymatroid prophet inequalities"

Connected through hyperedge HE-4 (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"
    - "spectral mle top k rank aggregation from pairwise comparisons"
    - "pricing online decisions beyond auctions"
    - "simple robust and optimal ranking from pairwise comparisons"
    - "on the k independence required by linear probing and minwise independence"

Connected through hyperedge HE-5 (induced by source paper "prophets and secretaries with overbooking"):
  with members:
    - "think eternally improved algorithms for the temp secretary problem and extensions"
    - "combinatorial prophet inequalities"
    - "building a good team secretary problems and the supermodular degree"
    - "combinatorial auctions via posted prices"
    - "advances on matroid secretary problems free order model and laminar case"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "secretary problems with convex costs"
    - "buyback problem approximate matroid intersection with cancellation costs"

Connected through hyperedge HE-6 (induced by source paper "online resource allocation under partially predictable demand"):
  with members:
    - "a dynamic near optimal algorithm for online linear programming"

Connected through hyperedge HE-7 (induced by source paper "a framework for the secretary problem on the intersection of matroids"):
  with members:
    - "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"
    - "on variants of the matroid secretary problem"

Connected through hyperedge HE-8 (induced by source paper "near optimal irrevocable sample selection for periodic data streams with applications to marine robotics"):
  with members:
    - "information theoretic regret bounds for gaussian process optimization in the bandit setting"

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)