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: "playing games with algorithms algorithmic combinatorial game theory"
  Abstract: Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and Constraint Logic, which provides a framework for showing hardness. Then we survey results about the complexity of determining ideal play in these games, and the related problems of solving puzzles, in terms of both polynomial-time algorithms and computational intractability results. Our review of background and survey of algorithmic results are by no means complete, but should serve as a useful primer.

Connected through hyperedge HE-1 (induced by source paper "complexity limitations on one turn quantum refereed games"):
  with members:
    - "quantum interactive proofs with competing provers"
    - "quantum arthur merlin games"
    - "complexity limitations on quantum computation"
    - "simple strategies for large zero sum games with applications to complexity theory"

Connected through hyperedge HE-2 (induced by source paper "computational hardness of multidimensional subtraction games"):
  with members:
    - "from heaps of matches to the limits of computability"

Connected through hyperedge HE-3 (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-4 (induced by source paper "pushing lines helps efficient universal centralised transformations for programmable matter"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "on the transformation capability of feasible mechanisms for programmable matter"
    - "line recovery by programmable particles"
    - "shape formation by programmable particles"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "simple and efficient local codes for distributed stable network construction"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "the computational power of population protocols"

Connected through hyperedge HE-5 (induced by source paper "token swapping on trees"):
  with members:
    - "swapping colored tokens on graphs"
    - "the time complexity of permutation routing via matching token swapping and a variant"
    - "the time complexity of the token swapping problem and its parallel variants"
    - "approximation and hardness for token swapping"
    - "pebble games proof complexity and time space trade offs"
    - "the complexity of change"
    - "an efficient algorithm for the diameter of cayley graphs generated by transposition trees"
    - "pancake flipping is hard"

Connected through hyperedge HE-6 (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"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-7 (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"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-8 (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"
    - "gaming is a hard job but someone has to do it"

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)