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 "the worst case number of questions in generalized ab game with and without white peg answers"):
  Abstract: The AB game is a two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible. It is a variant of the famous Mastermind game, with the only difference that all pegs in both, the secret and the questions must have distinct colors. In this work, we consider the Generalized AB game, where for given arbitrary numbers p , c with p ? c the secret code consists of p pegs each having one of c colors and the answer consists of a number of black and white pegs. There the number of black pegs equals the number of pegs matching in the corresponding question and the secret in position and color, and the number of white pegs equals the additional number of pegs matching in the corresponding question and the secret only in color. We consider also a variant of the Generalized AB game, where the information of white pegs is omitted. This variant is called Generalized Black-peg AB game. Let ab ( p , c ) and abb ( p , c ) be the number of questions in the worst case needed by the codebreaker to guess the secret for Generalized AB game and Generalized Black-peg AB game, respectively. Combining a computer program with theoretical considerations, we confirm known exact values of ab ( 2 , c ) and ab ( 3 , c ) and prove tight bounds for ab ( 4 , c ) . Furthermore, we present exact values for abb ( 2 , c ) and abb ( 3 , c ) and tight bounds for abb ( 4 , c ) .

Includes members:
  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 "on the query complexity of black peg ab mastermind")
  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 "on the query complexity of black peg ab mastermind")
  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 "mastermind is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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.GT(Computer Science and Game Theory)