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: "mastermind is np complete"
  Abstract: In this paper we show that the Mastermind Satisfiability Problem (MSP) is NP-complete. The Mastermind is a popular game which can be turned into a logical puzzle called Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an addition to our knowledge about a host of other puzzles, such as Minesweeper, Mah-Jongg, and the 15-puzzle.

Connected through hyperedge HE-1 (induced by source paper "search algorithms for mastermind"):
  with members:
    - "an optimal mastermind 4 7 strategy and more results in the expected case"

Connected through hyperedge HE-2 (induced by source paper "on the query complexity of black peg ab mastermind"):
  with members:
    - "the worst case number of questions in generalized ab game with and without white peg answers"
    - "improved approximation algorithm for the number of queries necessary to identify a permutation"
    - "playing mastermind with many colors"
    - "hardness of mastermind"
    - "playing mastermind with constant size memory"
    - "on the algorithmic complexity of the mastermind game with black peg results"
    - "the mastermind attack on genomic data"

Connected through hyperedge HE-3 (induced by source paper "the worst case number of questions in generalized ab game with and without white peg answers"):
  with members:
    - "improved approximation algorithm for the number of queries necessary to identify a permutation"
    - "playing mastermind with many colors"
    - "hardness of mastermind"
    - "playing mastermind with constant size memory"
    - "on the algorithmic complexity of the mastermind game with black peg results"

Connected through hyperedge HE-4 (induced by source paper "improved approximation algorithm for the number of queries necessary to identify a permutation"):
  with members:
    - "playing mastermind with many colors"
    - "hardness of mastermind"
    - "playing mastermind with constant size memory"
    - "on the algorithmic complexity of the mastermind game with black peg results"

Connected through hyperedge HE-5 (induced by source paper "playing mastermind with many colors"):
  with members:
    - "hardness of mastermind"
    - "playing mastermind with constant size memory"
    - "on the algorithmic complexity of the mastermind game with black peg results"
    - "the mastermind attack on genomic data"
    - "a constructive proof of the lovasz local lemma"

Connected through hyperedge HE-6 (induced by source paper "learning character strings via mastermind queries with a case study involving mtdna"):
  with members:
    - "on the algorithmic complexity of the mastermind game with black peg results"
    - "the mastermind attack on genomic data"
    - "confluent drawings visualizing non planar diagrams in a planar way"

Connected through hyperedge HE-7 (induced by source paper "hardness of mastermind"):
  with members:
    - "on the algorithmic complexity of the mastermind game with black peg results"

Connected through hyperedge HE-8 (induced by source paper "playing mastermind with constant size memory"):
  with members:
    - "on the algorithmic complexity of the mastermind game with black peg results"

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.CC(Computational Complexity)