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 "finding a mediocre player"):
  Abstract: Consider a totally ordered set $S$ of $n$ elements; as an example, a set of tennis players and their rankings. Further assume that their ranking is a total order and thus satisfies transitivity and anti-symmetry.Following Frances Yao (1974), an element (player) is said to be $(i,j)$-\emph{mediocre} if it is neither among the top $i$ nor among the bottom $j$ elements of $S$. More than $40$ years ago, Yao suggested a stunningly simple algorithm for finding an $(i,j)$-mediocre element: Pick $i+j+1$ elements arbitrarily and select the $(i+1)$-th largest among them. She also asked: "Is this the best algorithm?" No one seems to have found such an algorithm ever since. #R##N#We first provide a deterministic algorithm that beats the worst-case comparison bound in Yao's algorithm for a large range of values of $i$ (and corresponding suitable $j=j(i)$). We then repeat the exercise for randomized algorithms; the average number of comparisons of our algorithm beats the average comparison bound in Yao's algorithm for another large range of values of $i$ (and corresponding suitable $j=j(i)$); the improvement is most notable in the symmetric case $i=j$. Moreover, the tight bound obtained in the analysis of Yao's algorithm allows us to give a definite answer for this class of algorithms. In summary, we answer Yao's question as follows: (i) "Presently not" for deterministic algorithms and (ii) "Definitely not" for randomized algorithms. (In fairness, it should be said however that Yao posed the question in the context of deterministic algorithms.)

Includes members:
  Member "quickmergesort practically efficient constant factor optimal sorting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quickxsort a fast sorting scheme in theory and practice")
  Member "selection from heaps row sorted matrices and x y using soft heaps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selection on x_1 x_2 cdots x_m with layer ordered heaps")
  Member "fast deterministic selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "worst case efficient sorting with quickmergesort")
  Member "a selectable sloppy heap":
    also connected through other hyperedges:
      (none)

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)