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: "bejeweled candy crush and other match three games are np hard"
  Abstract: The twentieth century has seen the rise of a new type of video games targeted at a mass audience of "casual" gamers. Many of these games require the player to swap items in order to form matches of three and are collectively known as \emph{tile-matching match-three games}. Among these, the most influential one is arguably \emph{Bejeweled} in which the matched items (gems) pop and the above gems fall in their place. Bejeweled has been ported to many different platforms and influenced an incredible number of similar games. Very recently one of them, named \emph{Candy Crush Saga} enjoyed a huge popularity and quickly went viral on social networks. We generalize this kind of games by only parameterizing the size of the board, while all the other elements (such as the rules or the number of gems) remain unchanged. Then, we prove that answering many natural questions regarding such games is actually \NP-Hard. These questions include determining if the player can reach a certain score, play for a certain number of turns, and others. We also \href{this http URL}{provide} a playable web-based implementation of our reduction.

Connected through hyperedge HE-1 (induced by source paper "the computational complexity of angry birds"):
  with members:
    - "the computational complexity of portal and other 3d video games"
    - "pspace completeness of bloxorz and of games with 2 buttons"
    - "braid is undecidable"
    - "a bayesian ensemble regression framework on the angry birds game"
    - "towards a theory of mind inspired generic decision making framework"
    - "candy crush is np hard"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"

Connected through hyperedge HE-2 (induced by source paper "np completeness of the game kingdomino"):
  with members:
    - "monte carlo methods for the game kingdomino"
    - "hanabi is np complete even for cheaters who look at their cards"
    - "an aperiodic set of 11 wang tiles"
    - "candy crush is np hard"
    - "the computational complexity of the game of set and its theoretical applications"
    - "domino tatami covering is np complete"
    - "classic nintendo games are computationally hard"

Connected through hyperedge HE-3 (induced by source paper "push pull block puzzles are hard"):
  with members:
    - "classic nintendo games are computationally hard"
    - "motion planning with pull moves"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"
    - "pushpush and push 1 are np hard in 2d"

Connected through hyperedge HE-4 (induced by source paper "trainyard is np hard"):
  with members:
    - "large peg army maneuvers"
    - "the computational complexity of portal and other 3d video games"
    - "2048 is pspace hard but sometimes easy"
    - "classic nintendo games are computationally hard"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-5 (induced by source paper "hanabi is np hard even for cheaters who look at their cards"):
  with members:
    - "candy crush is np hard"
    - "the computational complexity of the game of set and its theoretical applications"
    - "tetris is hard even to approximate"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-6 (induced by source paper "large peg army maneuvers"):
  with members:
    - "classic nintendo games are computationally hard"

Connected through hyperedge HE-7 (induced by source paper "on the complexity of slide and merge games"):
  with members:
    - "pushpush is np hard in 2d"

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)