human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "near optimal online algorithms and fast approximation algorithms for resource allocation problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "fast algorithms for online stochastic convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple and fast algorithm for binary integer and online linear programming")
  Member "o log log rank competitive ratio for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "online independent set beyond the worst case secretaries prophets and periods":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust algorithms for the secretary problem")
  Member "primal beats dual on online packing lps in the random order model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random order models")
  Member "advances on matroid secretary problems free order model and laminar case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "online stochastic packing applied to display ad allocation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "near optimal online algorithms and fast approximation algorithms for resource allocation problems")

Question: Please tell me which class the source paper 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)