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: "gaming is a hard job but someone has to do it"
  Abstract: We establish some general schemes relating the computational complexity of a video game to the presence of certain common elements or mechanics, such as destroyable paths, collectible items, doors opened by keys or activated by buttons or pressure plates, etc. Then we apply such "metatheorems" to several video games published between 1980 and 1998, including Pac-Man, Tron, Lode Runner, Boulder Dash, Deflektor, Mindbender, Pipe Mania, Skweek, Prince of Persia, Lemmings, Doom, Puzzle Bobble~3, and Starcraft. We obtain both new results, and improvements or alternative proofs of previously known results.

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"
    - "bejeweled candy crush and other match three games are np hard"
    - "towards a theory of mind inspired generic decision making framework"
    - "candy crush is np hard"
    - "classic nintendo games are computationally hard"

Connected through hyperedge HE-2 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games"):
  with members:
    - "computational complexity of games and puzzles"
    - "trainyard is np hard"
    - "on planar variants of the monotone satisfiability problem with bounded variable appearances"
    - "the computational complexity of portal and other 3d video games"
    - "candy crush is np hard"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "the complexity of the puzzles of final fantasy xiii 2"

Connected through hyperedge HE-3 (induced by source paper "a note on computational complexity of dou shou qi"):
  with members:
    - "a note on hardness frameworks and computational complexity of xiangqi and janggi"
    - "endgame analysis of dou shou qi"
    - "classic nintendo games are computationally hard"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-4 (induced by source paper "a note on hardness frameworks and computational complexity of xiangqi and janggi"):
  with members:
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-5 (induced by source paper "lasertank is np complete"):
  with members:
    - "tetris is hard even to approximate"

Connected through hyperedge HE-6 (induced by source paper "a general theory of motion planning complexity characterizing which gadgets make games hard"):
  with members:
    - "computational complexity of motion planning of a robot through simple gadgets"
    - "push pull block puzzles are hard"
    - "pspace completeness of bloxorz and of games with 2 buttons"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-7 (induced by source paper "computational complexity of games and puzzles"):
  with members:
    - "the computational complexity of portal and other 3d video games"
    - "combinatorial game complexity an introduction with poset games"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "spider solitaire is np complete"
    - "tetris is hard even to approximate"

Connected through hyperedge HE-8 (induced by source paper "the computational complexity of finding hamiltonian cycles in grid graphs of semiregular tessellations"):
  with members:
    - "solving the rubik s cube optimally is np complete"
    - "hamiltonicity is hard in thin or polygonal grid graphs but easy in thin polygonal grid graphs"

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)