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 "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.

Includes members:
  Member "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")
  Member "coin moving puzzles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch")
  Member "the complexity of clickomania":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")
  Member "pushpush and push 1 are np hard in 2d":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of angry birds")
  Member "pushpush is np hard in 2d":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of slide and merge games")

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