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 "on the query complexity of black peg ab mastermind"):
  Abstract: Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the codemaker after each guess. In this paper, we consider the so called Black-Peg variant of Mastermind, where the only information concerning a guess is the number of positions in which the guess coincides with the secret code. More precisely, we deal with a special version of the Black-Peg game with n holes and k n we prove an upper bound for the problem of (n-1)*ld(n)+k+1. Furthermore we prove a new lower bound for (a generalization of) the case k=n that improves the recent result of Berger et al. (2016) from n-log(log(n)) to n. We also give a lower bound of k queries for the case k>n.

Includes members:
  Member "the worst case number of questions in generalized ab game with and without white peg answers":
    also connected through other hyperedges:
      (none)
  Member "improved approximation algorithm for the number of queries necessary to identify a permutation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the worst case number of questions in generalized ab game with and without white peg answers")
  Member "playing mastermind with many colors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the advantages of multiple classes for reducing overfitting from test set reuse")
  Member "hardness of mastermind":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the worst case number of questions in generalized ab game with and without white peg answers")
  Member "playing mastermind with constant size memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "black box complexity of the binary value function")
  Member "on the algorithmic complexity of the mastermind game with black peg results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory for discrete black box optimization heuristics")
  Member "the mastermind attack on genomic data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "evaluating the strength of genomic privacy metrics")
  Member "mastermind is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "search algorithms for mastermind")

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)